tar-1.11.8/README 644 625 1 10664 5770560266 6321 [This pre-README pertains to the 1.11.8 release only] This release is being made explicitely for complying with the CDROM deadline of June 1995, that is, sooner than even 1.11.7 was initially scheduled. So, sad to say, a few portability reports against 1.11.6 are still pending in 1.11.8. None is lost, however! (For maintainers: Makefile.in engineering is not fully up-to-date.) A Texinfo manual is provided, but in a very draft state. Many users want documentation, and even a draft manual is better than nothing. Please be kind to us, the manual will surely improve before 1.12. GNU `tar' is also a testbed for message localization as provided by the GNU `gettext' tool set. I decided to leave this in for 1.11.8. Unless you feel like working on remaining problems, I suggest that you use either `--disable-nls' or `--with-gnu-nls' on the `configure' call. See file `NLS' for more information on these matters. I roughly estimate that 40% of the 1.11.2 problem backlog is solved in 1.11.8. The extensive diffsets contributed by Ian Jackson and Piercarlo Grandi are not fully processed, as I want to be overly careful at not breaking things while doing so. *Many* other people contributed reports and solutions, I'm heartedly thanking them all. [This pre-README pertains to the 1.11.X series, with X > 2] This is a beta test version for GNU `tar' 1.12, which will be a bug fix release. The emphasis is still on solving portability problems, rather than execution bugs or requests for enhancements. You should have received mail if a problem you submitted has been solved. If you fear your report has been lost, please check file `BACKLOG' in the distribution. It is not useful resubmitting a bug report for which a trace still exists in `BACKLOG'. The default archive device is now `stdin' on read and `stdout' on write. The installer can still override this by presetting `DEFAULT_ARCHIVE' in the environment before configuring (the behavior of `-[0-7]' or `-[0-7]lmh' options in `tar' are then derived automatically). Similarly, `DEFAULT_BLOCKING' can be preset to something else than 20. [The usual README follows] GNU `tar' saves many files together into a single tape or disk archive, and can restore individual files from the archive. It includes multivolume support, the ability to archive sparse files, automatic archive compression/decompression, remote archives and special features that allow `tar' to be used for incremental and full backups. This distribution also includes `rmt', the remote tape server. The `mt' tape drive control program is in the GNU `cpio' distribution. GNU `tar' is based heavily on John Gilmore's public domain `tar'. Unfortunately, GNU `tar' implements an early draft of the POSIX 1003.1 `ustar' standard which is different from the final standard. Adding support for the new changes in a backward-compatible fashion is not trivial. See file `BACKLOG' for a summary of pending mail and articles. See file `COPYING' for copying conditions. See file `INSTALL' for compilation and installation instructions. See file `NEWS' for a list of major changes in the current release. See file `NLS' for how to customize this program to your language. See file `THANKS' for a list of contributors. The scripts used at the FSF for doing all our backups are included. Use them for making incremental dumps, instead of using --incremental (-G), --after-date (-N) or --newer-mtime. The only option that works correctly for incremental backups is --listed-incremental. However, when extracting incremental dumps, use --incremental (-G). Various people have been having problems using floppies on a NeXT. In order to have them work right, you need to kill the automounting program which tries to mount floppies as soon as they are added. Besides those configure options documented in files `INSTALL' and `NLS', a few extra options may be accepted after `./configure': * `--with-dmalloc' is a debugging option for looking memory management problems, it prerequires Gray Watson's package, which is available as `ftp://ftp.letters.com/src/dmalloc/dmalloc.tar.gz'. * `--with-regex' tells the installation to use the older regex package, instead of Tom Lord's GNU `rx' regular expression package. Send bug reports to `bug-gnu-utils@prep.ai.mit.edu'. A bug report is an adequate description of the problem: your input, what you expected, what you got, and why this is wrong. Diffs are welcome, but they only describe a solution, from which the problem might be uneasy to infer. tar-1.11.8/AUTHORS 644 625 1 620 5756153520 6433 Authors of GNU tar. The following contributions warranted legal paper exchanges with the Free Software Foundation. Also see files ChangeLog and THANKS. TAR Jay Fenlason Assigns his changes. TAR Richard E Salz 3/11/93 Disclaims changes to getdate.y. From: assign@gnu.ai.mit.edu Date: Fri, 27 Jan 95 18:13:46 est TAR MANUAL (?) Amy Gorin (US 1963) 1/10/95 Assigns the Tar Manual. tar-1.11.8/BACKLOG 644 625 1 146265 5770605612 6450 # Summary of pending email for GNU tar 1.11.8. # Last updated: Saturday, June 17, 1995. # # You may use this BACKLOG file for checking if I still have an # unprocessed report of yours, or just to have a feeling of how # this package is evolving (or not :-). Please be kind enough to # check here before reporting again a problem that is not solved # in this release. # # When I will process a report from you, you may reasonably count # on the fact that I will give you some feedback at that time. # By merely re-sending a report I already have, you are just putting # more burden on my shoulders, and surely not making things go # any faster. # # I could of course withhold a release until all reported problems # are solved. This would not always be practical, nor fair for # the community, when some of all reported bugs are solved indeed. # So I have to cut the pear in halves, draw a line somewhere, and # still make releases once in a while. # # About the principle of the BACKLOG file itself, my opinion is that # users deserve to know where maintenance stands for what they use. # Ignorance is sometimes more comfortable, but does not change facts. # If commercial companies were indeed publishing their own internal # bug lists, I think you would feel more secure with GNU software! rmail/announce 1. 04 Dec 94 pinard@IRO.UMontreal.CA: Prerelease: GNU tar 1.11.6 2. 09 Dec 94 Francois Pinard: Re: Jan1995 GNU's Bulletin: @item @code{tar} 3. 17 May 95 François Pinard: Prerelease: GNU tar 1.11.7 4. 07 Jun 95 Michael I Bushnell: Re: GNU tar documentation 5. 07 Jun 95 François Pinard: Re: GNU tar documentation 6. 17 Jun 95 François Pinard: GNU tar maintainance rmail/priorities 1. 05 Sep 94 Francois Pinard: Re: tar changes 2. 06 Sep 94 rms@gnu.ai.mit.edu: Re: tar changes 3. 06 Sep 94 Francois Pinard: Re: tar changes 4. 06 Sep 94 rms@gnu.ai.mit.edu: Re: tar changes 5. 19 Nov 94 John Gilmore: Re: tar, block counts, and blocking factors 6. 18 May 95 Richard Stallman: Re: GNU tar 1.11.7 prereleased soon 7. 04 Sep 94 Francois Pinard: Re: tar changes 8. 05 Sep 94 Francois Pinard: Re: tar changes rmail/0/configuration 1. 24 May 95 Bruno Haible: Re: Prerelease: GNU tar 1.11.7 2. 28 May 95 K. Berry: Re: revised tar.texi 3. 07 Jun 95 Ulrich Drepper: date + version.texi 4. 16 Jun 95 Ulrich Drepper: pretar-1.11.8 rmail/0/documentation 1. 28 May 95 K. Berry: Re: revised tar.texi rmail/0/errno-problems 1. 22 Aug 94 pcn@tbit.dk: Re: Prerelease: GNU tar version 1.11.5 2. 24 Aug 94 uddeborg@carlstedt.se: Report on the compilation of tar 1.11.5 3. 05 Nov 94 Roland McGrath: tar bug 4. 08 Nov 94 pinard@gnu.ai.mit.edu: Re: tar bug rmail/0/ian-piercarlo 1. 03 Oct 94 Ian Jackson: Re: uuencode 1.0: Ultrix, use of spaces, no table, n rmail/0/memory-management 1. 08 Jul 91 pierce cantrell: tar-1.10 core dumps on long file names 2. 13 Aug 91 Pierce Cantrell: GNU tar 1.10 Patch for multi-volume, long filena 3. 04 Oct 91 ro@thp.uni-koeln.de: NULL ptr dereference in GNU tar 1.10 4. 26 May 93 Operator: memory garbaging up bug found / causes gnutar to coredu 5. 30 Sep 93 Vic Abell: GNU tar 1.11.2 under NeXTSTEP 3.1 (followup) 6. 27 Nov 93 Axel Habermann: Bug in gnu-tar 1-11.2 7. 20 Dec 93 Frank Gales [ET]: gnutar 8. 10 May 94 Michael P Urban: GNUTAR 1.11.2: Coredump from long file names 9. 19 Aug 94 haible@ma2s2.mathematik.uni-karlsruhe.de: Re: Prerelease: GNU tar 10. 16 Oct 94 Matthew Dillon: Re: memory garbaging up bug found / causes gnutar 11. 28 Nov 94 Paul Mitchell: tar-1.11.2 12. 19 Jan 95 Ed Sirett: gnu-tar.1.11.2 - Verification on tape media. 13. 19 Jan 95 Francois Pinard: Re: gnu-tar.1.11.2 - Verification on tape media. 14. 07 Feb 95 Marty Leisner: problems with tar-1.11.[56] 15. 07 Feb 95 Francois Pinard: Re: problems with tar-1.11.[56] 16. 07 Feb 95 Marbury, Gerald D.: GNU tar version 1.11.2 17. 25 Feb 95 Walter C. Pelissero: GNU tar on FreeBSD 2.0 18. 28 Feb 95 Andrey A. Chernov, Black Mage: Re: GNU tar on FreeBSD 2.0 19. 23 May 95 Kevin Dalley: core dump in tar-1.11.7 and tar-1.11.5 for multi-vo 20. 28 May 95 François Pinard: Re: core dump in tar-1.11.7 and tar-1.11.5 for m rmail/0/restoring-permissions 1. 03 Apr 93 Bruce Evans: tar-1.11.2 umask and USG 2. 10 Aug 93 Gijsb. Wiesenekker: (none) 3. 17 May 91 Leslie Mikesell: Re: Do you use find command? 4. 05 Aug 94 tim@tct.com: filutils-3.9: install 5. 14 Aug 94 andersa@Mizar.DoCS.UU.SE: Re: tar 1.11.2 6. 09 Nov 94 Lack Mr G M: Bug(?) in cpio-2.3 7. 08 Dec 94 Bruno Haible: tar-1.11.6 --same-owner 8. 23 Aug 94 piercarl@ltd.c-d.com: Re: Prerelease: GNU tar version 1.11.4 9. 25 Mar 95 Roland McGrath: tar -xp 10. 05 Apr 95 François Pinard: Re: tar -xp rmail/0/rtapelib 1. 12 Sep 94 abe@vic.cc.purdue.edu: Re: Prerelease: GNU tar version 1.11.5 2. 20 Dec 94 Minh Tran-Le: bug in tar-1.11.6 for remote tape device ... 3. 17 Aug 94 schwab@issan.informatik.uni-dortmund.de: Tar 1.11.4: build proble rmail/0/sgtty-offt-etc 1. 26 Feb 94 Jeanette Pauline Middelink: CPIO 2.3 bugs 2. 15 Sep 94 Francois Pinard: Re: GNU tar 1.11.5 3. 30 Sep 94 John L. Chmielewski: tar.1.11.5 problems and fixes 4. 04 Oct 94 ghazi@caip.rutgers.edu: tar-1.11.5 build report ... 5. 04 Oct 94 Francois Pinard: Re: tar-1.11.5 build report ... 6. 20 Oct 94 ke@pertron.central.de: cpio 2.3: configure failed for rmt 7. 05 Dec 94 Jim Blandy: Re: Prerelease: GNU tar 1.11.6 8. 17 Jan 95 Thomas Krebs: tar patches for FreeBSD 9. 16 Jan 95 Sergei Viznyuk: Re: How do I deal with #include 10. 17 Jan 95 Alex Yuriev: Re: How do I deal with #include rmail/0/sigchild-problems 1. 18 Aug 94 Marc Aurele La France: On SIGCHLD signals 2. 22 Aug 94 tsi@gpu.srv.ualberta.ca: Changes to GNU tar-1.11.2 package 3. 23 Aug 94 tsi@gpu.srv.ualberta.ca: Re: Changes to GNU tar-1.11.2 package 4. 13 Apr 95 Marc Aurele La France: Re: Changes to GNU tar-1.11.2 package 5. 13 Apr 95 François Pinard: Re: Changes to GNU tar-1.11.2 package 6. 13 Apr 95 François Pinard: Re: Changes to GNU tar-1.11.2 package 7. 13 Apr 95 Marc Aurele La France: Re: Changes to GNU tar-1.11.2 package rmail/0/signal-handling 1. 07 Apr 95 Greg McGary: GNU tar is vulnerable to EINTR failures 2. 09 May 95 Greg McGary: tar patches for safe_read, full_write rmail/0/syserrlist 1. 08 Oct 94 ghudson@mit.edu: Compilation problems with cpio-2.3 under NetBSD 2. 17 May 95 Chris Arthur: Re: Prerelease: GNU tar 1.11.7 3. 28 May 95 François Pinard: [csa@csatech.com: Re: Prerelease: GNU tar 1.11.7 4. 28 May 95 François Pinard: Re: Prerelease: GNU tar 1.11.7 5. 28 May 95 David J. MacKenzie: I'm on vacation 6. 31 May 95 David J. MacKenzie: Re: [csa@csatech.com: Re: Prerelease: GNU tar 7. 01 Jun 95 François Pinard: Re: [csa@csatech.com: Re: Prerelease: GNU tar 1. rmail/0/union-wait 1. 01 Jan 95 Francois Pinard: [mjshield@nyx.cs.du.edu: make 3.71 `configure' b 2. 09 Jan 95 Coranth Gryphon: Configure problems with GMAKE 3.72.1 3. 09 Jan 95 Francois Pinard: Re: Configure problems with GMAKE 3.72.1 4. 09 Jan 95 Coranth Gryphon: Re: Configure problems... 5. 09 Jan 95 Coranth Gryphon: Re: Tar configuration update... 6. 03 Feb 95 Jean-Philippe Martin-Flatin: Re: GNU tar 1.11.2 7. 06 Mar 95 Tarang Kumar Patel: Re: Ref: installation of tar-1.11.2 on SGI ru 8. 15 Mar 95 François Pinard: Re: Ref: installation of tar-1.11.2 on SGI runni 9. 19 Mar 95 Alan Bawden: GNU tar: BSD42 not set under FreeBSD, --sparse fails 10. 22 Apr 95 R. Bernstein: make 3.73 vs. union wait 11. 17 May 95 Chris Arthur: Re: Prerelease: GNU tar 1.11.7 rmail/0/utimbuf-problems 1. 13 Jan 95 Francois Pinard: Re: fileutils 3.12: AIX 2 changes 2. 13 Jan 95 Jason Downs: Re: fileutils 3.12: AIX 2 changes rmail/0/wrong-owner 1. -- --- -- Johannes Helander: Re: tar should have numeric uid/gid option 2. -- --- -- -----: GNU tar 1.10/beta bugfixes 3. 11 Sep 91 wierda@ltb.bso.nl: here is a quick and dirty hack for the directo 4. 23 Jun 93 Ian Jackson: Uid/gid extraction still broken in 1.11.2 5. 23 Jun 93 Johannes Helander: Re: Uid/gid extraction still broken in 1.11.2 6. 17 Apr 94 Ian Jackson: GNU tar 1.11.2 doesn't exit if -C fails 7. 16 Jun 94 Ian Jackson: GNU tar-1.11.2 bugs - patch and new binary available 8. 12 Jul 94 brown@bibliotech.com: bug in GNU tar? 9. 14 Jul 94 ccwf@ludwig.klab.caltech.edu: Re: bug in GNU tar? 10. 15 Jul 94 ccwf@klab.caltech.edu: Re: bug in GNU tar? 11. 19 Jul 94 iwj10@cus.cam.ac.uk: Re: bug in GNU tar? 12. 28 Jul 94 torkel@bibsyst.no: Re: gnu tar 13. 23 Aug 94 piercarl@ltd.c-d.com: Re: Prerelease: GNU tar version 1.11.4 14. 16 Dec 94 Tim P. Starrin: tar-1.11.2b patch 15. 14 Mar 95 rbs@acs.bu.edu: Gnu tar - ownership of extracted files 16. 04 May 95 Jean Bouchard Tech VLSI: tar ownership problem 17. 15 Jun 95 Bernard Derval: GNU tar 18. 15 Jun 95 François Pinard: Re: GNU tar rmail/1/8-bit-locales 1. 22 Oct 91 axel@chaos1.ccc.in.sub.org: GNU tar 1.10 problem with 8-bit-ascii 2. 09 Dec 94 Bruno Haible: tar-1.11.6 and Latin-1 characters 3. 24 Apr 95 Ryutaro Susukita: tar-1.11.2 SunOS-4.1.3 JLE-1.1.3 segmentaion fa 4. 09 Jan 95 Marty Leisner: what's code-to-tbl in tar? 5. 13 Jan 95 Marty Leisner: Re: what's code-to-tbl in tar? 6. 08 Mar 95 Jochen Hein: GNU-packages to internationalize 7. 01 Feb 95 Konno Hiroharu: Some problems in GNU tar-1.11.2 8. 01 Feb 95 Francois Pinard: Re: Some problems in GNU tar-1.11.2 rmail/1/blocking 1. 29 Aug 92 David J. MacKenzie: another tar format difference 2. 26 Mar 93 Mike Silano: Re: Bug in tar-1.11.1 on SCO 3.2.2 3. 28 Mar 93 Pete Geenhuizen: Re: Version 1.11.2 of GNU tar is now available 4. 28 Apr 93 Mike Silano: Re: Problem with gtar-1.11.2 5. 28 Apr 93 Kambiz Aghaiepour: Re: Problem with gtar-1.11.2 6. 20 May 93 Barracuda: GNU tar 1.10 problem 7. 06 Jun 93 Jeff Finger: gnutar 1.11.2/gcc-2.4.3 installation problem 8. 01 Jul 93 ian@cygnus.com: GNU tar and gcc header installation on Ultrix 9. 05 Jul 93 ian@cygnus.com: GNU tar and gcc header installation on Ultrix 10. 05 Jul 93 Richard Stallman: Re: [ian@cygnus.com: GNU tar and gcc header ins 11. 11 Jul 94 Bill Beaton: Re: Transporting files using cpio 12. 26 Aug 94 ericb@lsid.hp.com: Re: GNU cpio version 2.3 suggestion and proble 13. 07 Nov 94 Jim Meyering: GNU tar vs SunOS tar (was Re: is this tar file ok? 14. 07 Nov 94 Shauh-Teh Juang: fileutils-3.12.tar.gz 15. 08 Nov 94 john@bostech.com: Re: is this tar file ok? 16. 09 Nov 94 John_D._Sybalsky.MV@envos.xerox.com: SGI install experience for t 17. 10 Nov 94 Nelson Minar: fileutils-3.12 tar file problem 18. 10 Nov 94 John Gilmore: Re: tar, block counts, and blocking factors 19. 11 Nov 94 Jim Meyering: GNU tar vs SunOS /bin/tar 20. 11 Nov 94 Francois Pinard: Re: GNU tar vs SunOS /bin/tar 21. 11 Nov 94 Jim Meyering: Re: fileutils-3.12 : tar file is 'foul' 22. 10 Jan 95 Christian Jonsson: Re: kpathsea 2.6/xdvik 18f/dvipsk 5.58f/dviljk 23. -- --- -- -----: (none) 24. 10 Jan 95 Christian Jonsson: Re: kpathsea 2.6/xdvik 18f/dvipsk 5.58f/dviljk 25. 10 Jan 95 K. Berry: GNU tar incompatibility? 26. 10 Jan 95 Francois Pinard: Re: GNU tar incompatibility? 27. 12 Jan 95 Peter Dyballa: Re: GNU tar incompatibility? 28. 29 Jan 95 Kai: Re: gnu tar on bsdi 29. 01 Feb 95 Ed Sirett: Re: gnu-tar.1.11.2 - Verification on tape media. 30. 24 Feb 95 Dick Streefland: [tar-1.11.6] --sparse suggestion / Broken pipe 31. 24 Feb 95 Dick Streefland: [tar-1.11.6] --sparse suggestion / Broken pipe 32. 26 Feb 95 David Monro: bug + added feature in fileutils 3.12 cp 33. 14 Mar 95 ralphc@sps.siemens.co.uk: Problems With GNU Tar 1.11.2 On AIX 3.2 34. 28 Mar 95 Charles Lamb: tar and EOF markers 35. 28 Mar 95 François Pinard: Re: tar and EOF markers 36. 18 May 95 Tom Arnold: GNU tar not on blocke boundary problem 37. 31 May 95 Glenn Coombs: Problem with blocking factor 38. 12 Jun 95 Michael I Bushnell: Re: GNU tar format 39. 12 Jun 95 François Pinard: Re: GNU tar format 40. 12 Jun 95 Michael I Bushnell: Re: GNU tar format 41. 12 Jun 95 François Pinard: Re: GNU tar format rmail/1/c-option 1. 06 Oct 94 dave@hiauly1.hia.nrc.ca: Re: Possible problem with tar-1.11.5 2. 04 Nov 94 patrick timmons: bug with tar 1.11.2 ? 3. 07 Feb 95 Marty Leisner: problems with tar-1.11.[56] 4. 17 May 95 John David Anglin: Re: Prerelease: GNU tar 1.11.7 5. 28 May 95 K. Berry: revised tar.texi 6. 07 Feb 95 Francois Pinard: Re: problems with tar-1.11.[56] rmail/1/create-problems 1. 23 Sep 94 hoymand@gate.net: Problem w/ GNU tar 1.11.2 on Next 2. 30 Oct 94 Alexander Lehmann: gnu tar: configure doesn't work correctly on N 3. 03 Nov 94 Francois Pinard: Re: GNU tar question... 4. 29 Nov 94 R. Bernstein: Mushrooms, Unix Haters 5. 16 Dec 94 Jeffrey S. Sorensen: Problem with GNU tar 6. 03 Nov 94 Francois Pinard: Re: GNU tar question... 7. 03 Nov 94 Jeffrey W. Parker: GNU tar question... 8. 03 Nov 94 root@lidp5: Results of backup started Wed Nov 2 19:00:01 CST 1994 9. 10 Mar 94 Vax: Tar inconsistencies. 10. 17 Jul 94 karl@owl.HQ.ileaf.com: tar c 11. 17 Jul 94 Francois Pinard: Re: tar c 12. 20 Feb 95 Stephen Gildea: tar: want to not write user/group info into archi 13. 20 Feb 95 Francois Pinard: Re: tar: want to not write user/group info into 14. 27 Mar 95 Stephen Gildea: autoconf: to have tar follow links, which flag? 15. 10 Apr 95 Rob MacLeod: tar bug 16. 17 Apr 95 K. Berry: tar --create --verbose & sizes 17. 17 Apr 95 François Pinard: Re: tar --create --verbose & sizes rmail/1/denotation-affixes 1. 26 Sep 91 wierda@ltb.bso.nl: tar does not recognize name without ./ 2. 18 Feb 93 Peter W. Osel: Would these new tar options be useful? 3. 20 Feb 93 Peter W. Osel: Re: Would these new tar options be useful? 4. 25 Mar 93 John Giannandrea: gnu tar 5. 08 Dec 94 David J. MacKenzie: making 'make dist' simpler and faster 6. 08 Dec 94 Francois Pinard: Re: making 'make dist' simpler and faster 7. 08 Dec 94 David J. MacKenzie: Re: making 'make dist' simpler and faster 8. 08 Mar 95 Carl Mascott: GNU cpio POSIX ustar questions 9. 15 Mar 95 François Pinard: Re: Ref: installation of tar-1.11.2 on SGI runni 10. 31 May 95 Ulrich Mueller: GNU tar 1.11.2, routines quote_copy_string and un rmail/1/dir-nextstep 1. 09 Sep 94 abe@vic.cc.purdue.edu: Re: Prerelease: GNU tar version 1.11.5 2. 17 Oct 94 amon@walt.music.qub.ac.uk: Has anyone compiled gnutar 1.11.2 for 3. 02 Dec 94 Stephen J. Perkins: Gnutar on NeXTSTEP rmail/1/extract-problems 1. 02 Jun 93 Robert Eckardt: tar-1.11.2 2. 17 Jun 93 J. Mark Noworolski: tar 1.11.2 bug with -O ? 3. 15 Dec 93 Andreas Schwab: cpio 2.3: bug in make_path 4. 25 Mar 94 Goeran Uddeborg: possible improvement of configuration of fileuti 5. 18 Jun 94 iwj10@cus.cam.ac.uk: Re: [tar 1.11.2] Ownership of extracted syml 6. 18 Jun 94 koppenas@tick.informatik.uni-stuttgart.de: Re: [tar 1.11.2] Owner 7. 12 Aug 94 ctd@space.mit.edu: Re: tar-1.11.3 8. 26 Aug 94 curt@watson.ibm.com: GNU tar disaster! 9. 02 Sep 94 Francois Pinard: Re: GNU tar disaster! 10. 06 Sep 94 curt@watson.ibm.com: Note from you attached below 11. 17 Sep 94 czyborra@cs.tu-berlin.de: tar-1.11.2 mkdir woes 12. 17 Sep 94 czyborra@cs.tu-berlin.de: Re: tar-1.11.2 mkdir woes 13. 12 Oct 94 kb@cs.umb.edu: tar enhancement 14. 14 Oct 94 David J Topper: Tar | Seyon Problems 15. 18 Oct 94 koenig@tat.physik.uni-tuebingen.de: bug/possible security problem 16. 15 Nov 94 Lack Mr G M: Bug(?) in cpio-2.3 17. 19 Dec 94 Harald Koenig: bug/possible security problem with GNU tar-1.11.6 18. 22 Jan 95 Paul Rubin: another tar suggestion 19. 23 Jan 95 Karel Kubat: Re: DISCUSSION: afio 2.4.1 new feature 20. 24 Jan 95 Koen Holtman: Re: DISCUSSION: afio 2.4.1 new feature 21. 24 Jan 95 Karel Kubat: Re: DISCUSSION: afio 2.4.1 new feature 22. 24 Jan 95 Koen Holtman: Re: DISCUSSION: afio 2.4.1 new feature 23. 02 Feb 95 Marty Leisner: tar feature (not documented?) 24. 02 Feb 95 Francois Pinard: Re: tar feature (not documented?) 25. 07 Feb 95 Marty Leisner: problems with tar-1.11.[56] 26. 13 Feb 95 Jonathan I. Kamens: GNU tar 1.11.2: handles hard links wrong when 27. 25 Mar 95 François Pinard: Re: decipher "tar" options 28. 07 Apr 95 Marty Leisner: backup patches to gnu tar... 29. 07 Apr 95 Greg McGary: tar enhancement rmail/1/huge-archives 1. 26 Jan 95 verberne@prl.philips.nl: backup > 2Gigabyte disk with gtar? 2. 27 Jan 95 Francois Pinard: Re: backup > 2Gigabyte disk with gtar? rmail/1/incomplete-write 1. 23 Dec 93 Bruno Haible: obvious bug in cat and several other text utilities 2. 16 Aug 94 Thomas.Koenig@ciw.uni-karlsruhe.de: tar, on Linux this time 3. 01 Sep 94 Chris Metcalf: lossage with "tar cz" writing to gzip; easy fix? 4. 02 Sep 94 Chris Metcalf: Re: lossage with "tar cz" writing to gzip; easy fi 5. 08 Sep 94 Mitch Davis: Re: lossage with "tar cz" writing to gzip; easy fix? rmail/1/long-names 1. 03 Aug 91 Max Hailperin: contextualization of tar 1.10 diffs 2. 11 Aug 91 Max Hailperin: bug in earlier tar-1.10 bug fix/improvment 3. 10 Sep 92 Robert E. Brown: GNU tar version 1.11 bug 4. 10 Sep 92 Robert E. Brown: GNU tar 1.11 bug ?? 5. 07 Jun 93 Tim Rylance: tar 1.11.2: "Visible longname error" bug 6. 07 Jun 93 Brian R. Smith: bug in gnu tar 1.11.2 - long link names 7. 16 Jun 93 Chris Verberne: Proposal for improvement of gtar 1.11.2 8. 16 Jun 93 Steven Kimball 603-885-3306: tar-1.11.2 9. 19 Aug 93 J.T. Conklin: cpio 2.3 can produce non-portable cpio archives. 10. 07 Sep 93 Robert E. Brown: tar glitches 11. 21 Jan 94 Marcel Waldvogel: GNU tar 1.11.2 and hard links to files with lon 12. 02 Aug 94 kpc@ptolemy-ethernet.arc.nasa.gov: gtar: -X option and filename l 13. 02 Aug 94 Francois Pinard: Re: gtar: -X option and filename length 14. -- --- -- Nelson H.F. Beebe: Errata, comments, and bug in GNU tar 1.04 15. 26 Oct 94 Chance Reschke: GNU tar 1.11.2 core dumps 16. 27 Oct 94 Francois Pinard: Re: GNU tar 1.11.2 core dumps 17. 29 Oct 94 Ben Stuyts: Re: GNU tar 1.11.2 core dumps 18. 30 Oct 94 Chance Reschke: Re: GNU tar 1.11.2 core dumps 19. 29 Oct 94 Ben Stuyts: Re: GNU tar 1.11.2 core dumps 20. 13 Aug 91 Pierce Cantrell: GNU tar 1.10 Patch for multi-volume, long filena 21. 23 Jan 95 Peter Fox: (none) 22. 15 Mar 95 Joachim Schrod: Re: Problems With GNU Tar 1.11.2 On AIX 3.2.5. 23. 20 Apr 95 Tom Tromey: Bug in GNU tar 1.11.2 24. 10 Jun 95 Arne Wichmann: tar-1.11.2, verbose creation and longnames rmail/1/remote-user 1. 30 Mar 93 Robert Eckardt: tar-1.11.2 2. 19 Aug 94 haible@ma2s2.mathematik.uni-karlsruhe.de: Re: Prerelease: GNU tar 3. 31 Mar 95 Friedhelm Waitzmann: Re: How do I forward incoming mail to a mail rmail/1/restoring-symlinks-etc 1. 20 Jun 93 Jim Graham: problem (?) with GNU tar version 1.11.1 2. 25 Oct 93 mhpower@MIT.EDU: tar symlink ownership problem 3. 13 Jun 94 mib@gnu.ai.mit.edu: Re: A problem with tar-1.11.2 ?? 4. 13 Jun 94 Warren Dodge: Re: A problem with tar-1.11.2 ?? 5. 17 Jun 94 Wolfram Gloger: [tar 1.11.2] Ownership of extracted symlinks (w/ 6. 18 Jun 94 Andreas Koppenhoefer: Re: [tar 1.11.2] Ownership of extracted sym 7. 28 Jul 93 Bo Nygaard Bai: Bug in gnu tar 1.11.2: restoring links fails in s 8. 07 Sep 94 kpc@ptolemy-ethernet.arc.nasa.gov: gtar: symlink errors 9. 07 Jun 94 fvm@tasking.nl: cpio/find problems with certain NFS implementatio rmail/1/rmt-location 1. 09 Aug 94 Francois Pinard: Re: Prerelease: GNU tar version 1.11.3 2. 23 Aug 94 torkel@bibsyst.no: Re: Prerelease: GNU tar version 1.11.5 3. 23 Aug 94 wbader@CSEE.Lehigh.Edu: more on tar and sco unix 4. 02 Sep 94 John David Anglin: Installation directory for rmt -- tar-1.11.5 p 5. 07 Sep 94 tilman@gb1.sema.de: Re: Prerelease: GNU tar version 1.11.5 6. 07 Dec 94 Jeff Longcore: tar-1.11.2 installation complaint 7. 08 Dec 94 Francois Pinard: Re: tar-1.11.2 installation complaint 8. 05 Jan 95 David J. MacKenzie: rtapelib.c, location of rmt 9. 21 Mar 95 François Pinard: Re: GNU tar: BSD42 not set under FreeBSD, --spar 10. 19 Mar 95 W. Phillip Moore: Inconfigurability in cpio-2.3 Makefile.in 11. 16 Jun 95 David Kemp: rmt on an rs6000; missing mtio.h rmail/1/special-chars 1. 01 Aug 91 Max Hailperin: bugs in tar 1.10 string quoting/unquoting 2. 16 Oct 91 Martin Tomes: Bug in GNU tar version 1.08 3. 22 Oct 91 axel@chaos1.ccc.in.sub.org: GNU tar 1.10 problem with 8-bit-ascii 4. 13 Nov 91 Waltraud Lechner-Rau: GNU tar 1.10 problem with 8-bit-ascii-pathn 5. 28 Oct 92 Andreas Schott: tar.1.11.1 6. 10 May 93 Allen Delaney: Re: incrementals & unprintable characters in file 7. 29 Sep 93 System Admin (Mike Peterson): gnu tar 1.11.2 problems on HP-UX 9. 8. 12 Apr 94 Robert E. Brown: file name quoting bugs in GNU tar 1.11.2 9. 29 Mar 95 Joergen Haegg: Bug (?) in tar 1.11.2 10. 01 Apr 95 Detlef Schwier: Gnu tar and umlaut character 11. 10 Sep 94 Maarten Litmaath: bug found in GNU tar-1.11.2 rmail/1/tape-problems 1. 08 Sep 94 Alberto Maria Segre: FTAPE and GNU mt screw up 2. 18 Apr 95 keith@cathi1.bsd.uchicago.edu: (none) 3. 18 Apr 95 François Pinard: GNU tar [was: (none)] 4. 18 Apr 95 keith@cathi1.bsd.uchicago.edu: (none) 5. 18 Apr 95 François Pinard: GNU tar [was: (none)] 6. 28 May 95 François Pinard: Re: Prerelease: GNU tar 1.11.7 7. 01 Jan 95 Francois Pinard: Re: Prerelease: GNU tar version 1.11.5 8. 17 May 95 Chris Arthur: Re: Prerelease: GNU tar 1.11.7 rmail/1/unlink-before 1. 27 Mar 93 Seth Robertson: tar-1.11.2 - remove-before (+code) 2. 28 Jul 93 Chris G. Demetriou: diffs to tar, so it's more useful... 3. 17 Sep 93 Warner Losh: tar 1.11.2 enhancement request 4. 04 Nov 93 Wolfram Wagner: proposed extention for gnu-tar 5. 15 Aug 94 verberne@prl.philips.nl: Gnu-tar 1.11.2 bug with extract 6. 18 Nov 94 Andrew A. Chernov, Black Mage: Usuable addition to TAR rmail/1/verbosity 1. 28 Aug 89 Zdenko Tomasic: Re: gnutar on mips rs2030, multi-volume problem 2. 17 Jul 91 Virgil Champlin: Tar 1.10 bug with archive open errors. 3. 19 Nov 92 John P. Rouillard: Patch for putting verbose listing info into fi 4. 29 Mar 93 Vince DeMarco: Re: Tar suggestion 5. 12 May 93 Karl Berry: tar 1.12.2 & --show-omitted-dirs extra newline 6. 14 May 93 Noah Friedman: tar and absolute file names 7. 19 Jul 93 gergen@edvulx.mpi-stuttgart.mpg.de: GNU tar 11.2 8. 30 Jul 93 Chris G. Demetriou: oops... 9. 10 Aug 93 Tony Silva: minor bug in GNU tar version 1.11.2 10. 08 Dec 93 verberne@prl.philips.nl: Bug in GNU tar 1.11.2 11. 10 Mar 94 John R. Vanderpool: status of GNU tar 12. 26 Apr 94 Roland McGrath: tar feature idea: status reports 13. 04 May 94 Steve Davis: Re: tar feature idea: status reports 14. 10 May 94 Joerg Weule: Help -- whom to write for tar extension ? 15. 29 Oct 92 John P. Rouillard: Need help with the manual? 16. 15 Sep 94 kwzh@gnu.ai.mit.edu: fileutils-3.9: ls printf format 17. 26 Sep 94 leisner@sdsp.mc.xerox.com: tar 1.11.5 -C 18. 15 Dec 94 George B. Ross: gnutar --totals option broken? 19. 04 May 95 Jim Meyering: Re: GNU tar 1.11.[78] and localization 20. 31 May 95 Rod Thompson: GNU Tar 1.11.2 integer overflow on --totals rmail/2/compression-mode 1. -- --- -- Jean-loup Gailly: Re: gnu tar on bsdi 2. 25 Mar 89 Don Bennett (408)433-3311: tar 1.05 bugs 3. 20 Apr 93 Frank Terhaar-Yonkers: gtar hacks 4. 26 Apr 93 Frank Terhaar-Yonkers: Re: gtar hacks 5. 30 Apr 93 Jean-loup Gailly: tar with compression on tapes 6. 30 May 93 Brian J. Murrell: Re: file compression with tar 7. 08 Sep 93 Casper: TAR-suggestion 8. 10 Sep 93 Jean-loup Gailly: Re: TAR-suggestion 9. 15 Sep 93 Marcin Matuszewski (IA PW): GNU Tar 10. 16 Sep 93 Jean-loup Gailly: Re: GNU Tar 11. 29 Sep 93 Esa Karell: Broken pipe/gtar: child returned status 1 12. 04 Nov 93 Esa Karell: gtar: child returned status 2 13. 21 Dec 93 Bennett Todd: Problem with GNU tar --- writer gets SIGPIPE 14. 13 Feb 94 Richard Stallman: tar idea 15. 02 Jun 94 Jean-loup Gailly: Re: GNU Tar version 1.11.2 16. 05 Aug 94 rms@gnu.ai.mit.edu: tar idea 17. 02 Sep 94 Delemar: Re: Which is better: tar->gzip or gzip->tar? 18. 08 Sep 94 Kai Petzke: Re: Which is better: tar->gzip or gzip->tar? 19. 03 Nov 94 Jeffrey W. Parker: GNU tar question... 20. 13 Nov 94 peter hayward: Re: Can DAT drives switch compression on and off? 21. 14 Nov 94 Ron Pritchett: Re: Can DAT drives switch compression on and off? 22. 15 Nov 94 Marc Ewing: Re: Can DAT drives switch compression on and off? 23. 16 Nov 94 Doug McLaren: gnu tar with slightly different --gzip option ? 24. 17 Nov 94 wd: Re: Can DAT drives switch compression on and off? 25. 01 Dec 94 Koen Holtman: afio version 2.4 (archiver & backup program) 26. 21 Dec 94 David L. Wade: tar-1.11.2 why not compression AND multiple tapes? 27. 24 Dec 94 Francois Pinard: Re: tar-1.11.2 why not compression AND multiple 28. 20 Jan 95 Dave Gymer: Re: DISCUSSION: afio 2.4.1 new feature 29. 28 Jan 95 Kai: gnu tar on bsdi 30. 05 Feb 95 Michael Hohmuth: gzip-1.2.4: SIGSEGV in huft_build() 31. 14 Feb 95 bpreece@eos.ncsu.edu: tar enhancement: compress files? 32. 14 Feb 95 Daniel Quinlan: Re: tar enhancement: compress files? 33. 08 May 95 Fred Clift: Possible bug with gnu tar 1.11.2 34. 11 May 95 Leigh Clayton: GNU Tar Question, or maybe RFE 35. 11 May 95 Leigh Clayton: GNU Tar Question, or maybe RFE 36. 14 May 95 François Pinard: Re: GNU Tar Question, or maybe RFE 37. 28 May 95 K. Berry: revised tar.texi 38. 09 Jun 95 François Pinard: tar -y / -Y 39. 09 Jun 95 Jean-loup Gailly: Re: tar -y / -Y 40. 09 Jun 95 Jean-loup Gailly: Re: tar -y / -Y rmail/2/date-problems 1. 11 Sep 91 wierda@ltb.bso.nl: here is a quick and dirty hack for the directo 2. 26 Apr 93 Richard O'Neill: Re: GNU Tar Bugs related to `-g' and `-G', with 3. 08 Mar 94 Dieter Woerz: Bug in tar 1.11.2 4. 07 Jan 95 Dino Dini: Still maintaining tar? 5. 07 Jan 95 Francois Pinard: Re: Still maintaining tar? 6. 08 Jan 95 Dino Dini: Fixes/improvements to tar-1.11.2 7. 24 Feb 95 Shaheen Tonse T3156: Re: Gnu Tar 8. 23 Nov 94 Donald Douglas Jolley: Understanding the syntax for invoking tar 9. 27 Apr 95 Sherwood Botsford: Re: Location of present release of gnutar 10. 04 Jan 95 Jim Meyering: Re: getdate correction [was: Re: tar 1.11.2] 11. 10 Jun 95 Bryan Higgins: tar --newer rmail/2/directory-option 1. 29 Dec 91 Francois Pinard: GNU tar: options -C and -T do not work well toge 2. 03 Aug 94 eddy@gen.cam.ac.uk: GNU tar status: here it is! [Re: bug in GNU t 3. 04 Aug 94 pinard@IRO.UMontreal.CA: Re: GNU tar status: here it is! [Re: bug rmail/2/exclude-option 1. 23 May 89 Gerry Wiener: problem with tar1.05 and tar1.07 on sun4-os4 2. 06 Jul 89 Steven M Romig: tar 1.07 bugs 3. 14 Aug 91 Eric Hanchrow: `tar' 1.10 +extract option sure is hard to use! 4. 25 Sep 91 John A. Turner: tar 1.10 5. 26 Sep 91 wierda@ltb.bso.nl: Exclude pattern does not work and directory il 6. 26 Sep 91 wierda@ltb.bso.nl: Exclude pattern does not work and directory il 7. 10 Aug 93 Ken Harrenstien: GNU tar misfeature 8. 17 Jun 94 Andreas Schwab: Tar 1.11.2: bug with --exclude 9. 12 Jul 94 carol@phoenix.oise.on.ca: --newer DATE option 10. 13 Jul 94 carol@vizbiz.com: Re: --newer DATE option 11. 13 Jul 94 carol@vizbiz.com: Re: --newer DATE option 12. 02 Aug 94 kpc@ptolemy-ethernet.arc.nasa.gov: gtar: -X option and filename l 13. 29 Aug 94 perry@jpunix.com: tar --exclude doesn't work. 14. 31 Aug 94 les@mcs.com: Re: tar --exclude doesn't work. 15. 15 Sep 94 ivo@next.agsm.ucla.edu: Re: gnutar 16. 02 Oct 94 ellson@hotair.att.com: tar-1.11.2 -X switch doesn't work 17. 02 Oct 94 Francois Pinard: Re: tar-1.11.2 -X switch doesn't work 18. 05 Dec 94 Will Partain: tar 1.11.6 and -X option (buglet and comment) 19. 05 Dec 94 Francois Pinard: Re: tar 1.11.6 and -X option (buglet and comment 20. 23 Mar 95 Leslie Mikesell: Re: tar 21. 23 Mar 95 Keith Briggs: tar rmail/2/exit-statuses 1. 09 Aug 94 holger@hotbso.rhein-main.DE: Re: GNU tar: exit statuses rmail/2/gcc-warnings 1. 19 Aug 94 haible@ma2s2.mathematik.uni-karlsruhe.de: Re: Prerelease: GNU tar 2. 21 Aug 94 pinard@IRO.UMontreal.CA: 1.11.5 - premier essai 3. 22 Aug 94 Francois Pinard: (none) 4. 23 Aug 94 gjb@maxim.gba.oz.au: Re: tar-1.11.5 (i486, BSDI-1.1) [create.c] 5. 23 Aug 94 gjb@maxim.gba.oz.au: Re: tar-1.11.5 (i486, BSDI-1.1) [extract.c] 6. 23 Aug 94 gjb@maxim.gba.oz.au: Re: tar-1.11.5 (i486, BSDI-1.1) [diffarch.c] 7. 23 Aug 94 gjb@maxim.gba.oz.au: Re: tar-1.11.5 (i486, BSDI-1.1) [buffer.c] 8. 23 Aug 94 gjb@maxim.gba.oz.au: Re: tar-1.11.5 (i486, BSDI-1.1) [1] rmail/2/incremental-mode 1. 20 Jan 89 Leonard H. Tower Jr.: (none) 2. 26 May 93 Operator: another gnutar 1.11.2 bug 3. 02 Aug 93 Michael I Bushnell: Re: 1.11.1 on SCO - can't close tape device 4. 25 Aug 93 Michael C. Grant: GNU tar 1.11.2 incremental backup question 5. 13 Sep 93 Joachim Holzfuss,2d-111,16-2884: tar 1.11.2: --listed-incremental 6. 04 Oct 93 Noah Friedman: [joed@itsa.ucsf.EDU: Re: tar] 7. 18 Feb 94 Leslie Mikesell: find/cpio vs. gnutar 8. 17 Mar 94 Leslie Mikesell: Re: Questions on which features work in gtar-1.1 9. 21 Apr 94 Gert van Antwerpen: GNUtar problem 10. 20 May 94 les@mcs.com: Re: gnu tar --newer option question 11. 19 Jun 94 Melissa O'Neill: GNU tar incremental backup bug... 12. 19 Jun 94 Leslie Mikesell: Re: GNU tar incremental backup bug... 13. 05 Sep 94 uddeborg@carlstedt.se: tar 1.11.5 dumps core with certain flag co 14. 16 Oct 94 Matthew Dillon: Re: memory garbaging up bug found / causes gnutar 15. 11 Dec 94 rodrigo vanegas: GNU tar and incremental backups 16. 10 Oct 94 thornbur@physics.ubc.ca: GNU tar 1.11.2: should --atime-preserve 17. 06 Jan 95 R. Kent Dybvig: gnu tar 1.11.2 and dumping OS2 NFS mounted file s 18. 06 Jan 95 Francois Pinard: Re: gnu tar 1.11.2 and dumping OS2 NFS mounted f 19. 19 Jan 95 Richard Stallman: [phr@gnu.ai.mit.edu: tape backup] 20. 19 Jan 95 phr@gnu.ai.mit.edu: tape backup 21. 19 Jan 95 Richard Stallman: Re: tape backup 22. 21 Jan 95 Paul Rubin: Re: tape backup [folder: 2/incremental-option] 23. 20 Apr 95 Ed Childs: Core dump in gnu tar, using level-1 backup script 24. 20 Apr 95 Ed Childs: Re: Core dump in gnu tar, using level-1 backup script 25. 12 Jul 91 Ernest Hua: tar 1.10 option G rmail/2/lib-doprnt 1. 12 Jul 94 vogelke@c-17igp.wpafb.af.mil: Re: shar-3.52g1 on a Pyramid 2. 12 Jul 94 djm@Glue.umd.edu: Re: [pinard: Re: shar-3.52g1 on a Pyramid] rmail/2/nfs-related 1. 23 Feb 89 Laurence G Lundblade: Gnu tar 1.04 fix to avoid NFS mounted file 2. 28 May 89 Leonard H. Tower Jr.: [smsdpg!seg@uunet.uu.net: Re: GNU Tar exper 3. 01 Aug 91 Max Hailperin: bug in tar 1.10 +one-file-system 4. 02 Aug 91 Max Hailperin: socket handling in tar 1.10 would be better omitte 5. 30 Aug 91 Jim Mayer: Bugs+fixes for gnu tar 1.10 6. 02 Sep 91 Max Hailperin: better (?) fix to tar 1.10 bug 7. 11 Sep 91 Gerben Wierda: tar 1.10 and directories on SUNOS 3.5, SUNOS 4.1.1 8. 25 Mar 93 thorbjorn willoch: -N in gnu tar 9. 25 Mar 93 Jim Meyering: tar-1.11.2 nit 10. 11 May 93 Oliver Trepte: Gnu tar 1.11.2 11. 16 Jul 93 Van Snyder: tar 1.11.1 12. 06 May 94 Dean Gaudet: gnu tar-1.11.2, ultrix 4.2, and atol 13. 24 Jun 94 marc@redhat.com: cpio-2.3 and st_size of symlinks 14. 12 May 93 Oliver Trepte: Gnu tar on Apollo 15. 30 Aug 91 Jim Mayer: Bugs+fixes for gnu tar 1.10 16. 11 Sep 91 Gerben Wierda: tar 1.10 and directories on SUNOS 3.5, SUNOS 4.1.1 17. 13 Oct 91 Magnus.Harlander@physik.tu-muenchen.de: Problem with incremental 18. 04 Jan 95 Francois Pinard: Re: bug found in GNU tar-1.11.2 rmail/2/no-recurse 1. 28 Jul 93 Chris G. Demetriou: diffs to tar, so it's more useful... 2. 17 Sep 93 backus@lks.csi.com: taring directories rmail/2/remote-problems 1. 09 Jun 89 Dave Gagne: Tar 1.07 Problem. 2. 27 Apr 93 Kambiz Aghaiepour: Problem with gtar-1.11.2 3. 19 Jul 93 Esa Karell: gtar, AIX 3.2.3, -Z option doesn't work 4. 16 Aug 94 Thomas.Koenig@ciw.uni-karlsruhe.de: tar, on Linux this time 5. 03 Sep 91 Roland Schemers III: GNU tar 6. 12 Oct 94 David Kastrup: Absurd backup problem with tar 7. 20 Apr 95 Mike Jagdis: Patch to cpio 2.3/tar 1.11.2 for remote archives rmail/2/salvaging-archives 1. 13 Oct 90 Jean-Pierre Radley: Re: Recovering corrupted tar's 2. 21 Mar 91 Rich Salz: v24i077: Tool to salvage data from damaged tar tapes 3. 29 Oct 91 Robert W. Reinke: gnutar 4. 04 Aug 93 Warren Burstein: error recover in gnutar after write-protected ta 5. 07 Sep 94 jonboy@neuromancer.ucr.edu: Re: Any decent backup software for Li 6. 06 Jul 94 Yasuo Ohgaki: Bad block in tape. Help 7. 09 Jul 94 Dan Saunders: Re: Bad block in tape. Help 8. 11 Jul 94 Mohan Kokal: Re: Bad block in tape. Help 9. 06 Oct 94 brown@bibliotech.com: GNU tar and bad blocks 10. 06 Oct 94 brown@bibliotech.com: GNU tar and bad blocks 11. 05 Oct 94 Leon Shieh: Help Recovering Tar Tape Needed 12. 08 Oct 94 Ray Vermey: Help Recovering Tar Tape Needed 13. 27 Mar 95 Michael G. Phillips: Re: reading a corrupted Tar-File ? 14. 27 Mar 95 Michael Haak: reading a corrupted Tar-File ? rmail/2/sparse-option 1. 26 Jun 89 Joy Kendall: Tar questions 2. 14 Sep 90 ian@sibyl.eleceng.ua.oz.au: Weird fileutils bug. 3. 10 Dec 90 Dan Bernstein: Re: How do you find the symbolic links to files. 4. 10 Dec 90 Dan Bernstein: Re: How do you find the symbolic links to files. 5. 10 Dec 90 Rahul Dhesi: Re: How do you find the symbolic links to files. 6. 10 Dec 90 Elizabeth Zwicky: Re: How do you find the symbolic links to files 7. 10 Dec 90 Bob Goudreau: Re: How do you find the symbolic links to files. 8. 11 Dec 90 Barry Shein: Re: How do you find the symbolic links to files. 9. 12 Dec 90 Dan Bernstein: Re: How do you find the symbolic links to files. 10. 15 Dec 90 John F Haugh II: Re: holes in files 11. 15 Dec 90 Rahul Dhesi: Re: holes in files 12. 16 Dec 90 Dan Bernstein: Re: holes in files 13. 16 Dec 90 Dan Bernstein: Re: holes in files 14. 17 Dec 90 Anthony DeBoer: Re: holes in files 15. 17 Dec 90 Rahul Dhesi: Re: holes in files 16. 20 Dec 90 Rahul Dhesi: Re: holes in files 17. 26 Dec 90 Jim Balter: Re: holes in files 18. 26 Dec 90 Barry Margolin: Re: holes in files 19. 27 Dec 90 Paul Chamberlain: Re: holes in files 20. 28 Dec 90 Andrew Hume: Re: holes in files 21. 28 Dec 90 Paul Gillingwater: Re: holes in files 22. 30 Jan 91 David Burren: holes in files 23. 29 Oct 92 Jeff Moskow: tar enhancement. 24. 25 Jan 93 Jim Murray: Bug report for tar.1.11.1 25. 18 Aug 93 Joachim Holzfuss: tar 1.11.2: --sparse hangs tar 26. 29 Nov 93 Dominic Dunlop: GNU tar 1.11.2: --sparse has no effect in tmpfs ( 27. 16 Aug 94 meyering@idefix.comco.com: Re: Sparse files 28. 16 Aug 94 meyering@idefix.comco.com: Re: Sparse files 29. 24 Aug 94 djm@va.pubnix.com: Re: Sparse files 30. 24 Aug 94 djm@va.pubnix.com: Re: Sparse files 31. 20 Sep 94 m.dsouza@mrc-apu.cam.ac.uk: Bug in tar-1.11.5 32. 20 Sep 94 m.dsouza@mrc-apu.cam.ac.uk: Re: Bug in tar-1.11.5 33. 26 Sep 94 bap@scr.siemens.com: gtar bug (under linux) 34. 27 Sep 94 bap@scr.siemens.com: Re: gtar bug (under linux) 35. 27 Sep 94 bap@scr.siemens.com: Re: gtar bug (under linux) 36. 30 Sep 94 Francois Pinard: Re: gtar bug (under linux) 37. 30 Sep 94 faith@cs.unc.edu: Re: gtar bug (under linux) 38. 30 Sep 94 Francois Pinard: Re: gtar bug (under linux) 39. 09 Dec 94 Jeremy Fitzhardinge: cp fails to make sparse files under linux 40. 09 Dec 94 Bruno Haible: fileutils-3.12 is too restrictive making holes 41. 12 Dec 94 Ulrich Drepper: Re: cp fails to make sparse files under linux 42. 25 Jan 95 Alan Modra: tar-1.11.2 improvements & fixes 43. 27 Jan 95 Francois Pinard: Re: tar-1.11.2 improvements & fixes 44. 28 Jan 95 Alan Modra: Re: tar-1.11.2 improvements & fixes 45. 05 Feb 95 Karl Berry: tar: sparse file extraction bug 46. 06 Feb 95 Karl Berry: Re: tar: sparse file extraction bug 47. 13 Feb 95 Harald Koenig: small patch for cp in fileutils-3.12 48. 24 Feb 95 Dick Streefland: [tar-1.11.6] --sparse suggestion / Broken pipe 49. 24 Feb 95 Francois Pinard: Re: [tar-1.11.6] --sparse suggestion / Broken pi 50. 13 Mar 95 David Monro: bug + added feature in fileutils 3.12 cp 51. 19 Mar 95 Alan Bawden: GNU tar: BSD42 not set under FreeBSD, --sparse fails 52. 27 May 95 Maarten Litmaath: another bug found in GNU tar 1.11.2 rmail/2/switching-tapes 1. 14 Jun 89 Brant Cheikes: bug in tar-1.07 on AT&T UNIXpc 2. 17 Nov 90 Jay Ts: Re: tar or cpio, which is better? 3. 15 Jul 91 Saul Lubkin: tar 1.10 problem with "-dM", "-WM", "-ML" or "-MR" 4. 13 Aug 91 Pierce Cantrell: GNU tar 1.10 Patch for multi-volume, long filena 5. 15 Sep 91 Francois Pinard: `tar dM' still does not work 6. 11 Dec 92 Richard Stallman: [dump-remind@gnu.ai.mit.edu: Backup needs new t 7. 19 Dec 92 Richard Stallman: [dump-remind@gnu.ai.mit.edu: Backup needs new t 8. 02 Feb 93 Scott L. Burson: tar 1.11.1: "Prepare volume #3 for /dev/nrst9 an 9. 19 Jul 93 Alessandro MAGNETTI: gtar/tar question 10. 21 Jul 93 Alex MAGNETTI: gtar/tar question 11. 04 Aug 93 Richard Stallman: [warren@nysernet.org: error recover in gnutar a 12. 05 Aug 93 William Bader: tar question 13. 29 Sep 93 Ronald Aarts: remark about GNU tar 1.11.2 14. 09 Dec 93 Heiko Muenkel: Problem with tar on Suns 15. 11 Jan 94 Hiroyuki Bessho: GNU tar 1.11.2 multivolume bugs 16. 03 May 94 Ben Stuyts: Problem with GNU tar level-0 script 17. 18 May 94 u31b3hs@pool.informatik.rwth-aachen.de: Two GNU tar 1.11.2 proble 18. 22 Jun 94 Steven Buytaert: Re: How to split large tar file to fit on floppy 19. 22 Jun 94 Jonathan A Buzzard: Re: How to split large tar file to fit on flo 20. 22 Jun 94 Andreas Schwab: Re: How to split large tar file to fit on floppy 21. 23 Jun 94 Charles Ian Walker: Re: How to split large tar file to fit on flo 22. 24 Jun 94 Robert Osterlund: Re: How to split large tar file to fit on flopp 23. 27 Jun 94 Vinod G Kulkarni: Re: How to split large tar file to fit on flopp 24. 15 Sep 94 yjsu@hinet.net: (none) 25. 23 Sep 94 leisner@sdsp.mc.xerox.com: tar 1.11.5 26. 03 Oct 94 Brynn Rogers: tar cM possible (probable?) bug 27. 04 Oct 94 leisner@sdsp.mc.xerox.com: tar 1.11.5 , making multiple volume co 28. 05 Oct 94 dean@fors751.ice.ncr.doe.ca: gnutar 1.10 for HP-UX 700 series (9. 29. 11 Oct 94 Patrick.Condran@corp.sun.com: Re: gnutar 1.10 for HP-UX 700 serie 30. 18 Oct 94 leisner@sdsp.mc.xerox.com: tar fixes (autoeject) 31. 18 Oct 94 Francois Pinard: Re: tar fixes (autoeject) 32. 18 Oct 94 rittle@comm.mot.com: tar 1.11.2 [1] and 1.11.5 [1,2] bugs 33. 20 Oct 94 Marty Leisner: Re: tar fixes (autoeject) 34. 22 Oct 94 Francois Pinard: Re: tar 1.11.2 [1] and 1.11.5 [1,2] bugs 35. 11 Nov 94 Rocky Giannini: Problem with tar 1.11.2 --info-script option? 36. 13 Nov 94 Olaf Schlueter: Several Problems (GNU Tar, cpio, smail) 37. 14 Nov 94 Doug Pickering: Re: tar (via scsi interface /dev/st0) 38. 20 Nov 94 Clinton Carr: Re: tar (via scsi interface /dev/st0) 39. 14 Dec 94 Viertola Harri: GNU Tar behaviour 40. 20 Jan 95 Francois Pinard: Re: gnutar: Multi volume archives 41. 09 Feb 95 Vidiot: cpio and multi-volume files 42. 17 Feb 95 Ed Silva: Re: gnutar EOT handling. 43. 07 Apr 95 Simon Wright: tar -dM fails on floppies 44. 10 Apr 95 Hernan Prieto Schmidt: Problems with GNU tar 1.11.6 45. 11 Apr 95 Hernan Prieto Schmidt: Patch OK! rmail/2/to-stdout-option 1. 10 Sep 92 Norbert Kiesel: tar 1.11 -O 2. 13 Jan 95 dbgordon@gnu.ai.mit.edu: Possible GNU tar bug? 3. 13 Jan 95 Francois Pinard: Re: Possible GNU tar bug? rmail/2/verify-problems 1. 20 May 93 Jim Burnes: tar-1.10 bug 2. 25 Aug 94 graham@tybj3.eglin.af.mil: Re: update on test CRC option 3. 25 Aug 94 graham@tybj3.eglin.af.mil: GNU cpio version 2.3 suggestion and pr 4. 23 Sep 94 brown@bibliotech.com: GNU tar enhancement 5. 23 Sep 94 Francois Pinard: Re: GNU tar enhancement 6. 19 Oct 94 iros1.IRO.UMontreal.CA!iastate.edu!gora: Problem with gtar 7. 19 Oct 94 iros1.IRO.UMontreal.CA!iastate.edu!gora: Re: Problem with gtar 8. 01 Aug 91 Max Hailperin: bugs in tar-1.10 verification 9. 01 Feb 95 Ed Sirett: Re: gnu-tar.1.11.2 - Verification on tape media. 10. 07 Feb 95 Francois Pinard: Re: gnu-tar.1.11.2 - Verification on tape media. 11. 07 Feb 95 Ed Sirett: Re: gnu-tar.1.11.2 - Verification on tape media. 12. 08 Feb 95 Ed Sirett: Re: gnu-tar.1.11.2 - Verification on tape media. rmail/3/archive-pg-like 1. 25 Feb 93 Patrick Sobalvarro: ITS Grim File Reaper rmail/3/configuration-files 1. 03 May 93 Sarantos Kapidakis: tar/addition 2. 27 Jul 94 wbader@CSEE.Lehigh.Edu: Re: GNU tar: exit statuses 3. 27 Jul 94 Francois Pinard: Re: GNU tar: exit statuses 4. 27 Jul 94 wbader@CSEE.Lehigh.Edu: Re: GNU tar: exit statuses rmail/3/delete-problems 1. 04 Jul 91 Stuart Kemp: gnutar 1.10 problems 2. 30 Jul 91 Saul Lubkin: Re: gnutar on ISC 2.2 3. 02 Mar 94 Vincent M. Del Vecchio: GNU Tar delete problem [1.09, also 1.11.2 4. 16 Aug 94 js@hornet.att.com: Re: Prerelease: GNU tar version 1.11.4 rmail/3/dironly-option 1. 05 Aug 94 mib@gnu.ai.mit.edu: Re: GNU tar: status of -D/f_dironly rmail/3/emacs-mode 1. 07 Apr 95 Greg McGary: FYI: tar-mode.el hacks 2. 07 Apr 95 François Pinard: Re: GNU tar is vulnerable to EINTR failures rmail/3/info-script-option 1. 29 Oct 92 John P. Rouillard: Need help with the manual? 2. 16 Mar 94 Neil Faulks: -F option causes tar to dump core 3. 11 Nov 94 Rocky Giannini: Problem with tar 1.11.2 --info-script option? 4. 06 Dec 94 Marty Leisner: tar 1.11.6 rmail/3/pax-specifications 1. -- --- -- Hal Jespersen: pax proposal 2. -- --- -- Hal Jespersen: more thoughts on pax 3. 07 Dec 93 Don Cragun: (POSIX.2 38) Proposal to replace ISO 1001 based new a 4. 13 Dec 93 Hal Jespersen: (POSIX.2 42) Re: Some feedback on your new pax pro 5. 18 Dec 93 Hal Jespersen: (POSIX.2 44) Re: Comments on pax proposal 6. 22 Dec 93 Don Cragun: (POSIX.2 48) Re: (POSIX.2 44) Re: Comments on pax pro 7. 23 Dec 93 Hal Jespersen: (POSIX.2 50) new pax proposal [nroff] 8. 27 Dec 93 Hal Jespersen: (POSIX.2 52) pax prefix/name 9. 15 Aug 94 Francois Pinard: Re: A pax implementation for GNU 10. 20 Apr 95 Tom Tromey: Re: Bug in GNU tar 1.11.2 11. 21 Apr 95 François Pinard: Re: Bug in GNU tar 1.11.2 rmail/3/pax-utility-project 1. 26 Dec 93 Richard Stallman: Re: pax proposals 2. 28 Feb 94 Isaac Charles: Re: pax 3. 29 May 94 j chapman flack: Integrating the 'pax' archiver with GNU utilitie 4. 02 Aug 94 Francois Pinard: ustar compatibility, from cpio distribution 5. 13 Aug 94 gjb@maxim.gba.oz.au: A pax implementation for GNU 6. 12 Aug 94 Francois Pinard: Re: A pax implementation for GNU 7. 16 Aug 94 gjb@maxim.gba.oz.au: Re: A pax implementation for GNU 8. 16 Aug 94 gjb@maxim.gba.oz.au: Re: A pax implementation for GNU 9. 20 Aug 94 Mail Delivery Subsystem: Returned mail: Cannot send message for 5 10. 21 Aug 94 Mail Delivery Subsystem: Returned mail: Cannot send message for 5 11. 21 Apr 95 Tom Tromey: Re: Bug in GNU tar 1.11.2 12. 21 Apr 95 Tom Tromey: Re: Bug in GNU tar 1.11.2 13. 25 Apr 95 François Pinard: Re: Bug in GNU tar 1.11.2 rmail/3/performance-related 1. 24 Jun 89 Brian Fox: tar idea 2. 02 Sep 90 Steve Nuchia: Re: UNIX semantics do permit full support for async 3. 17 Nov 90 Jay Ts: Re: tar or cpio, which is better? 4. 20 Mar 93 RP Chamberlin: New patches for gnu tar-1.11.1 5. 31 May 93 Lee M J McLoughlin: v37i098: buffer1.16 - Very Fast Tape Writer, 6. 03 Jun 93 Barry Margolin: GNU tar suggestions 7. 16 Jun 93 Matthias Rabe: Re: Proposal for improvement of gtar 1.11.2 8. 21 Jun 93 Superuser: GNU Tar and SCO UNIX 3.2.4 9. 13 Jul 93 Doug Lenz: Suggestion Only... 10. 22 Apr 94 mib@gnu.ai.mit.edu: Re: GNUtar problem 11. 26 Apr 94 les@chinet.chinet.com: Re: GNUtar problem 12. 10 Jun 94 Werner Krebs: improvements to tar 1.11.2 13. 19 Jun 94 J"org Weule: (none) 14. 05 Aug 94 haible@ma2s2.mathematik.uni-karlsruhe.de: Re: Prerelease: GNU tar 15. 12 Aug 94 root@apollo.west.oic.com: gnu tar 16. 12 Aug 94 Francois Pinard: Re: gnu tar 17. 19 Aug 94 ig25@fg30.rz.uni-karlsruhe.de: Buffering for GNU cat 18. 23 Aug 94 Russell Cattelan: tar mods 19. 24 Aug 94 cattelan@thebarn.com: Re: tar mods 20. 08 Oct 94 fheitkamp@nova.wright.edu: Speeding Linux Tar 21. 12 Oct 94 Garry Adkins: Re: Tar and z option with DAT drive 22. 12 Oct 94 Claus-Dieter Bredl: Re: Tar and z option with DAT drive 23. 30 Nov 94 Russell Cattelan: Latest and greatest tar 24. 20 Jan 95 Frankie K.T. Chu: tar like GTAK of OS/2... 25. 24 Feb 95 Randall Glass: tar 1.11.2 rmail/3/raw-tcp-sockets 1. 27 Jul 94 mende@piecomputer.rutgers.edu: Re: (gnu)tar 1.10 patch rmail/3/rdump-emulation 1. 08 Oct 92 Noah Friedman: [Harald.Eikrem@delab.sintef.no: backup dump w/ GNU 2. 02 Oct 93 Alan Stebbens: Re: tar-1.11.2 and incremental backups 3. 19 May 94 Steve Warren: gnu tar --newer option question rmail/3/scripts-related 1. 30 Sep 92 Derek Beatty: tar 1.11.1 --listed-incremental with --atime-preser 2. 30 Sep 92 Derek Beatty: (none) 3. 20 Apr 93 root: tar 1.11.2/level-{0,1} 4. 05 May 93 Siddall P: GNU_tar 1.11 5. 21 May 93 LEE@lpi.jsc.nasa.gov: Questions about tar-1.11.2 6. 19 Jun 93 tim: GNU tar 7. 26 Jul 93 Rob Parry: Compile error in regex.c in tar 1.11.2 8. 30 Aug 93 John David Anglin: tar-1.11.2 of hp700 with hpux 9.01 9. 30 Sep 93 Noah Friedman: tar-1.11.2 and incremental backups 10. 22 Oct 93 Alberto Santini: about tar1.11.2 11. 22 Oct 93 Noah Friedman: about tar1.11.2 12. 30 Nov 93 Richard Stallman: Backup script bug 13. 21 Feb 94 K Kubat: Backup scripts V1.00 14. 26 Feb 94 Bennett Todd: Incrementals (was Re: find/cpio vs. gnutar) 15. 15 Mar 94 Michael I Bushnell: Re: Questions on which features work in gtar- 16. 11 Aug 94 rms@gnu.ai.mit.edu: idea for dump scripts 17. 16 Aug 94 rms@gnu.ai.mit.edu: Re: GNU tar scripts maintainance 18. 17 Aug 94 friedman@gnu.ai.mit.edu: Re: GNU tar scripts maintainance 19. 17 Aug 94 rms@gnu.ai.mit.edu: Re: GNU tar scripts maintainance 20. 17 Aug 94 friedman@gnu.ai.mit.edu: Re: GNU tar scripts maintainance 21. 17 Aug 94 friedman@gnu.ai.mit.edu: Re: GNU tar scripts maintainance 22. 17 Aug 94 rms@gnu.ai.mit.edu: Re: GNU tar scripts maintainance 23. 23 Aug 94 Ashok Aiyar: Re: Any decent backup software for Linux ??? 24. 23 Aug 94 Leslie Mikesell: Re: Any decent backup software for Linux ??? 25. 23 Aug 94 Leslie Mikesell: Re: Any decent backup software for Linux ??? 26. 26 Aug 94 rms@gnu.ai.mit.edu: Re: GNU tar scripts maintainance 27. 04 Sep 94 rms@gnu.ai.mit.edu: tar changes 28. 04 Sep 94 rms@gnu.ai.mit.edu: Re: tar changes 29. 05 Sep 94 rms@gnu.ai.mit.edu: Re: tar changes 30. 06 Sep 94 henrik@picard.tamu.edu: How does one restore from a level-0 dump 31. 06 Sep 94 Jonathan Warburton-Brown: L.B.U - A Linux Backup Utility 32. 03 Oct 94 dave@hiauly1.hia.nrc.ca: Re: Possible problem with tar-1.11.5 33. 22 Nov 94 Kurt Mader: Backup scripts (GNU tar) 34. 22 Nov 94 Francois Pinard: Re: Backup scripts (GNU tar) 35. 22 Nov 94 Noah Friedman: [mader@cecam.fr: Backup scripts (GNU tar)] 36. 20 Jan 95 Koen Holtman: DISCUSSION: afio 2.4.1 new feature 37. 23 Jan 95 Joel M. Hoffman: Re: DISCUSSION: afio 2.4.1 new feature 38. 29 Jan 95 Milan Hodoscek: Re: GNU tar 1.11.2 and IRIX kisg 5.3 11091812 IP2 39. 02 Feb 95 Cliff Rayman: Re: tar backups w/ active files? 40. 07 Feb 95 Jason Uberig: tar 1.11.2: FSF backup scripts: problem/question 41. 18 Feb 95 Gerry Frank Gilmore: Re: tar backups w/ active files? 42. 24 Feb 95 Noah Friedman: Re: GNU tar 1.11.2 and IRIX kisg 5.3 11091812 IP22 43. 24 Feb 95 Noah Friedman: tar 1.11.2: FSF backup scripts: problem/question 44. 24 Feb 95 Jason Uberig: Re: tar 1.11.2: FSF backup scripts: problem/questio 45. 25 Feb 95 Milan Hodoscek: Re: GNU tar 1.11.2 and IRIX kisg 5.3 11091812 IP2 46. 25 Feb 95 Leslie Mikesell: Re: tar 1.11.2: FSF backup scripts: problem/ques 47. 02 Mar 95 Francois Pinard: Re: extra newline printed by cheesy checkpoint c 48. 05 Mar 95 Trever Miller: Re: Safe to use TAR to backup? 49. 06 Mar 95 Paul Southworth: Re: Safe to use TAR to backup? 50. 06 Mar 95 Michael Meissner: Re: Safe to use TAR to backup? 51. 07 Mar 95 Kevin Lentin: Re: TAR and backups... 52. 10 Mar 95 Rod Troch: Re: Safe to use TAR to backup? 53. 11 Mar 95 Leslie Mikesell: Re: Safe to use TAR to backup? 54. 12 Mar 95 David Kastrup: Re: Safe to use TAR to backup? 55. 13 Mar 95 Steven A. Reisman: Re: Safe to use TAR to backup? 56. 17 Mar 95 Michael Meissner: Re: Safe to use TAR to backup? 57. 24 Apr 95 Noah Friedman: As if you didn't have enough to do already 58. 27 Apr 95 Uri Meth: tar-1.11.2 59. 15 May 95 asb@ulysses.att.com: GNU tar incremental backup problem 60. 22 May 95 M. Damerell: Re: GNU tar incremental backup problem 61. 22 May 95 M. Damerell: Re: GNU tar incremental backup problem rmail/3/shared-libraries 1. 11 Apr 93 Junio Hamano: GNU tar 1.11.2 not using GNU libc rmail/3/tape-length-option 1. 20 Oct 93 Michael I Bushnell: Re: bug report for gnu tar 1.10 rmail/3/ufos-and-horrors 1. 29 Jun 89 Scott Garfinkle: HP diffs for tar 2. 30 Jun 89 Scott Garfinkle: my tar patches 3. 27 May 93 Daniel R. Guilderson: GNU tar and SCO UNIX: what to do? 4. 28 May 93 Daniel R. Guilderson: Tar link type extensions for SCO UNIX 5. 04 Jul 94 dave@hiauly1.hia.nrc.ca: Re: Patches for tar-1.11.2 for hpux s700 6. 12 Jul 94 dave@hiauly1.hia.nrc.ca: Re: Patches for tar-1.11.2 for hpux s700 7. 05 Aug 94 haible@ma2s2.mathematik.uni-karlsruhe.de: Re: Prerelease: GNU tar 8. 08 Aug 94 Francois Pinard: Re: Prerelease: GNU tar version 1.11.3 9. 10 Jul 91 Jan Dj{rv: Question about tar format 10. 11 Oct 91 friedman@gnu.ai.mit.edu: Beware of copying HPUX devices with GNU 11. 16 Aug 94 R.K.Lloyd@csc.liv.ac.uk: Re: Prerelease: GNU tar version 1.11.4 12. 17 Aug 94 R.K.Lloyd@csc.liv.ac.uk: Re: Prerelease: GNU tar version 1.11.4 13. 28 May 93 Daniel R. Guilderson: SCO UNIX 3.2v4 patches to GNU tar 1.11.2 14. 01 Sep 94 lkv@mania.robin.de: bug-fix for GNU-tar under HP-UX 15. 04 Jul 94 Jordan Hazen: Why does 'tar -clf' archive /proc filesystem? 16. 08 Jul 94 M. Shawn Easter: Re: Why does 'tar -clf' archive /proc filesystem 17. 09 Jul 94 Juha Virtanen: Re: Why does 'tar -clf' archive /proc filesystem? 18. 11 Nov 94 Ralf Lammers: fileutils-3.12 rmail/3/update-problems 1. 14 Mar 94 Matthew Swift: tar 1.11.2 on NeXT 3.0 black: bus errors 2. 07 Nov 94 brad@instep.wimsey.com: WARNING: bug in gnutar 3. 12 Oct 94 Carsten Menke: tar --update or --append on Connor Archive Viper 2 rmail/3/validation-suite 1. 06 Dec 91 Paul Eggert: Zwicky's reported bugs in GNU tar 1.10 2. 03 Jul 94 pinard@IRO.UMontreal.CA: (none) 3. 03 Jul 94 bigmac@erg.sri.com: Re: Finding Elizabeth D. Zwicky? 4. 06 Sep 94 rocky@panix.com: Re: tar 1.11.5 (make check) 5. 06 Oct 94 lmcguyb@LMC.Ericsson.SE: Re: Just a question 6. 08 Jun 95 François Pinard: Re: pinard@iro-genr-nosbe rmail/3/wish-list 1. 08 Jan 94 Jamie Zawinski: tar feature request 2. 05 Jun 94 Deron E. Meranda: GNU tar 1.11.2 doesn't handle hard-linked direc 3. 08 Feb 95 Francois Pinard: Re: problems with tar-1.11.[56] 4. 28 May 95 K. Berry: revised tar.texi 5. 26 May 95 Charles Lamb: local tar modification to avoid reading partial fil 6. 30 Mar 95 Charles Lamb: Re: tar and EOF markers 7. 30 Mar 95 François Pinard: Re: tar and EOF markers admin/msdos/RMAIL 1. 06 Dec 91 OPER2%ncuee.ncu.edu.tw@CUNYVM.CUNY.EDU: LTARV1.ZIP - DOS's deTAR 2. 15 Jan 92 Christoph Splittgerber: Re: TAR for MSDOS using ASPI 3. 30 Apr 92 DARREL HANKERSON: Re: djgpp/go32 utilities archived? 4. 24 Mar 93 Mark Bergman: names2dos Porting script upload 5. 25 Apr 93 Alexey Vovenko: TAR 1.11.1 on MS-DOS, Borland C 3.10 Compilation 6. 31 Dec 93 js@hrmsf.att.com: Bug report for GNU tar 1.11.2 7. 21 Jun 94 leisner@sdsp.mc.xerox.com: Improving portability of sh-util-1.10 8. 03 Oct 94 elf@netcom.com: tar-1.11 and DJGPP 9. 04 Jan 95 Leslie Mikesell: Re: probable bug in tar 1.11.2 10. 04 Jan 95 Francois Pinard: Re: gnu tar extention 11. 05 Jan 95 pinard@gnu.ai.mit.edu: Assignments and disclaimers 12. 25 Feb 95 Francois Pinard: Re: tar 1.11.2 13. 25 Feb 95 Leslie Mikesell: Re: tar 1.11.2 14. 01 Mar 95 Christoph Splittgerber: Re: tar 1.11.2 15. 10 Feb 95 Gregory S. Thorne: Help with 'tar' 16. 22 Apr 95 François Pinard: Re: TAR 17. 28 Apr 95 Ronald F. Guilmette: Re: Building GNU sed requires GNU sed 18. 28 Apr 95 François Pinard: Re: Building GNU sed requires GNU sed 19. 28 Apr 95 Ronald F. Guilmette: WANTED: Ports of GNU tools to Windows95. 20. 31 Mar 95 Piercarlo Grandi: Re: UNIX to DOS transfer 21. 02 Feb 95 Dimitris Fousekis - KAPE: (none) 22. 02 Feb 95 Francois Pinard: Autour de tar... 23. 04 Feb 95 Mail Delivery Subsystem: Returned mail: Cannot send message for 3 24. 14 Jun 95 Chris Kernstock: gnu tar 1.11.2 tar-1.11.8/COPYING 644 625 1 43076 5022066500 6455 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19yy name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. tar-1.11.8/INSTALL 644 625 1 16446 5716157366 6501 Basic Installation ================== These are generic installation instructions. The `configure' shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a `Makefile' in each directory of the package. It may also create one or more `.h' files containing system-dependent definitions. Finally, it creates a shell script `config.status' that you can run in the future to recreate the current configuration, a file `config.cache' that saves the results of its tests to speed up reconfiguring, and a file `config.log' containing compiler output (useful mainly for debugging `configure'). If you need to do unusual things to compile the package, please try to figure out how `configure' could check whether to do them, and mail diffs or instructions to the address given in the `README' so they can be considered for the next release. If at some point `config.cache' contains results you don't want to keep, you may remove or edit it. The file `configure.in' is used to create `configure' by a program called `autoconf'. You only need `configure.in' if you want to change it or regenerate `configure' using a newer version of `autoconf'. The simplest way to compile this package is: 1. `cd' to the directory containing the package's source code and type `./configure' to configure the package for your system. If you're using `csh' on an old version of System V, you might need to type `sh ./configure' instead to prevent `csh' from trying to execute `configure' itself. Running `configure' takes awhile. While running, it prints some messages telling which features it is checking for. 2. Type `make' to compile the package. 3. Optionally, type `make check' to run any self-tests that come with the package. 4. Type `make install' to install the programs and any data files and documentation. 5. You can remove the program binaries and object files from the source code directory by typing `make clean'. To also remove the files that `configure' created (so you can compile the package for a different kind of computer), type `make distclean'. There is also a `make maintainer-clean' target, but that is intended mainly for the package's developers. If you use it, you may have to get all sorts of other programs in order to regenerate files that came with the distribution. Compilers and Options ===================== Some systems require unusual options for compilation or linking that the `configure' script does not know about. You can give `configure' initial values for variables by setting them in the environment. Using a Bourne-compatible shell, you can do that on the command line like this: CC=c89 CFLAGS=-O2 LIBS=-lposix ./configure Or on systems that have the `env' program, you can do it like this: env CPPFLAGS=-I/usr/local/include LDFLAGS=-s ./configure Compiling For Multiple Architectures ==================================== You can compile the package for more than one kind of computer at the same time, by placing the object files for each architecture in their own directory. To do this, you must use a version of `make' that supports the `VPATH' variable, such as GNU `make'. `cd' to the directory where you want the object files and executables to go and run the `configure' script. `configure' automatically checks for the source code in the directory that `configure' is in and in `..'. If you have to use a `make' that does not supports the `VPATH' variable, you have to compile the package for one architecture at a time in the source code directory. After you have installed the package for one architecture, use `make distclean' before reconfiguring for another architecture. Installation Names ================== By default, `make install' will install the package's files in `/usr/local/bin', `/usr/local/man', etc. You can specify an installation prefix other than `/usr/local' by giving `configure' the option `--prefix=PATH'. You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you give `configure' the option `--exec-prefix=PATH', the package will use PATH as the prefix for installing programs and libraries. Documentation and other data files will still use the regular prefix. If the package supports it, you can cause programs to be installed with an extra prefix or suffix on their names by giving `configure' the option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. Optional Features ================= Some packages pay attention to `--enable-FEATURE' options to `configure', where FEATURE indicates an optional part of the package. They may also pay attention to `--with-PACKAGE' options, where PACKAGE is something like `gnu-as' or `x' (for the X Window System). The `README' should mention any `--enable-' and `--with-' options that the package recognizes. For packages that use the X Window System, `configure' can usually find the X include and library files automatically, but if it doesn't, you can use the `configure' options `--x-includes=DIR' and `--x-libraries=DIR' to specify their locations. Specifying the System Type ========================== There may be some features `configure' can not figure out automatically, but needs to determine by the type of host the package will run on. Usually `configure' can figure that out, but if it prints a message saying it can not guess the host type, give it the `--host=TYPE' option. TYPE can either be a short name for the system type, such as `sun4', or a canonical name with three fields: CPU-COMPANY-SYSTEM See the file `config.sub' for the possible values of each field. If `config.sub' isn't included in this package, then this package doesn't need to know the host type. If you are building compiler tools for cross-compiling, you can also use the `--target=TYPE' option to select the type of system they will produce code for and the `--build=TYPE' option to select the type of system on which you are compiling the package. Sharing Defaults ================ If you want to set default values for `configure' scripts to share, you can create a site shell script called `config.site' that gives default values for variables like `CC', `cache_file', and `prefix'. `configure' looks for `PREFIX/share/config.site' if it exists, then `PREFIX/etc/config.site' if it exists. Or, you can set the `CONFIG_SITE' environment variable to the location of the site script. A warning: not all `configure' scripts look for a site script. Operation Controls ================== `configure' recognizes the following options to control how it operates. `--cache-file=FILE' Use and save the results of the tests in FILE instead of `./config.cache'. Set FILE to `/dev/null' to disable caching, for debugging `configure'. `--help' Print a summary of the options to `configure', and exit. `--quiet' `--silent' `-q' Do not print messages saying which checks are being made. `--srcdir=DIR' Look for the package's source code in directory DIR. Usually `configure' can determine that directory automatically. `--version' Print the version of Autoconf used to generate the `configure' script, and exit. `configure' also accepts some other, not widely useful, options. tar-1.11.8/NEWS 644 625 1 11021 5756550002 6113 GNU tar NEWS - User visible changes. Copyright (C) 1994, 1995 Free Software Foundation, Inc. Version 1.11.8 - May 1995, by Franc,ois Pinard. * Implement message catalogs for French, German, Portuguese and Swedish. * The distribution provides a rudimentary Texinfo manual. * The device defaults to stdin/stdout, unless overridden by the installer. * Option --sparse (-S) should work on more systems. * Option --rsh-command may select an alternative remote shell program. Most changes are internal, and should yield better portability. Version 1.11.2 - March 1993, by Michael Bushnell. * Changes in backup scripts: cleaned up considerably; notices error conditions better over rsh; DUMP_REMIND_SCRIPT is now an option in backup-specs; new file dump-remind is an example of a DUMP_REMIND_SCRIPT. * Superfluous "Reading dirname" was a bug; fixed. * Incompatibility problems with a bug on Solaris are fixed. * New option --gzip (aliases are --ungzip and -z); calls gzip instead of compress. Also, --use-compress-program lets you specify any compress program. --compress-block is renamed --block-compress and now requires one of the three compression options to be specified. * Several error messages are cleaned up. * Directory owners are now set properly when running as root. * Provide DUMP_REMIND_SCRIPT in backup-specs as a possible option for --info-script. * Behave better with broken rmt servers. * Dump scripts no longer use --atime-preserve; this causes a nasty probem. * Several Makefile cleanups. Version 1.11.1 - September 1992, by Michael Bushnell. * Many bug fixes. Version 1.11 - September 1992, by Michael Bushnell. Version 1.10.16 - July 1992. Version 1.10.15 - Jun 1992. Version 1.10.14 - May 1992. Version 1.10.13 - January 1992. * Many bug fixes. * Now uses GNU standard configure, generated by Autoconf. * Long options now use `--'; use of `+' is deprecated and support for it will eventually be removed. * New option --null causes filenames read by -T to be null-terminated, and causes -C to be ignored. * New option --remove-files deletes files (but not directories) after they are added to the archive. * New option --ignore-failed-read prevents read-errors from affecting the exit status. * New option --checkpoint prints occasional messages as the tape is being read or written. * New option --show-omitted-dirs prints the names of directories omitted from the archive. * Some tape drives which use a non-standard method of indicating end-of-tape now work correctly with multi-tape archives. * --volno-file: Read the volume number used in prompting the user (but not in recording volume ID's on the archive) from a file. * When using --multi-volume, you can now give multiple -f arguments; the various tape drives will get used in sequence and then wrap around to the beginning. * Remote archive names no longer have to be in /dev: any file with a `:' is interpreted as remote. If new option --force-local is given, then even archive files with a `:' are considered local. * New option --atime-preserve restores (if possible) atimes to their original values after dumping the file. * No longer does tar confusingly dump "." when you don't tell it what to dump. * When extracting directories, tar now correctly restores their modification and access times. * Longnames support is redone differently--long name info directly precedes the long-named file or link in the archive, so you no longer have to wait for the extract to hit the end of the tape for long names to work. Version 1.10 - July 1991, by Michael Bushnell. * Filename to -G is optional. -C works right. Names +newer and +newer-mtime work right. * -g is now +incremental, -G is now +listed-incremental. * Sparse files now work correctly. * +volume is now called +label. * +exclude now takes a filename argument, and +exclude-from does what +exclude used to do. * Exit status is now correct. * +totals keeps track of total I/O and prints it when tar exits. * When using +label with +extract, the label is now a regexp. * New option +tape-length (-L) does multi-volume handling like BSD dump: you tell tar how big the tape is and it will prompt at that point instead of waiting for a write error. * New backup scripts level-0 and level-1 which might be useful to people. They use a file "backup-specs" for information, and shouldn't need local modification. These are what we use to do all our backups at the FSF. Version 1.09 - October 1990, by Jay Fenlason. Version 1.08 - January 1990, by Jay Fenlason. Versions 1.07 back to 1.00 by Jay Fenlason. * See ChangeLog for more details. tar-1.11.8/NLS 644 625 1 14635 5765106331 6013 Notes on the GNU Translation Project ************************************ This chapter presents some information about GNU packages providing native language translation for their messages: configuration and usage, contributing to translations, and obtaining GNU `gettext'. INSTALL matters =============== Some GNU packages are "localizable" when properly installed; the programs they contain can be made to speak your own native language. Most such packages use GNU `gettext'. Some other packages have their own ways to internationalization, predating GNU `gettext'. If you found this `NLS' file inside a GNU distribution, you may assume that this distribution does use GNU `gettext'. By default, this package will be installed to allow translation of messages. It will automatically detect whether the system provides the `catgets' or `gettext' functions. If neither is present, the GNU `gettext' library will be used. Installers may use special options at configuration time for changing this behaviour. The commands: ./configure --with-gnu-nls ./configure --disable-nls will respectively bypass system `catgets' or `gettext' to use GNU `gettext', or else, totally disable translation of messages. The `README' file of each internationalized package should say which languages are supported by this package, giving an ISO 639 two-letter code for each language. If your language is supported, and translation has not been disabled at configure time, you only have to set the `LANG' environment variable to the two-letter language code prior to using the programs in the package. For example, let's suppose that you speak German. At the shell prompt, merely execute `setenv LANG de' (in `csh') or `export LANG; LANG=de' (in `sh'). This can be done from your `.login' or `.profile' file. Translating teams ================= GNU is going international! The GNU Translation Project is a way to get maintainers, translators and users all together, so GNU will gradually become able to speak many native languages. The GNU `gettext' tool set contains *everything* maintainers need for internationalizing their packages for messages. It also contains quite useful tools for helping translators at localizing messages to their native language, once a package has already been internationalized. To achieve the GNU Translation Project, we need many interested people who like their own language and write it well, and who are also able to synergize with other translators speaking the same language. If you'd like to volunteer to *work* at translating messages, please send mail to your translating team. Each team has its own mailing list, courtesy of Linux International. You may reach your translating team at the address `XX@li.org', replacing XX by the two-letter ISO 639 code for your language. Language codes are *not* the same as country codes. The following translating teams exist, as of May 1995: Chinese (zh), Czech (cs), Danish (da), Dutch (nl), Esperanto (eo), Finnish (fi), French (fr), Irish (ga), German (de), Greek (el), Italian (it), Japanese (ja), Indonesian (in), Norwegian (no), Polish (pl), Portuguese (pt), Russian (ru), Spanish (es), Swedish (sv) and Turkish (tr). For example, you may reach the Chinese translating team by writing to `zh@li.org'. When you become a member of the translating team for your own language, you may subscribe to its list. For example, Swedish people can send a message to `sv-request@li.org', having this message body: subscribe Keep in mind that team members should be interested in *working* at translations, or at solving translational difficulties, rather than merely lurking around. If your team does not exist yet and you want to start one, please write to `gnu-translation@prep.ai.mit.edu'; you will then reach the GNU coordinator for all translator teams. Available packages ================== Languages are not equally supported in all GNU packages. The following matrix shows the current state of GNU internationalization, as of May 1995. Listed are: internationalized packages, and languages for which work is in progress, or about to start. Many packages in pretest, but not all of them, may currently be fetched from `ftp://ftp.iro.umontreal.ca/pub/contrib/pinard/gnu/'. See note cs de es fi fr it ja nl pt sv \ .-------------------------------. chess (4) | * * | clisp (3) | * * | diffutils (2) | . - | fileutils | - | flex (1) | . - | m4 (2) | + + + - + | gettext | + + | ptx (2) | + + + | recode (2) | + . + + | sharutils (2) | + + + + + | shellutils | - | tar | + . + . + + | wdiff (2) | + + + + | `-------------------------------' cs de es fi fr it ja nl pt sv The interpretation legend is: `.' interest shown, or invitation made `-' being undertaken, or work in progress `+' submitted, and now ready for pretest `*' distributed through an official release Notes: (1) This package has its translatable strings marked, but does not use GNU `gettext'. A convenience patch may be available separately. (2) This package is planned to switch to GNU `gettext'. For the time being, it uses temporary means for internationalization. (3) This package is translated to specific languages by methods predating GNU `gettext'. Translations are kept in the sources and memory, rather than installed in external message catalogs. (4) This package is translated to specific languages by methods predating GNU `gettext'. Translations are all kept on disk files, and sources contain numbers where one normally expects strings. Getting GNU `gettext' ===================== Even if specifications are still evolving, and GNU `gettext' is in beta test, you may grab a copy by anonymous ftp, at URL `ftp://i44ftp.info.uni-karlsruhe.de/pub/gnu/gettext.tar.gz'. For the time being, please report problems directly to Ulrich Drepper, the author of this package, at `drepper@gnu.ai.mit.edu'. tar-1.11.8/THANKS 644 625 1 14231 5770545005 6340 GNU tar THANKS file GNU tar has originally been written by Graham Todd. Many people further contributed to GNU tar by reporting problems, suggesting various improvements or submitting actual code. Here is a list of these people. Help me keep it complete and exempt of errors. Alan Bawden Alan@lcs.mit.edu Alan Modra alan@spri.levels.unisa.edu.au Alexander Dupuy dupuy@smarts.com Alexander Lehmann alex@hal.rhein-main.de Anders Andersson andersa@docs.uu.se Andreas Schwab schwab@issan.informatik.uni-dortmund.de Andrew A. Chernov ache@astral.msk.su Andrew Torda torda@igc.chem.ethz.ch Antonio Jose Coutinho ajc@di.uminho.pt Arnold Robbins arnold@gnu.ai.mit.edu Ben A. Mesander ben@piglet.cr.usgs.gov Bernard Chen bern@cs.ucla.edu Bob Mende Pie mende@piecomputer.rutgers.edu Bruno Haible haible@ma2s2.mathematik.uni-karlsruhe.de Bryant Fujimoto fujimoto@denali.chem.washington.edu Burkhard Plache plache@krusty.optimax.ns.ca Carl Streeter streeter@cae.wisc.edu Charles Lopes Charles.Lopes@infm.ulst.ac.uk Chip Salzenberg tct!chip Chris Arthur csa@gnu.ai.mit.edu Chris Hopps sycom.mi.org!ro-chp!chopps Chris Ransom chris@quests.com Christian T. Dum ctd@mpe-garching.mpg.de Christopher Vickery vickery@ipc1.cs.qc.edu Claude Scarpelli claude@genethon.fr Cliff Krumvieda cliff@cs.cornell.edu Dan Bloch dan@transarc.com Daniel R. Guilderson d.guilderson@ma30.bull.com Danny R. Johnston danny@cs.weber.edu Dave Gentzel gentzel@nova.enet.dec.com David J. MacKenzie djm@uunet.uu.net David K. Drum ccdavid@mizzou1.missouri.edu David Lemson lemson@uiuc.edu David Taylor taylor@think.com Dean Gaudet dgaudet@watdragon.uwaterloo.ca Demizu Noritoshi nori-d@is.aist-nara.ac.jp Denis Fortin fortin@acm.org Dick Streefland dicks@tasking.nl Dimitris Fousekis dfousek@leon.nrcps.ariadne-t.gr Drew Sullivan drew@sni.ca Drew Trieger trieger@woodstock.abbott.com Edward Welbourne eddy@gen.cam.ac.uk Elmar Heeb heeb@itp.ethz.ch Eric Norum eric@ee.ualberta.ca Esa Karell karell@cs.helsinki.fi Ezra Peisach epeisach@mit.edu François Pinard pinard@iro.umontreal.ca Gerben Wierda gerben@rna.indiv.nluug.nl Goeran Uddeborg uddeborg@carmen.se George Chyu gschyu@ccgate.dp.beckman.com Greg Black gjb@gba.oz.au Greg McGary gkm@magilla.cichlid.com Harald Koenig koenig@tat.physik.uni-tuebingen.de Henrik Bakman hb@csd.uu.se Hiroyuki Bessho bsh@grotto.iijnet.or.jp Holger Teutsch holger@hotbso.rhein-main.de Hugh Secker-Walker hugh@ear.mit.edu Ian Jackson iwj@cam-orl.co.uk Ian T. Zimmerman itz@crl.com Indra Singhal indra@synoptics.com J.T. Conklin jtc@cygnus.com Jan Carlson janc@sni.ca James W. McKelvey mckelvey@fafnir.com Janice Burton r06a165@bcc25.kodak.com Jay Fenlason hack@gnu.ai.mit.edu Jean-Michel Soenen soenen@lectra.fr Jean-Ph. Martin-Flatin syj@ecmwf.int Jeff Moskow jeff@rtr.com Jeff Prothero jsp@betz.biostr.washington.edu Jeff Siegel js@hornet.att.com Jeffrey Goldberg J.Goldberg@cranfield.ac.uk John David Anglin dave@hiauly1.hia.nrc.ca Jim Blandy jimb@totoro.cs.oberlin.edu Jim Farrell jwf@platinum.com Jim Meyering meyering@acm.org John Clark jclark@gray.cscwc.pima.edu John Gilmore gnu@toad.com John L. Chmielewski jlc@attmail.com John Oleynick juo@klinzhai.rutgers.edu John Rouillard rouilj@cs.umb.edu Jonathan I. Kamens jik@cam.ov.com Jonathan N. Sherman sysjns@etacrs1.safb.af.mil Joseph E. Sacco jsacco@ssl.com Judy Ricker jricker@gdstech.grumman.com Juha Sarlin juha@tds.kth.se Kai Petzke wpp@marie.physik.tu-berlin.de Karl Berry karl@cs.umb.edu Karl Vogel vogelke@c-17igp.wpafb.af.mil Kaveh R. Ghazi ghazi@caip.rutgers.edu Kevin D Quitt drs@netcom.com Kevin Dalley kevin@aimnet.com Kimmy Posey kimmyd@bnr.ca Kurt Jaeger pi@rus.uni-stuttgart.de Laurent Sainte-Marthe smarthe@genethon.fr Les Mikesell les@mcs.com Mark Clements mpc@mbsmm.com Mark Frost mfrost@ncd.com Mark W. Eichin eichin@cygnus.com Marty Leisner leisner@eso.mc.xerox.com Massimo Dal Zotto dz@cs.unitn.it Mats Lofkvist d87-mal@nada.kth.se Michael Helm mike@fionn.lbl.gov Michael Holmes mholmes@lccinc.com Michael Innis Bushnell mib@gnu.ai.mit.edu Michael Kubik mkubik@qitgsdv1.telecom.com.au Michael Maass michael.maass@bk.bosch.de Mike Muuss mike@brl.mil Mike Nolan nolan@lpl.arizona.edu Mike Rogers mike@demon.net Milan Hodoscek milan@kihp6.ki.si Minh Tran-Le tranle@intellicorp.com Neil Jerram nj104@cus.cam.ac.uk Nelson H.F. Beebe beebe@math.utah.edu Nick Barron nikb@cix.compulink.co.uk Noah Friedman friedman@prep.ai.mit.edu Pascal Meheut pascal@cnam.cnam.fr Patrick Timmons timmons@electech.polymtl.ca Paul Eggert eggert@twinsun.com Peder Chr. Norgaard pcn@tbit.dk Per Bojsen pb@delta.dk Per Foreby perf@efd.lth.se Piercarlo Grandi piercarl@sabi.demon.co.uk R. Scott Butler butler@prism.es.dupont.com Rainer Orth ro@thp.uni-koeln.de Ralf Suckow suckow@contrib.de Ray Dassen jdassen@wi.leidenuniv.nl Reuben Sumner rasumner@undergrad.math.uwaterloo.ca Richard Deal deal@xi.cs.fsu.edu Richard Lloyd R.K.Lloyd@csc.liv.ac.uk Richard O'Neill richard@nexus.vnus.bc.ca Rick Emerson rick@ssg.com Rob Parry rparry@hydrolab.arsusda.gov Robert Bernstein rocky@panix.com Robert E. Brown brown@bibliotech.com Robert McGraw mcgraw@sunspot.noao.edu Robert W. Kim robertwk@aixpdslib.seas.ucla.edu Robert Weissenfels robert@hop.ping.de Roland Schemers III schemers@vela.acs.oakland.edu Ron Guilmette rfg@netcom.com Russ Evans e_gs18@ub.nmh.ac.uk Sarah Quady squady@warp10.keck.hawaii.edu Scott Grosch garath@engin.umich.edu Scott S. Bertilson scott@geom.umn.edu Sherwood Botsford sherwood@space.ualberta.ca Stefan Skoglund sp2stes1@ida.his.se Stephen Saroff saroff@msc.edu Tarang Kumar Patel mombasa@ptolemy.arc.nasa.gov The King elvis@gnu.ai.mit.edu Thomas Koenig Thomas.Koenig@ciw.uni-karlsruhe.de Thomas Krebs krebs@faps.uni-erlangen.de Tilman Schmidt ts@gb1.sema.de Tim Ramsey tar@ksu.ksu.edu Timothy Fossum fossum@cs.uwp.edu Tom Quinn trq@astro.washington.edu Torbjorn Granlund tege@sics.se Torkel Hasle torkel@bibsyst.no Travis L. Priest T.L.Priest@larc.nasa.gov Tsutomu Yamada tsutomu@sra.co.jp Ulrich Drepper drepper@gnu.ai.mit.edu Van Snyder vsnyder@math.jpl.nasa.gov Vic Abell abe@cc.purdue.edu W. Phillip Moore wpm@morgan.com William Bader wbader@pluto.csee.lehigh.edu William Kucharski kucharsk@netcom.com tar-1.11.8/TODO 644 625 1 1552 5713305171 6072 * TODO file for GNU tar -*- outline -*- Tell if you feel like volunteering for any of these ideas, listed more or less in decreasing order of priority. .@ ChangeLog .* Revise 3/rmail/{malloc,memcmp}. .* Rename --absolute-paths to --absolute-names .* Make so that --rsh-command may be used even if !HAVE_RTAPELIB. .* revise all NAMSIZ references, too often related to short buffers. .* current_link_name, current_file_name not always quoted when printed. .* Let DEVICE_PREFIX be configured from the environment. .* --ignore-failed-read might have been defeated. .* diffarch.c: confusion between stderr and stdlis, WARN and ERROR. .* create.c: diagnostics missing when `goto badfile'. .* split tar.h into genuine POSIX tar.h and system.h. .* error should have a way to emulate msg or msg_perror. .* Make a debugging feature out of all `#if 0'. tar-1.11.8/ChangeLog 644 625 1 351357 5770654616 7245 Sat Jun 17 07:08:26 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * Release 1.11.8. * lib/Makefile.in (DISTFILES): Remove COPYING.LIB. * lib/COPYING.LIB: Deleted. * src/Makefile.in (mostlyclean): Remove also _*.c and _*.o. * src/system.h: Remove typedef of off_t, because AC_TYPE_OFF_T takes care of it now. * src/create.c (dump_file), src/gnu.c (get_dir_contents): Cast (int) explicitely for test. * src/Makefile.in ($(OBJECTS)): Depend on ../intl/libgettext.h instead of ../intl/libintl.h, which does not always exist. * src/genfile.c: Define EXIT_SUCCESS and EXIT_FAILURE if not. * src/tar.c (main): Use TAREXIT_SUCCESS instead of EXIT_SUCCESS. * scripts/WARNING: New file. * scripts/Makefile.in (DISTFILES): Distribute it. * po/Makefile.in (.po.gmo): Force moving the created .gmo file to $(srcdir), in case it was not already found and replaced there. (install-data): Find files in $(srcdir) if not in current dir, because .gmo files are taken there, right out the distribution. * intl/Makefile.in (DISTFILES): Ensure an all ready stamp-cat-id and cat-id-tbl.c into the distribution. (stamp-cat-id): Rewrite rule so it replaces files in $(srcdir), remove a useless rm and cat. * po/Makefile.in (install-data, uninstall): Avoid using basename. * Makefile.in (DISTFILES): Distribute config.guess and config.sub. Reported by Ulrich Drepper. * acconfig.h, aclocal.m4, configure.in, intl/cat-compat.c, int/gettext.h, intl/po-to-tbl.sed, po/Makefile.in: Last minutes additions, and glimpses to the future gettext 0.6.1. Reported by Ulrich Drepper. * acconfig.h: Document HAVE_MKNOD. * configure.in: Test for mknod only once included. Reported by Alan Modra, Ray Dassen and Ulrich Drepper. * aclocal.m4: Test for re_rx_search instead of rx_compile, the latter not being exported unless RX_WANT_RX_DEFS is defined. Reported by Alan Modra. * src/tar.h: Use off_t instead of long for the second argument in __rmt_lseek declaration. Thu Jun 15 14:30:20 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * po/Makefile.in (dist): Comment out tupdate action for now, it needs more tweeking before being distributed active. * intl/Makefile.in (dist), po/Makefile.in (dist): Correct missing reference to $(srcdir) on cp call, also avoid outputting clutter while doing the work. * intl/Makefile.in: Use top_srcdir for referring to $(PACKAGE).pot. * Makefile.in, lib/Makefile.in (dist), scripts/Makefile.in (dist): Do not hide copying rule. * po/Makefile.in (.po.gmo): Get around what seems to be an msgfmt bug, which adds .mo even to FILE in `-o FILE'. * src/checktar.sh: Send a message saying that it is still useless. * configure.in, intl/Makefile.in, po/Makefile.in: Adjustments to NLS, so .sed scripts may now all reside in intl/. Tue Jun 13 16:10:49 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * Makefile.in (pot): New goal, triggering po/tar.pot. Sun Jun 11 08:53:50 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * src/tar.h, src/tar.c (decode_options), src/extract.c (extract_archive), src/diffarch.c (diff_archive), src/create.c (dump_file, start_header), src/tar.c (decode_options): Replace flag_absolute_paths by flag_absolute_names. * src/tar.c (decode_options): Implement OBSOLETE_ABSOLUTE_NAMES for reporting --absolute-paths as obsolete. * src/system.h: Conditionnaly include and define setlocale to void independently of ENABLE_NLS. Reported by Ulrich Drepper. Sat Jun 10 19:59:19 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * src/tar.c (long_options): Use no_argument and require_argument, instead of constants. Have long option names translated to short options whenever possible, rather than setting flags directly: easing option management is worth a few extra nanoseconds. * src/tar.c (long_options): Add --gunzip as meaning -z. Reported by Bruno Haible. Wed Jun 7 13:51:13 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * configure.in: Substitute POTFILES by contents of po/POTFILES. * po/POTFILES: New file. * po/Makefile.in: Use POTFILES instead of TRANSCSRCS, also use top_srcdir. * {doc,lib,scripts,src}/Makefile.in: Use subdir and distdir. * configure.in: More adjustments for GNU gettext 0.6. * config.guess, config.sub, intl/linux-msg.sed, intl/po-to-tbl.sed, intl/xopen-msg.sed: New files, all taken from gettext 0.6. * lib/stpcpy.c, lib/xgetcwd.c: New functions needed by gettext. * lib/Makefile.in: Adjusted to always compile these. * src/system.h: If NLS, simplify by merely including . Also, define setlocale to emtpy only if the setlocale function is not known, instead of when is missing. * src/Makefile.in (INCLUDES): Use ../intl in compilations, taking care of the fact libintl.h might have been symlinked there. Mon Jun 5 21:51:01 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * intl/*: New from GNU gettext 0.6, replacing the previous version of this directory. This change should solve many problems. Reported by Bruno Haible, Christopher Vickery, Jan Carlson, Jean-Philippe Martin-Flatin, John David Anglin, Joseph E. Sacco, Kaveh R. Ghazi, Kurt Jaeger, Mark W. Eichin, Marty Leisner, Minh Tran-Le, Stephen Saroff, Thomas Koenig, Thomas Krebs and William Bader. * src/tar.c, src/tar.h: Rename TAR_EXTERN to GLOBAL. * src/tar.h: Delete COMMAND_VERSION. * src/tar.c: Replace OPTION_HELP and OPTION_VERSION commands by show_help and show_version variables, so `--version --create' will not diagnose `Too many commands'. Adjust things so this works. Reported by Marty Leisner. Sun Jun 4 15:15:06 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * Makefile.in, src/Makefile.in (check): New goal. * src/checktar.sh: New script. * src/genfile.c: New file. * src/Makefile.in (all): Prepare genfile. * src/Makefile.in: Distribute checktar.sh and genfile.c. Sat Jun 3 09:30:34 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * doc/tar.texinfo: Use header.texi. * doc/Makefile.in: Prepare doc/header.texi from src/tar.h. Distribute it. * src/tar.h: Adjust so extracted doc/header.texi is neater. Tue May 30 08:01:38 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * src/tar.c (name_match): Use %s for printing directory, not %d. Reported by Marty Leisner. * src/tar.c (name_gather, addname): chdir_name receives string pointers which might later be overwritten, but nevertheless saved into structures, so, use xstrdup for the time being. Reported by Michael Holmes. * src/tar.c (name_next, name_from_list): Abort when chdir fails. Reported by Ian Jackson and Marty Leisner. * Makefile.in (DISTFILES): Do not distribute SUPPORT, now integrated in the documentation. Reported by Karl Berry. Sun May 28 13:36:10 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * src/rmt.h: Declare second argument of __rmt_lseek to be off_t instead of long, so it is the same as in src/rmt.c. Reported by Chris Arthur. * src/buffer.c (close_archive): Compensate for the addition of 2 to ar_block at open_archive time, for when -M used, just before calling free. Reported by Kevin Dalley. * src/rmt.c: Replace SSIZE by STRING_SIZE, avoiding a conflict with some header files. Reported by Kaveh R. Ghazi and William Bader. * src/tar.c: Use DEVICE_PREFIX instead of DEVICE_PREXIX, and WITH_REGEX instead of WITH_REGEC. Reported by Bruno Haible. * doc/Makefile.in (DISTFILES): Add tar.info-3. Reported by Bruno Haible. * configure.in: Check for isascii, not iascii. Reported by Alan Modra, Bruno Haible and Greg McGary. Tue May 16 12:32:04 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * Prerelease 1.11.7. * src/Makefile.in (tar): Have $(OBJECTS) depend on system.h. * Makefile.in (DISTFILES): Distribute NLS. * lib/insremque.h, lib/insremque.c: New files, from GNU gettext. * lib/Makefile.in: Take care of insremque.[hc]. * configure.in, acconfig.h: Many adjustments for GNU gettext. * intl/Makefile.in, po/Makefile.in: Idem. * src/system.h: Idem. Tue May 9 00:14:23 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * configure.in, src/Makefile.in: Clean glocale out. * po/Makefile.in: New file. * po/de.po, po/fr.po, po/pt.po, po/sv.po: New files, adapted from the corresponding .tt files in src/. * Makefile.in (SUBDIRS): Add po. * Makefile.in (pofile): New goal. Mon May 8 14:58:54 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * configure.in: Call ud_WITH_NLS, create intl/Makefile.in. Compute size of unsigned short and unsigned int. * acconfig.h: Document ENABLE_NLS, HAVE_CATGETS and HAVE_GETTEXT. * Makefile.in: Process intl subdirectory. * src/Makefile.in: Use libintl.a while linking. * src/system.h: Include unconditionally, instead only if WITH_CATALOG. Let define _() appropriately. * src/tar.c (main): Call textdomain. * intl/*: New, from nlsutils. * configure.in (LINGUAS): Add pt. * src/pt.po: New file, for Portuguese. Reported by Antonio Jose Coutinho. Tue May 2 23:24:10 1995 =?ISO-8859-1?Q?Fran=E7ois_Pinard?= (pinard@icule) * src/system.h, src/gnu.c, src/list.c, src/port.c: Avoid superfluous parentheses in macro definitions. * src/port.c: Capitalize macro arguments. * src/buffer.c, src/create.c, src/diffarch.c, src/tar.c: Use comma operator when assignment in test. Thu Apr 27 20:56:21 1995 François Pinard (pinard@icule) * src/port.c (link): Use WARN to report the message. Reported by Sherwood Botsford. Sun Mar 19 10:41:06 1995 François Pinard (pinard@icule) * configure.in: Remove GLOCALE, add LINGUAS, use fp_WITH_CATALOGS. * lib/Makefile.in, src/Makefile.in: Modify accordingly. * acconfig.h: Add description for WITH_CATALOGS. * system.h: Use WITH_CATALOGS to define _() differently. Tue Mar 14 23:29:34 1995 François Pinard (pinard@icule) * src/rtapelib.c (__rmt_open): Close the unused side of each pipe, instead of the useful one, prior to processing. Reported by Charles Lopes. Wed Feb 22 00:03:32 1995 Francois Pinard (pinard@icule) * configure.in, Makefile.in, doc/Makefile.in, src/Makefile.in: Replace `date' by `echo timestamp'. Sun Feb 19 12:25:02 1995 Francois Pinard (pinard@icule) * Makefile.in, lib/Makefile.in, src/Makefile.in: Support ID files. Do not distribute TAGS. Mon Feb 13 18:29:23 1995 Francois Pinard (pinard@icule) * doc/Makefile.in, src/Makefile.in: Use top_srcdir. Sat Feb 11 18:16:40 1995 Francois Pinard (pinard@icule) * src/gnu.c (is_dot_or_dotdot): Through NFS, readdir might deliver empty filenames under old Solaris 2.4, causing endless loops in tar. As a workaround, avoid `' as done already for `.' and `..'. Reported by Jan Carlson. Sun Feb 5 07:38:18 1995 Francois Pinard (pinard@icule) * All Makefile.in (maintainer-clean): New name for realclean. Mon Jan 9 13:29:24 1995 Francois Pinard (pinard@icule) * src/de.tt: New file, for Swedish. Reported by Jan Djarv. Wed Jan 4 12:50:46 1995 Francois Pinard (pinard@icule) * src/extract.c (make_dirs): Correct for Turbo C on MSDOS, which may return EACCES instead of EEXIST on mkdir. Reported by Jeffrey Goldberg. * src/tar.c (usage): Do not tell about -N and related if MSDOS. (decode_options): Be blind to -N and related if MSDOS. Reported by Jeffrey Goldberg. * src/rmt.h (_remdev): A filename is not remote if the colon is preceeded by a slash, to take care of `/:/' which is a shorthand for `/...//fs' on OSF's Distributing Computing Environment (DCE) and Distributed File System (DFS). Reported by Travis L. Priest. Tue Jan 3 21:43:36 1995 Francois Pinard (pinard@icule) * src/tar.c (decode_options): Renamed from options. Convert oldish-style non-dashed options to modern writing before performing option decoding. Diagnose when modern options are met before old style options are fully converted. This allows mixing of option styles on a single call. Avoid getoldopt and use getopt_long instead. * src/getoldopt.c: Deleted. * src/tar.h: Prototype deleted. * src/Makefile.in: Adjusted. Reported by Bruno Haible, Les Mikesell and Patrick Timmons. Mon Jan 2 21:48:49 1995 Francois Pinard (pinard@icule) * src/system.h: New file, split out of src/tar.h. * src/buffer.c, src/create.c, src/diffarch.c, src/extract.c, src/getoldopt.c, src/gnu.c, src/list.c, src/mangle.c, src/names.c, src/port.c, src/tar.c, src/update.c: Include "system.h", and move the inclusion of "tar.h" down after system dependent definitions. * src/Makefile.in: Distribute system.h. * src/rmt.c: Include "system.h", and simplify accordingly. * src/rtapelib.c: Include "system.h", and simplify accordingly. * src/rmt.h: Simplify according to the inclusion of "system.h". * src/system.h: Include conditionnaly , , , and . * src/buffer.c, src/diffarch.c, src/rmt.c, src/rtapelib.c, src/update.c: Simplify accordingly. * configure.in: Check for . * src/system.h: If it exists, include prior to , to account for problems when GNU libc 1.0x is installed over SunOS 4.1.3: GNU libc does not provide sys/mtio.h, so it is taken from Sun header files which use things like _IOW, which GNU libc despises, sys/ioccom.h then provides definitions. Reported by Joseph E. Sacco. Sun Jan 1 15:52:44 1995 Francois Pinard (pinard@icule) * Makefile.in (DISTFILES): Distribute SUPPORT, with *pre*-releases. Tue Dec 27 11:26:19 1994 Francois Pinard (pinard@icule) * src/rmt.h: Ensure strrchr is defined to rindex in some cases. Reported by Karl Vogel. Sun Dec 18 19:34:32 1994 Francois Pinard (pinard@icule) * configure.in: Check for isascii. * src/tar.h: Include and declare ISASCII. * src/gnu.c: Adjust, declare and use ISDIGIT and ISSPACE. * src/list.c: Adjust, declare and use ISODIGIT and ISSPACE. * src/port.c: Adjust, declare and use ISPRINT. Reported by Bruno Haible. * lib/safe-stat.h: New, from elsewhere. This solves the fact that lib/mkdir.c, lib/rmdir.c and lib/rename.c were needing it. * lib/Makefile.in (Makefile): Distribute it. Reported by Bruno Haible and Sherwood Botsford. Sun Dec 11 16:17:19 1994 Francois Pinard (pinard@icule) * configure.in: Use fp_WITH_REGEX. * acconfig.h: Document WITH_REGEX. * lib/rx.c, lib/rx.h: New, from elsewhere. * lib/Makefile.in: Adjust accordingly. * src/buffer.c, src/tar.c: Check WITH_REGEX. Sat Dec 10 08:23:06 1994 Francois Pinard (pinard@icule) * src/de.tt: New file, for German. Reported by Ulrich Drepper. Sat Dec 3 21:59:23 1994 Francois Pinard (pinard@icule) * Prerelease 1.11.6. * src/rmt.c: Adjust for localization, by including and , by defining _(), by defining and calling setlocale, and by defining and initializing program_name. * src/Makefile.in: Use locale.o and libtar.a with rmt. * scripts/ChangeLog: Replaced by a warning for now. It has seemingly been overwritten by the weekly script :-(. * scripts/Makefile.in (dist): Correct .../examples to .../scripts. * doc/Makefile.in (DISTFILES): Include docwarn.texi. * src/Makefile.in: Ensure INSTALL_DATA is defined. * configure.in, {,src,lib}/Makefile.in, src/tar.h, src/tar.c: Localize, adapting from how it is done in sharutils. * src/fr.tt: New file, for French. * configure.in, {,*/}Makefile.in, acconfig.h, src/tar.c: Rename PRODUCT to PACKAGE. Tue Nov 29 20:44:14 1994 Francois Pinard (pinard@icule) * src/buffer.c (backspace_output): Change cur from long to off_t. * src/diffarch.c (diff_archive): Idem for offset. * src/extract.c (extract_archive): Idem for offset. * src/rmt.c: Idem for lseek (). (main): For case 'L', use atol instead of atoi, and cast the result to (off_t) rather than (long). * src/rtapelib.c (__rmt_lseek): Idem of offset argument. * src/tar.h: Change offset of sp_array from int to off_t. * src/update.c (move_arch): Change cur from long to off_t. Reported by David J. MacKenzie. Sat Nov 26 18:35:37 1994 Francois Pinard (pinard@icule) * configure.in: Check for and . * src/rmt.h, src/tar.h, src/buffer.c, src/create.c, src/diffarch.c, src/extract.c, src/gnu.c, src/list.c, src/rtapelib.c, src/update.c: Rename _ to __P. * src/tar.h, src/rmt.h: Declare _ as a macro returning its argument, or else, include and declare _ as gettext. * src/tar.c: Possibly include and call setlocale. * src/rmt.c, src/buffer.c, src/create.c, src/diffarch.c, src/extract.c, src/getoldopt.c, src/gnu.c, src/list.c, src/mangle.c, src/port.c, src/rtapelib.c, src/tar.c, src/update.c: Use _ macro over all localizable strings. * src/rtapelib.c: Declare prototype for xstrdup. Do not declare strstr, which is not needed. Mon Nov 7 22:25:27 1994 Francois Pinard (pinard@icule) * doc/Makefile.in (stamp-vti): Use new -r option to date. Sat Nov 5 15:53:53 1994 Francois Pinard (pinard@icule) * doc/Makefile.in (realclean): Also remove stamp-vti. Wed Nov 2 00:50:31 1994 Francois Pinard (pinard@icule) * configure.in: Check for const only after having found possible ANSIfying compiler flags, this is of no use to check it before. Tue Nov 1 15:30:12 1994 Francois Pinard (pinard@icule) * {,*/}Makefile.in: Clean up, following those of GNU m4. I will not detail all the changes here. * configure.in: Likewise. * tar.c: Use PRODUCT and VERSION instead of version_string. * acconfig.h: Document PRODUCT and VERSION. Sun Oct 30 16:29:05 1994 Francois Pinard (pinard@icule) * src/tar.h: Use #if __STDC__ instead of #ifdef __STDC__. Thu Oct 27 12:36:06 1994 Francois Pinard (pinard@icule) * src/rmt.h, src/tar.h, src/buffer.c, src/create.c, src/diffarch.c, src/extract.c, src/gnu.c, src/list.c, src/mangle.c, src/tar.c, src/update.c: Rename all f_* variables to flag_*. * src/tar.h, src/buffer.c, src/tar.c, src/update.c: Rename cmd_mode into command_mode. * src/tar.c (SET_COMMAND_MODE): New macro, use it. * src/port.c (quote_copy_string): Prevent sign extension of character while copying it to an int. (un_quote_string): Increment to_there pointer in all cases. Reported by Mats Lofkvist. Sun Oct 9 08:37:35 1994 Francois Pinard (pinard@icule) * src/rmt.c, src/rtapelib.c, src/tar.h: Get rid of CONFIG_BROKETS. Tue Oct 4 22:45:06 1994 Francois Pinard (pinard@icule) * src/diffarch.c (fill_in_sparse_array): Add a cast for Pyramid's dumb compiler. Later remove the cast and compare to 0 instead. * src/extract.c (extract_archive): Idem. Reported by Karl Vogel and Kaveh R. Ghazi. * configure.in: Correct shell assignment for ac_cv_path_RSH. Reported by Kaveh R. Ghazi. Tue Sep 27 12:12:04 1994 Francois Pinard (pinard@icule) * src/diffarch.c: Normalize capitalization in diagnostics. Mon Sep 26 18:23:47 1994 Francois Pinard (pinard@icule) * src/tar.c (name_next, name_match): Abort tar if directory cannot be changed, instead of going on. This is not an innocuous error. Reported by Marty Leisner. Thu Sep 15 23:46:27 1994 Francois Pinard (pinard@icule) * src/rtapelib.c: Include "rmt.h" only once has been included, because off_t might not be defined otherwise. Reported by James W. McKelvey, Karl Vogel, Kaveh R. Ghazi an and Jim Meyering and Tilman Schmidt. Wed Sep 14 21:43:26 1994 Francois Pinard (pinard@icule) * doc/Makefile.in: Cleanup... (texclean): Deleted, merged into mostlyclean. (Makefile): Have ./config.status create this Makefile only. * lib/Makefile.in: Cleanup... (DISTFILES): Distribute TAGS. (check): Deleted. (TAGS): Make TAGS in $(srcdir) only. (distclean): Do not remove TAGS. (realclean): Remove TAGS. (Makefile): Have ./config.status create this Makefile only. * scripts/Makefile.in: Cleanup... (check): Deleted. (Makefile): Have ./config.status create this Makefile only. * src/Makefile.in: Cleanup... (DISTFILES): Distribute TAGS. (ansi2knr): Use $(LIBS). (TAGS): Make TAGS in $(srcdir) only. (distclean): Do not remove TAGS. (realclean): Remove TAGS. (Makefile): Have ./config.status create this Makefile only. * Makefile.in: Cleanup... Use subshells for all cd's. (MDEFINES): Do not use $(INSTALL...), because ./install-sh will not be relocated correctly. (DISTFILES): Distribute install-sh, not install.sh. (tags): Make only in lib and src. (TAGS): Deleted. (distclean, realclean): Remove config.status. (distclean-local): Don't. (*-recursive): Combine, use sed to strip -recursive in subgoals. (Makefile): Have ./config.status create this Makefile only. (stamp-h): Have ./config.status create config.h only. Do not create stamp-h here, it is now done from configure. (stamp-h.in): Use date instead of touch. * configure.in (AC_OUTPUT): Create stamp-h. Tue Sep 13 23:01:42 1994 Francois Pinard (pinard@icule) * src/buffer.c: Remove the presetting of stdlis, because stdout is not a constant in GNU libc. Reported by Joseph E. Sacco and Michael Innis Bushnell. * src/buffer.c (new_volume): Pass an otherwise unused argument to wait, do not use NULL. Reported by Michael Innis Bushnell. Fri Sep 9 18:10:56 1994 Francois Pinard (pinard@icule) * configure.in: Use fp_ macros for accessing aclocal.m4. Revert _OS_ macros to their previous names, to follow Autoconf. Thu Sep 8 20:04:03 1994 Francois Pinard (pinard@icule) * configure.in: Delete AC_OS_XENIX, now within AC_HEADER_DIRENT. Mon Sep 5 17:06:31 1994 Francois Pinard (pinard@icule) * src/Makefile.in (TAGS): Remove -t on etags call. It has been the default behavior for a few releases of Emacs and it seems that option -t is now disappearing (from Emacs 19.25, at least). Reported by Goeran Uddeborg. Fri Sep 2 22:36:20 1994 Francois Pinard (pinard@icule) * src/gnu.c (get_dir_contents): Do not set dp->allnew if dp is not set itself. Reported by Piercarlo Grandi. * src/extract.c (extract_archive): Issue diagnostic or verbose messages to msg_file, instead of stdout. Reported by Piercarlo Grandi. Thu Sep 1 13:37:49 1994 Francois Pinard (pinard@icule) * configure.in (PROGS): Warn if $DEFAULT_ARCHIVE was specified, while not being found on the current system. Reported by Robert Bernstein Wed Aug 31 09:28:51 1994 Francois Pinard (pinard@icule) * Makefile.in: Distribute it. * Makefile.in (distclean-local): Delete config.log. Tue Aug 30 09:45:13 1994 Francois Pinard (pinard@icule) * doc/Makefile.in (tar.info): Make the documentation in the source directory only. Sat Aug 27 08:05:31 1994 Francois Pinard (pinard@icule) * acconfig.h: Document HAVE_UNION_WAIT, no more in Autoconf. Wed Aug 24 12:16:41 1994 Francois Pinard (pinard@icule) * configure.in: Replace AC_SYS_REMOTE_TAPE by its definition, distillating it around. It is going out of Autoconf. Do not backslash quotes anymore while defining unquoted, this is now corrected in Autoconf. Tue Aug 23 02:05:50 1994 Francois Pinard (pinard@icule) * src/tar.h: Do not declare alloca if already defined, so HP's +Olibcalls compiler option works. Reported by John David Anglin. * src/rtapelib.c (__rmt_open): Use REMOTE_SHELL only if defined. Otherwise, if the command argument has been specified and REMOTE_SHELL is not defined, immediately return an error. Reported by Bruno Haible, Kaveh R. Ghazi, Marty Leisner, Torkel Hasle and William Bader. Because --rsh-command may always be given, even if no remote shell was found at configure time, remote capabilities are always compiled: * configure.in: Do not define RTAPELIB nor HAVE_RTAPELIB. * src/Makefile.in: Always compile $Urtapelib.o. * src/buffer.c (child_open): Always test _remdev, do not depend anymore on HAVE_RTAPELIB. * src/rmt.h: Remove the code for missing HAVE_RTAPELIB. * src/rtapelib.c: Remove unused COMPAT (mis)feature. Remove most length limitations for remote host name, remote user name and remote device name. Duplicate path, and free it in all cases. * (_rmt_rexec): The `user' parameter may never by the empty string. Remove code for that case. Mon Aug 22 17:58:19 1994 Francois Pinard (pinard@icule) Little cleanup in installation: * configure.in: Do not check for wait3, this function is not used. * Makefile.in: Remove useless RSH substitutions. * src/Makefile.in: Remove rule for ../lib/libtar.a. * lib/Makefile.in (install, check): Depend on all. * configure.in: Use `-g -O' instead of `-g' as CFLAGS default value, when GNU C is being used. Delay testing for presets. Reported by Chris Arthur. Sun Aug 21 08:26:29 1994 Francois Pinard (pinard@icule) * Prerelease 1.11.5. * Makefile.in (BACKLOG, dist, shar): Correct for when a different build directory. * src/Makefile.in, lib/Makefile.in, doc/Makefile.in: Idem. * configure.in: Check for union wait. Adapted from make 3.71. * src/tar.h: Replace W* definitions. Adapted from make 3.71. * src/buffer.c (close_archive): Replace WIFCOREDUMPED by WCOREDUMP. Previous WIFSIGNALED definition was excluding SIGSTOP, new definition do not exclude it anymore. We'll see. Reported by Demizu Noritoshi, Greg Black, Kaveh R. Ghazi, Robert E. Brown and Russ Evans. FIXME: (close_archive): * doc/docwarn.texi: New file. * doc/Makefile.in: Distribute it. * configure.in: Replace both mkdir and rmdir, not just mkdir, because NS32016 running SysVr2.2 has mkdir and lacks rmdir. * lib/rmdir.c: New, split out of lib/mkdir.c. * lib/Makefile.in: Distribute it. Reported by Greg Black. * configure.in: Do not try anymore to discover the archive device by looking around for various device names. If the installer does not override it, nicely use `-' as a convenient default. Reported by Andreas Schwab and Kaveh R. Ghazi. Sat Aug 20 09:09:47 1994 Francois Pinard (pinard@icule) This might (?) solve the dirent problems on NeXT's and Apollo's: * src/tar.h: Change includes and defines from older AC_DIR_HEADER style to newer and clearer AC_HEADER_DIRENT style. * src/create.c, src/gnu.c: Replace NLENGTH by NAMLEN. Reported by Drew Trieger, Hugh Secker-Walker, James W. McKelvey, Robert E. Brown and Thomas Krebs. * configure.in: Correct a checking message. Reported by Bruno Haible. Wed Aug 17 00:37:16 1994 Francois Pinard (pinard@icule) Remove some shadowings. * src/update.c (update_archive): Rename head_standard to unused. * src/buffer.c (open_archive): Rename head to label. (fl_read): Rename head to cursor. * src/gnu.c (dirent_cmp): Use (char *const *), not (const char **) for not loosing the const specifier while casting. * src/mangle.c (extract_mangle): Remove unused argument. * src/tar.h: Adjust prototype. * src/extract.c (extract_archive): Caller changed. * src/rtapelib.c (__rmt_open): Remove useless mode parameter. * src/rmt.h, src/tar.h: Adjust prototype. * src/rmt.h: Adjust macros calling __rmt_open. * src/create.c (deal_with_sparse): Remove unused argument. * src/create.c (dump_file): Caller changed. Reported by Greg Black. * configure.in: Replace AC_PROG_RSH with its expansion. Correct the no/true confusion in tests. Do not substitute RSH anymore in src/Makefile, instead define REMOTE_SHELL in config.h. Replace NO_REMOTE by HAVE_RTAPELIB, with inverted meaning. Substitute RTAPELIB by $Urtapelib.o instead of rtapelib.o. * acconfig.h: Document HAVE_RTAPELIB and REMOTE_SHELL. * src/Makefile.in: Avoid $U in defining RTAPELIB. Remove both rtapelib.o and _urtapelib.o explicit rules, not needed anymore. * src/rmt.h, src/buffer.c: Use HAVE_RTAPELIB, not !NO_REMOTE. Reported by Andreas Schwab. * configure.in: Checking for remote shell, use the RSH environment variable if set. This is done only when not already in the cache. Reported by Kaveh R. Ghazi. * configure.in: Include when testing . Reported by Andreas Schwab. * lib/ftruncate.c: Revised, because there is no ftruncate capability whatsoever in Interactive Unix. Reported by Peder Chr. Norgaard. * src/Makefile.in: Correct a typo in $Ubuffer.o dependencies. Reported by Andreas Schwab. * src/rtapelib.c (__rmt_ioctl): Compile the MTIOCGET case only if this symbol is defined. This also solves a missing mt_type field on NS32016 running SysVr2.2. Reported by Greg Black. * src/rtapelib.c (__rmt_ioctl): Conditionnalize only the MTIOCTOP case, not the whole routine, with the MTIOCTOP symbol. In case of unrecognized operation, return EOPNOTSUPP instead of EINVAL. * src/rmt.h: Always provide a prototype for __rmt_ioctl. Delete the RMTIOCTL machinery. * configure.in: Also create doc/Makefile. * Makefile.in: Add doc in subdirs, set infodir, update MDEFINES. * doc/Makefile.in: New file. * doc/tar.texinfo: New file. * doc/texinfo.tex: New, from elsewhere. Tue Aug 16 09:47:49 1994 Francois Pinard (pinard@icule) * configure.in: Undo the `test -b' patch of 1994-08-05. Ultrix 4.2 test does not know about -b. Grrr... Reported by Kaveh R. Ghazi. * configure.in: Check for , HAVE_SYS_GENTAPE_H is tested in rmt.c. Check for , to avoid playing with M_UNIX anymore in rmt.c. * src/rmt.c, src/buffer.c: Use a more uniform way of including or its alternates. Reported by Daniel R. Guilderson and Kaveh R. Ghazi. * src/Makefile.in: Split rule for $Urtapelib.o into one rule for rtapelib.o and one rule for _rtapelib.o, taking care of the fact that rtapelib.c is in $(srcdir) while _rtapelib.c is in current directory. Reported by Andreas Schwab, Kaveh R. Ghazi, Minh Tran-Le and Per Foreby. * configure.in: Use proper function names in AC_CHECK_LIB's. Reported by Alexander Dupuy and Kurt Jaeger. * configure.in: Use $LIBOBJS, not LIBOJBS, while adding to it. Reported by Demizu Noritoshi and Kaveh R. Ghazi. * src/rmt.c (string_error): Correct DEBUG2 into DEBUG1, and strint into string. Reported by Anders Andersson, Bruno Haible, Thomas Krebs and Thomas Koenig. * src/Makefile.in: Add $U's to rtapelib and rmt specific rules. Reported by Thomas Koenig. Mon Aug 15 15:11:12 1994 Francois Pinard (pinard@icule) * Prerelease 1.11.4. * src/rmt.c (numeric_error): Renamed from error. (string_error): New, to replace ERROR ((...)), unavailable in rmt.c. * src/rmt.c (checkbuf): Do not accept, nor return record. Use the global instead. This will get rid of useless shadowings. * src/rmt.h: Give prototypes for __rmt_* routines. * src/rtapelib.c: Include "rmt.h". * src/update.c (move_arch): Cast last rmtioctl argument to char *. * src/buffer.c (backspace_output): Idem. * src/diffarch.c (verify_volume): Idem. * src/Makefile.in (rmt): Declare dependencies over rmt.h. * Makefile.in (dist): Dynamically update FIXME in distributions. Sun Aug 14 10:44:53 1994 Francois Pinard (pinard@icule) * configure.in: Decide MTIO_CHECK_FIELD by grepping . * acconfig.h: Document it. * src/rtapelib.c: Use it instead of mt_type. Reported by Ben A. Mesander. * Makefile.in: Substitute CC, INSTALL, INSTALL_PROGRAM, INSTALL_DATA, RSH, CFLAGS, LDFLAGS, LIBS, prefix, exec_prefix, binprefix, bindir and libexecdir. (MDEFINES): New, using the previous substitutions. (all, install, uninstall): Use it. Reported by Bruno Haible. Sat Aug 13 11:21:23 1994 Francois Pinard (pinard@icule) * configure.in: Check for . * tar.h: Include if it exists, whether POSIX or not. Check if WIFSTOPPED is defined, to decide if defining others WIF*. Reported by Bruno Haible. Thu Aug 11 22:29:49 1994 Francois Pinard (pinard@icule) * configure.in: For , also ensure struct utimbuf is defined by the header file before defining HAVE_UTIME_H. Some systems will not define the structure without _POSIX_SOURCE. * acconfig.h: Document HAVE_UTIME_H. Reported by James W. McKelvey and Robert E. Brown. * configure.in: Instead of replacing strstr, check for it, so HAVE_STRSTR gets defined, then replace it explicitely if required. * src/tar.h, src/rtapelib.c: Declare strstr if we replaced it. Reported by Ben A. Mesander, Christian T. Dum and Kaveh R. Ghazi. * src/extract.c (extract_archive): Declare longname variable if O_CTG is defined. Initialize it as NULL. This dirty kludge will allow the module to compile on Masscomp's, for the time being. Reported by Ben A. Mesander. Wed Aug 10 06:52:15 1994 Francois Pinard (pinard@icule) * src/create.c (dump_file): Do not test only for hpux, but also for __hpux. I added __hpux__ too, as done in src/tar.h. Reported by Richard Lloyd. * src/tar.h: Do not include anymore for HP-UX from HP-UX 8 and after, for which definitions are in , and reorganize the tests in this area. Reported by Christian T. Dum, Dimitris Fousekis, Kimmy Posey, Michael Maass, Richard Lloyd and Thomas Koenig. Tue Aug 9 00:03:00 1994 Francois Pinard (pinard@icule) * configure.in: Updated for Autoconf 2.0. These changes for const-cleaning src/gnu.c and src/tar.c: * src/tar.c (read_name_from_file): Work directly on global variables instead of accepting parameters. Return success or failure as an int instead of the relocated name_buffer. (name_next): Caller changed, internal clean-up of the function. Remove trailing slashes on the command call too, not only when reading from a file through -T option. * src/gnu.c: Add const to name and dir_text in struct dirname. Reported by Ben A. Mesander, Bruno Haible, Christian T. Dum, Dean Gaudet, James W. McKelvey, Richard Lloyd and Robert E. Brown. Mon Aug 8 11:22:56 1994 Francois Pinard (pinard@icule) * src/tar.c (name_next, name_gather, addname): Use strcmp for checking for "-C", instead of decomposed tests, just for clarity. * src/Makefile.in (RSH): Define from configuration. (rtapelib.o): Define REMOTE_SHELL from $(RSH) while compiling. * src/rtapelib.c (__rmt_open): If command not given, use REMOTE_SHELL, instead of cascading tries of filenames. Reported by Bruno Haible. * src/tar.c: Include if FNM_LEADING_DIR is not defined, instead of checking for FNM_PATHNAME, because some define the later without defining the former. Reported by Thomas Koenig. * src/create.c (dump_file): Cast alloca results, for those compilers not processing void * properly. Reported by Kaveh R. Ghazi. * configure.in: Replace memset, mkdir (and rmdir), rename, strstr, ftruncate, when not found. * lib/memset.c, lib/mkdir.c, lib/rename.c, lib/strstr.c and lib/ftruncate.c: New, from elsewhere. * lib/Makefile.in: Distribute them. * src/port.c: Delete mkdir (and rmdir), rename, strstr and ftruncate replacements. Reported by Kaveh R. Ghazi (for memset and strstr). Reported by Bruno Haible (for mkdir and rename). * src/Makefile.in: Get prefix and exec_prefix from configure. Reported by Andreas Schwab, Christian T. Dum and Dean Gaudet. Fri Aug 5 03:47:02 1994 Francois Pinard (pinard@icule) * src/tar.h: Replace msg_file by stdlis. * src/buffer.c, src/gnu.c, src/list.c, src/diffarch.c: Idem. * src/tar.c (main): Print version on stdout, not stderr. * configure.in: Remove padding test. * acconfig.h: Remove PADDING_IN_TAR_HEADER. * tar.h: Unconditionnaly insert the pad. Why play the game of forcing the compiler to do it for us? (Hum! I'm not so sure.) Reported by Bruno Haible. * src/list.c (read_header): Initialize signed_sum to 0. Use this opportunity for slightly reorganizing the code around. Reported by Anders Andersson, Andrew A. Chernov, Bruno Haible and Chris Ransom. * src/tar.c: Declare name_buffer_length as size_t instead of int. Reported by Andreas Schwab, J.T. Conklin, Kaveh R. Ghazi and Robert E. Brown. * configure.in: While defining DEFAULT_ARCHIVE, check for a block device, instead of mere existence. But is `test -b' portable? Test for /dev/fd0, instead of for /dev/fd. Put rct tests last. Reported by Andreas Schwab. * lib/Makefile.in (getdate.c): Tell the installer to expect 10 shift/reduce conflicts instead of 9. Reported by Andreas Schwab. * src/rmt.h: Have the NO_REMOTE case be a particular case of the other, for rmtopen and rmtcreat were not transmitting the proper number of parameters to open and creat (since 26 July 1994). Reported by Andreas Schwab. * src/extract.c (extract_archive): Delay changing owner to after doing utime, for keeping long enough the permission of utime'ing. (extract_archive, restore_saved_dir_info): Idem for directories. * configure.in: Define uid_t and gid_t if necessary. Reported by Jonathan I. Kamens. * Makefile.in (distclean-local): Delete config.cache. Reported by Thomas Koenig. * configure.in: Change malloc_dbg to dmalloc, mutatis mutandi. * acconfig.h: According changes. * tar.h: According changes. * configure.in: Test for broken stat macros, and for mkfifo. * src/tar.h: Undefine many macros if stat macros found to be broken. Define mkfifo only if configure did not find it. Include if not _POSIX_SOURCE, then if we have it, than "pathmax.h". Move _POSIX_VERSION dependent code further down. Do not declare getcwd if we do not have it. * src/tar.c: Do not include , now in "src/tar.h". Reported by Bernard Chen, Jean-Michel Soenen, John L. Chmielewski and Kaveh R. Ghazi. * configure.in: Check for ST_BLKSIZE and ST_BLOCKS. * lib/fileblocks.c: New, from elsewhere. * lib/Makefile.in: Distribute it. * src/tar.h: Define DEV_BSIZE, ST_BLKSIZE and ST_NBLOCKS, borrowing this code from both fileutils-3.9's "lib/system.h" and textutils-1.9's "src/system.h". * src/create.c (dump_file): Straighten the test for sparseness, which was requiring one block too much, most probably for trying to get around DEV_BSIZE/st_blksize confusion. Use ST_NBLOCKS, instead of computing a variable block_size and doing specific tests for HP-UX or Linux. Also rewrite the test so it works when ST_NBLOCKS is unsigned. Reported by Bruno Haible, Dean Gaudet, Dick Streefland, Harald Koenig, Jim Meyering, Kai Petzke, Kaveh R. Ghazi and Torkel Hasle. Thu Aug 4 22:03:50 1994 Francois Pinard (pinard@icule) * src/tar.c: Do not include if we do not have it. Reported by Kaveh R. Ghazi. * src/Makefile.in (RTAPELIB): Prefix by $U for unprotoization. Reported by Kaveh R. Ghazi and Christian T. Dum. * src/port.c: Remove many static specifiers. Reported by Demizu Noritoshi, Kaveh R. Ghazi and William Bader. * src/rtapelib.c (__rmt_open): Replace system by remote, twice. Reported by Ben A. Mesander, Christian T. Dum, Demizu Noritoshi and Kaveh R. Ghazi. * src/tar.c (addname): Replace a forgotten EX_SYSTEM by TAREXIT_FAILURE. Reported by Demizu Noritoshi, James W. McKelvey, Kaveh R. Ghazi and Robert E. Brown. Tue Aug 2 02:40:23 1994 Francois Pinard (pinard@icule) * Prerelease 1.11.3. * Makefile.in (dist, shar): Distribute the scripts directory. * src/tar.c (assign_string): New routines. * src/create.c (dump_file, start_header), src/extract.c (extract_archive), src/list.c (list_archive, read_header), src/buffer.c (open_archive), src/diffarch.c (diff_archive): Use assign_string for setting these variables to a string value or NULL. * src/buffer.c (open_archive): Sets current_file_name, current_link_name and save_name to NULL. (close_archive): Free each of them if not NULL. (fl_write): Take a copy of save_name into cursor, and advance the cursor instead, because save_name should stay free-able. Reported by Dave Gentzel, Harald Anlauf, Mark Clements, Robert Weissenfels, Ronald van Loon, Tsutomu Yamada and Vic Abell. * src/extract.c (extract_archive): Use xstrdup, for clarity. * src/gnu.c (add_dir): Idem. * lib/xstrdup.c: New, from elsewhere. * lib/Makefile.in: Adjusted. * src/list.c (print_header): Correct a little bug by which non-symbolic links were not printed properly quoted. * src/diffarch.c (diff_archive): Allocate tmpbuf to the proper size. NAMSIZ + 2 is not necessarily enough. Mon Aug 1 15:49:46 1994 Francois Pinard (pinard@icule) * configure.in: Check for . * src/tar.h: Refresh str*/mem* configured declarations. Among other things, this will solve previously missing #undef's. * src/rmt.h: Revise strchr configured declaration. * src/*.c: Replace bzero by memset, bcopy by memcpy, bcmp by memcmp, index by strchr and rindex by strrchr. * src/port.c: Delete functions bzero and bcmp, said to not exist on Minix. AC_MINIX in configure.in should guarantee POSIX things. Reported by Drew Trieger, Hugh Secker-Walker and Vic Abell. * src/tar.h, src/tar.c, src/buffer.c, src/update.c: Change CMD_* to COMMAND_*. * src/buffer.c (open_archive): Use strcmp to compare archive name to `-', instead of doing it explicitely. Just for clarity. * src/tar.h, src/tar.c, src/buffer.c: Replace ar_files by archive_name_array, n_ar_files by archive_names and ar_files_len by allocated_archive_names. Replace the index cur_ar_file by archive_name_cursor, which is a cursor in archive_name_array. * src/tar.c (main): Move the initialization of archive_name_array at beginning, taken from options routine. Free it at end of main. (options): Use xrealloc instead of ck_malloc for archive_name, for the already saved names to be preserved. Reported by Per Bojsen. * src/tar.h, src/tar.c: Replace name_file by namefile_name. * src/tar.c: Replace n_ind by name_array, n_indused by names, n_indalloc by allocated_names, and n_indscan by name_index. Replace namef by name_file, n_argv by names_argv and n_argc by names_argc. (main): Make an initial allocation for name_array at beginning, moved out from name_add, free it at end of main. * src/buffer.c (close_archive): Free ar_block at end. Sat Jul 30 03:12:11 1994 Francois Pinard (pinard@icule) * configure.in: When --with-malloc-dbg, define WITH_MALLOC_DBG and add -lmalloc_dbg to LIBS. * acconfig.h: Document WITH_MALLOC_DBG. * src/tar.h: Include "malloc_dbg.h" if WITH_MALLOC_DBG is defined. * src/create.c (create_archive): Do not attempt creating a directory summary file if -G, since -G sets gnu_dumpfile to 0. Reported by Alexander Dupuy. * src/create.c (dump_file): Avoid a NULL dereference with -G when trying to dump an empty directory. * src/gnu.c (add_dir_name): Same thing. Reported by Rainer Orth. Correction for the improper `data differs' diagnostic given when the continuation of a multi-volume was compared. * src/diffarch.c (diff_archive): If multi-volume, update save_name and save_totsize before calling wantbytes. * src/buffer.c (wantbytes): If multi-volume, update save_sizeleft. Reported by Andreas Schwab, Denis Fortin and Hiroyuki Bessho. * configure.in: Try deciding DEVICE_PREFIX and DENSITY_LETTER from the selected DEFAULT_ARCHIVE. * acconfig.h: Document DEVICE_PREFIX and DENSITY_LETTER. * src/tar.c (options): Implement these. Reported by Danny R. Johnston. * src/gnu.c (gnu_restore): Use CURRENT_FILE_NAME abbreviation. * src/extract.c (extract_archive): Idem. Reported by Timothy Fossum. Fri Jul 29 01:02:02 1994 Francois Pinard (pinard@icule) * src/create.c (dump_file): Abort if no memory for a possible link, remove related bogus code, and the variable nolinks. Reported by Andreas Schwab. * src/create.c (dump_file): Detect file sparseness correctly for Linux ext2 filesystem. Reported by Kai Petzke. * src/port.c (link): Do not call setmode when not on MS-DOS. Reported by Richard Deal. Reorganization for `tar -d' to provide a different exit status. * src/tar.h: Replace errors by exit_status. Declare TAREXIT_*. * src/buffer.c (child_open): Exit with exit_status. * src/tar.c (main): Initialize exit_status to TAREXIT_SUCCESS, and exit with exit_status. * src/buffer.c, src/diffarch.c, src/gnu.c, src/list.c, src/port.c, src/rmt.c, src/tar.c, src/update.c: Replace EXIT_FAILURE by TAREXIT_FAILURE, and EXIT_SUCCESS by TAREXIT_SUCCESS. * src/tar.h (ERROR), src/create.c (dump_file): Set exit_status to TAREXIT_FAILURE instead of increasing errors. * src/diffarch.c (sigh, diff_sparse_files): On differences, set exit_status to TAREXIT_DIFFERS if nothing more serious already. Reported by Tilman Schmidt. * src/rmt.c: Define EXIT_FAILURE and EXIT_SUCCESS if not already. * src/rtapelib.c: Define EXIT_ON_EXEC_ERROR to 128 and use it. * aclocal.m4: Adapt AC_PROTOTYPES to caching. * lib/error.c: Add error_print_progname virtual routine. * Using configure as generated by a more recent Autoconf solves a problem of rename being rejected on HP-UX in ANSI mode, because of a conflicting prototype from . In this context, Autoconf now uses ctype.c instead for defining __stub macros. Reported by Burkhard Plache, Edward Welbourne, Henrik Bakman, Jeffrey Goldberg, Jim Farrell, Kimmy Posey, Michael Maass, Mike Nolan, Richard Lloyd, Robert McGraw, Robert W. Kim, Stefan Skoglund, Tarang Kumar Patel, Tilman Schmidt, Tim Ramsey, Van Snyder and W. Phillip Moore. Wed Jul 27 09:16:01 1994 Francois Pinard (pinard@icule) * src/diffarch.c (sigh): Increment errors, so a difference will yield a non-zero exit status at end. Reported by Nick Holloway. * tar.h: Rename TARERROR to WARN, then add ERROR which is similar, but increments the errors counter. * *.c: Replace all TARERROR by WARN or ERROR, deciding for each case. Many errors were not reflected in exit status. Reported by Carl Streeter, Esa Karell, George Chyu, Ian Jackson, Judy Ricker, Massimo Dal Zotto, Tilman Schmidt and Torkel Hasle. * src/buffer.c (child_open): Exit with EXIT_FAILURE if any error. * src/rtapelib.c: Use error for reporting errors. (do_command): New name for command. (get_status): New name for status. * src/buffer.c: Remove definition of MAGIC_STAT. (close_archive): Do not check MAGIC_STAT for an exit value, since this value is never returned. * *.c: Use TARERROR or exit with EXIT_FAILURE, instead of various esoteric statuses. Normalize using TARERROR with an exit status, instead of calling TARERROR with 0 first, then _exit. On exit calls, use EXIT_SUCCESS instead of 0. * src/tar.c: Do not use the exit status anymore for outputting an error counter value. Wrap around was creating spurious success. * src/tar.h: Remove EX_* definitions for tar exit statuses. Reported by Bob Mende and Torbjorn Granlund. Tue Jul 26 03:37:07 1994 Francois Pinard (pinard@icule) * src/tar.h: Add f_rsh_command variable. * src/tar.c: Add and process --rsh-command option. * src/buffer.c (open_archive, child_open, new_volume): Pass f_rsh_command to rmtopen and rmtcreat calls. * src/rmt.h (rmtopen, rmtcreat): Pass a supplementary argument. * src/rtapelib.c (__rmt_open): Accept and process a command argument, to replace rsh. Reported by Jonathan I. Kamens. * configure.in: Check for . Do not define BSD42, do not look anymore if /vmunix, /sdmach or /../../mach exist. * acconfig.h: Remove BSD42. * tar.h: Instead of including with BSD42 or for V7, merely include if it exists, otherwise . * src/buffer.c, src/diffarch.c, src/extract.c, src/list.c, src/port.c, src/update.c: Do not include or , because they are indirectly included through "tar.h". * src/create.c (dump_file): Remove the BSD42 conditional. If not f_sparse_files, initialize upperbound as when not BSD42. Reported by Alan Bawden, Claude Scarpelli, Laurent Sainte-Marthe, Noah Friedman, Reuben Sumner, Tom Quinn and William Bader. Sun Jul 24 10:42:54 1994 Francois Pinard (pinard@icule) * configure.in: Add gmalloc.o to LIBOBJS, instead of AC_SUBST'ing MALLOC. Check for valloc only if gmalloc.o is not being selected. valloc was possibly defined both in "port.h" and GNU malloc. * acconfig.h: Add a description for HAVE_VALLOC. * src/tar.h: Merely define valloc as being malloc if valloc does not exist. * src/port.h: Remove valloc, which was only a dummy for malloc. * lib/gmalloc.c: New, from elsewhere. This renames and updates what was previously malloc.c. This also solves __const vs const. * lib/Makefile.in: Distribute gmalloc.c. Reported by Cliff Krumvieda, Francois Pinard, Henrik Bakman, J.T. Conklin, Nelson H.F. Beebe and Tilman Schmidt. Fri Jul 22 00:05:44 1994 Francois Pinard (pinard@icule) * src/create.c (start_header): Cast NAMSIZ to size_t before comparing it to strlen result. Reported by Mark Frost. * src/tar.c (main): Zero out label_pattern before compiling in regular expressions, instead of using uninitialized memory. Reported by Holger Teutsch. * configure.in: Use provided fnmatch only as a replacement. * lib/Makefile.in (LIBOBJS): Get configured list of replacements. * src/tar.c: Include fnmatch.h only if unistd.h fails to define FNM_PATHNAME. * lib/fnmatch.h: Undefine FNM_PATHNAME and FNM_PERIOD, for HP-UX defines them in . Reported by Alan Modra, Christian T. Dum, Eddy ?, John Oleynick and Richard Lloyd. * lib/getdate.y: Acknowledging here a few reports which are likely solved by going to an updated version of getdate.y. Reported by Andrew A. Chernov, Bruce Evans, Dean Gaudet, Ian T. Zimmerman, Jeff Prothero, Mike Nolan, Milan Hodoscek, Peder Chr. Norgaard, Sarah Quady, Tarang Kumar Patel and Thomas Koenig. * configure.in: Check for , needed for defining _IOW and _IOR on the Tektronix XD88. * src/buffer.c, src/diffarch.c, src/rtapelib.c, src/update.c: Include before , if it exists. Reported by Kaveh R. Ghazi. * src/tar.c (options): Use defined OPTION_* constants instead of anonymous numbers for long options not having a short option form. * src/rmt.h (RMTIOCTL): Define only if MTIOCTOP, so __rmt_ioctl will not be called if it has not been compiled in rtapelib.c. * src/tar.h: Add CMD_TOO_MANY. * src/tar.c (main): Use CMD_TOO_MANY, and get rid of badopt label. Reported by David J. MacKenzie. * src/tar.c (usage): New name for describe(). Rewritten with better help formatting and more logical grouping of options. Accepts an exit status argument. Callers adapted. Reported by Richard O'Neill. Wed Jul 20 07:57:54 1994 Francois Pinard (pinard@icule) * Makefile.in (BACKLOG): New goal, for summarizing the maintainance backlog. Distribute file BACKLOG. * src/port.c (rename): Constify the arguments. Reported by Elmar Heeb, Jeff Prothero and John Clark. * src/tar.c (main): Declare version_string locally. * src/version.c: Deleted. * src/Makefile.in: Adjusted. Tue Jul 19 21:55:21 1994 Francois Pinard (pinard@icule) * src/tar.h: Merge "port.h" towards the beginning of tar.h. Include and , and define errno if needed. * src/*.c: Do not include "port.h" anymore after "tar.h", do not include , nor . Also move "tar.h" as the first file included in every module. This would solve, among other things, the problem of RE_DUP_MAX being redefined by , when included after "regex.h". * src/port.h: Deleted. * src/Makefile.in: Adjusted. Reported by Alan Modra, Christian T. Dum, Dimitris Fousekis, John David Anglin, Matthew Braun, Michael Maass, Richard Lloyd and Stefan Skoglund. * src/create.c (dump_file): Do not cast alloca result to (char *). The problem reported was that alloca result was seen as int, but with the changes just made, alloca should be properly declared. Reported by Bryant Fujimoto and Michael Kubik. Fri Jul 8 23:44:03 1994 Francois Pinard (pinard@icule) * regex.c, regex.h: Use newer versions. This solves a few problems reported by users. Reported by Chris Hopps and John David Anglin. Wed Jul 6 00:37:18 1994 Francois Pinard (pinard@icule) * configure.in: Check for . * src/create.c, src/extract.c: Check HAVE_UTIME_H instead of _POSIX_VERSION, for choosing to include . Reported by Carl Swanson and Thomas Krebs. Tue Jul 5 07:36:58 1994 Francois Pinard (pinard@icule) * configure.in: Substitute DEFAULT_ARCHIVE and DEFAULT_BLOCKING from the environment. Check for /dev/tape first while trying to decide the default archive, because it is often symlinked right. * acconfig.h: Explain DEFAULT_ARCHIVE and DEFAULT_BLOCKING. * src/tar.c: Replace DEF_AR_FILE with DEFAULT_ARCHIVE, replace DEFBLOCKING with DEFAULT_BLOCKING. * configure.in: Use AC_SET_MAKE. * Makefile.in: Use @SET_MAKE@. Reported by Jim Meyering. * src/rtapelib.c: Replace "??'" by "?? '" at two places in a comment, so avoiding Pyramid's DC/OSx compiler to complain about ANSI trigraph sequences. Even comments can trigger bugs, now! Reported by Mark Frost. * src/tar.h: Declare valloc. * src/buffer.c, src/diffarch.c: Remove declaration for valloc. * configure.in: Integrate the check, previously in testpad.c, about a needed padding field in the tar header struct. * testpad.c: Deleted. * tar.h: Do not include "testpad.h" anymore. * acconfig.h: Explain PADDING_IN_TAR_HEADER. * src/Makefile.in: Delete testpad matters. * src/buffer.c (new_volume): Inside case 'n', strcpy into r then assign r to p, instead of strcpy'ing directly into p, for making the module const clean. Sun Jul 3 11:41:54 1994 Francois Pinard (pinard@icule) Rename a few variables to avoid shadowing variables or functions: * src/list.c (print_header): Change name to quoted_name. * src/buffer.c (child_open): Change pipe to local_pipe. * src/extract.c (extract_archive): Change namelen to namelen_bis. * src/rtapelib.c (__rmt_open): Change system to remote. * src/tar.c (options): Add two missing arguments to getoldopt call, NULL is not necessarily implied on all systems. * src/list.c (print_header): Add a few missing long specification in formats. * src/diffarch.c (compare_chunk, diff_sparse_files): Idem. * src/port.c (msg, msg_perror): Idem. * src/tar.h: Include prototypes for all functions which call from one module to another. Declare voidstar (use it everywhere instead of PTR). Move in the include from , and the include of option.h from tar.c and getoldopt.c, waiting for a better solution for all these things. * src/port.c: Removed PTR declaration and including . * src/getoldopt.c, src/tar.c: Remove including "option.h". Sat Jul 2 00:26:54 1994 Francois Pinard (pinard@icule) * src/*: Protoized all function headers. Added static to functions which can take it. Add many const specifiers. Remove unused variables. * src/port.c (xmalloc): Delete function, do not mask the true one. * src/port.c (ck_malloc): Use xmalloc, waiting for annihilation. * src/port.c (ck_realloc): Use xrealloc, waiting for annihilation. * lib/xmalloc.c: New file, from elsewhere. * lib/Makefile.in: Adjusted. * src/*: Begin switching from ck_malloc (or even pure malloc) to xmalloc. Same for ck_realloc (pure realloc) to xrealloc. Doing this correctly is a delicate matter, which I'll continue without reporting it anymore, while doing other modifications. * src/*: Replace msg and msg_perror calls by TARERROR macro calls. Capitalize first word of all error messages, remove ending punctuation or newline. Systematically avoid contractions for `Cannot' and `Could not'. Always write `WARNING:' all in capitals. * src/tar.h: Declare TARERROR as calling error(). Rename variable tar to program_name. * src/tar.c (main, options), src/buffer.c (child_open), src/port.c (msg, msg_perror), src/gnu.c (gnu_restore): Rename variable tar to program_name. * src/gnu.c (gnu_restore): Remove a spurious repetition of program_name in error message. * lib/error.c: New, from elsewhere. * lib/Makefile.in: Adjusted. * configure.in: Check for -linet, this library is required on a few systems for gettimeofday() or getservbyname(). Reported by Dean Gaudet, Goeran Uddeborg, Mike Rogers and Peder Chr. Norgaard. * configure.in: Ensure -lsocket is tested after -lnsl. Reported by Mark Frost. * configure.in: All tests reordered for clarity. Fri Jul 1 13:35:16 1994 Francois Pinard (pinard@icule) * configure.in: Use AC_TIME_WITH_SYS_TIME, test for . This should solve the problem of multiple inclusions of . Also, also check for , for getdate.y tests this. Reported by Jim Meyering, John Rouillard, Karl Berry and Rick Emerson. * src/buffer.c, src/create.c src/extract.c, src/gnu.c, src/list.c, src/names.c, src/rmt.c, src/tar.c, src/update.c: Remove all (void) prefixes to function calls. There are limits to lint clutter. Thu Jun 30 07:55:22 1994 Francois Pinard (pinard@icule) * src/port.h: Remove definition of const. Let configure do it. * configure.in: AC_CONST was already added since 1.11.2, but no ChangeLog entry for it, so here is one, with list of reporters. * AIX 3.2 RS/6000 IBM's compiler was unable to compile regex.c, this might be solved already through improved Autoconf tests. Reported by Alexey Vovenko, Ben A. Mesander, Bryant Fujimoto, Christian. T. Dum, Christopher Vickery, Dan Bloch, David K. Drum, David Lemson, Demizu Noritoshi, Dimitris Fousekis, Ezra Peisach, Hugh Secker-Walker, Indra Singhal, J.T. Conklin, Jan Hoeglund, Janice Burton, Jeff Siegel, Jim Blandy, John L. Chmielewski, John Rouillard, Jonathan N. Sherman, Kevin D Quitt, Kurt Jaeger, Mark Frost, Matthew Braun, Michael Kubik, Michael Helm, Moritz D. Klingholz, Neil Jerram, Nelson H.F. Beebe, Nick Barron, Paul Eggert, R. Scott Butler, Rob Parry, Ron Guilmette, Scott Grosch, Sherwood and Stephen Saroff. * Makefile.in: Completely replaced, lurking at the previous one. At the same time, solve a few minor problems reported by users. The most frequently reported ones pertained to a trailing \ in a comment, and rmt installing in /etc. Reported by Dean Gaudet, Gerben Wierda, James W. McKelvey, John L. Chmielewski, Karl Berry, Mike Rogers, Ralf Suckow and Richard Lloyd. * lib/Makefile.in, src/Makefile.in: New files. * configure.in: Also process lib/Makefile.in and src/Makefile.in. Substitute CFLAGS, LDFLAGS and YFLAGS from the environment. Use AC_CHECKING instead of using echo explicitely. Use AC_HEADER_CHECK(unistd.h) instead of obsolete AC_UNISTD_H. * configure.in: Generate a configuration header file. This not only puts less clutter in make output, but also goes around some compilers' limits about the number of allowed -D options. Reported by Nelson H.F. Beebe. * acconfig.h: New file. * src/tar.h, src/rmt.c, src/rtapelib.c, src/version.c, src/testpad.c: Add a block for including or "config.h". If "tar.h" was included everywhere, the block will only be needed there. * src/*.[ch]: Reindented to GNU standards (they were not far). Got rid of all `* ' left prefixes in comments and refilled them. There is still a lot of cosmetic changes needed everywhere. I will not report them any more, doing them along the way of other things in the future. * Split distribution into a few subdirectories, for easing maintainance. So far: src, lib, scripts, msdos which are to be distributed; then rmail, texinfo, ARCH and misc to be kept here. * scripts/ChangeLog: Initialized by moving entries related to scripts out of this ChangeLog. * Taking over maintainance duties. Tue Aug 31 20:06:40 1993 David J. MacKenzie (djm@goldman.gnu.ai.mit.edu) * rmt.c [M_UNIX]: Include sys/tape.h instead of sys/mtio.h. Reported by Drew Sullivan and William Bader. Thu Jul 29 20:53:00 1993 David J. MacKenzie (djm@wookumz.gnu.ai.mit.edu) * Makefile.in (config.status): Run config.status --recheck, not configure, to get the right args passed. Mon Jul 19 23:01:00 1993 David J. MacKenzie (djm@churchy.gnu.ai.mit.edu) * Makefile.in (libdir): Use standard GNU value -- $(exec_prefix)/lib, not /etc. Thu Jul 8 20:05:03 1993 David J. MacKenzie (djm@goldman.gnu.ai.mit.edu) * Makefile.in (installdirs, configure, config.status, Makefile): New targets. Mon Jun 14 07:44:46 1993 Noah Friedman (friedman@nutrimat.gnu.ai.mit.edu) * Makefile.in (.c.o): Put -I. before -I$(srcdir), and make $(CFLAGS) last. Sat May 22 21:33:36 1993 The King (elvis@graceland.gnu.ai.mit.edu) * extract.c (extract_archive, restore_saved_dir_info): Print mode in octal, not in decimal. Reported by Scott S. Bertilson. Fri Mar 26 19:30:26 1993 Noah Friedman (friedman@nutrimat.gnu.ai.mit.edu) * configure.in: Better way of detecting HP-UX. Reported by Noah Friedman. Thu Mar 25 13:32:40 1993 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * version.c: Released version 1.11.2. * Makefile.in (dist): Do the link differently; some of the files have changed filesystems which makes it more complex. * Makefile.in (dist, shar): Use gzip instead of compress. * create.c (dump_file): Test for curdev==-1, not curdev<0. Some losing NFS systems give negative device numbers sometimes. Fri Mar 19 15:05:15 1993 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * buffer.c (new_volume): Write the global volume number to the volno file before running the info script, so that the script can look at it. Wed Mar 17 10:30:58 1993 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * tar.c (describe, long_options): Changed --compress-block to --block-compress. (options): Fixed f_compress_block sanity check error message to give the correct name of the option. Tue Mar 16 14:52:40 1993 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * extract.c (extract_archive): case LF_DIR: Do chown when necessary. Don't bother jumping to set_filestat for f_modified; repeat the chmod code here. Replace `break', deleted on 2 September 1992. * tar.c (describe, long_options, options): Added gzip options and use-compress-program option. * tar.h: Added new compression options. * buffer.c (child_open, open_archive): Use new compression options. * create.c (start_header): Only mask off high bits when creating old-style archives. * list.c (decode_header): Mask off potentially misleading high bits from the mode when reading headers. Reported by Paul Eggert. Mon Mar 15 11:34:34 1993 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * extract.c (extract_archive): Put arguments in the right order for error message. Reported by Bruno Haible. * create.c (deal_with_sparse): If the last byte was null, we didn't write it out. * gnu.c, create.c, extract.c, diffarch.c, list.c throughout: Replace malloc calls with ck_malloc and realloc with ck_realloc. Reported by Jonathan Kamens. * tar.c (describe): Improve doc for -L. * tar.c (name_next): Don't apply exclusion to explicitly named files. * tar.c (long_options, describe): Added new-volume-script as an alias for info-script. * extract.c (extract_archive): LF_DUMPDIR case; misplaced paren. * extract.c (extract_archive): extract_file case, first if, include space for null in namelen computation. * extract.c (extract_sparse_file): Use value returned by write to properly create error message. * create.c (create_archive): Don't assume we have anything to dump. * buffer.c (open_archive): Set current_file_name for the volume header so that verbose listings work properly. * Makefile.in (realclean): Added getdate.c. Thu Jan 14 23:38:44 1993 David J. MacKenzie (djm@kropotkin.gnu.ai.mit.edu) * tar.c: Include fnmatch.h after port.h to make sure we get our FNM_* (e.g. on HPUX 8). Tue Nov 24 08:30:54 1992 David J. MacKenzie (djm@goldman.gnu.ai.mit.edu) * tar.c (addname), gnu.c (read_dir_file): Use HAVE_GETCWD, not USG. * port.h, rmt.h: Use HAVE_STRING_H, not USG. * port.h: Add dir header decls. * create.c, gnu.c: Use SYSNDIR, SYSDIR, and NDIR instead of BSD42 and USG. Rename DP_NAMELEN to NLENGTH. Use `struct dirent' instead of `struct direct'. * create.c, gnu.c, tar.c: Remove dir header decls. Wed Nov 18 15:31:30 1992 David J. MacKenzie (djm@goldman.gnu.ai.mit.edu) * tar.c: Change FNM_TARPATH to FNM_LEADING_DIR to match change in fnmatch.[ch]. Fri Oct 2 00:28:01 1992 David J. MacKenzie (djm@goldman.gnu.ai.mit.edu) * tar.c (describe): Fix some tab alignments. * Makefile.in (SRC3): Add getdate.c, for systems without bison/yacc (like MS-DOS). * diffarch.c (diff_sparse_files): Add missing arg to fprintf calls. * extract.c (extract_archive, restore_saved_dir_info), buffer.c (child_open), list.c (decode_header, print_header): Delete unused vars. * port.c [__MSDOS__]: Have strstr, rename, and mkdir. Don't define ck_pipe. * buffer.c, tar.c (init_volume_number, closeout_volume_number), create.c (write_long): Declare as void, not int, since they don't return a value. Tue Sep 22 14:15:48 1992 Michael I Bushnell (mib@wookumz.gnu.ai.mit.edu) * buffer.c (close_archive): Removed leftover `break' from when this was a switch. Tue Sep 22 08:33:16 1992 Noah Friedman (friedman@nutrimat.gnu.ai.mit.edu) * create.c, port.h: indented #pragma directives with 1 space. Fri Sep 18 14:15:17 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * All source files: re indented using GNU indent. * rtapelib.c (__rmt_read): Only read the amount left in the buffer; otherwise a broken rmt server (which puts too much data out) could overwrite past our buffer. Thu Sep 17 14:08:58 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * create.c: Throughout, use struct utimbuf rather than array of longs. Reported by J.T. Conklin. * configure.in: Check for getpwuid and getgrgid. Reported by J.T. Conklin. * Makefile.in (SRC3, AUX): Move alloca.c to SRC3. (OBJ3): Add @ALLOCA@. * Makefile.in (getdate.c): Look in srcdir for getdate.y. * buffer.c (close_archive): We can't check WTERMSIG meaningfully unless we already know tha WIFSIGNALED is true. (There is no guarantee it WTERMSIG will return zero when WIFSIGNALED is false.) * port.c (rmdir, mkdir): Check WIFSIGNALED rather than WTERMSIG. * Makefile.in (getdate.c): Use $(YACC) instead of `yacc'. Tue Sep 15 14:49:48 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * version.c: Released version 1.11.1. * Makefile (AUX): Added NEWS. * Makefile.in (rmt): Added $(LIBS). * configure.in: Added tests for libraries needed on Solaris. * mangle.c (extract_mangle): Null terminate link name for losing archives missing it. * Makefile.in: added target and rule for getdate.c: getdate.y; some makes don't have one built in. Mon Sep 14 16:23:15 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * tar.c (options, main): Advise use of --help rather than +help. Reported by J.T. Conklin. * create.c (write_long): Using hstat here is a Bad Idea, and totally unnecessary at that. * list.c (read_header): Compute both signed and normal checksums. Reported by Robert E. Brown. * configure.in: Define BSD in the presence of /sdmach or /../../mach. Reported by Robert E. Brown. * diffarch.c, buffer.c: Declare valloc as void* rather than char*. Reported by Robert E. Brown. * Makefile.in: Don't install info files. * configure.in: Check for malloc was scrambled. * port.h: Undefine index and rindex if necessary; some string.h's define them for us. * tar.c (addname): Missing braces after if. * gnu.c (read_dir_file): Missing braces after if. * names.c: Add include of , * create.c (start_header): Set current_file_name so that print_header (used for verbose create) works properly. (dump_file): Set current_link_name when setting up symlink and hardlink records. Reported by Robert Crowe. Fri Sep 11 01:05:52 1992 David J. MacKenzie (djm@nutrimat.gnu.ai.mit.edu) * fnmatch.[ch]: New files. * wildmat.c: File removed. * tar.c: Include fnmatch.h and use fnmatch instead of wildmat. * Makefile.in, makefile.pc: Replace wildmat.o(bj) with fnmatch. Thu Sep 10 23:19:30 1992 David J. MacKenzie (djm@nutrimat.gnu.ai.mit.edu) * buffer.c, tar.c: Remove redundant decls of getenv, rindex. * Makefile.in: Add uninstall target. Define libdir instead of hardcoding /etc for installing rmt. Thu Sep 10 13:06:03 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * list.c (read_header): On second thought, that doesn't work either, so just store the names in malloced areas. Sigh. * NEWS: New file. * README: Removed things that belong in NEWS; point to it. * list.c (read_header): current_file_name and current_link_name need to be set to the arrays in head rather than header; header is the actual read buffer and will change. * extract.c (extract_archive): * buffer.c (new_volume): `#' directives need to start in column 1. Reported by J.T. Conklin. Wed Sep 9 13:34:26 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * version.c: Release of version 1.11. * Makefile.in (AUX): Add getpagesize.h. (AUX): Comment out manuals. (all): Comment out dependency on tar.info. * Makefile, configure.in: Arrange to use local malloc on HP-UX. * port.h Use the canonical Autoconf chunk for alloca instead of just looking for gcc. Wed Sep 9 03:16:58 1992 Noah Friedman (friedman@nutrimat.gnu.ai.mit.edu) * port.h: If compiling with gcc, use __builtin_alloca. Tue Sep 8 16:13:41 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * extract.c: Removed long name support from here. * list.c (read_header): Understand and skip longname/longlink headers here. Names for current file are stored in new global variables. All source files except create.c changed to refer to current_file_name and current_link_name instead of fields directly from the current header. Thu Sep 3 12:41:08 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * create.c (write_long): New function. (dump_file): When writing link records or symlink records, use new write_long function instead of mangling when the link target is too long. (start_header): Use write_long instead of mangling for long names. * extract.c (saverec): Recognize LF_LONGNAME and LF_LONGLINK. (saverec): Throughout, use longname and longlink if they are set. Wed Sep 2 14:41:13 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * mangle.c: This is now deprecated; retain extract_mangle for backward compatability. * list.c (print_header): Prevent printing 0 when the gid or uid is null. Reported by Chris Arthur. * list.c (decode_header): Use the gid field when the gid is empty, and similarly for uid. Reported by Chris Arthur. * extract.c: saved_dir_info, saved_dir_info_head: new type and var. (extract_archive): When extracting directories, now save info in saved_dir_info_head. (restore_saved_dir_info): New function. * list.c (read_and): Call restore_saved_dir_info at the end of the run. Reported by Chris Arthur. Mon Aug 31 15:39:55 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * create.c (create_archive): If there are no names specified, write nothing on the archive instead of dumping ".". * buffer.c (open_archive): Useful error message. * tar.c, tar.h: Recognize f_atime_preserve. * create.c (dump_file): Implement f_atime_preserve. * rmt.h (_remdev): Don't require /dev/ to be in remote archive names; obey new force-local flag. * tar.c, tar.h: Implement new force-local flag. Reported by Roland Schemers III. * tar.c (describe): same-owner and same-order were confused. * create.c (dump_file): Check for toplevel had sense reversed. * buffer.c (new_archive): Don't free old_name...when these come from the command line, they aren't malloced, and it isn't important to save this trivial amount of memory. * tar.h: replace ar_file with ar_files, n_ar_files, cur_ar_files. * buffer.c (open_archive): multi-volume compressed archives never worked; give an appropriate error. Change open of ar_file to open of ar_files[0]. (writeerror, readerror, flush_archive): use ar_files[cur_ar_file] instead of ar_file. (new_archive): Necessary changes to support ar_files. * tar.c (options): handle multiple tape drive arguments. Fri Aug 28 17:42:13 1992 Michael I Bushnell (mib@wookumz.gnu.ai.mit.edu) * list.c (decode_header), create.c (start_header), tar.h (TMAGIC): Undo djm's changes below; tar does not support the final Posix.1 format; it's bad to make it look like it does. Sun Jul 19 02:13:46 1992 David J. MacKenzie (djm@nutrimat.gnu.ai.mit.edu) * port.h: Try to prevent redefining major. * port.c: HAVE_BZERO -> minix. Fix a typo. * list.c (decode_header): Recognize the final POSIX.1 magic as well as the early draft magic for ustar. * create.c (start_header): Create a final POSIX.1 magic string instead of an early draft string for ustar. * tar.h (TMAGIC): Remove the trailing blanks. * rmt.c, rtapelib.c: Use POSIX and STDC headers if available. * rmt.h: Declare the external functions defined in rtapelib.c. Tue Jul 14 00:44:37 1992 David J. MacKenzie (djm@apple-gunkies.gnu.ai.mit.edu) * pathmax.h: New file. * port.h: Include it. * create.c (create_archive): Allocate PATH_MAX instead of NAME_MAX for temporary buffer so we don't have to figure out what NAME_MAX is (portably). Fri Jul 10 08:30:42 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * gnu.c (collect_and_sort_names): write_dir_file has no argument. Mon Jul 6 20:11:32 1992 David J. MacKenzie (djm@nutrimat.gnu.ai.mit.edu) * port.c (rename): If unlinking the source at the end fails, unlink the destination instead to avoid leaving a mess. Fri Jul 3 15:16:42 1992 David J. MacKenzie (djm@nutrimat.gnu.ai.mit.edu) * buffer.c, diffarch.c, update.c, rtapelib.c: Change NO_MTIO to HAVE_SYS_MTIO_H. * port.c, tar.h: Change FOO_MISSING to HAVE_FOO. Tue Jun 23 23:39:02 1992 David J. MacKenzie (djm@goldman.gnu.ai.mit.edu) * rmt.c: Add #ifdefs to work on ISC. Wed May 20 00:12:27 1992 David J. MacKenzie (djm@churchy.gnu.ai.mit.edu) * port.h: Define major, minor, makedev if the system doesn't. Wed May 13 21:16:38 1992 Michael I Bushnell (mib@apple-gunkies.gnu.ai.mit.edu) * gnu.c (add_dir_name): Store legitimate value into dir_contents when get_dir_contents returns NULL. Thu May 7 23:44:35 1992 Michael I Bushnell (mib@apple-gunkies.gnu.ai.mit.edu) * gnu.c (add_dir_name): Check for return of NULL from get_dir_contents; see djm's change of Fri Jul 26 01:12:58 1991. Mon May 4 22:50:57 1992 David J. MacKenzie (djm@churchy.gnu.ai.mit.edu) * tar.h: Make comments for option names say -- instead of +. Wed Apr 29 14:23:10 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * tar.c, tar.t: Added +volno-file option. buffer.c: New functions init_volume_number, closeout_volume_number. tar.c (main): Call new functions in the right place. * buffer.c (fl_write, fl_read): Mod to allow losing tape drives which use short counts to indicate end of tape correctly handle the multi-tape stuff. The read half won't co-exist with f_reblock; there's no way to fix that, of course. * tar.c, tar.h: Added new option +show-omitted-dirs. list.c (read_and): Implemented show-omitted-dirs. Reported by Karl Berry. * tar.c, tar.h: Added new option +checkpoint. buffer.c (fl_read, fl_write): Implemented +checkpoint lazily. * create.c (dump_file): Added toplevel argument; some devices can be negative, so the old method was bogus. All callers changed. * tar.c, tar.h: Added new option +ignore-failed-read. create.c (dump_file): Implemented +ignore-failed-read. Reported by Bob Mende Pie. * create.c (finish_sparse_file): Commented out debugging printf. * tar.c, tar.h: Added new option +remove-files to delete files after they are added to the archive. create.c (dump_file): Implemented +remove-files for everything but directories. I don't think they need it. Tue Apr 28 13:21:42 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * create.c: (dump_file): save_name needs to be set equal to p, not something inside the header, because the header changes at the first buffer flush. Fri Apr 24 10:41:13 1992 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * create.c: Djm incorrectly moved the include of port.h to precede the include of sys/file.h; restored. * tar.c (main): Cases CMD_EXTRACT and CMD_LIST: declare error string with const. * gnu.c (collect_and_sort_names): Leave if around write_dir_file in place. Wed Apr 22 02:16:14 1992 David J. MacKenzie (djm@churchy.gnu.ai.mit.edu) * rtapelib.c: SIGTYPE -> RETSIGTYPE. Mon Mar 9 22:42:05 1992 David J. MacKenzie (djm@nutrimat.gnu.ai.mit.edu) * rtapelib.c: Reformat and make comments more complete. Rename a few variables for clarity. Thu Mar 5 14:07:34 1992 David J. MacKenzie (djm@nutrimat.gnu.ai.mit.edu) * tar.c (describe): Document long options as starting with --. Thu Jan 23 22:54:41 1992 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * tar.c (options): Check get_date return value for error indication. Tue Dec 24 00:03:03 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * tar.c, gnu.c, extract.c, create.c, port.h, rmt.h: Change POSIX ifdefs to HAVE_UNISTD_H and _POSIX_VERSION. Fri Dec 20 13:50:38 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * testpad.c (main): flush stderr so perror and fprintf cooperate right. Wed Dec 18 16:52:42 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * port.h: Check MAJOR_IN_MKDEV and MAJOR_IN_SYSMACROS to find where to get major, minor and makedev. * create.c, list.c, update.c: Don't check USG to include sys/sysmacros.h. Thu Dec 12 21:57:10 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * mangle.c (extract_mangle): Correctly null terminate name of link target. Thu Nov 21 07:44:18 1991 Michael I Bushnell (mib at nutrimat) * create.c (dump_file, at start of ISREG output loop): use filename from header instead of real name to make sure that we get the mangled version and not one that is too long and overflows buffers. Sat Nov 16 01:37:45 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * tar.h: Use new criteria for STDC version of msg. Sat Nov 2 21:31:57 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * create.c, gnu.c, tar.c: Use DIRENT instead of NDIR to select between dirent.h and ndir.h for USG. * port.c: Rename WANT_FOO to FOO_MISSING to make sharing code and configure script with other utilities easier. Use VPRINTF_MISSING and DOPRNT_MISSING instead of FOO_MSG to select error reporting routines. Thu Aug 29 00:54:01 1991 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * tar.c (long_options). Fixed info-script long option. Reported by Eric Norum. Mon Aug 26 16:53:50 1991 David J. MacKenzie (djm at pogo.gnu.ai.mit.edu) * configure, Makefile.in: Only put $< in Makefiles if VPATH is being used, because older makes don't understand it. Mon Aug 19 01:47:57 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * create.c: Indent '#pragma alloca' so non-ANSI compilers don't choke on it. Wed Aug 14 14:10:43 1991 David J. MacKenzie (djm at geech.gnu.ai.mit.edu) * list.c (UGSWIDTH): Increase from 11 (sort of like Unix tar) to 18, so that with normal user and group names of <= 8 chars, the columns never shift in a tar -t listing. Fri Aug 2 00:41:08 1991 David J. MacKenzie (djm at apple-gunkies) * Makefile.in (dist): Include texinfo.tex and tar.info*. (install): Install tar.info*. * configure: Set INSTALLDATA. * configure: Create config.status. Remove it and Makefile if interrupted while creating them. * configure: Check for +srcdir etc. arg and look for Makefile.in in that directory. Set VPATH if srcdir is not `.'. * Makefile.in: Add `prefix'. (tar.info): New target. Tue Jul 30 17:08:04 1991 David J. MacKenzie (djm at apple-gunkies) * configure: NEED_TZSET has become FTIME_MISSING. Mon Jul 29 19:23:10 1991 David J. MacKenzie (djm at wombat.gnu.ai.mit.edu) * port.c [F_CHSIZE]: Additional version. Sat Jul 27 22:27:47 1991 David J. MacKenzie (djm at wombat.gnu.ai.mit.edu) * rmt.h: Clean up ifdefs. * makefile.pc: Fix typo. port.h: Change MSDOS to __MSDOS__. [__MSDOS__]: Define off_t. Include io.h and not sys/param.h. [__TURBOC__]: Use void * and don't define const. Fri Jul 26 01:12:58 1991 David J. MacKenzie (djm at bleen) * buffer.c: Rename `eof' to `hit_eof' to avoid conflict with an MSDOS function. * gnu.c (get_dir_contents): Return NULL, not "\0\0\0\0", on error. * diffarch.c (diff_archive): Open files in binary mode. Don't use or free a non-malloc'd return value from get_dir_contents. * msd_dir.c [__TURBOC__]: Include stdlib.h. * rmt.h: lseek returns off_t, not long. * tar.c (describe): -X is +exclude-from, not +exclude. (names_notfound): Free memory only if amiga, not !unix. * tar.h, tar.c: Add +null option to make -T read null-terminated filenames (such as those produced by GNU find -print0), and disable -C option. This guarantees that odd filenames will get archived. * tar.c (read_name_from_file): New function. (name_next): Call it instead of fgets. From David J. MacKenzie. Wed Jul 24 11:17:48 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * create.c [_AIX]: Declare alloca. * buffer.c (open_archive): Check for successful open before, not after, fstatting the fd. Tue Jul 23 20:51:31 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * configure: Only define BSD42 if sys/file.h exists. If alloca is missing and /usr/ucblib exists (SVR4), use it instead of -lPW. * port.h [!__STDC__]: #define const. * gnu.c (dirent_cmp): Fix args to agree with ANSI C prototype. * create.c: Declare ck_realloc. * gnu.c, diffarch.c: Move check for symlinks to after port.h include. Sat Jul 20 00:03:54 1991 David J. MacKenzie (djm at apple-gunkies) * msd_dir.[ch]: Use POSIX-style `struct dirent' instead of `struct direct'. * create.c, gnu.c, tar.c: Adjust callers. Thu Jul 18 00:05:01 1991 David J. MacKenzie (djm at bleen) * port.c (ck_malloc, ck_realloc): Return PTR, not char *. * gnu.c, create.c, tar.c: Fix decls. * port.c: Don't use the preprocessor to guess missing functions on Unix; let configure do it. [WANT_GETWD] (getwd): Function removed; not needed because getcwd is used if needed. * gnu.c, tar.c: Use getcwd if POSIX. * rtapelib.c: Use SIGTYPE instead of testing SIGNAL_VOID. Default to void (more common these days) instead of int. * tar.c, gnu.c, mangle.c: Remove VOIDSTAR defn. Use PTR instead. * port.h: Define PTR. * gnu.c, tar.c [__MSDOS__ || USG]: Remove incorrect getcwd decl; put correct one in port.h [!POSIX]. * tar.c (describe): Print on stdout instead of stderr; it's not so much a usage message (since you have to ask for it explicitly) as on-line help, and you really need to be able to page it because it's more than a screen long. * Make #ifdefs for sys/file.h or fcntl.h, directory header, sys/mtio.h consistent between files. Use NO_MTIO instead of tricks with USG and HAVE_MTIO and NO_RMTIOCTL. * Move decls of ANSI C and POSIX functions to port.h and use standard headers to declare them if available [STDC_HEADERS or POSIX]. * Add many missing function declarations and return types. * Some places used __MSDOS__, some MSDOS; standardize on __MSDOS__. * Change S_IF macros to S_IS for POSIX. * port.h: Define appropriate S_IS macros if missing. * port.h: Rename macros for testing exit status to conform to POSIX; use the system's versions if available [POSIX]. * Use POSIX PATH_MAX and NAME_MAX instead of MAXPATHLEN and MAXNAMLEN. * port.h: Define PATH_MAX and NAME_MAX. * create.c, gnu.c, tar.c: Use ck_malloc and free instead of auto arrays of size PATH_MAX or NAME_MAX, since with pathconf they might not be constants. * Move all definitions of O_* to port.h to reduce redundancy. * Make all source files that now need to include port.h do so. * port.c: Remove #undefs of WANT_* so you can use -DWANT_* when compiling, instead of having to edit port.c. [WANT_DUMB_GET_DATE] (get_date): Function removed. Even systems without bison can get bison output and compile it. [WANT_STRING] (index, rindex, bcopy, bzero, bcmp): Functions removed; the translation is now done by macros in port.h. * wildmat.c (wildmat): Use POSIX.2 '!' instead of '^' to negate character classes. Mon Jul 15 13:47:45 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * testpad.c (main): Return type void. * port.c [WANT_STRING]: Don't include memory.h if NO_MEMORY_H. * create.c (dump_file) [AIX]: Fix typo, `allocate' for `alloca'. * gnu.c (collect_and_sort_names): Move misplaced brace out of #ifdef. Reported by Minh Tran-Le. * configure: Also look in sys/signal.h for signal decl. Wed Jul 10 01:42:55 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * Rename rtape_server.c to rmt.c and rtape_lib.c to rtapelib.c. * configure, Makefile.in: $(INSTALLPROG) -> $(INSTALL). Tue Jul 9 01:38:37 1991 David J. MacKenzie (djm at wookumz.gnu.ai.mit.edu) * Most files: Refer to GPL version 2. * COPYING: Use version 2. * port.c [__TURBOC__] (utime): New function. * xmalloc: New function (just calls ck_malloc), for alloca.c and bison.simple (in getdate.y output). * Makefile.in (AUX): Include alloca.c and tcexparg.c, a command line globber for Turbo C. Mon Jul 8 14:30:52 1991 David J. MacKenzie (djm at geech.gnu.ai.mit.edu) * testpad.c: Open and write to testpad.h instead of stdout, because some MS-DOS makes (Borland's at least) can't do redirection in commands. * Makefile.in: Don't redirect testpad output. Mon Jul 8 12:56:35 1991 Michael I Bushnell (mib at churchy.gnu.ai.mit.edu) * buffer.c (fl_read): Missing \n in printf. Mon Jul 8 03:40:28 1991 David J. MacKenzie (djm at geech.gnu.ai.mit.edu) * create.c, extract.c, gnu.c, diffarch.c, tar.c: Comment out unused variables. * tar.c (options): Cast get_date arg to VOIDSTAR instead of `struct timeb *', since on some non-BSD systems the latter is undefined. Sat Jul 6 04:53:14 1991 David J. MacKenzie (djm at geech.gnu.ai.mit.edu) * Replace Makefile with configure, Makefile.in, and makefile.pc. Update README with current compilation instructions. * port.c [WANT_RENAME] (rename): New function. Wed Jul 3 18:10:52 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * testpad.c (main): Avoid warning from some compilers on array address. * rtape_server.c (sys_errlist): Should be declared extern. Mon Jul 1 14:14:06 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * Release of version 1.10; appropriate changes to README. * create.c: Removed printf's about sparse files. Fri Jun 21 23:04:31 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * list.c (skip_extended_headers): Userec was being called in the wrong place. Thu Jun 20 19:10:35 1991 David J. MacKenzie (djm at geech.gnu.ai.mit.edu) * tar.h: Use ANSI prototypes for msg and msg_perror if STDC_MSG is defined, even if BSD42 is also. * Makefile: Replace DESTDIR with bindir. (install): Don't install tar.texinfo. There's no standard place for texinfo files, and /usr/local/man is inappropriate. Add TAGS, distclean, and realclean targets and SHELL= line. * version.c: Move old change history to bottom of ChangeLog. Wed Jun 12 12:43:58 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * rtape_lib.c (__rmt_write): #ifdef should reference SIGNAL_VOID, not USG. Wed Jun 5 14:57:11 1991 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * tar.c (name_match, addname): Ugly hack to handle -C without any files specified. tar.h (struct name): New field for ugly hack. Mon Jun 3 14:46:46 1991 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * testpad.c: New file to determine if we need special padding in struct header in tar.h. * tar.h (struct header): include padding if necessary, include testpad.h. * Makefile: rules to create testpad.h, etc. Wed May 22 16:02:35 1991 Michael I Bushnell (mib@churchy.gnu.ai.mit.edu) * tar.c (options): -L takes an argument. * rtape_lib.c (__rmt_open): add /usr/bin/nsh to the list of remote shell programs. * create.c: define MAXPATHLEN if we don't get it from a system header file. * create.c (deal_with_sparse): return a real return value if we can't open the file. * tar.c (long_options): +newer takes an argument. (describe): fix printing in various trivial ways Tue May 21 17:15:19 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * tar.c (long_options): +get and +concatentate don't require arguments Mon May 20 15:55:30 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * create.c (write_eot): Don't try and write an EOF if we are already at one. * port.c (strstr): Looking for null string should return zero. Sun May 19 22:30:10 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * tar.c (options): -l doesn't take an argument * Makefile: Minor fix for SGI 4D defines. Reported by Andrew Torda. * rtape_server.c (main.c): For 386/AIX. I'm suspicious about this one. * create.c (dump_file): For hidden files on AIX. gnu.c (collect_and_sort_name, get_dir_contents): AIX hidden file mod. Reported by Minh Tran-Le. * tar.c: (name_next): Allow -C inside a file list given to -T. Reported by David Taylor. * Makefile: Comment describing presence of USE_REXEC. * extract.c (extract_archive, case LF_SPARSE): zero check for last element on numbytes needs to look at value after converted from octal. * port.c: Don't always demand strstr, check for HAVE_STRSTR instead. Makefile: Comment describing presence of HAVE_STRSTR option. Sun May 19 18:39:48 1991 David J. MacKenzie (djm at churchy.gnu.ai.mit.edu) * port.c (get_date): Renamed from getdate, to avoid SVR4 conflict. * tar.c: Call get_date instead of getdate. Fri May 10 02:58:17 1991 Noah Friedman (friedman at nutrimat) * tar.c: added "\n\" to the end of some documentation strings where they were left off. Thu May 9 17:28:54 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * Makefile: added level-0, level-1, and backup-specs to AUX. * version.c: changed to 1.10 beta. * README: updated for 1.10 beta release. Tue Apr 2 12:04:54 1991 Michael I Bushnell (mib at godwin) * create.c (dump_file): HPUX's st_blocks is in 1024 byte units instead of 512 like the rest of the world, so I special cased it. * tar.c: Undo Noah's changes. Mon Apr 1 17:49:28 1991 Noah Friedman (friedman at wookumz.gnu.ai.mit.edu) (This ought to be temporary until things are fixed properly. ) * tar.c: (struct option long_options): flag for "sparse" zero if compiling under hpux. tar.c: (functon options): case 'S' is a no-op if compiling under hpux. Sat Mar 30 12:20:41 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * tar.h: new variable tape_length. * tar.c (options): add new option +tape-length / -L. * buffer.c (fl_write): Turn #ifdef TEST code for limited tape length on always, for tape-length option. * create.c (dump_file): avoid apollo lossage where S_IFIFO == S_IFSOCK. * buffer.c: include regex.h * buffer.c (fl_read, open_archive): Use regex routines for volume header match. * xmalloc.c: removed file; wasn't necessary. * tar.c: (main) use ck_malloc instead of xmalloc. Thu Mar 28 04:05:05 1991 Noah Friedman (friedman at goldman) * regex.c, regex.o: New links. * tar.c: include regex.h. * Makefile (OBJ2): Add regex.o. (regex.o, tar.o): Depend on regex.h (SRC2, AUX): Add the new files. Sat Mar 23 15:39:42 1991 Noah Friedman (friedman at wookumz.gnu.ai.mit.edu) * Makefile: added default flags and options for compiling under hpux. * Added files alloca.c and xmalloc.c. Sat Mar 23 14:35:31 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu) * port.c: Define WANT_VALLOC in HPUX. Fri Mar 15 06:20:15 1991 David J. MacKenzie (djm at geech.ai.mit.edu) * rtape_lib.c: If USG and not HAVE_MTIO, define NO_RMTIOCTL automatically. (_rmt_rexec): Temporarily re-open stdin and stdout to /dev/tty, to guarantee that rexec() can prompt and read the login name and password from the user. * Makefile: Mention -DUSE_REXEC. Reported by Pascal Meheut. Fri Mar 8 20:15:11 1991 Michael I Bushnell (mib at wookumz.ai.mit.edu) * tar.h, Makefile: Makefile CPP macro HAVE_SIZE_T might be useful for some people. * gnu.c: lstat->stat define where appropriate * buffer.c (fl_write): keep track of amount written for +totals. * tar.c, tar.h: set flag f_totals from +totals option * tar.h (f_totals, tot_written): new variables * tar.c (main): print total written with CMD_CREATE * tar.c (main): return appropriate exit status Thu Jan 17 00:50:21 1991 David J. MacKenzie (djm at apple-gunkies) * port.c: Remove a spurious `+' between functions (a remnant of a context diff, apparently). Wed Jan 9 19:43:59 1991 Michael I Bushnell (mib at pogo.ai.mit.edu) * create.c (where_is_data): Rewritten to be better, and then #ifdef-ed out. (deal_with_sparse): Severly pruned. Now we write or don't write only complete blocks, not worrying about partial blocks. This simplifies calculations, removes bugs, and elides the second scan through the block. The first was zero_record, the second was where_is_data. Mon Jan 7 17:13:29 1991 Michael I Bushnell (mib at wookumz.ai.mit.edu) * create.c (deal_with_sparse): Second computation (for short reads) of numbytes increment had subtraction backwards. Need to handle calling where_is_data better when we did a short read (it might go past the end of the read), also, set sparsearray[...].offset in this case too. Fri Jan 4 12:24:38 EST 1991 Jay Fenlason (hack@ai.mit.edu) * buffer.c: Return a special error code if the archive you're trying to read starts with a different label than the one specified on the command line. Wed Jan 2 12:05:21 EST 1991 Jay Fenlason (hack@ai.mit.edu) * gnu.c: Prepend the current directory to the gnu_dumpfile, so that -C's won't affect where the output goes. (sigh.) Tue Dec 18 18:05:59 EST 1990 Jay Fenlason (hack@ai.mit.edu) * gnu.c: Don't complain if the gnudumpfile we're reading info from doesn't exist. * create.c: Write out gnudumpfile after finishing writing the archive. * tar.c: Add +exclude FNAME, and make +exclude-from do what +exclude used to. * Make +version an operation, not an option. * Add +confirmation alias for +interactive. Tue Dec 4 13:28:08 EST 1990 Jay Fenlason (hack@ai.mit.edu) * tar.c (check_exclude): Don't let MUMBLE match MUMBLE.c or fooMUMBLE but only foo/MUMBLE. * mangle.c: New file. * create.c, extract.c: According changes. * extract.c: Don't complain when extracting an already existing link. Don't complain when extracting a directory iff it already exists. Don't ad u+wx to directories when running as root. Reported by Chip Salzenberg. * gnu.c: Make +listed-incremental work. Reported by Chip Salzenberg. * port.c: Add the F_FREESP emulation of the ftruncate syscall. Wed Nov 21 15:57:07 EST 1990 Jay Fenlason (hack@ai.mit.edu) Remove excess \n from lots of msg() calls. Mon Nov 19 14:09:43 EST 1990 Jay Fenlason (hack@ai.mit.edu) * tar.c: Rename +volume to +label. Fri Nov 16 15:43:44 1990 David J. MacKenzie (djm at apple-gunkies) * tar.c (describe): Include the default values for -b and -f (as set in the Makefile) in the message. Thu Nov 15 13:36:45 EST 1990 Jay Fenlason (hack@ai.mit.edu) * extract.c (extract_archive): Do the utime() call before the chmod() call, 'cuz some versons of utime() trash the file's mode bits. * list.c (read_and): Call do_something on volume headers and multivol files even if they don't match the names we're looking for, etc. Tue Nov 6 13:51:46 EST 1990 Jay Fenlason (hack@ai.mit.edu) * port.c (un-quote-string): Don't try to write a null if there's already one there. Thu Nov 1 14:58:57 EST 1990 Jay Fenlason (hack@ai.mit.edu) * buffer.c (new_volume): fflush(msg_file) before reading for confirmation on new volume. On EOF or error, print error msg and abort. Mon Oct 29 12:06:35 EST 1990 Jay Fenlason (hack@ai.mit.edu) * getdate.y: Use new version of getdate(). * tar.c (name_add): Use sizeof(char *) instead of sizeof(int) * README: Give the correct return address. Thu Oct 25 16:03:58 EDT 1990 Jay Fenlason (hack@ai.mit.edu) rtape_lib.c: Change RMTIOCTL to NO_RMTIOCTL, so it is on by default. rmt.h: Add _isrmt() #define for NO_REMOTE case. gnu.c: Add forward reference for add_dir_name(). Tue Oct 16 11:04:52 EDT 1990 Jay Fenlason (hack@ai.mit.edu) Version 1.09 --- New -G file implementation of gnu-dump stuff. * tar.c (name_add): Get the calls to ck_realloc and ck_malloc right. Thu Oct 11 11:23:38 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * gnu.c: Fix A couple of typos. Wed Sep 19 13:35:03 1990 David J. MacKenzie (djm at apple-gunkies) * getdate.y [USG] (ftime): Use `daylight' unless DAYLIGHT_MISSING is defined. Mon Sep 17 18:04:21 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * gnu.c (gnu_restore): Don't use a passed char* for the file name, use skipcrud+head->header.name, just like everything else does. This means that gnu_restore will still work with small buffers, etc. Thu Sep 13 15:01:17 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * tar.c (add_exclude): Don't bus-error if the exclude file doesn't end with a newline. Sun Sep 9 22:35:27 1990 David J. MacKenzie (djm at albert.ai.mit.edu) * Makefile (dist): Remove .fname when done. Thu Sep 6 12:48:58 EDT 1990 Jay Fenlason (hack@ai.mti.edu) * gnu.c (gnu_restore): Rember to skip_file() over the directory contents, even if we don't have to do anything with them. * create.c, extract.c, diffarch.c: Free sparsearray after we're done with it. Tue Sep 4 10:18:50 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * Makefile: Include gnu.c in dist * gnu.c: Move add_dir above read_dir_file so that cc doesn't complain about add_dir returning void. Sun Sep 2 20:46:34 1990 David J. MacKenzie (djm at apple-gunkies) * getdate.y: Declare some more functions and add storage classes where omitted to shut compiler up. [USG] (ftime): Don't use extern var `daylight'; appears that some systems don't have it. Wed Aug 29 00:05:06 1990 David J. MacKenzie (djm at apple-gunkies) * getdate.y (lookup): In the code that allows `Aug.' to be recognized as `Aug', don't chop off the final `.' from words like `a.m.', so they can be recognized. Thu Aug 16 11:34:07 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * buffer.c (open_archive): If -O, write verbosity to stderr instead of stdout. Fri Aug 10 12:29:28 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * getdate.y: Handle an explicit DST in the input string. Reported by Per Foreby. Mon Jul 16 13:05:11 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * tar.c: rename -g -G +incremental, +listed-imcremental, etc. Fri Jul 13 14:10:33 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * tar.c: Make +newer and +newer-mtime work according to their names. * gnu.c: If +newer or +newer-mtime, use the time specified on the command line. * buffer.c, create.c: Add test to see if dimwit is trying to archive the archive. * tar.c (long_options[]): Re-ordered, so that groups of similar options are next to each other... I think. (describe): Modified to more closely reflect reality. Fri Jul 6 13:13:59 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * tar.c: Add compile-time option for SYS V (?) style tape-drive names /dev/rmt/{n}[lmh] * tar.c: Fix getopt-style stuff so that -C always works correctly. * gnu.c, tar.c: Make filename to -G optional. * {all over}: Replace some fprintf(stderr...) calls with calls to msg(). * port.c: Make -Dmumble_MSG option on command line override internal assumptions. * Makefile: Mention -Dmumble_MSG options Fri Jul 6 02:35:31 1990 David J. MacKenzie (djm at apple-gunkies) * tar.c (options): Don't change `c' if it is 0, as getopt now handles that internally. Mon Jul 2 15:21:13 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * gnu.c (new file): Moved all the f_gnudump stuff here where we can keep track of it easier. Also made -G take a file name where it stores the inode information about directories so that we can detect moved directores. * create.c (dump_file): Changed slightly to work with the new f_gnudump. * tar.c: Moved the f_gnudump stuff to gnu.c * tar.c, extract.c: Added the +do-chown option, which forces tar to always try to chown the created files to their original owners. * version.c: New version 1.09 Sun Jun 24 14:26:28 1990 David J. MacKenzie (djm at albert.ai.mit.edu) * create.c: Change ifdefs for directory library header selection to be like the ones in tar.c. * Makefile [Xenix]: Link with -ldir to get the dirent.h directory library. Thu Jun 7 03:31:51 1990 David J. MacKenzie (djm at albert.ai.mit.edu) * Makefile, buffer.c, diffarch.c: Change MTIO symbol to HAVE_MTIO because SCO Xenix defines 'MTIO' for an incompatible tape driver system in a file included by termio.h. * tar.h: Don't define size_t for Xenix. Tue Jun 5 11:38:00 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * create.c (dump_file): Only print the "... is on a different filesystem..." if f_verbose is on. also add a case for S_IFSOCK and treat it like a FIFO. (Not sure if that's the right thing to do or not, but it's better than all those Unknown File Type msgs.) Thu May 31 19:25:36 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * port.c: Use #ifdef sparc instead of #ifdef SPARC since the lowercase version is defined, and the uppercase one isn't. Tue May 22 11:49:18 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * port.c (ck_malloc): if size==0 pretend size=1 (ck_realloc): if(!ptr) call ck_malloc instead. Tue May 15 12:05:45 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * diffarch.c (diff_archive): If not f_absolute_paths, and attempt to open a file listed in the archive fails, try /filename also. This will allow diff to open the wrong file if both /filename and filename exist, but there's nothing we can do about that. Fri May 11 16:17:43 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * Makefile: Describe new -DMTIO option. * buffer.c, diffarch.c: Change ifdefs slightly, so that -DMTIO will include sys/mtio.h even if USG is defined. This is for HUPX and similar BSD/USG crossovers. Tue May 8 13:14:54 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * update.c (update_archive): Call reset_eof() when appropriate. * buffer.c (reset_eof): New function, that turns of EOF flag, and re-sets the ar_record and ar_last pointers. This will allow 'tar rf non-existant-file' to not core-dump. Fri May 4 14:05:31 1990 David J. MacKenzie (djm at albert.ai.mit.edu) * tar.c: Recognize the +sparse option. It was documented, but only the short form (-S) was actually recognized. Tue Apr 17 21:34:14 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * create.c: Don't access location 0 if ->dir_contents is null. Wed Apr 11 17:30:03 EDT 1990 Jay Fenlason (hack@ai.mit.edu) * buffer.c (flush_archive, close_archive, new_volume): Always check the return value of rmtclose(), and only give a warning msg if it is <0. Some device drivers (including Sun floppy disk, and HP streaming tape) return -1 after an IO error (or something like that.) Fri Mar 23 00:06:30 1990 Jim Kingdon (kingdon at mole.ai.mit.edu) * tar.c (long_options): Make it so +append +extract +list +update +catenate and +delete don't take arguments. Mon Mar 12 13:33:53 EST 1990 * buffer.c (open_archive, fl_write): Set the mtime of the volume header to the current time. Wed Mar 7 14:10:10 EST 1990 Jay Fenlason (hack@ai.mit.edu) * buffer.c Fix +compress-block A two character patch from Juha Sarlin. Replace #ifdef __GNU__ with #ifdef __STDC__. (new_volume): If open of new archive fails, ask again (Is probably user error.) * tar.c: Replace #ifdef __GNU__ with #ifdef __STDC__ * port.c: Clean up #ifdef and #defines a bit. (quote_copy_string): Sometimes the malloc'd buffer would be up to two characters too short. * extract.c (extract_archive): Don't declare ind static. * create.c (dump_file): Don't declare index_offset static. * diffarch.c: Remove diff_name variable, and always use head->header.name, which will always work, unlike diff_name, which becomes trash when the next block is read in. Thu Mar 1 13:43:30 EST 1990 Jay Fenlason (hack@wookumz.ai.mit.edu) * Makefile: Mention the -NO_REMOTE option. * port.c: Fix typo, and define WANT_FTRUNCATE on i386 machines. Mon Feb 26 17:44:53 1990 Jim Kingdon (kingdon at pogo.ai.mit.edu) * getdate.y: Declare yylex and yyerror as static. #define yyparse to getdate_yyparse. Sun Feb 25 20:47:23 1990 David J. MacKenzie (djm at albert.ai.mit.edu) * tar.c: Remove +old option, since it is a valid abbreviation of +old-archive, which does the same thing. (describe): A few small cleanups in message. Mon Feb 5 14:29:21 EST 1990 Jay Fenlason (hack@wookumz) * port.c: Define LOSING_MSG on sparc, since doprnt_msg doesn't work. Fix typo in #ifdef WANT_GETWD Fri Jan 26 16:11:20 EST 1990 Jay Fenlason (hack@wookumz) Version 1.08 --- Sparse file support added. Also various other features. * diffarch.c (compare_chunk): Include correct arguments in a call to fprintf() for an error msg. (compare_chunks, compare_dir): First argument is a long, not an int. * tar.c (options): Use tar variable (argv[0]) as the name to print in an error msg, instead of a constant "tar". (confirm): Use external variable char TTY_NAME[] for name of file to open for confirmation input. * buffer.c (new_volume): Ditto. * port.c: Add declaration for TTY_NAME[]. * rmt.h: Add long declarations for lseek() and __rmt_lseek(); Tue Jan 23 14:06:21 EST 1990 Jay Fenlason (hack@wookumz) * tar.c, create.c: Create the +newer-mtime option, which is like +newer, but only looks for files whose mtime is newer than the given date. * rtape_lib.c: Make *both* instances of signal-handler stuff use void (*foo)() on USG systems. Thu Jan 11 14:03:45 EST 1990 Jay Fenlason (hack@wookumz) * getdate.y : Parse European dates of the form YYMMDD. In ftime(): Init timezone by calling localtime(), and remember that timezone is in seconds, but we want timeb->timezone to be in minutes. Reported by Joergen Haegg. * rtape_lib.c (__rmt_open): Also look for /usr/bsd/rsh. Declare signal handler as returning void instead of int if USG is defined. * port.c: Declare WANT_GETWD for SGI 4-D IRIS. * Makefile: Include defines for SGI 4D version. Reported by Mike Muuss. * buffer.c (fl_read): Work properly on broken Ultrix systems where read() returns -1 with errno==ENOSPC on end of tape. Correctly go on to the next volume if f_multivol. * list.c (list_archive, print_header): Flush msg_file after printing messages. * port.c: Delete unused references to alloca(). Don't crash if malloc() returns zero in quote_copy_string. Flush stderr in msg() and msg_perror(). * tar.c: Flush msg_file after printing confirmation msg. Wed Jan 10 01:58:46 1990 David J. MacKenzie (djm at hobbes.ai.mit.edu) * tar.c (main): Change -help option and references to it to +help, and remove suggestion to run info (which is unreleased, so not likely to be of any help). Tue Jan 9 16:16:00 EST 1990 Jay Fenlason (hack @wookumz) * create.c (dump_file): Close file descriptor if start_header() fails. (dump_file): Change test for `./'-ness to not think that `.' {any character} is a `./'. Reported by Piercarlo Grandi. * diffarch.c (diff_init): Print correct number of bytes in error message. Tue Jan 9 03:19:49 1990 David J. MacKenzie (djm at hobbes.ai.mit.edu) * Makefile: Add comment at top noting that two source files also contain #defines that might need to be changed by hand. * create.c, diffarch.c, extract.c: Change L_SET to 0 in lseek calls, because only BSD defines it. * create.c (dump_file): Make sparse file checking code conditional on BSD42 because it uses st_blocks, which the other systems lack. Tue Jan 2 13:35:56 EST 1990 Jay Fenlason (hack@gnu) * port.c (quote_copy_string): Fix so it doesn't scramble memory if the last character is non-printable. Reported by Kian-Tat Lim. Tue Dec 19 11:19:37 1989 Jim Kingdon (kingdon at pogo) * port.c [BSD42]: Define DOPRNT_MSG. tar.h [BSD42]: Do not prototype msg{,_perror}. Fri Dec 8 11:02:47 EST 1989 Jay Fenlason (hack@gnu) * create.c (dump_file): Remove typo in msg. Fri Dec 1 19:26:47 1989 David J. MacKenzie (djm at trix) * Makefile: Remove comments referring to certain systems lacking getopt, since it is now provided always and needed by all systems. * port.c: Remove copy of getopt.c, as it is now linked in separately to always get the current version. * tar.c: Rename +cat-tars option to +catenate or +concatenate, and +local-filesystem to +one-file-system (preferred by rms and used in GNU cp for the same purpose). (describe): Reflect changes. Tue Nov 28 04:28:26 1989 David J. MacKenzie (djm at hobbes.ai.mit.edu) * port.c: Move declaration of alloca into #else /* sparc */ so it will compile on sparcs. Mon Nov 27 15:17:08 1989 David J. MacKenzie (djm at hobbes.ai.mit.edu) * tar.c (options): Remove -version option (replaced by +version). (describe): Mention long options. Sat Nov 25 04:25:23 1989 David J. MacKenzie (djm at hobbes.ai.mit.edu) * getoldopt.c (getoldopt): Make `opt_index' argument a pointer to an int, not char. * tar.c: Modify long options per rms's suggestions: Make preserve-permissions an alias for same-permissions. Make preserve-order an alias for same-order. Define preserve to mean both of those combined. Make old an alias for old-archive. Make portability an alias for old-archive, also. Rename sym-links to dereference. Rename gnudump to incremental. Rename filename to file. Make compare an alias for diff. Leave diff but prefer compare. Rename blocking-factor to block-size. Rename chdir to directory. Make uncompress an alias for compress. Rename confirm to interactive. Make get an alias for extract. Rename volume-header to volume. Also make +version an alias for -version. (options): Shorten code that interprets long options by using the equivalent short options' code. This also makes it tons easier to change the long options. (describe): Make usage message more internally consistent stylistically. Mon Nov 20 14:55:39 EST 1989 hack@ai.mit.edu * list.c (read_and): Call check_exclude() to see if the files should be skipped on extract or list. Thu Nov 9 18:59:32 1989 Jim Kingdon (kingdon at hobbes.ai.mit.edu) * buffer.c (fl_read): Fix typos in error message "tar EOF not on block boundary". Mon Oct 23 13:09:40 EDT 1989 (hack@ai.mit.edu) * tar.c (long_options[]): Add an option for blocked compression. Thu Oct 19 13:38:16 EDT 1989 (hack@ai.mit.edu) * buffer.c (writeerror): Print a more useful error msg. Wed Sep 27 18:33:41 EDT 1989 (hack@ai.mit.edu) * tar.c (main): Mention "tar -help" if the luser types a non-workable set of options. Mon Sep 11 15:03:29 EDT 1989 (hack@ai.mit.edu) * tar.c (options): Have -F correctly set info_script. Tue Aug 29 12:58:06 EDT 1989 (hack@ai.mit.edu) * Makefile Include ChangeLog in tar.tar and tar.tar.Z Mon Aug 28 17:42:24 EDT 1989 (hack@ai.mit.edu) * tar.c (options) Made -F imply -M. Also remind tar that the -f option takes an argument! * Modified -F option to make it do what (I think) it should. e.g, if you say -F, tar won't send a msg to msg_file and wait for a It'll just run the program it was given, and when the prog returns, the new tape had *better* be ready... * buffer.c (open_archive): Give error message and abort if the luser didn't give an archive name. Fri Aug 25 20:05:27 EDT 1989 Joy Kendall (jak at hobbes) * Added code to make a new option to run a specified script at the end of each tape in a multi-volume backup. Changed: tar.c: made new switch, -F, and new long-named option, "info-script". Code is where you would expect. tar.h: added flag f_run_script_at_end, and an extern char * called info_script, which optarg gets set to. buffer.c (new_volume): if f_run_script_at_end is set, we give info_script to system(), otherwise we do what we've always done. Thu Aug 24 10:09:38 EDT 1989 Joy Kendall (jak at spiff) (These changes made over the course of 6/89 - 8/89) * diffarch.c: diff_archive: Added switches for LF_SPARSE in the case statements that needed it. Also, skip any extended headers if we need to when we skip over a file. (need to change the bit about, if the size doesn't agree AND the file is NOT sparse, then there's a discrepancy, because I added another field to the header which should be able to deal with the sizes): If the file is sparse, call the added routine "diff_sparse_files" to compare. Also added routine "fill_in_sparse_array". * extract.c: extract_archive: added the switch LF_SPARSE to the case statement as needed, and code to treat the sparse file. At label "again_file", modified opening the file to see if we should have O_APPEND be one of the modes. Added code at label "extract_file" to call the new routine "extract_sparse_file" when we have an LF_SPARSE flag. Note: really should erase the commented-out code in there, because it's confusing. * update.c: made sure that if a file needed to be "skipped" over, it would check to see if the linkflag was sparse, and if so, would then make sure to skip over any "extended headers" that might come after the header itself. Do so by calling "skip_extended_headers". * create.c: create_archive: added code to detect a sparse file when in the long case statement. Added ways to detect extended headers, and label "extend" (ack! should get rid of that, is atrocious). Call the new routine "finish_sparse_file" if the linkflag is LF_SPARSE to write the info to the tape. Also added routines "init_sparsearray", "deal_with_sparse", "clear_buffer", "where_is_data", "zero_record", and "find_new_file_size". * tar.h: Added the #define's SPARSE_EXT_HDR and SPARSE_IN_HDR. Added the struct sparse and the struct sp_array. Added the linkflag LF_SPARSE. Changed the tar header in several ways: - added an array of struct sparse's SPARSE_IN_HDR long - added a char flag isextended - added a char string realsize to store the true size of a sparse file Added another choice to the union record called a struct extended_header, which is an array of 21 struct sparse's and a char isextended flag. Added flag f_sparse_file to list of flags. * tar.c: added long-named options to make tar compatible with getopt_long, changed Makefile. Fri Mar 3 1989 23:14:55 David MacKenzie (edf at rocky2.rockefeller.edu) (I'm not sure all these have been integrated, I guess yes -- FP.) * buffer.c: ifdef'd out #include if USG. (close_archive): SysV doesn't have ftruncate, so substituted fmtwrite (just copied the code for MS-DOS). * create.c: Unos lacks so provided a substitute. (start_header): Only strip leading paths if f_relative_paths is true. * extract.c: (extract_archive): Only strip leading paths if f_relative_paths is true. Because the Unos filesystem has only one timestamp, moved the utime call to after the chown and chmod calls. * getdate.y: Don't define ftime if Unos. * list.c: Defined size_t for Unos. Don't include if USG. Define stuff manually for Unos. (decode_header): Add braces around switch cases; some compilers require them. (print_header): Changed UGSWIDTH from 11 to 25 because the smaller value made tape listings of files owned by more than one user gradually get wider, making them hard to read. * port.c: Don't include if SysV. Define size_t for Unos. (mkdir): Add code to support Unos makedir sys call. (getopt): Use malloc instead of alloca, because tar doesn't use alloca anywhere else and many systems lack it. A few other changes from the current version of getopt.c incorporated. * rtape_lib.c: Undefine RMTIOCTL. Doesn't seem to be needed, and can't compile on Unos/SysV with it defined. Might need to be ifdef'd. * tar.c: Alias addname to add_name and rmdir to deldir on Unos due to C library weirdness. (options): Recognize new -P option to set f_relative paths. (describe): Clean up error message and add -P description. * tar.h: Add variable, f_relative_paths, to cause tar to strip leading `/' characters in pathnames during create and extract. * tar.texinfo: Fixed a couple of typos, detected by texi2roff. * update.c: Simulate for Unos. Previous releases by Jay Fenlason (hack@ai.mit.edu) * Version 1.07 --- New version to go on beta tape with GCC 1.35. Better USG support. Also support for __builtin_alloca if we're compiling with GCC. diffarch.c: Include the correct header files so MTIOCTOP is defined. tar.c: Don't print the verbose list of options unless given -help. The list of options is *way* too long. * Version 1.06 --- Use STDC_MSG if __STDC__ defined. ENXIO meand end-of-volume in archive (for the UNIX PC) Added break after volume-header case (line 440) extract.c Added patch to rtape_lib.c (reported by Arnold Robbins). Added f_absolute_paths option. Deleted refereces to UN*X manual sections (dump(8), etc) Fixed to not core-dump on illegal options Modified msg_perror to call perror("") instead of perror(0) patch so -X - works Fixed tar.c so 'tar cf - -C dir' doesn't core-dump tar.c (name_match): Fixed to chdir() to the appropriate directory if the matching name's change_dir is set. This makes tar xv -C foo {files} work. * Version 1.05 --- A fix to make confirm() work when the archive is on stdin; include 'extern FILE *msg_file;' in pr_mkdir(), and fix tar.h to work with __STDC__. Added to port.c: mkdir() ftruncate(): Removed: lstat() Fixed -G to work with -X Another fix to tar.texinfo Changed tar.c to say argv[0]":you must specify exactly ... buffer.c: modified child_open() to keep tar from hanging when it is done reading/writing a compressed archive added fflush(msg_file) before printing error messages create.c: fixed to make link_names non-absolute * Version 1.04 --- Added functions msg() and msg_perror(): Modified all the files to call them. Also checked that all (I hope) calls to msg_perror() have a valid errno value. (modified anno() to leave errno alone), etc. Re-fixed the -X option. This time for sure... re-modified the msg stuff. flushed anno() completely Modified the directory stuff so it should work on sysV boxes added ftime() to getdate.y Fixed un_quote_string() so it won't wedge on \" Also fixed \ddd (like \123, etc) More fixes to tar.texinfo * Version 1.03 --- Fixed buffer.c so 'tar tzf NON_EXISTENT_FILE' returns an error message instead of hanging forever. More fixes to tar.texinfo. * Version 1.02 --- Fixed tar.c so 'tar -h' and 'tar -v' don't cause core dump. Also fixed the 'usage' message to be more up-to-date. Fixed diffarch.c so verify should compile without MTIOCTOP defined. * Version 1.01 --- Fixed typoes in tar.texinfo. Fixed a bug in the #define for rmtcreat(). Fixed the -X option to not call realloc() of 0. * Version 1.00 --- version.c added. -version option added. Installed new version of the remote-tape library. Added -help option. Local Variables: mode: indented-text left-margin: 8 version-control: never End: tar-1.11.8/Makefile.in 644 625 1 12201 5770554315 7471 # Main Makefile for GNU tar. # Copyright (C) 1994, 1995 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. PACKAGE = @PACKAGE@ VERSION = @VERSION@ @SET_MAKE@ BABYL = rmail/[a-z]* rmail/*/* admin/*/RMAIL SHELL = /bin/sh VPATH = @srcdir@ exec_prefix = @exec_prefix@ prefix = @prefix@ srcdir = @srcdir@ # This directory's subdirectories are mostly independent; you can cd # into them and run `make' without going through this Makefile. # To change the values of `make' variables: instead of editing Makefiles, # (1) if the variable is set in `config.status', edit `config.status' # (which will cause the Makefiles to be regenerated when you run `make'); # (2) otherwise, pass the desired values on the `make' command line. CC = @CC@ CFLAGS = @CFLAGS@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ LDFLAGS = @LDFLAGS@ LIBS = @LIBS@ TOUCH = echo timestamp > bindir = $(exec_prefix)/bin infodir = $(prefix)/info libexecdir = $(exec_prefix)/libexec MDEFINES = CC='$(CC)' CFLAGS='$(CFLAGS)' LDFLAGS='$(LDFLAGS)' LIBS='$(LIBS)' \ prefix='$(prefix)' exec_prefix='$(exec_prefix)' \ bindir='$(bindir)' libexecdir='$(libexecdir)' \ infodir='$(infodir)' infodir='$(infodir)' libexecdir='$(libexecdir)' SUBDIRS = doc lib intl src scripts po DISTFILES = \ README AUTHORS BACKLOG COPYING INSTALL NEWS NLS THANKS TODO ChangeLog \ Makefile.in acconfig.h aclocal.m4 configure.in install-sh mkinstalldirs \ config.guess config.sub rebox.el \ config.h.in configure stamp-h.in .SUFFIXES: all install uninstall: config.h for subdir in $(SUBDIRS); do \ echo making $@ in $$subdir; \ (cd $$subdir && $(MAKE) $(MDEFINES) $@) || exit 1; \ done info dvi: cd doc && $(MAKE) $@ check: all cd src && $(MAKE) $@ id tags: cd lib && $(MAKE) $@ cd src && $(MAKE) $@ pot: cd po && $(MAKE) $(PACKAGE).pot mostlyclean: mostlyclean-recursive mostlyclean-local clean: clean-recursive clean-local distclean: distclean-recursive distclean-local rm config.status maintainer-clean: maintainer-clean-recursive maintainer-clean-local rm config.status mostlyclean-recursive clean-recursive distclean-recursive \ maintainer-clean-recursive: for subdir in $(SUBDIRS); do \ target=`echo $@ | sed 's/-recursive//'`; \ echo making $$target in $$subdir; \ (cd $$subdir && $(MAKE) $$target) || exit 1; \ done mostlyclean-local: clean-local: mostlyclean-local distclean-local: clean-local rm -f Makefile config.cache config.h config.log stamp-h maintainer-clean-local: distclean-local @echo "This command is intended only for maintainers to use;" @echo "rebuilding the deleted files may require special tools." dist: $(DISTFILES) rm -rf $(PACKAGE)-$(VERSION) mkdir $(PACKAGE)-$(VERSION) chmod 777 $(PACKAGE)-$(VERSION) for file in $(DISTFILES); do \ ln $(srcdir)/$$file $(PACKAGE)-$(VERSION) 2> /dev/null \ || cp -p $(srcdir)/$$file $(PACKAGE)-$(VERSION); \ done for subdir in $(SUBDIRS); do \ echo making $@ in $$subdir; \ mkdir $(PACKAGE)-$(VERSION)/$$subdir; \ chmod 777 $(PACKAGE)-$(VERSION)/$$subdir; \ (cd $$subdir && $(MAKE) $@) || exit 1; \ done chmod -R a+r $(PACKAGE)-$(VERSION) tar chozf $(PACKAGE)-$(VERSION).tar.gz $(PACKAGE)-$(VERSION) rm -rf $(PACKAGE)-$(VERSION) dist-shar: $(DISTFILES) rm -rf $(PACKAGE)-$(VERSION) mkdir $(PACKAGE)-$(VERSION) chmod 777 $(PACKAGE)-$(VERSION) @echo "Copying distribution files" @for file in $(DISTFILES); do \ ln $(srcdir)/$$file $(PACKAGE)-$(VERSION) 2> /dev/null \ || cp -p $(srcdir)/$$file $(PACKAGE)-$(VERSION); \ done for subdir in $(SUBDIRS); do \ echo making dist in $$subdir; \ mkdir $(PACKAGE)-$(VERSION)/$$subdir; \ chmod 777 $(PACKAGE)-$(VERSION)/$$subdir; \ (cd $$subdir && $(MAKE) dist) || exit 1; \ done chmod -R a+r $(PACKAGE)-$(VERSION) shar $(PACKAGE)-$(VERSION) | gzip > $(PACKAGE)-$(VERSION).shar.gz rm -rf $(PACKAGE)-$(VERSION) # For an explanation of the following Makefile rules, see node # `Automatic Remaking' in GNU Autoconf documentation. Makefile: Makefile.in config.status CONFIG_FILES=$@ CONFIG_HEADERS= ./config.status config.status: configure ./config.status --recheck configure: configure.in aclocal.m4 cd $(srcdir) && autoconf config.h: stamp-h stamp-h: config.h.in config.status CONFIG_FILES= CONFIG_HEADERS=config.h ./config.status config.h.in: stamp-h.in stamp-h.in: configure.in aclocal.m4 acconfig.h cd $(srcdir) && autoheader $(TOUCH) $(srcdir)/stamp-h.in # Tell versions [3.59,3.63) of GNU make not to export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: tar-1.11.8/acconfig.h 644 625 1 4575 5770533425 7344 /* Special definitions for GNU tar, processed by autoheader. Copyright (C) 1994 Free Software Foundation, Inc. François Pinard , 1993. */ /* Define to a string giving the full name of the default archive file. */ #undef DEFAULT_ARCHIVE /* Define to a number giving the default blocking size for archives. */ #undef DEFAULT_BLOCKING /* Define to 1 if density may be indicated by [lmh] at end of device. */ #undef DENSITY_LETTER /* Define to a string giving the prefix of the default device, without the part specifying the unit and density. */ #undef DEVICE_PREFIX /* Define to 1 if you lack a 3-argument version of open, and want to emulate it with system calls you do have. */ #undef EMUL_OPEN3 /* Define to 1 if NLS is requested. */ #undef ENABLE_NLS /* Define as 1 if you have catgets and don't want to use GNU gettext. */ #undef HAVE_CATGETS /* Define to 1 if you have getgrgid(3). */ #undef HAVE_GETGRGID /* Define to 1 if you have getpwuid(3). */ #undef HAVE_GETPWUID /* Define as 1 if you have gettext and don't want to use GNU gettext. */ #undef HAVE_GETTEXT /* Define if your locale.h file contains LC_MESSAGES. */ #undef HAVE_LC_MESSAGES /* Define to 1 if you have the valloc function. */ #undef HAVE_VALLOC /* Define to 1 if some rsh exists, or if you have . */ #undef HAVE_RTAPELIB /* Define to 1 if mknod function is available. */ #undef HAVE_MKNOD /* Define if `union wait' is the type of the first arg to wait functions. */ #undef HAVE_UNION_WAIT /* Define to 1 if utime.h exists and declares struct utimbuf. */ #undef HAVE_UTIME_H /* Define to mt_model (v.g., for DG/UX), else to mt_type. */ #undef MTIO_CHECK_FIELD /* Define to the name of the distribution. */ #undef PACKAGE /* Define to 1 if ANSI function prototypes are usable. */ #undef PROTOTYPES /* Define to the full path of your rsh, if any. */ #undef REMOTE_SHELL /* Path to directory containing system wide message catalog sources. */ #undef STD_INC_PATH /* Define to the version of the distribution. */ #undef VERSION /* Define to 1 if using the `glocale' package for message catalogs. */ #undef WITH_CATALOGS /* Define to 1 for better use of the debugging malloc library. See site ftp.antaire.com in antaire/src, file dmalloc/dmalloc.tar.gz. */ #undef WITH_DMALLOC /* Define to 1 if GNU regex should be used instead of GNU rx. */ #undef WITH_REGEX tar-1.11.8/aclocal.m4 644 625 1 17563 5770551040 7274 # Local additions to Autoconf macros. # Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. # François Pinard , 1992. ## ------------------------------- ## ## Check for function prototypes. ## ## ------------------------------- ## AC_DEFUN(fp_C_PROTOTYPES, [AC_REQUIRE([fp_PROG_CC_STDC]) AC_MSG_CHECKING([for function prototypes]) if test "$ac_cv_prog_cc_stdc" != no; then AC_MSG_RESULT(yes) AC_DEFINE(PROTOTYPES) U= ANSI2KNR= else AC_MSG_RESULT(no) U=_ ANSI2KNR=ansi2knr fi AC_SUBST(U)dnl AC_SUBST(ANSI2KNR)dnl ]) ## ----------------------------------------- ## ## ANSIfy the C compiler whenever possible. ## ## ----------------------------------------- ## # @defmac AC_PROG_CC_STDC # @maindex PROG_CC_STDC # @ovindex CC # If the C compiler in not in ANSI C mode by default, try to add an option # to output variable @code{CC} to make it so. This macro tries various # options that select ANSI C on some system or another. It considers the # compiler to be in ANSI C mode if it defines @code{__STDC__} to 1 and # handles function prototypes correctly. # # If you use this macro, you should check after calling it whether the C # compiler has been set to accept ANSI C; if not, the shell variable # @code{ac_cv_prog_cc_stdc} is set to @samp{no}. If you wrote your source # code in ANSI C, you can make an un-ANSIfied copy of it by using the # program @code{ansi2knr}, which comes with Ghostscript. # @end defmac AC_DEFUN(fp_PROG_CC_STDC, [AC_MSG_CHECKING(for ${CC-cc} option to accept ANSI C) AC_CACHE_VAL(ac_cv_prog_cc_stdc, [ac_cv_prog_cc_stdc=no ac_save_CFLAGS="$CFLAGS" # Don't try gcc -ansi; that turns off useful extensions and # breaks some systems' header files. # AIX -qlanglvl=ansi # Ultrix and OSF/1 -std1 # HP-UX -Aa -D_HPUX_SOURCE # SVR4 -Xc for ac_arg in "" -qlanglvl=ansi -std1 "-Aa -D_HPUX_SOURCE" -Xc do CFLAGS="$ac_save_CFLAGS $ac_arg" AC_TRY_COMPILE( [#if !defined(__STDC__) || __STDC__ != 1 choke me #endif ], [int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);};], [ac_cv_prog_cc_stdc="$ac_arg"; break]) done CFLAGS="$ac_save_CFLAGS" ]) AC_MSG_RESULT($ac_cv_prog_cc_stdc) case "x$ac_cv_prog_cc_stdc" in x|xno) ;; *) CC="$CC $ac_cv_prog_cc_stdc" ;; esac ]) ## --------------------------------------------------------- ## ## Use AC_PROG_INSTALL, supplementing it with INSTALL_SCRIPT ## ## substitution. ## ## --------------------------------------------------------- ## AC_DEFUN(fp_PROG_INSTALL, [AC_PROG_INSTALL test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL} -m 755' AC_SUBST(INSTALL_SCRIPT)dnl ]) ## ----------------------------------- ## ## Check if --with-dmalloc was given. ## ## ----------------------------------- ## # I just checked, and GNU rx seems to work fine with a slightly # modified GNU m4. So, I put out the test below in my aclocal.m4, # and will try to use it in my things. The idea is to distribute # rx.[hc] and regex.[hc] together, for a while. The WITH_REGEX symbol # (which should also be documented in acconfig.h) is used to decide # which of regex.h or rx.h should be included in the application. # # If `./configure --with-regex' is given, the package will use # the older regex. Else, a check is made to see if rx is already # installed, as with newer Linux'es. If not found, the package will # use the rx from the distribution. If found, the package will use # the system's rx which, on Linux at least, will result in a smaller # executable file. AC_DEFUN(fp_WITH_DMALLOC, [AC_MSG_CHECKING(if malloc debugging is wanted) AC_ARG_WITH(dmalloc, [ --with-dmalloc use dmalloc, as in ftp://ftp.letters.com/src/dmalloc/dmalloc.tar.gz], [if test "$withval" = yes; then AC_MSG_RESULT(yes) AC_DEFINE(WITH_DMALLOC) LIBS="$LIBS -ldmalloc" LDFLAGS="$LDFLAGS -g" else AC_MSG_RESULT(no) fi], [AC_MSG_RESULT(no)]) ]) ## --------------------------------- ## ## Check if --with-regex was given. ## ## --------------------------------- ## AC_DEFUN(fp_WITH_REGEX, [AC_MSG_CHECKING(which of rx or regex is wanted) AC_ARG_WITH(regex, [ --with-regex use older regex in lieu of GNU rx for matching], [if test "$withval" = yes; then ac_with_regex=1 AC_MSG_RESULT(regex) AC_DEFINE(WITH_REGEX) LIBOBJS="$LIBOBJS regex.o" fi]) if test -z "$ac_with_regex"; then AC_MSG_RESULT(rx) AC_CHECK_FUNC(re_rx_search, , [LIBOBJS="$LIBOBJS rx.o"]) fi AC_SUBST(LIBOBJS)dnl ]) ## ------------------- ## ## Check NLS options. ## ## ------------------- ## AC_DEFUN(ud_LC_MESSAGES, [if test $ac_cv_header_locale_h = yes; then AC_MSG_CHECKING([for LC_MESSAGES]) AC_CACHE_VAL(ud_cv_val_LC_MESSAGES, [AC_TRY_LINK([#include ], [return LC_MESSAGES], ud_cv_val_LC_MESSAGES=yes, ud_cv_val_LC_MESSAGES=no)]) AC_MSG_RESULT($ud_cv_val_LC_MESSAGES) if test $ud_cv_val_LC_MESSAGES = yes; then AC_DEFINE(HAVE_LC_MESSAGES) fi fi ]) define(ud_WITH_NLS, [AC_MSG_CHECKING([whether NLS is requested]) dnl Default is enabled NLS AC_ARG_ENABLE(nls, [ --disable-nls do not use Native Language Support], [nls_cv_use_nls=$enableval], [nls_cv_use_nls=yes]) AC_MSG_RESULT($nls_cv_use_nls) dnl If we use NLS figure out what method if test "$nls_cv_use_nls" = "yes"; then AC_DEFINE(ENABLE_NLS) AC_MSG_CHECKING([for explicitly using GNU gettext]) AC_ARG_WITH(gnu-nls, [ --with-gnu-nls use the GNU NLS library], [nls_cv_force_use_gnu_nls=$withval], [nls_cv_force_use_gnu_nls=no]) AC_MSG_RESULT($nls_cv_force_use_gnu_nls) if test "$nls_cv_force_use_gnu_nls" = "yes"; then nls_cv_use_gnu_nls=yes else dnl User does not insist on using GNU NLS library. Figure out what dnl to use. If gettext or catgets are available (in this order) we dnl use this. Else we have to fall back to GNU NLS library. AC_CHECK_LIB(intl, main) AC_CHECK_LIB(i, main) AC_FUNC_CHECK(gettext, [AC_DEFINE(HAVE_GETTEXT) AC_PATH_PROG(MSGFMT, msgfmt, msgfmt)dnl AC_PATH_PROG(GMSGFMT, gmsgfmt, $MSGFMT)dnl AC_PATH_PROG(XGETTEXT, xgettext, xgettext)dnl INTLOBJS="\$(GETTOBJS)" CATOBJEXT=.mo DATADIRNAME=lib], dnl No gettext in C library. Try catgets next. [AC_FUNC_CHECK(catgets, [AC_DEFINE(HAVE_CATGETS) INTLOBJS="\$(CATOBJS)" AC_PATH_PROG(GENCAT, gencat, [echo gencat])dnl AC_PATH_PROGS(GMSGFMT, [gmsgfmt msgfmt], msgfmt)dnl AC_PATH_PROG(XGETTEXT, xgettext, xgettext)dnl CATOBJEXT=.cat DATADIRNAME=lib INTLDEPS="../intl/libintl.a" INTLLIBS=$INTLDEPS nls_cv_header_intl=intl/libintl.h nls_cv_header_libgt=intl/libgettext.h], dnl Even catgets is not included. Fall back on GNU NLS library. [AC_MSG_RESULT([using GNU gettext]) nls_cv_use_gnu_nls=yes])]) fi if test "$nls_cv_use_gnu_nls" = "yes"; then dnl Mark actions used to generate GNU NLS library. INTLOBJS="\$(GETTOBJS)" AC_PATH_PROG(MSGFMT, msgfmt, msgfmt)dnl AC_PATH_PROG(GMSGFMT, gmsgfmt, $MSGFMT)dnl AC_PATH_PROG(XGETTEXT, xgettext, xgettext)dnl AC_SUBST(MSGFMT) CATOBJEXT=.gmo DATADIRNAME=share INTLDEPS="../intl/libintl.a" INTLLIBS=$INTLDEPS nls_cv_header_intl=intl/libintl.h nls_cv_header_libgt=intl/libgettext.h fi # We need to process the intl/ directory INTLSUB=intl fi AC_SUBST(INTLOBJS) if test -n "$CATOBJEXT"; then for lang in $LINGUAS; do CATALOGS="$CATALOGS $lang$CATOBJEXT"; done fi AC_SUBST(CATALOGS) AC_SUBST(CATOBJEXT) AC_SUBST(DATADIRNAME) AC_SUBST(INTLDEPS) AC_SUBST(INTLLIBS) AC_SUBST(INTLSUB) ]) AC_DEFUN(ud_GNU_GETTEXT, [AC_CHECK_HEADERS(locale.h nl_types.h) AC_CHECK_FUNCS(setlocale) ud_LC_MESSAGES ud_WITH_NLS if test "x$prefix" = xNONE; then AC_DEFINE_UNQUOTED(STD_INC_PATH, "$ac_default_prefix/share/nls/src") else AC_DEFINE_UNQUOTED(STD_INC_PATH, "$prefix/share/nls/src") fi ]) tar-1.11.8/configure.in 644 625 1 14315 5770616720 7744 # Configure template for GNU tar. # Copyright (C) 1991, 1994, 1995 Free Software Foundation, Inc. # Process this file with autoconf to produce a configure script. AC_INIT(src/tar.c) AC_CONFIG_HEADER(config.h) AC_CANONICAL_SYSTEM AC_ARG_PROGRAM PACKAGE=tar VERSION=1.11.8 LINGUAS="de fr pt sv" PROGRAMS=tar AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE") AC_DEFINE_UNQUOTED(VERSION, "$VERSION") AC_SUBST(PACKAGE) AC_SUBST(VERSION) AC_SUBST(PROGRAMS) AC_PROG_GCC_TRADITIONAL AC_PROG_INSTALL AC_PROG_MAKE_SET AC_PROG_RANLIB AC_PROG_YACC AC_AIX AC_ISC_POSIX AC_MINIX fp_C_PROTOTYPES AC_C_CONST AC_CHECK_HEADERS(fcntl.h limits.h memory.h string.h \ sys/gentape.h sys/io/trioctl.h sys/ioccom.h sys/mtio.h sys/param.h \ sys/tape.h sys/time.h sys/timeb.h sys/wait.h unistd.h) AC_MSG_CHECKING(for utime.h) AC_TRY_COMPILE([#include #include ], [struct utimbuf foo], [AC_MSG_RESULT(yes); AC_DEFINE(HAVE_UTIME_H)], [AC_MSG_RESULT(no)]) if test "$ac_cv_header_sys_mtio_h" = yes; then AC_MSG_CHECKING(for remote tape header files) AC_CACHE_VAL(ac_cv_header_rmt, [AC_TRY_CPP([#include #include ], ac_cv_header_rmt=yes, ac_cv_header_rmt=no)]) AC_MSG_RESULT($ac_cv_header_rmt) test $ac_cv_header_rmt = yes && PROGRAMS="$PROGRAMS rmt" fi AC_MSG_CHECKING(for getgrgid declaration) AC_EGREP_HEADER(getgrgid, grp.h, [AC_MSG_RESULT(yes); AC_DEFINE(HAVE_GETGRGID)], [AC_MSG_RESULT(no)]) AC_MSG_CHECKING(for getpwuid declaration) AC_EGREP_HEADER(getpwuid, pwd.h, [AC_MSG_RESULT(yes); AC_DEFINE(HAVE_GETPWUID)], [AC_MSG_RESULT(no)]) AC_MSG_CHECKING(which field to test for reversed bytes in remote ioctl) AC_EGREP_HEADER(mt_model, sys/mtio.h, field=mt_model, field=mt_type) AC_MSG_RESULT($field) AC_DEFINE_UNQUOTED(MTIO_CHECK_FIELD, $field) AC_HEADER_DIRENT AC_HEADER_MAJOR AC_HEADER_STAT AC_HEADER_STDC AC_HEADER_TIME AC_STRUCT_ST_BLKSIZE AC_STRUCT_ST_BLOCKS AC_TYPE_SIGNAL AC_TYPE_SIZE_T AC_TYPE_UID_T AC_CHECK_FUNCS(ftime getcwd isascii mkfifo strstr) AC_MSG_CHECKING(for mknod) AC_CACHE_VAL(ac_cv_func_mknod, AC_TRY_LINK([#include ], [mknod (0, 0, 0)], ac_cv_func_mknod=yes, ac_cv_func_mknod=no)) AC_MSG_RESULT($ac_cv_func_mknod) test $ac_cv_func_mknod = yes && AC_DEFINE(HAVE_MKNOD) # # If -lnsl has gethostname() defined, and/or if -lsocket has an # undefined reference to gethostname(), then we need both -lsocket # and -lnsl. Ideally, -lsocket and -lnsl should be tested both # at once, we rather test -lsocket after -lnsl. Other ideas for # -lsocket: socket or ntohl. For -lnsl: t_open or dial. # AC_CHECK_LIB(inet, gettimeofday, [LIBS="$LIBS -linet"]) AC_CHECK_LIB(nsl, gethostname, [LIBS="$LIBS -lnsl"]) AC_CHECK_LIB(socket, setsockopt, [LIBS="$LIBS -lsocket"]) # AC_FUNC_ALLOCA AC_FUNC_VPRINTF AC_REPLACE_FUNCS(fnmatch ftruncate memset mkdir rename rmdir) test "$ac_cv_func_strstr" = yes || LIBOBJS="$LIBOBJS strstr.o" AC_MSG_CHECKING(for HP-UX needing gmalloc) if test "`(uname -s) 2> /dev/null`" = 'HP-UX'; then AC_MSG_RESULT(yes) LIBOBJS="$LIBOBJS gmalloc.o" AC_DEFINE(HAVE_VALLOC) else AC_MSG_RESULT(no) AC_CHECK_FUNCS(valloc) fi # The 3-argument open happens to go along with the O_* defines, which # are easier to check for. AC_MSG_CHECKING(for 3-argument open) AC_TRY_COMPILE([#ifdef HAVE_FCNTL_H #include #else #include #endif], [int x = O_RDONLY], [AC_MSG_RESULT(yes)], [AC_MSG_RESULT(no); AC_DEFINE(EMUL_OPEN3)]) AC_MSG_CHECKING(for union wait) AC_TRY_COMPILE([#include #include ], [union wait status; int pid; pid = wait (&status); #ifdef WEXITSTATUS /* Some POSIXoid systems have both the new-style macros and the old union wait type, and they do not work together. If union wait conflicts with WEXITSTATUS et al, we don't want to use it at all. */ if (WEXITSTATUS (status) != 0) pid = -1; #endif], [AC_MSG_RESULT(yes); AC_DEFINE(HAVE_UNION_WAIT)], [AC_MSG_RESULT(no)]) AC_MSG_CHECKING(for remote shell) AC_CACHE_VAL(ac_cv_path_RSH, [if test -n "$RSH"; then ac_cv_path_RSH=$RSH else ac_cv_path_RSH=no for ac_file in \ /usr/ucb/rsh /usr/bin/remsh /usr/bin/rsh /usr/bsd/rsh /usr/bin/nsh do if test -f $ac_file; then ac_cv_path_RSH=$ac_file break fi done fi]) AC_MSG_RESULT($ac_cv_path_RSH) if test $ac_cv_path_RSH = no; then AC_CHECK_HEADERS(netdb.h) else AC_DEFINE_UNQUOTED(REMOTE_SHELL, "$ac_cv_path_RSH") fi AC_MSG_CHECKING(for default archive) if test -z "$DEFAULT_ARCHIVE"; then DEFAULT_ARCHIVE=- else if test -z "`ls $DEFAULT_ARCHIVE 2>/dev/null`"; then AC_MSG_WARN(DEFAULT_ARCHIVE \`$DEFAULT_ARCHIVE' not found on this system) fi # Look for DEFTAPE in . Rearrange, here. FIXME. case $DEFAULT_ARCHIVE in changequote(, )dnl *[0-7][lmh]) device_prefix=`echo $DEFAULT_ARCHIVE | sed 's/[0-7][lmh]$//'` changequote([, ])dnl AC_DEFINE_UNQUOTED(DEVICE_PREFIX, "$device_prefix") AC_DEFINE(DENSITY_LETTER) ;; changequote(, )dnl *[0-7]) device_prefix=`echo $DEFAULT_ARCHIVE | sed 's/[0-7]$//'` changequote([, ])dnl AC_DEFINE_UNQUOTED(DEVICE_PREFIX, "$device_prefix") ;; esac fi AC_DEFINE_UNQUOTED(DEFAULT_ARCHIVE, "$DEFAULT_ARCHIVE") AC_MSG_RESULT($DEFAULT_ARCHIVE) AC_MSG_CHECKING(for default blocking) DEFAULT_BLOCKING=${DEFAULT_BLOCKING-20} AC_DEFINE_UNQUOTED(DEFAULT_BLOCKING, $DEFAULT_BLOCKING) AC_MSG_RESULT($DEFAULT_BLOCKING) fp_WITH_DMALLOC fp_WITH_REGEX # ---------------------- # Beginning of NLS block. # ud_GNU_GETTEXT for file in `cat $srcdir/po/POTFILES`; do POTFILES="$POTFILES ../$file" done AC_SUBST(POTFILES) AC_HAVE_HEADERS(values.h) AC_C_INLINE AC_TYPE_OFF_T AC_SIZEOF_TYPE(unsigned short) AC_SIZEOF_TYPE(unsigned int) AC_FUNC_MMAP AC_CHECK_FUNCS(putenv setenv) test -d intl || mkdir intl case "$target" in *-linux*) cp $srcdir/intl/linux-msg.sed intl/po-to-msg.sed ;; *) cp $srcdir/intl/xopen-msg.sed intl/po-to-msg.sed ;; esac chmod +w intl/po-to-msg.sed if test -n "$nls_cv_header_libgt" && test -n "$nls_cv_header_intl"; then cp $srcdir/$nls_cv_header_libgt $nls_cv_header_intl chmod +w $nls_cv_header_intl fi # # End of NLS block. # ----------------- AC_OUTPUT([Makefile doc/Makefile intl/Makefile lib/Makefile po/Makefile \ src/Makefile scripts/Makefile], [test -z "$CONFIG_HEADERS" || echo timestamp > stamp-h]) tar-1.11.8/install-sh 555 625 1 11244 5716156334 7433 #! /bin/sh # # install - install a program, script, or datafile # This comes from X11R5. # # Calling this script install-sh is preferred over install.sh, to prevent # `make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. # # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit="${DOITPROG-}" # put in absolute paths if you don't have them in your path; or use env. vars. mvprog="${MVPROG-mv}" cpprog="${CPPROG-cp}" chmodprog="${CHMODPROG-chmod}" chownprog="${CHOWNPROG-chown}" chgrpprog="${CHGRPPROG-chgrp}" stripprog="${STRIPPROG-strip}" rmprog="${RMPROG-rm}" mkdirprog="${MKDIRPROG-mkdir}" tranformbasename="" transform_arg="" instcmd="$mvprog" chmodcmd="$chmodprog 0755" chowncmd="" chgrpcmd="" stripcmd="" rmcmd="$rmprog -f" mvcmd="$mvprog" src="" dst="" dir_arg="" while [ x"$1" != x ]; do case $1 in -c) instcmd="$cpprog" shift continue;; -d) dir_arg=true shift continue;; -m) chmodcmd="$chmodprog $2" shift shift continue;; -o) chowncmd="$chownprog $2" shift shift continue;; -g) chgrpcmd="$chgrpprog $2" shift shift continue;; -s) stripcmd="$stripprog" shift continue;; -t=*) transformarg=`echo $1 | sed 's/-t=//'` shift continue;; -b=*) transformbasename=`echo $1 | sed 's/-b=//'` shift continue;; *) if [ x"$src" = x ] then src=$1 else # this colon is to work around a 386BSD /bin/sh bug : dst=$1 fi shift continue;; esac done if [ x"$src" = x ] then echo "install: no input file specified" exit 1 else true fi if [ x"$dir_arg" != x ]; then dst=$src src="" if [ -d $dst ]; then instcmd=: else instcmd=mkdir fi else # Waiting for this to be detected by the "$instcmd $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if [ -f $src -o -d $src ] then true else echo "install: $src does not exist" exit 1 fi if [ x"$dst" = x ] then echo "install: no destination specified" exit 1 else true fi # If destination is a directory, append the input filename; if your system # does not like double slashes in filenames, you may need to add some logic if [ -d $dst ] then dst="$dst"/`basename $src` else true fi fi ## this sed command emulates the dirname command dstdir=`echo $dst | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'` # Make sure that the destination directory exists. # this part is taken from Noah Friedman's mkinstalldirs script # Skip lots of stat calls in the usual case. if [ ! -d "$dstdir" ]; then defaultIFS=' ' IFS="${IFS-${defaultIFS}}" oIFS="${IFS}" # Some sh's can't handle IFS=/ for some reason. IFS='%' set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'` IFS="${oIFS}" pathcomp='' while [ $# -ne 0 ] ; do pathcomp="${pathcomp}${1}" shift if [ ! -d "${pathcomp}" ] ; then $mkdirprog "${pathcomp}" else true fi pathcomp="${pathcomp}/" done fi if [ x"$dir_arg" != x ] then $doit $instcmd $dst && if [ x"$chowncmd" != x ]; then $doit $chowncmd $dst; else true ; fi && if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dst; else true ; fi && if [ x"$stripcmd" != x ]; then $doit $stripcmd $dst; else true ; fi && if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dst; else true ; fi else # If we're going to rename the final executable, determine the name now. if [ x"$transformarg" = x ] then dstfile=`basename $dst` else dstfile=`basename $dst $transformbasename | sed $transformarg`$transformbasename fi # don't allow the sed command to completely eliminate the filename if [ x"$dstfile" = x ] then dstfile=`basename $dst` else true fi # Make a temp file name in the proper directory. dsttmp=$dstdir/#inst.$$# # Move or copy the file name to the temp name $doit $instcmd $src $dsttmp && trap "rm -f ${dsttmp}" 0 && # and set any options; do chmod last to preserve setuid bits # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $instcmd $src $dsttmp" command. if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; else true;fi && if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; else true;fi && if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; else true;fi && if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; else true;fi && # Now rename the file to the real destination. $doit $rmcmd -f $dstdir/$dstfile && $doit $mvcmd $dsttmp $dstdir/$dstfile fi && exit 0 tar-1.11.8/mkinstalldirs 555 625 1 1212 5716156043 10204 #! /bin/sh # mkinstalldirs --- make directory hierarchy # Author: Noah Friedman # Created: 1993-05-16 # Last modified: 1994-03-25 # Public domain errstatus=0 for file in ${1+"$@"} ; do set fnord `echo ":$file" | sed -ne 's/^:\//#/;s/^://;s/\// /g;s/^#/\//;p'` shift pathcomp= for d in ${1+"$@"} ; do pathcomp="$pathcomp$d" case "$pathcomp" in -* ) pathcomp=./$pathcomp ;; esac if test ! -d "$pathcomp"; then echo "mkdir $pathcomp" 1>&2 mkdir "$pathcomp" || errstatus=$? fi pathcomp="$pathcomp/" done done exit $errstatus # mkinstalldirs ends here tar-1.11.8/config.guess 555 625 1 31470 5751164254 7751 #!/bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc. # # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Written by Per Bothner . # The master version of this file is at the FSF in /home/gd/gnu/lib. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit system type (host/target name). # # Only a few systems have been added to this list; please add others # (but try to keep the structure clean). # # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 8/24/94.) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown trap 'rm -f dummy.c dummy.o dummy; exit 1' 1 2 15 # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in alpha:OSF1:V*:*) # After 1.2, OSF1 uses "V1.3" for uname -r. echo alpha-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^V//'` exit 0 ;; alpha:OSF1:*:*) # 1.2 uses "1.2" for uname -r. echo alpha-dec-osf${UNAME_RELEASE} exit 0 ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit 0;; Pyramid*:OSx*:*:*) if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit 0 ;; sun4*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; sun4*:SunOS:*:*) # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit 0 ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit 0 ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit 0 ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit 0 ;; mips:*:5*:RISCos) echo mips-mips-riscos${UNAME_RELEASE} exit 0 ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit 0 ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit 0 ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit 0 ;; AViiON:dgux:*:*) if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx \ -o ${TARGET_BINARY_INTERFACE}x = x ] ; then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi exit 0 ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit 0 ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit 0 ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit 0 ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit 0 ;; *:IRIX:*:*) echo mips-sgi-irix${UNAME_RELEASE} exit 0 ;; i[34]86:AIX:*:*) echo i386-ibm-aix exit 0 ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then sed 's/^ //' << EOF >dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF ${CC-cc} dummy.c -o dummy && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy echo rs6000-ibm-aix3.2.5 elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit 0 ;; *:AIX:*:4) if /usr/sbin/lsattr -EHl proc0 | grep POWER >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if grep bos410 /usr/include/stdio.h >/dev/null 2>&1; then IBM_REV=4.1 elif grep bos411 /usr/include/stdio.h >/dev/null 2>&1; then IBM_REV=4.1.1 else IBM_REV=4.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit 0 ;; *:AIX:*:*) echo rs6000-ibm-aix exit 0 ;; *:BOSX:*:*) echo rs6000-bull-bosx exit 0 ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit 0 ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit 0 ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit 0 ;; 9000/[3478]??:HP-UX:*:*) case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/7?? | 9000/8?7 ) HP_ARCH=hppa1.1 ;; 9000/8?? ) HP_ARCH=hppa1.0 ;; esac HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit 0 ;; 3050*:HI-UX:*:*) sed 's/^ //' << EOF >dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF ${CC-cc} dummy.c -o dummy && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy echo unknown-hitachi-hiuxwe2 exit 0 ;; 9000/7??:4.3bsd:*:* | 9000/8?7:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit 0 ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit 0 ;; hp7??:OSF1:*:* | hp8?7:OSF1:*:* ) echo hppa1.1-hp-osf exit 0 ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit 0 ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit 0 ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit 0 ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit 0 ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit 0 ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit 0 ;; CRAY*X-MP:UNICOS:*:*) echo xmp-cray-unicos exit 0 ;; CRAY*Y-MP:UNICOS:*:*) echo ymp-cray-unicos exit 0 ;; CRAY-2:UNICOS:*:*) echo cray2-cray-unicos exit 0 ;; hp3[0-9][05]:NetBSD:*:*) echo m68k-hp-netbsd${UNAME_RELEASE} exit 0 ;; i[34]86:BSD/386:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit 0 ;; *:FreeBSD:*:*) echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit 0 ;; *:NetBSD:*:*) echo ${UNAME_MACHINE}-unknown-netbsd`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` exit 0 ;; *:GNU:*:*) echo `echo ${UNAME_MACHINE}|sed -e 's,/.*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit 0 ;; *:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux exit 0 ;; # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. earlier versions # are messed up and put the nodename in both sysname and nodename. i[34]86:DYNIX/ptx:4*:*) echo i386-sequent-sysv4 exit 0 ;; i[34]86:*:4.*:* | i[34]86:SYSTEM_V:4.*:*) if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_RELEASE} else echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE} fi exit 0 ;; i[34]86:*:3.2:*) if /bin/uname -X 2>/dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|egrep Release|sed -e 's/.*= //')` (/bin/uname -X|egrep i80486 >/dev/null) && UNAME_MACHINE=i486 echo ${UNAME_MACHINE}-unknown-sco$UNAME_REL elif test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit 0 ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit 0 ;; M680[234]0:*:R3V[567]*:*) test -r /sysV68 && echo 'm68k-motorola-sysv' && exit 0 ;; 3[34]??:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0) uname -p 2>/dev/null | grep 86 >/dev/null \ && echo i486-ncr-sysv4.3 && exit 0 ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) uname -p 2>/dev/null | grep 86 >/dev/null \ && echo i486-ncr-sysv4 && exit 0 ;; m680[234]0:LynxOS:2.2*:*) echo m68k-lynx-lynxos${UNAME_RELEASE} exit 0 ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit 0 ;; i[34]86:LynxOS:2.2*:*) echo i386-lynx-lynxos${UNAME_RELEASE} exit 0 ;; TSUNAMI:LynxOS:2.2*:*) echo sparc-lynx-lynxos${UNAME_RELEASE} exit 0 ;; rs6000:LynxOS:2.2*:*) echo rs6000-lynx-lynxos${UNAME_RELEASE} exit 0 ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit 0 ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit 0 ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 cat >dummy.c </dev/null`; printf ("%s-next-nextstep%s\n", __ARCHITECTURE__, version==2 ? "2" : "3"); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-unknown-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) #if !defined (ultrix) printf ("vax-dec-bsd\n"); exit (0); #else printf ("vax-dec-ultrix\n"); exit (0); #endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF ${CC-cc} dummy.c -o dummy 2>/dev/null && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit 0; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit 0 ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit 0 ;; c34*) echo c34-convex-bsd exit 0 ;; c38*) echo c38-convex-bsd exit 0 ;; c4*) echo c4-convex-bsd exit 0 ;; esac fi #echo '(Unable to guess system type)' 1>&2 exit 1 tar-1.11.8/config.sub 555 625 1 37676 5751164247 7434 #!/bin/sh # Configuration validation subroutine script, version 1.1. # Copyright (C) 1991, 1992, 1993, 1994 Free Software Foundation, Inc. # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. # # This file is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # It is wrong to echo any other type of specification. # First pass through any local machine types. case $1 in *local*) echo $1 exit 0 ;; *) ;; esac # Separate what the user gave into CPU-COMPANY and OS (if any). basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp ) os= basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -lynx) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. tahoe | i[345]86 | i860 | m68k | m68000 | m88k | ns32k | arm | pyramid \ | tron | a29k | 580 | i960 | h8300 | hppa1.0 | hppa1.1 \ | alpha | we32k | ns16k | clipper | sparclite | i370 | sh \ | powerpc | sparc64 | 1750a | dsp16xx | mips64 | mipsel \ | pdp11 | mips64el | mips64orion | mips64orionel ) basic_machine=$basic_machine-unknown ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. vax-* | tahoe-* | i[345]86-* | i860-* | m68k-* | m68000-* | m88k-* \ | sparc-* | ns32k-* | fx80-* | arm-* | c[123]* \ | mips-* | pyramid-* | tron-* | a29k-* | romp-* | rs6000-* \ | none-* | 580-* | cray2-* | h8300-* | i960-* | xmp-* | ymp-* \ | hppa1.0-* | hppa1.1-* | alpha-* | we32k-* | cydra-* | ns16k-* \ | pn-* | np1-* | xps100-* | clipper-* | orion-* | sparclite-* \ | pdp11-* | sh-* | powerpc-* | sparc64-* | mips64-* | mipsel-* \ | mips64el-* | mips64orion-* | mips64orionel-* ) ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-cbm ;; amigados) basic_machine=m68k-cbm os=-amigados ;; amigaunix | amix) basic_machine=m68k-cbm os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; balance) basic_machine=ns32k-sequent os=-dynix ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | ymp) basic_machine=ymp-cray os=-unicos ;; cray2) basic_machine=cray2-cray os=-unicos ;; crds | unos) basic_machine=m68k-crds ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k7[0-9][0-9] | hp7[0-9][0-9] | hp9k8[0-9]7 | hp8[0-9]7) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; i370-ibm* | ibm*) basic_machine=i370-ibm os=-mvs ;; # I'm not sure what "Sysv32" means. Should this be sysv3.2? i[345]86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-unknown/'` os=-sysv32 ;; i[345]86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-unknown/'` os=-sysv4 ;; i[345]86v) basic_machine=`echo $1 | sed -e 's/86.*/86-unknown/'` os=-sysv ;; i[345]86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-unknown/'` os=-solaris2 ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; miniframe) basic_machine=m68000-convergent ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; np1) basic_machine=np1-gould ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pentium-*) # We will change tis to say i586 once there has been # time for various packages to start to recognize that. basic_machine=i486-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; ps2) basic_machine=i386-ibm ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; symmetry) basic_machine=i386-sequent os=-dynix ;; tower | tower-32) basic_machine=m68k-ncr ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; xmp) basic_machine=xmp-cray os=-unicos ;; xps | xps100) basic_machine=xps100-honeywell ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. mips) basic_machine=mips-mips ;; romp) basic_machine=romp-ibm ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sparc) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # -solaris* is a basic system type, with this one exception. -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative must end in a *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -vms* | -sco* | -esix* | -isc* | -aix* | -sunos | -sunos[345]* \ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -amigados* | -msdos* | -newsos* | -unicos* | -aos* \ | -nindy* | -vxworks* | -ebmon* | -hms* | -mvs* | -clix* \ | -riscos* | -linux* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -netbsd* | -freebsd* | -riscix* \ | -lynxos* | -bosx* | -nextstep* | -cxux* | -aout* | -elf* \ | -ptx* | -coff* | -winnt*) ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -ctix* | -uts*) os=-sysv ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -xenix) os=-xenix ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in *-acorn) os=-riscix1.2 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-ibm) os=-aix ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigados ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-masscomp) os=-rtu ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -lynxos*) vendor=lynx ;; -aix*) vendor=ibm ;; -hpux*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs*) vendor=ibm ;; -ptx*) vendor=sequent ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os tar-1.11.8/rebox.el 644 625 1 61172 5736200444 7071 ;;; Handling of comment boxes. ;;; Copyright (C) 1991, 1992, 1993, 1994, 1995 Free Software Foundation, Inc. ;;; François Pinard , April 1991. ;;; ;;; I often refill paragraphs inside comments, while stretching or ;;; shrinking the surrounding box as needed. This is a real pain to ;;; do by hand (or with vi! :-). This GNU Emacs LISP code eases my ;;; life on this. It would not be fair giving all sources for a ;;; package without also giving the means for nicely modifying them. ;;; ;;; The function rebox-comment discovers the extent of the boxed ;;; comments near the cursor, possibly refills the text, then adjusts ;;; the comment box style. The function rebox-region does the same, ;;; except that it takes the current region as a boxed comment. ;;; Numeric prefixes are used to add or remove a box, change its style ;;; (language, quality or type), or to prevent refilling of its text. ;;; ;;; For most Emacs language editing modes, refilling does not make ;;; sense outside comments, so you may redefine the M-q command and ;;; link it to this file. For example, I use this in my .emacs file: ;;; ;;; (setq c-mode-hook ;;; '(lambda () ;;; (define-key c-mode-map "\M-q" 'rebox-comment))) ;;; (autoload 'rebox-comment "rebox" nil t) ;;; (autoload 'rebox-region "rebox" nil t) ;;; ;;; The cursor should be within a comment before any of these ;;; commands, or else it should be between two comments, in which case ;;; the command applies to the next comment. When the command is ;;; given without prefix, the current comment box style is recognized ;;; from the comment itself as far as possible, and preserved. A ;;; prefix may be used to force a particular box style. A style is ;;; made up of three attributes: a language (the hundreds digit), a ;;; quality (the tens digit) and a type (the units digit). A zero or ;;; negative flag value changes the default box style to its absolute ;;; value. Zero digits in default style, when not overriden in flag, ;;; asks for recognition of corresponding attributes from the current ;;; box. C-u avoids refilling the text, using the default box style. ;;; ;;; Box language is associated with comment delimiters. Values are ;;; 100 for none or unknown, 200 for `/*' and `*/' as in plain C, 300 ;;; for '//' as in C++, 400 for `#' as in most scripting languages, ;;; 500 for `;' as in LISP or assembler and 600 for `%' as in TeX or ;;; PostScript. ;;; ;;; Box quality differs according to language. For unknown languages ;;; (100) or for the C language (200), values are 10 for simple, 20 or ;;; 30 for rounded, and 40 for starred. For all others, box quality ;;; indicates the thickness in characters of the left and right sides ;;; of the box: values are 10, 20, 30 or 40 for 1, 2, 3 or 4 ;;; characters wide. C++ quality 10 is always promoted to 20. ;;; ;;; Box type values are 1 for fully opened boxes for which boxing is ;;; done only for the left and right but not for top or bottom, 2 for ;;; half single lined boxes for which boxing is done on all sides ;;; except top, 3 for fully single lined boxes for which boxing is ;;; done on all sides, 4 for half double lined boxes which is like ;;; type 2 but more bold, or 5 for fully double lined boxes which is ;;; like type 3 but more bold. ;;; ;;; Roughly said, simple quality boxes (10) use comment delimiters to ;;; left and right of each comment line, and also for the top or ;;; bottom line when applicable. Rounded quality boxes (20 or 30) try ;;; to suggest rounded corners in boxes. Starred quality boxes (40) ;;; mostly use a left margin of asterisks or X'es, and use them also ;;; in box surroundings. Experiment a little to see what happens. ;;; ;;; The special style 221 or 231 is worth a note, because it is fairly ;;; common: the whole C comment stays between a single opening `/*' ;;; and a single closing `*/'. The special style 111 deletes a box. ;;; The initial default style is 023 so, unless overriden, comments ;;; are put in single lined boxes, C comments are of rounded quality. ;;; ;;; I first observed rounded corners, as used in style 223 boxes, in ;;; code from Warren Tucker . (defvar rebox-default-style 0 "*Preferred style for box comments.") ;;; Write some TEXT followed by an edited STYLE value into the minibuffer. (defun rebox-show-style (text style) (let (language quality type) (setq text (concat text)) (setq language (* (/ style 100) 100)) (setq quality (* (% (/ style 10) 10) 10)) (setq type (% style 10)) (message (concat text (format " (%03d)" style) ": " (cond ((= language 000) "default language") ((= language 100) "no language") ((= language 200) "plain C") ((= language 300) "C++") ((= language 400) "sh/Perl/make") ((= language 500) "LISP/assembler") ((= language 600) "TeX/PostScript") (t "")) ", " (cond ((= quality 00) "default quality") ((= quality 10) "square or 1-wide") ((= quality 20) "rounded or 2-wide") ((= quality 30) "rounded or 3-wide") ((= quality 40) "starred or 4-wide") (t "")) ", " (cond ((= type 0) "default type") ((= type 1) "opened box") ((= type 2) "half normal") ((= type 3) "full normal") ((= type 4) "half bold") ((= type 5) "full bold") (t "")))))) ;;; Validate FLAG and usually return t if not interrupted by errors. ;;; But if FLAG is zero or negative, change default box style, then ;;; return nil. (defun rebox-validate-flag (flag) ;; Validate flag. (if (numberp flag) (let ((value (if (< flag 0) (- flag) flag))) (if (> (/ value 100) 6) (error "\ Box language should be 100-none, 200-/*, 300-//, 400-#, 500-;, 600-%%")) (if (> (% (/ value 10) 10) 4) (error "\ Box quality should be 10-simple, 20-rounded, 30-rounded or 40-starred")) (if (> (% value 10) 5) (error "\ Box type should be 1-open, 2-half-single, 3-single, 4-half-double or 5-double" )))) ;; Change default box style if requested. (if (and (numberp flag) (<= flag 0)) (progn (setq flag (- flag)) (if (not (zerop (/ flag 100))) (setq rebox-default-style (+ (* (/ flag 100) 100) (% rebox-default-style 100)))) (if (not (zerop (% (/ flag 10) 10))) (setq rebox-default-style (+ (* (/ rebox-default-style 100) 100) (* (% (/ flag 10) 10) 10) (% rebox-default-style 10)))) (if (not (zerop (% flag 10))) (setq rebox-default-style (+ (* (/ rebox-default-style 10) 10) (% flag 10)))) (rebox-show-style "Default style" rebox-default-style) nil) t)) ;;; Return the minimum value of the left margin of all lines, or -1 if ;;; all lines are empty. (defun rebox-left-margin () (let ((margin -1)) (goto-char (point-min)) (while (not (eobp)) (skip-chars-forward " \t") (if (not (looking-at "\n")) (setq margin (if (< margin 0) (current-column) (min margin (current-column))))) (forward-line 1)) margin)) ;;; Return the maximum value of the right margin of all lines. Any ;;; sentence ending a line has a space guaranteed before the margin. (defun rebox-right-margin () (let ((margin 0) period) (goto-char (point-min)) (while (not (eobp)) (end-of-line) (if (bobp) (setq period 0) (backward-char 1) (setq period (if (looking-at "[.?!]") 1 0)) (forward-char 1)) (setq margin (max margin (+ (current-column) period))) (forward-char 1)) margin)) ;;; Return a regexp to match the start or end of a comment for some ;;; LANGUAGE. ;; FIXME: Recognize style 1** boxes. (defun rebox-regexp-start (language) (cdr (assoc language '((0 . "^[ \t]*\\(/\\*\\|//+\\|#+\\|;+\\|%+\\)") (100 . "^") (200 . "^[ \t]*\\(/\\*\\)") (300 . "^[ \t]*\\(//+\\)") (400 . "^[ \t]*\\(#+\\)") (500 . "^[ \t]*\\(;+\\)") (600 . "^[ \t]*\\(%+\\)"))))) (defun rebox-regexp-end (language) (cdr (assoc language '((0 . "\\(\\*/\\|//+\\|#+\\|;+\\|%+\\)[ \t]*$") (100 . "$") (200 . "\\(\\*/\\)[ \t]*$") (300 . "\\(//+\\)[ \t]*$") (400 . "\\(#+\\)[ \t]*$") (500 . "\\(;+\\)[ \t]*$") (600 . "\\(%+\\)[ \t]*$"))))) ;;; By looking at the text starting at the cursor position, guess the ;;; language in use, and return it. (defun rebox-guess-language () (let ((language 100) (value 600)) (while (not (zerop value)) (if (looking-at (rebox-regexp-start value)) (progn (setq language value) (setq value 0)) (setq value (- value 100)))) language)) ;;; Find the limits of the block of comments following or enclosing ;;; the cursor, or return an error if the cursor is not within such a ;;; block of comments. Extend it as far as possible in both ;;; directions, then narrow the buffer around it. (defun rebox-find-and-narrow () (save-excursion (let (start end temp language) ;; Find the start of the current or immediately following comment. (beginning-of-line) (skip-chars-forward " \t\n") (beginning-of-line) (if (not (looking-at (rebox-regexp-start 0))) (progn (setq temp (point)) (if (re-search-forward "\\*/" nil t) (progn (re-search-backward "/\\*") (if (> (point) temp) (error "outside any comment block")) (setq temp (point)) (beginning-of-line) (skip-chars-forward " \t") (if (not (= (point) temp)) (error "text before start of comment")) (beginning-of-line)) (error "outside any comment block")))) (setq start (point)) (setq language (rebox-guess-language)) ;; - find the end of this comment (if (= language 200) (progn (search-forward "*/") (if (not (looking-at "[ \t]*$")) (error "text after end of comment")))) (beginning-of-line) (forward-line 1) (setq end (point)) ;; - try to extend the comment block backwards (goto-char start) (while (and (not (bobp)) (if (= language 200) (progn (skip-chars-backward " \t\n") (if (> (point) 2) (progn (backward-char 2) (if (looking-at "\\*/") (progn (re-search-backward "/\\*") (setq temp (point)) (beginning-of-line) (skip-chars-forward " \t") (if (= (point) temp) (progn (beginning-of-line) t))))))) (previous-line 1) (looking-at (rebox-regexp-start language)))) (setq start (point))) ;; - try to extend the comment block forward (goto-char end) (while (looking-at (rebox-regexp-start language)) (if (= language 200) (progn (re-search-forward "[ \t]*/\\*") (re-search-forward "\\*/") (if (looking-at "[ \t]*$") (progn (beginning-of-line) (forward-line 1) (setq end (point))))) (forward-line 1) (setq end (point)))) ;; - narrow to the whole block of comments (narrow-to-region start end)))) ;;; After refilling it if REFILL is not nil, while respecting a left ;;; MARGIN, put the narrowed buffer back into a boxed LANGUAGE comment ;;; box of a given QUALITY and TYPE. (defun rebox-reconstruct (refill margin language quality type) (rebox-show-style "Style" (+ language quality type)) (let (right-margin nw nn ne ww ee sw ss se x xx) ;; - decide the elements of the box being produced (cond ((= language 100) ;; - planify a comment for no language in particular (cond ((= quality 10) ;; - planify a simple box (cond ((= type 1) (setq nw "") (setq sw "") (setq ww "") (setq ee "")) ((= type 2) (setq nw "") (setq ww "| ") (setq ee " |") (setq sw "+-") (setq ss ?-) (setq se "-+")) ((= type 3) (setq nw "+-") (setq nn ?-) (setq ne "-+") (setq ww "| ") (setq ee " |") (setq sw "+-") (setq ss ?-) (setq se "-+")) ((= type 4) (setq nw "") (setq ww "| ") (setq ee " |") (setq sw "*=") (setq ss ?=) (setq se "=*")) ((= type 5) (setq nw "*=") (setq nn ?=) (setq ne "=*") (setq ww "| ") (setq ee " |") (setq sw "*=") (setq ss ?=) (setq se "=*")))) ((or (= quality 20) (= quality 30)) ;; - planify a rounded box (cond ((= type 1) (setq nw "") (setq sw "") (setq ww "| ") (setq ee " |")) ((= type 2) (setq nw "") (setq ww "| ") (setq ee " |") (setq sw "`-") (setq ss ?-) (setq se "-'")) ((= type 3) (setq nw ".-") (setq nn ?-) (setq ne "-.") (setq ww "| ") (setq ee " |") (setq sw "`-") (setq ss ?-) (setq se "-'")) ((= type 4) (setq nw "") (setq ww "| " ) (setq ee " |" ) (setq sw "\\=") (setq ss ?=) (setq se "=/" )) ((= type 5) (setq nw "/=" ) (setq nn ?=) (setq ne "=\\") (setq ww "| " ) (setq ee " |" ) (setq sw "\\=") (setq ss ?=) (setq se "=/" )))) ((= quality 40) ;; - planify a starred box (cond ((= type 1) (setq nw "") (setq sw "") (setq ww "| ") (setq ee "")) ((= type 2) (setq nw "") (setq ww "* ") (setq ee " *") (setq sw "**") (setq ss ?*) (setq se "**")) ((= type 3) (setq nw "**") (setq nn ?*) (setq ne "**") (setq ww "* ") (setq ee " *") (setq sw "**") (setq ss ?*) (setq se "**")) ((= type 4) (setq nw "") (setq ww "X ") (setq ee " X") (setq sw "XX") (setq ss ?X) (setq se "XX")) ((= type 5) (setq nw "XX") (setq nn ?X) (setq ne "XX") (setq ww "X ") (setq ee " X") (setq sw "XX") (setq ss ?X) (setq se "XX")))))) ((= language 200) ;; - planify a comment for C (cond ((= quality 10) ;; - planify a simple C comment (cond ((= type 1) (setq nw "") (setq sw "") (setq ww "/* ") (setq ee " */")) ((= type 2) (setq nw "") (setq ww "/* ") (setq ee " */") (setq sw "/* ") (setq ss ?-) (setq se " */")) ((= type 3) (setq nw "/* ") (setq nn ?-) (setq ne " */") (setq ww "/* ") (setq ee " */") (setq sw "/* ") (setq ss ?-) (setq se " */")) ((= type 4) (setq nw "") (setq ww "/* ") (setq ee " */") (setq sw "/* ") (setq ss ?=) (setq se " */")) ((= type 5) (setq nw "/* ") (setq nn ?=) (setq ne " */") (setq ww "/* ") (setq ee " */") (setq sw "/* ") (setq ss ?=) (setq se " */")))) ((or (= quality 20) (= quality 30)) ;; - planify a rounded C comment (cond ((= type 1) ;; ``open rounded'' is a special case (setq nw "") (setq sw "") (setq ww " ") (setq ee "")) ((= type 2) (setq nw "/*") (setq nn ? ) (setq ne " .") (setq ww "| ") (setq ee " |") (setq sw "`-") (setq ss ?-) (setq se "*/")) ((= type 3) (setq nw "/*") (setq nn ?-) (setq ne "-.") (setq ww "| ") (setq ee " |") (setq sw "`-") (setq ss ?-) (setq se "*/")) ((= type 4) (setq nw "/*" ) (setq nn ? ) (setq ne " \\") (setq ww "| " ) (setq ee " |" ) (setq sw "\\=") (setq ss ?=) (setq se "*/" )) ((= type 5) (setq nw "/*" ) (setq nn ?=) (setq ne "=\\") (setq ww "| " ) (setq ee " |" ) (setq sw "\\=") (setq ss ?=) (setq se "*/" )))) ((= quality 40) ;; - planify a starred C comment (cond ((= type 1) (setq nw "/* ") (setq nn ? ) (setq ne "") (setq ww " * ") (setq ee "") (setq sw " */") (setq ss ? ) (setq se "")) ((= type 2) (setq nw "/* ") (setq nn ? ) (setq ne " *") (setq ww " * ") (setq ee " *") (setq sw " **") (setq ss ?*) (setq se "**/")) ((= type 3) (setq nw "/**") (setq nn ?*) (setq ne "**") (setq ww " * ") (setq ee " *") (setq sw " **") (setq ss ?*) (setq se "**/")) ((= type 4) (setq nw "/* " ) (setq nn ? ) (setq ne " *\\") (setq ww "|* " ) (setq ee " *|" ) (setq sw "\\**") (setq ss ?*) (setq se "**/" )) ((= type 5) (setq nw "/**" ) (setq nn ?*) (setq ne "**\\") (setq ww "|* " ) (setq ee " *|" ) (setq sw "\\**") (setq ss ?*) (setq se "**/" )))))) (t ;; - planify a comment for all other things (if (and (= language 300) (= quality 10)) (setq quality 20)) (setq x (cond ((= language 300) ?/) ((= language 400) ?#) ((= language 500) ?\;) ((= language 600) ?%))) (setq xx (make-string (/ quality 10) x)) (setq ww (concat xx " ")) (cond ((= type 1) (setq nw "") (setq sw "") (setq ee "")) ((= type 2) (setq ee (concat " " xx)) (setq nw "") (setq sw ww) (setq ss ?-) (setq se ee)) ((= type 3) (setq ee (concat " " xx)) (setq nw ww) (setq nn ?-) (setq ne ee) (setq sw ww) (setq ss ?-) (setq se ee)) ((= type 4) (setq ee (concat " " xx)) (setq xx (make-string (1+ (/ quality 10)) x)) (setq nw "") (setq sw xx) (setq ss x) (setq se xx)) ((= type 5) (setq ee (concat " " xx)) (setq xx (make-string (1+ (/ quality 10)) x)) (setq nw xx) (setq nn x) (setq ne xx) (setq sw xx) (setq ss x) (setq se xx))))) ;; - possibly refill, and adjust margins to account for left inserts (if (not (and flag (listp flag))) (let ((fill-prefix (make-string margin ? )) (fill-column (- fill-column (+ (length ww) (length ee))))) (fill-region (point-min) (point-max)))) (setq right-margin (+ (rebox-right-margin) (length ww))) ;; - construct the box comment, from top to bottom (goto-char (point-min)) (if (and (= language 200) (or (= quality 20) (= quality 30)) (= type 1)) (progn ;; - construct an 33 style comment (skip-chars-forward " " (+ (point) margin)) (insert (make-string (- margin (current-column)) ? ) "/* ") (end-of-line) (forward-char 1) (while (not (eobp)) (skip-chars-forward " " (+ (point) margin)) (insert (make-string (- margin (current-column)) ? ) ww) (beginning-of-line) (forward-line 1)) (backward-char 1) (insert " */")) ;; - construct all other comment styles ;; construct one top line (if (not (zerop (length nw))) (progn (indent-to margin) (insert nw) (if (or (not (eq nn ? )) (not (zerop (length ne)))) (insert (make-string (- right-margin (current-column)) nn) ne)) (insert "\n"))) ;; construct one middle line (while (not (eobp)) (skip-chars-forward " " (+ (point) margin)) (insert (make-string (- margin (current-column)) ? ) ww) (end-of-line) (if (not (zerop (length ee))) (progn (indent-to right-margin) (insert ee))) (beginning-of-line) (forward-line 1)) ;; construct one bottom line (if (not (zerop (length sw))) (progn (indent-to margin) (insert sw) (if (or (not (eq ss ? )) (not (zerop (length se)))) (insert (make-string (- right-margin (current-column)) ss) se "\n"))))))) ;;; Add, delete or adjust a comment box in the narrowed buffer. ;;; Various FLAG values are explained at beginning of this file. (defun rebox-engine (flag) (let ((undo-list buffer-undo-list) (marked-point (point-marker)) (language (progn (goto-char (point-min)) (rebox-guess-language))) (quality (* (% (/ rebox-default-style 10) 10) 10)) (type 1)) (untabify (point-min) (point-max)) ;; Remove all the comment marks, and move all the text rigidly ;; to the left to insure the left margin stays at the same ;; place. At the same time, recognize and save the box style in ;; TYPE and box quality in QUALITY. (let ((previous-margin (rebox-left-margin)) actual-margin) ;; FIXME: Cleanup style 1** boxes. ;; FIXME: Cleanup style 241 boxes. ;; FIXME: quality should be deduced instead (if (zerop quality) (setq quality 20)) ;; - remove all comment marks (if (= language 100) nil (goto-char (point-min)) (while (re-search-forward (rebox-regexp-start language) nil t) (replace-match (make-string (- (match-end 1) (match-beginning 1)) ? ) t t)) (goto-char (point-min)) (while (re-search-forward (rebox-regexp-end language) nil t) (replace-match "" t t))) (if (= language 200) (progn (goto-char (point-min)) (while (re-search-forward "\\*/ */\\*" nil t) (replace-match " " t t)) (goto-char (point-min)) (while (re-search-forward "^\\( *\\)|\\*\\(.*\\)\\*| *$" nil t) (setq quality 40) (setq type 5) (replace-match "\\1 \\2" t)) (goto-char (point-min)) (while (re-search-forward "^\\( *\\)\\*\\(.*\\)\\* *$" nil t) (setq quality 40) (setq type 3) (replace-match "\\1 \\2" t)) (goto-char (point-min)) (while (re-search-forward "^\\( *\\)|\\(.*\\)| *$" nil t) (setq quality 20) (replace-match "\\1 \\2" t)))) ;; - remove the first dashed or starred line (goto-char (point-min)) (if (looking-at "^ *\\(--+\\|\\*\\*+\\)[.\+\\]? *\n") (progn (setq type 3) (replace-match "" t t)) (if (looking-at "^ *\\(==\\|XX+\\|##+\\|;;+\\)[.\+\\]? *\n") (progn (setq type 5) (replace-match "" t t)))) ;; - remove the last dashed or starred line (goto-char (point-max)) (previous-line 1) (if (looking-at "^ *[`\+\\]?*--+ *\n") (progn (if (= type 1) (setq type 2)) (replace-match "" t t)) (if (looking-at "^ *[`\+\\]?*\\(==+\\|##+\\|;;+\\) *\n") (progn (if (= type 1) (setq type 4)) (replace-match "" t t)) (if (looking-at "^ *\\*\\*+[.\+\\]? *\n") (progn (setq quality 40) (setq type 2) (replace-match "" t t)) (if (looking-at "^ *XX+[.\+\\]? *\n") (progn (setq quality 40) (setq type 4) (replace-match "" t t)))))) ;; - remove all spurious whitespace (goto-char (point-min)) (while (re-search-forward " +$" nil t) (replace-match "" t t)) (goto-char (point-min)) (if (looking-at "\n+") (replace-match "" t t)) (goto-char (point-max)) (skip-chars-backward "\n") (if (looking-at "\n\n+") (replace-match "\n" t t)) (goto-char (point-min)) (while (re-search-forward "\n\n\n+" nil t) (replace-match "\n\n" t t)) ;; - move the text left is adequate (setq actual-margin (rebox-left-margin)) (if (not (= previous-margin actual-margin)) (indent-rigidly (point-min) (point-max) (- previous-margin actual-margin)))) ;; Override box style according to FLAG. (if (and (numberp flag) (not (zerop (/ flag 100)))) (setq language (* (/ flag 100) 100)) (if (not (zerop (/ rebox-default-style 100))) (setq language (* (/ rebox-default-style 100) 100)))) (if (and (numberp flag) (not (zerop (% (/ flag 10) 10)))) (setq quality (* (% (/ flag 10) 10) 10)) (if (not (zerop (% (/ rebox-default-style 10) 10))) (setq quality (* (% (/ rebox-default-style 10) 10) 10)))) (if (and (numberp flag) (not (zerop (% flag 10)))) (setq type (% flag 10)) (if (not (zerop (% rebox-default-style 10))) (setq type (% rebox-default-style 10)))) ;; Possibly refill, then reconstruct the comment box. (rebox-reconstruct (not (and flag (listp flag))) (rebox-left-margin) language quality type) ;; Retabify to the left only (adapted from tabify.el). (if indent-tabs-mode (progn (goto-char (point-min)) (while (re-search-forward "^[ \t][ \t]+" nil t) (let ((column (current-column)) (indent-tabs-mode t)) (delete-region (match-beginning 0) (point)) (indent-to column))))) ;; Restore the point position. (goto-char (marker-position marked-point)) ;; Remove all intermediate boundaries from the undo list. (if (not (eq buffer-undo-list undo-list)) (let ((cursor buffer-undo-list)) (while (not (eq (cdr cursor) undo-list)) (if (car (cdr cursor)) (setq cursor (cdr cursor)) (rplacd cursor (cdr (cdr cursor))))))))) ;;; Set or reset the Taarna team's own way for a C style. You do not ;;; really want to know about this. (defvar c-mode-taarna-style nil "*Non-nil for Taarna team C-style.") (defun taarna-mode () (interactive) (if c-mode-taarna-style (progn (setq c-mode-taarna-style nil) (setq c-indent-level 2) (setq c-continued-statement-offset 2) (setq c-brace-offset 0) (setq c-argdecl-indent 5) (setq c-label-offset -2) (setq c-tab-always-indent t) (setq rebox-default-style 020) (message "C mode: GNU style")) (setq c-mode-taarna-style t) (setq c-indent-level 4) (setq c-continued-statement-offset 4) (setq c-brace-offset -4) (setq c-argdecl-indent 4) (setq c-label-offset -4) (setq c-tab-always-indent t) (setq rebox-default-style 012) (message "C mode: Taarna style"))) ;;; Rebox the current region. (defun rebox-region (flag) (interactive "P") (if (rebox-validate-flag flag) (save-restriction (narrow-to-region (region-beginning) (region-end)) (rebox-engine flag)))) ;;; Rebox the surrounding comment. (defun rebox-comment (flag) (interactive "P") (if (rebox-validate-flag flag) (save-restriction (rebox-find-and-narrow) (rebox-engine flag)))) tar-1.11.8/config.h.in 644 625 1 16245 5770544405 7462 /* config.h.in. Generated automatically from configure.in by autoheader. */ /* Define if on AIX 3. System headers sometimes define this. We just want to avoid a redefinition error message. */ #ifndef _ALL_SOURCE #undef _ALL_SOURCE #endif /* Define if using alloca.c. */ #undef C_ALLOCA /* Define to empty if the keyword does not work. */ #undef const /* Define to one of _getb67, GETB67, getb67 for Cray-2 and Cray-YMP systems. This function is required for alloca.c support on those systems. */ #undef CRAY_STACKSEG_END /* Define to `int' if doesn't define. */ #undef gid_t /* Define if you have alloca, as a function or macro. */ #undef HAVE_ALLOCA /* Define if you have and it should be used (not on Ultrix). */ #undef HAVE_ALLOCA_H /* Define if you don't have vprintf but do have _doprnt. */ #undef HAVE_DOPRNT /* Define if you have a working `mmap' system call. */ #undef HAVE_MMAP /* Define if your struct stat has st_blksize. */ #undef HAVE_ST_BLKSIZE /* Define if your struct stat has st_blocks. */ #undef HAVE_ST_BLOCKS /* Define if you have the vprintf function. */ #undef HAVE_VPRINTF /* Define as __inline if that's what the C compiler calls it. */ #undef inline /* Define if major, minor, and makedev are declared in . */ #undef MAJOR_IN_MKDEV /* Define if major, minor, and makedev are declared in . */ #undef MAJOR_IN_SYSMACROS /* Define if on MINIX. */ #undef _MINIX /* Define to `long' if doesn't define. */ #undef off_t /* Define if the system does not provide POSIX.1 features except with this defined. */ #undef _POSIX_1_SOURCE /* Define if you need to in order for stat and other things to work. */ #undef _POSIX_SOURCE /* Define as the return type of signal handlers (int or void). */ #undef RETSIGTYPE /* Define to `unsigned' if doesn't define. */ #undef size_t /* If using the C implementation of alloca, define if you know the direction of stack growth for your system; otherwise it will be automatically deduced at run-time. STACK_DIRECTION > 0 => grows toward higher addresses STACK_DIRECTION < 0 => grows toward lower addresses STACK_DIRECTION = 0 => direction of growth unknown */ #undef STACK_DIRECTION /* Define if the `S_IS*' macros in do not work properly. */ #undef STAT_MACROS_BROKEN /* Define if you have the ANSI C header files. */ #undef STDC_HEADERS /* Define if you can safely include both and . */ #undef TIME_WITH_SYS_TIME /* Define to `int' if doesn't define. */ #undef uid_t /* Define to a string giving the full name of the default archive file. */ #undef DEFAULT_ARCHIVE /* Define to a number giving the default blocking size for archives. */ #undef DEFAULT_BLOCKING /* Define to 1 if density may be indicated by [lmh] at end of device. */ #undef DENSITY_LETTER /* Define to a string giving the prefix of the default device, without the part specifying the unit and density. */ #undef DEVICE_PREFIX /* Define to 1 if you lack a 3-argument version of open, and want to emulate it with system calls you do have. */ #undef EMUL_OPEN3 /* Define to 1 if NLS is requested. */ #undef ENABLE_NLS /* Define as 1 if you have catgets and don't want to use GNU gettext. */ #undef HAVE_CATGETS /* Define to 1 if you have getgrgid(3). */ #undef HAVE_GETGRGID /* Define to 1 if you have getpwuid(3). */ #undef HAVE_GETPWUID /* Define as 1 if you have gettext and don't want to use GNU gettext. */ #undef HAVE_GETTEXT /* Define if your locale.h file contains LC_MESSAGES. */ #undef HAVE_LC_MESSAGES /* Define to 1 if you have the valloc function. */ #undef HAVE_VALLOC /* Define to 1 if mknod function is available. */ #undef HAVE_MKNOD /* Define if `union wait' is the type of the first arg to wait functions. */ #undef HAVE_UNION_WAIT /* Define to 1 if utime.h exists and declares struct utimbuf. */ #undef HAVE_UTIME_H /* Define to mt_model (v.g., for DG/UX), else to mt_type. */ #undef MTIO_CHECK_FIELD /* Define to the name of the distribution. */ #undef PACKAGE /* Define to 1 if ANSI function prototypes are usable. */ #undef PROTOTYPES /* Define to the full path of your rsh, if any. */ #undef REMOTE_SHELL /* Path to directory containing system wide message catalog sources. */ #undef STD_INC_PATH /* Define to the version of the distribution. */ #undef VERSION /* Define to 1 for better use of the debugging malloc library. See site ftp.antaire.com in antaire/src, file dmalloc/dmalloc.tar.gz. */ #undef WITH_DMALLOC /* Define to 1 if GNU regex should be used instead of GNU rx. */ #undef WITH_REGEX /* The number of bytes in a unsigned int. */ #undef SIZEOF_UNSIGNED_INT /* The number of bytes in a unsigned short. */ #undef SIZEOF_UNSIGNED_SHORT /* Define if you have the ftime function. */ #undef HAVE_FTIME /* Define if you have the getcwd function. */ #undef HAVE_GETCWD /* Define if you have the isascii function. */ #undef HAVE_ISASCII /* Define if you have the mkfifo function. */ #undef HAVE_MKFIFO /* Define if you have the putenv function. */ #undef HAVE_PUTENV /* Define if you have the setenv function. */ #undef HAVE_SETENV /* Define if you have the setlocale function. */ #undef HAVE_SETLOCALE /* Define if you have the strstr function. */ #undef HAVE_STRSTR /* Define if you have the valloc function. */ #undef HAVE_VALLOC /* Define if you have the header file. */ #undef HAVE_DIRENT_H /* Define if you have the header file. */ #undef HAVE_FCNTL_H /* Define if you have the header file. */ #undef HAVE_LIMITS_H /* Define if you have the header file. */ #undef HAVE_LOCALE_H /* Define if you have the header file. */ #undef HAVE_MEMORY_H /* Define if you have the header file. */ #undef HAVE_NDIR_H /* Define if you have the header file. */ #undef HAVE_NETDB_H /* Define if you have the header file. */ #undef HAVE_NL_TYPES_H /* Define if you have the header file. */ #undef HAVE_STRING_H /* Define if you have the header file. */ #undef HAVE_SYS_DIR_H /* Define if you have the header file. */ #undef HAVE_SYS_GENTAPE_H /* Define if you have the header file. */ #undef HAVE_SYS_IO_TRIOCTL_H /* Define if you have the header file. */ #undef HAVE_SYS_IOCCOM_H /* Define if you have the header file. */ #undef HAVE_SYS_MTIO_H /* Define if you have the header file. */ #undef HAVE_SYS_NDIR_H /* Define if you have the header file. */ #undef HAVE_SYS_PARAM_H /* Define if you have the header file. */ #undef HAVE_SYS_TAPE_H /* Define if you have the header file. */ #undef HAVE_SYS_TIME_H /* Define if you have the header file. */ #undef HAVE_SYS_TIMEB_H /* Define if you have the header file. */ #undef HAVE_SYS_WAIT_H /* Define if you have the header file. */ #undef HAVE_UNISTD_H /* Define if you have the header file. */ #undef HAVE_VALUES_H /* Define if you have the i library (-li). */ #undef HAVE_LIBI /* Define if you have the intl library (-lintl). */ #undef HAVE_LIBINTL tar-1.11.8/configure 755 625 1 303751 5770624311 7362 #! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated automatically using autoconf version 2.3 # Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc. # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. # Defaults: ac_help= ac_default_prefix=/usr/local # Any additions from configure.in: ac_help="$ac_help --with-dmalloc use dmalloc, as in ftp://ftp.letters.com/src/dmalloc/dmalloc.tar.gz" ac_help="$ac_help --with-regex use older regex in lieu of GNU rx for matching" ac_help="$ac_help --disable-nls do not use Native Language Support" ac_help="$ac_help --with-gnu-nls use the GNU NLS library" # Initialize some variables set by options. # The variables have the same names as the options, with # dashes changed to underlines. build=NONE cache_file=./config.cache exec_prefix=NONE host=NONE no_create= nonopt=NONE no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= target=NONE verbose= x_includes=NONE x_libraries=NONE # Initialize some other variables. subdirs= ac_prev= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval "$ac_prev=\$ac_option" ac_prev= continue fi case "$ac_option" in -*=*) ac_optarg=`echo "$ac_option" | sed 's/[-_a-zA-Z0-9]*=//'` ;; *) ac_optarg= ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case "$ac_option" in -build | --build | --buil | --bui | --bu | --b) ac_prev=build ;; -build=* | --build=* | --buil=* | --bui=* | --bu=* | --b=*) build="$ac_optarg" ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file="$ac_optarg" ;; -disable-* | --disable-*) ac_feature=`echo $ac_option|sed -e 's/-*disable-//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_feature| sed 's/[-a-zA-Z0-9_]//g'`"; then { echo "configure: error: $ac_feature: invalid feature name" 1>&2; exit 1; } fi ac_feature=`echo $ac_feature| sed 's/-/_/g'` eval "enable_${ac_feature}=no" ;; -enable-* | --enable-*) ac_feature=`echo $ac_option|sed -e 's/-*enable-//' -e 's/=.*//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_feature| sed 's/[-_a-zA-Z0-9]//g'`"; then { echo "configure: error: $ac_feature: invalid feature name" 1>&2; exit 1; } fi ac_feature=`echo $ac_feature| sed 's/-/_/g'` case "$ac_option" in *=*) ;; *) ac_optarg=yes ;; esac eval "enable_${ac_feature}='$ac_optarg'" ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix="$ac_optarg" ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he) # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat << EOF Usage: configure [options] [host] Options: [defaults in brackets after descriptions] Configuration: --cache-file=FILE cache test results in FILE --help print this message --no-create do not create output files --quiet, --silent do not print \`checking...' messages --version print the version of autoconf that created configure Directory and file names: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=PREFIX install architecture-dependent files in PREFIX [same as prefix] --srcdir=DIR find the sources in DIR [configure dir or ..] --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names Host type: --build=BUILD configure for building on BUILD [BUILD=HOST] --host=HOST configure for HOST [guessed] --target=TARGET configure for TARGET [TARGET=HOST] Features and packages: --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --x-includes=DIR X include files are in DIR --x-libraries=DIR X library files are in DIR --enable and --with options recognized:$ac_help EOF exit 0 ;; -host | --host | --hos | --ho) ac_prev=host ;; -host=* | --host=* | --hos=* | --ho=*) host="$ac_optarg" ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix="$ac_optarg" ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix="$ac_optarg" ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix="$ac_optarg" ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name="$ac_optarg" ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site="$ac_optarg" ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir="$ac_optarg" ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target="$ac_optarg" ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers) echo "configure generated by autoconf version 2.3" exit 0 ;; -with-* | --with-*) ac_package=`echo $ac_option|sed -e 's/-*with-//' -e 's/=.*//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_package| sed 's/[-_a-zA-Z0-9]//g'`"; then { echo "configure: error: $ac_package: invalid package name" 1>&2; exit 1; } fi ac_package=`echo $ac_package| sed 's/-/_/g'` case "$ac_option" in *=*) ;; *) ac_optarg=yes ;; esac eval "with_${ac_package}='$ac_optarg'" ;; -without-* | --without-*) ac_package=`echo $ac_option|sed -e 's/-*without-//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_package| sed 's/[-a-zA-Z0-9_]//g'`"; then { echo "configure: error: $ac_package: invalid package name" 1>&2; exit 1; } fi ac_package=`echo $ac_package| sed 's/-/_/g'` eval "with_${ac_package}=no" ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes="$ac_optarg" ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries="$ac_optarg" ;; -*) { echo "configure: error: $ac_option: invalid option; use --help to show usage" 1>&2; exit 1; } ;; *) if test -n "`echo $ac_option| sed 's/[-a-z0-9.]//g'`"; then echo "configure: warning: $ac_option: invalid host type" 1>&2 fi if test "x$nonopt" != xNONE; then { echo "configure: error: can only configure for one host and one target at a time" 1>&2; exit 1; } fi nonopt="$ac_option" ;; esac done if test -n "$ac_prev"; then { echo "configure: error: missing argument to --`echo $ac_prev | sed 's/_/-/g'`" 1>&2; exit 1; } fi trap 'rm -fr conftest* confdefs* core core.* *.core $ac_clean_files; exit 1' 1 2 15 # File descriptor usage: # 0 standard input # 1 file creation # 2 errors and warnings # 3 some systems may open it to /dev/tty # 4 used on the Kubota Titan # 6 checking for... messages and results # 5 compiler messages saved in config.log if test "$silent" = yes; then exec 6>/dev/null else exec 6>&1 fi exec 5>./config.log echo "\ This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. " 1>&5 # Strip out --no-create and --no-recursion so they do not pile up. # Also quote any args containing shell metacharacters. ac_configure_args= for ac_arg do case "$ac_arg" in -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c) ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) ;; *" "*|*" "*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?]*) ac_configure_args="$ac_configure_args '$ac_arg'" ;; *) ac_configure_args="$ac_configure_args $ac_arg" ;; esac done # NLS nuisances. # Only set LANG and LC_ALL to C if already set. # These must not be set unconditionally because not all systems understand # e.g. LANG=C (notably SCO). if test "${LC_ALL+set}" = set; then LC_ALL=C; export LC_ALL; fi if test "${LANG+set}" = set; then LANG=C; export LANG; fi # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -rf conftest* confdefs.h # AIX cpp loses on an empty file, so make sure it contains at least a newline. echo > confdefs.h # A filename unique to this package, relative to the directory that # configure is in, which we can look for to find out if srcdir is correct. ac_unique_file=src/tar.c # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then its parent. ac_prog=$0 ac_confdir=`echo $ac_prog|sed 's%/[^/][^/]*$%%'` test "x$ac_confdir" = "x$ac_prog" && ac_confdir=. srcdir=$ac_confdir if test ! -r $srcdir/$ac_unique_file; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r $srcdir/$ac_unique_file; then if test "$ac_srcdir_defaulted" = yes; then { echo "configure: error: can not find sources in $ac_confdir or .." 1>&2; exit 1; } else { echo "configure: error: can not find sources in $srcdir" 1>&2; exit 1; } fi fi srcdir=`echo "${srcdir}" | sed 's%\([^/]\)/*$%\1%'` # Prefer explicitly selected file to automatically selected ones. if test -z "$CONFIG_SITE"; then if test "x$prefix" != xNONE; then CONFIG_SITE="$prefix/share/config.site $prefix/etc/config.site" else CONFIG_SITE="$ac_default_prefix/share/config.site $ac_default_prefix/etc/config.site" fi fi for ac_site_file in $CONFIG_SITE; do if test -r "$ac_site_file"; then echo "loading site script $ac_site_file" . "$ac_site_file" fi done if test -r "$cache_file"; then echo "loading cache $cache_file" . $cache_file else echo "creating cache $cache_file" > $cache_file fi ac_ext=c # CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. ac_cpp='$CPP $CPPFLAGS' ac_compile='${CC-cc} -c $CFLAGS $CPPFLAGS conftest.$ac_ext 1>&5 2>&5' ac_link='${CC-cc} -o conftest $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS 1>&5 2>&5' if (echo "testing\c"; echo 1,2,3) | grep c >/dev/null; then # Stardent Vistra SVR4 grep lacks -e, says ghazi@caip.rutgers.edu. if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then ac_n= ac_c=' ' ac_t=' ' else ac_n=-n ac_c= ac_t= fi else ac_n= ac_c='\c' ac_t= fi ac_aux_dir= for ac_dir in $srcdir $srcdir/.. $srcdir/../..; do if test -f $ac_dir/install-sh; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f $ac_dir/install.sh; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break fi done if test -z "$ac_aux_dir"; then { echo "configure: error: can not find install-sh or install.sh in $srcdir $srcdir/.. $srcdir/../.." 1>&2; exit 1; } fi ac_config_guess=$ac_aux_dir/config.guess ac_config_sub=$ac_aux_dir/config.sub ac_configure=$ac_aux_dir/configure # This should be Cygnus configure. # Do some error checking and defaulting for the host and target type. # The inputs are: # configure --host=HOST --target=TARGET --build=BUILD NONOPT # # The rules are: # 1. You are not allowed to specify --host, --target, and nonopt at the # same time. # 2. Host defaults to nonopt. # 3. If nonopt is not specified, then host defaults to the current host, # as determined by config.guess. # 4. Target and build default to nonopt. # 5. If nonopt is not specified, then target and build default to host. # The aliases save the names the user supplied, while $host etc. # will get canonicalized. case $host---$target---$nonopt in NONE---*---* | *---NONE---* | *---*---NONE) ;; *) { echo "configure: error: can only configure for one host and one target at a time" 1>&2; exit 1; } ;; esac # Make sure we can run config.sub. if $ac_config_sub sun4 >/dev/null 2>&1; then : else { echo "configure: error: can not run $ac_config_sub" 1>&2; exit 1; } fi echo $ac_n "checking host system type""... $ac_c" 1>&6 host_alias=$host case "$host_alias" in NONE) case $nonopt in NONE) if host_alias=`$ac_config_guess`; then : else { echo "configure: error: can not guess host type; you must specify one" 1>&2; exit 1; } fi ;; *) host_alias=$nonopt ;; esac ;; esac host=`$ac_config_sub $host_alias` host_cpu=`echo $host | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\1/'` host_vendor=`echo $host | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\2/'` host_os=`echo $host | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\3/'` echo "$ac_t""$host" 1>&6 echo $ac_n "checking target system type""... $ac_c" 1>&6 target_alias=$target case "$target_alias" in NONE) case $nonopt in NONE) target_alias=$host_alias ;; *) target_alias=$nonopt ;; esac ;; esac target=`$ac_config_sub $target_alias` target_cpu=`echo $target | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\1/'` target_vendor=`echo $target | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\2/'` target_os=`echo $target | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\3/'` echo "$ac_t""$target" 1>&6 echo $ac_n "checking build system type""... $ac_c" 1>&6 build_alias=$build case "$build_alias" in NONE) case $nonopt in NONE) build_alias=$host_alias ;; *) build_alias=$nonopt ;; esac ;; esac build=`$ac_config_sub $build_alias` build_cpu=`echo $build | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\1/'` build_vendor=`echo $build | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\2/'` build_os=`echo $build | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\3/'` echo "$ac_t""$build" 1>&6 test "$host_alias" != "$target_alias" && test "$program_prefix$program_suffix$program_transform_name" = \ NONENONEs,x,x, && program_prefix=${target_alias}- if test "$program_transform_name" = s,x,x,; then program_transform_name= else # Double any \ or $. echo 's,\\,\\\\,g; s,\$,$$,g' > conftestsed program_transform_name="`echo $program_transform_name|sed -f conftestsed`" rm -f conftestsed fi test "$program_prefix" != NONE && program_transform_name="s,^,${program_prefix},; $program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s,\$\$,${program_suffix},; $program_transform_name" # sed with no file args requires a program. test "$program_transform_name" = "" && program_transform_name="s,x,x," PACKAGE=tar VERSION=1.11.8 LINGUAS="de fr pt sv" PROGRAMS=tar cat >> confdefs.h <> confdefs.h <&6 if eval "test \"`echo '$''{'ac_cv_prog_CC'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_CC="gcc" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_prog_CC" && ac_cv_prog_CC="cc" fi fi CC="$ac_cv_prog_CC" if test -n "$CC"; then echo "$ac_t""$CC" 1>&6 else echo "$ac_t""no" 1>&6 fi echo $ac_n "checking whether we are using GNU C""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_prog_gcc'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.c <&5 | egrep yes >/dev/null 2>&1; then ac_cv_prog_gcc=yes else ac_cv_prog_gcc=no fi fi echo "$ac_t""$ac_cv_prog_gcc" 1>&6 if test $ac_cv_prog_gcc = yes; then GCC=yes if test "${CFLAGS+set}" != set; then echo $ac_n "checking whether ${CC-cc} accepts -g""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_prog_gcc_g'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else echo 'void f(){}' > conftest.c if test -z "`${CC-cc} -g -c conftest.c 2>&1`"; then ac_cv_prog_gcc_g=yes else ac_cv_prog_gcc_g=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_prog_gcc_g" 1>&6 if test $ac_cv_prog_gcc_g = yes; then CFLAGS="-g -O" else CFLAGS="-O" fi fi else GCC= test "${CFLAGS+set}" = set || CFLAGS="-g" fi echo $ac_n "checking how to run the C preprocessor""... $ac_c" 1>&6 # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if eval "test \"`echo '$''{'ac_cv_prog_CPP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else # This must be in double quotes, not single quotes, because CPP may get # substituted into the Makefile and "${CC-cc}" will confuse make. CPP="${CC-cc} -E" # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. cat > conftest.$ac_ext < Syntax Error EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then : else echo "$ac_err" >&5 rm -rf conftest* CPP="${CC-cc} -E -traditional-cpp" cat > conftest.$ac_ext < Syntax Error EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then : else echo "$ac_err" >&5 rm -rf conftest* CPP=/lib/cpp fi rm -f conftest* fi rm -f conftest* ac_cv_prog_CPP="$CPP" fi fi CPP="$ac_cv_prog_CPP" echo "$ac_t""$CPP" 1>&6 if test $ac_cv_prog_gcc = yes; then echo $ac_n "checking whether ${CC-cc} needs -traditional""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_prog_gcc_traditional'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_pattern="Autoconf.*'x'" cat > conftest.$ac_ext < Autoconf TIOCGETP EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "$ac_pattern" >/dev/null 2>&1; then rm -rf conftest* ac_cv_prog_gcc_traditional=yes else rm -rf conftest* ac_cv_prog_gcc_traditional=no fi rm -f conftest* if test $ac_cv_prog_gcc_traditional = no; then cat > conftest.$ac_ext < Autoconf TCGETA EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "$ac_pattern" >/dev/null 2>&1; then rm -rf conftest* ac_cv_prog_gcc_traditional=yes fi rm -f conftest* fi fi echo "$ac_t""$ac_cv_prog_gcc_traditional" 1>&6 if test $ac_cv_prog_gcc_traditional = yes; then CC="$CC -traditional" fi fi # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # ./install, which can be erroneously created by make from ./install.sh. echo $ac_n "checking for a BSD compatible install""... $ac_c" 1>&6 if test -z "$INSTALL"; then if eval "test \"`echo '$''{'ac_cv_path_install'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do # Account for people who put trailing slashes in PATH elements. case "$ac_dir/" in /|./|.//|/etc/*|/usr/sbin/*|/usr/etc/*|/sbin/*|/usr/afsws/bin/*|/usr/ucb/*) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. for ac_prog in ginstall installbsd scoinst install; do if test -f $ac_dir/$ac_prog; then if test $ac_prog = install && grep dspmsg $ac_dir/$ac_prog >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. # OSF/1 installbsd also uses dspmsg, but is usable. : else ac_cv_path_install="$ac_dir/$ac_prog -c" break 2 fi fi done ;; esac done IFS="$ac_save_ifs" # As a last resort, use the slow shell script. test -z "$ac_cv_path_install" && ac_cv_path_install="$ac_install_sh" fi INSTALL="$ac_cv_path_install" fi echo "$ac_t""$INSTALL" 1>&6 # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' echo $ac_n "checking whether ${MAKE-make} sets \${MAKE}""... $ac_c" 1>&6 set dummy ${MAKE-make}; ac_make=$2 if eval "test \"`echo '$''{'ac_cv_prog_make_${ac_make}_set'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftestmake <<\EOF all: @echo 'ac_maketemp="${MAKE}"' EOF # GNU make sometimes prints "make[1]: Entering...", which would confuse us. eval `${MAKE-make} -f conftestmake 2>/dev/null | grep temp=` if test -n "$ac_maketemp"; then eval ac_cv_prog_make_${ac_make}_set=yes else eval ac_cv_prog_make_${ac_make}_set=no fi rm -f conftestmake fi if eval "test \"`echo '$ac_cv_prog_make_'${ac_make}_set`\" = yes"; then echo "$ac_t""yes" 1>&6 SET_MAKE= else echo "$ac_t""no" 1>&6 SET_MAKE="MAKE=${MAKE-make}" fi # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_prog_RANLIB'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_RANLIB="ranlib" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_prog_RANLIB" && ac_cv_prog_RANLIB=":" fi fi RANLIB="$ac_cv_prog_RANLIB" if test -n "$RANLIB"; then echo "$ac_t""$RANLIB" 1>&6 else echo "$ac_t""no" 1>&6 fi for ac_prog in 'bison -y' byacc do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_prog_YACC'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$YACC"; then ac_cv_prog_YACC="$YACC" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_YACC="$ac_prog" break fi done IFS="$ac_save_ifs" fi fi YACC="$ac_cv_prog_YACC" if test -n "$YACC"; then echo "$ac_t""$YACC" 1>&6 else echo "$ac_t""no" 1>&6 fi test -n "$YACC" && break done test -n "$YACC" || YACC="yacc" echo $ac_n "checking for AIX""... $ac_c" 1>&6 cat > conftest.$ac_ext <&5 | egrep "yes" >/dev/null 2>&1; then rm -rf conftest* echo "$ac_t""yes" 1>&6; cat >> confdefs.h <<\EOF #define _ALL_SOURCE 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&6 fi rm -f conftest* echo $ac_n "checking for POSIXized ISC""... $ac_c" 1>&6 if test -d /etc/conf/kconfig.d && grep _POSIX_VERSION /usr/include/sys/unistd.h >/dev/null 2>&1 then echo "$ac_t""yes" 1>&6 ISC=yes # If later tests want to check for ISC. cat >> confdefs.h <<\EOF #define _POSIX_SOURCE 1 EOF if test "$GCC" = yes; then CC="$CC -posix" else CC="$CC -Xp" fi else echo "$ac_t""no" 1>&6 ISC= fi ac_safe=`echo "minix/config.h" | tr './\055' '___'` echo $ac_n "checking for minix/config.h""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 MINIX=yes else echo "$ac_t""no" 1>&6 MINIX= fi if test "$MINIX" = yes; then cat >> confdefs.h <<\EOF #define _POSIX_SOURCE 1 EOF cat >> confdefs.h <<\EOF #define _POSIX_1_SOURCE 2 EOF cat >> confdefs.h <<\EOF #define _MINIX 1 EOF fi echo $ac_n "checking for ${CC-cc} option to accept ANSI C""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_prog_cc_stdc'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_cv_prog_cc_stdc=no ac_save_CFLAGS="$CFLAGS" # Don't try gcc -ansi; that turns off useful extensions and # breaks some systems' header files. # AIX -qlanglvl=ansi # Ultrix and OSF/1 -std1 # HP-UX -Aa -D_HPUX_SOURCE # SVR4 -Xc for ac_arg in "" -qlanglvl=ansi -std1 "-Aa -D_HPUX_SOURCE" -Xc do CFLAGS="$ac_save_CFLAGS $ac_arg" cat > conftest.$ac_ext <&6 case "x$ac_cv_prog_cc_stdc" in x|xno) ;; *) CC="$CC $ac_cv_prog_cc_stdc" ;; esac echo $ac_n "checking for function prototypes""... $ac_c" 1>&6 if test "$ac_cv_prog_cc_stdc" != no; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define PROTOTYPES 1 EOF U= ANSI2KNR= else echo "$ac_t""no" 1>&6 U=_ ANSI2KNR=ansi2knr fi echo $ac_n "checking for working const""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_c_const'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; } ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_c_const=yes else rm -rf conftest* ac_cv_c_const=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_c_const" 1>&6 if test $ac_cv_c_const = no; then cat >> confdefs.h <<\EOF #define const EOF fi for ac_hdr in fcntl.h limits.h memory.h string.h \ sys/gentape.h sys/io/trioctl.h sys/ioccom.h sys/mtio.h sys/param.h \ sys/tape.h sys/time.h sys/timeb.h sys/wait.h unistd.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&6 fi done echo $ac_n "checking for utime.h""... $ac_c" 1>&6 cat > conftest.$ac_ext < #include int main() { return 0; } int t() { struct utimbuf foo ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* echo "$ac_t""yes" 1>&6; cat >> confdefs.h <<\EOF #define HAVE_UTIME_H 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&6 fi rm -f conftest* if test "$ac_cv_header_sys_mtio_h" = yes; then echo $ac_n "checking for remote tape header files""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_rmt'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* ac_cv_header_rmt=yes else echo "$ac_err" >&5 rm -rf conftest* ac_cv_header_rmt=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_header_rmt" 1>&6 test $ac_cv_header_rmt = yes && PROGRAMS="$PROGRAMS rmt" fi echo $ac_n "checking for getgrgid declaration""... $ac_c" 1>&6 cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "getgrgid" >/dev/null 2>&1; then rm -rf conftest* echo "$ac_t""yes" 1>&6; cat >> confdefs.h <<\EOF #define HAVE_GETGRGID 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&6 fi rm -f conftest* echo $ac_n "checking for getpwuid declaration""... $ac_c" 1>&6 cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "getpwuid" >/dev/null 2>&1; then rm -rf conftest* echo "$ac_t""yes" 1>&6; cat >> confdefs.h <<\EOF #define HAVE_GETPWUID 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&6 fi rm -f conftest* echo $ac_n "checking which field to test for reversed bytes in remote ioctl""... $ac_c" 1>&6 cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "mt_model" >/dev/null 2>&1; then rm -rf conftest* field=mt_model else rm -rf conftest* field=mt_type fi rm -f conftest* echo "$ac_t""$field" 1>&6 cat >> confdefs.h <&6 if eval "test \"`echo '$''{'ac_cv_header_dirent_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include <$ac_hdr> int main() { return 0; } int t() { DIR *dirp = 0; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* eval "ac_cv_header_dirent_$ac_safe=yes" else rm -rf conftest* eval "ac_cv_header_dirent_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_dirent_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&6 fi done # Two versions of opendir et al. are in -ldir and -lx on SCO Xenix. if test $ac_header_dirent = dirent.h; then echo $ac_n "checking for -ldir""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_lib_dir'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-ldir $LIBS" cat > conftest.$ac_ext <&6 LIBS="$LIBS -ldir" else echo "$ac_t""no" 1>&6 fi else echo $ac_n "checking for -lx""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_lib_x'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lx $LIBS" cat > conftest.$ac_ext <&6 LIBS="$LIBS -lx" else echo "$ac_t""no" 1>&6 fi fi echo $ac_n "checking whether sys/types.h defines makedev""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_sys_types_h_makedev'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { return 0; } int t() { return makedev(0, 0); ; return 0; } EOF if eval $ac_link; then rm -rf conftest* ac_cv_header_sys_types_h_makedev=yes else rm -rf conftest* ac_cv_header_sys_types_h_makedev=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_header_sys_types_h_makedev" 1>&6 if test $ac_cv_header_sys_types_h_makedev = no; then ac_safe=`echo "sys/mkdev.h" | tr './\055' '___'` echo $ac_n "checking for sys/mkdev.h""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define MAJOR_IN_MKDEV 1 EOF else echo "$ac_t""no" 1>&6 fi if test $ac_cv_header_sys_mkdev_h = no; then ac_safe=`echo "sys/sysmacros.h" | tr './\055' '___'` echo $ac_n "checking for sys/sysmacros.h""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define MAJOR_IN_SYSMACROS 1 EOF else echo "$ac_t""no" 1>&6 fi fi fi echo $ac_n "checking whether stat file-mode macros are broken""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_stat_broken'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include #if defined(S_ISBLK) && defined(S_IFDIR) # if S_ISBLK (S_IFDIR) You lose. # endif #endif #if defined(S_ISBLK) && defined(S_IFCHR) # if S_ISBLK (S_IFCHR) You lose. # endif #endif #if defined(S_ISLNK) && defined(S_IFREG) # if S_ISLNK (S_IFREG) You lose. # endif #endif #if defined(S_ISSOCK) && defined(S_IFREG) # if S_ISSOCK (S_IFREG) You lose. # endif #endif EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "You lose" >/dev/null 2>&1; then rm -rf conftest* ac_cv_header_stat_broken=yes else rm -rf conftest* ac_cv_header_stat_broken=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_header_stat_broken" 1>&6 if test $ac_cv_header_stat_broken = yes; then cat >> confdefs.h <<\EOF #define STAT_MACROS_BROKEN 1 EOF fi # If we cannot run a trivial program, we must be cross compiling. echo $ac_n "checking whether cross-compiling""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_c_cross'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then ac_cv_c_cross=yes else cat > conftest.$ac_ext </dev/null; then ac_cv_c_cross=no else ac_cv_c_cross=yes fi fi rm -fr conftest* fi cross_compiling=$ac_cv_c_cross echo "$ac_t""$ac_cv_c_cross" 1>&6 echo $ac_n "checking for ANSI C header files""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_stdc'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include #include #include EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* ac_cv_header_stdc=yes else echo "$ac_err" >&5 rm -rf conftest* ac_cv_header_stdc=no fi rm -f conftest* if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "memchr" >/dev/null 2>&1; then : else rm -rf conftest* ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "free" >/dev/null 2>&1; then : else rm -rf conftest* ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then ac_cv_header_stdc=no else cat > conftest.$ac_ext < #define ISLOWER(c) ('a' <= (c) && (c) <= 'z') #define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) exit(2); exit (0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then : else ac_cv_header_stdc=no fi fi rm -fr conftest* fi fi echo "$ac_t""$ac_cv_header_stdc" 1>&6 if test $ac_cv_header_stdc = yes; then cat >> confdefs.h <<\EOF #define STDC_HEADERS 1 EOF fi echo $ac_n "checking whether time.h and sys/time.h may both be included""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_time'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include #include int main() { return 0; } int t() { struct tm *tp; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_header_time=yes else rm -rf conftest* ac_cv_header_time=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_header_time" 1>&6 if test $ac_cv_header_time = yes; then cat >> confdefs.h <<\EOF #define TIME_WITH_SYS_TIME 1 EOF fi echo $ac_n "checking for st_blksize in struct stat""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_struct_st_blksize'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include int main() { return 0; } int t() { struct stat s; s.st_blksize; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_struct_st_blksize=yes else rm -rf conftest* ac_cv_struct_st_blksize=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_struct_st_blksize" 1>&6 if test $ac_cv_struct_st_blksize = yes; then cat >> confdefs.h <<\EOF #define HAVE_ST_BLKSIZE 1 EOF fi echo $ac_n "checking for st_blocks in struct stat""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_struct_st_blocks'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include int main() { return 0; } int t() { struct stat s; s.st_blocks; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_struct_st_blocks=yes else rm -rf conftest* ac_cv_struct_st_blocks=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_struct_st_blocks" 1>&6 if test $ac_cv_struct_st_blocks = yes; then cat >> confdefs.h <<\EOF #define HAVE_ST_BLOCKS 1 EOF else LIBOBJS="$LIBOBJS fileblocks.o" fi echo $ac_n "checking return type of signal handlers""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_type_signal'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include #ifdef signal #undef signal #endif #ifdef __cplusplus extern "C" #endif void (*signal ()) (); int main() { return 0; } int t() { int i; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_type_signal=void else rm -rf conftest* ac_cv_type_signal=int fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_signal" 1>&6 cat >> confdefs.h <&6 if eval "test \"`echo '$''{'ac_cv_type_size_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #if STDC_HEADERS #include #endif EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "size_t" >/dev/null 2>&1; then rm -rf conftest* ac_cv_type_size_t=yes else rm -rf conftest* ac_cv_type_size_t=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_size_t" 1>&6 if test $ac_cv_type_size_t = no; then cat >> confdefs.h <<\EOF #define size_t unsigned EOF fi echo $ac_n "checking for uid_t in sys/types.h""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_type_uid_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "uid_t" >/dev/null 2>&1; then rm -rf conftest* ac_cv_type_uid_t=yes else rm -rf conftest* ac_cv_type_uid_t=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_uid_t" 1>&6 if test $ac_cv_type_uid_t = no; then cat >> confdefs.h <<\EOF #define uid_t int EOF cat >> confdefs.h <<\EOF #define gid_t int EOF fi for ac_func in ftime getcwd isascii mkfifo strstr do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&6 fi done echo $ac_n "checking for mknod""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_mknod'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { return 0; } int t() { mknod (0, 0, 0) ; return 0; } EOF if eval $ac_link; then rm -rf conftest* ac_cv_func_mknod=yes else rm -rf conftest* ac_cv_func_mknod=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_func_mknod" 1>&6 test $ac_cv_func_mknod = yes && cat >> confdefs.h <<\EOF #define HAVE_MKNOD 1 EOF # # If -lnsl has gethostname() defined, and/or if -lsocket has an # undefined reference to gethostname(), then we need both -lsocket # and -lnsl. Ideally, -lsocket and -lnsl should be tested both # at once, we rather test -lsocket after -lnsl. Other ideas for # -lsocket: socket or ntohl. For -lnsl: t_open or dial. # echo $ac_n "checking for -linet""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_lib_inet'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-linet $LIBS" cat > conftest.$ac_ext <&6 LIBS="$LIBS -linet" else echo "$ac_t""no" 1>&6 fi echo $ac_n "checking for -lnsl""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_lib_nsl'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lnsl $LIBS" cat > conftest.$ac_ext <&6 LIBS="$LIBS -lnsl" else echo "$ac_t""no" 1>&6 fi echo $ac_n "checking for -lsocket""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_lib_socket'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lsocket $LIBS" cat > conftest.$ac_ext <&6 LIBS="$LIBS -lsocket" else echo "$ac_t""no" 1>&6 fi # # The Ultrix 4.2 mips builtin alloca declared by alloca.h only works # for constant arguments. Useless! echo $ac_n "checking for working alloca.h""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_alloca_h'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { return 0; } int t() { char *p = alloca(2 * sizeof(int)); ; return 0; } EOF if eval $ac_link; then rm -rf conftest* ac_cv_header_alloca_h=yes else rm -rf conftest* ac_cv_header_alloca_h=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_header_alloca_h" 1>&6 if test $ac_cv_header_alloca_h = yes; then cat >> confdefs.h <<\EOF #define HAVE_ALLOCA_H 1 EOF fi echo $ac_n "checking for alloca""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_alloca'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < # else # ifdef _AIX #pragma alloca # else # ifndef alloca /* predefined by HP cc +Olibcalls */ char *alloca (); # endif # endif # endif #endif int main() { return 0; } int t() { char *p = (char *) alloca(1); ; return 0; } EOF if eval $ac_link; then rm -rf conftest* ac_cv_func_alloca=yes else rm -rf conftest* ac_cv_func_alloca=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_func_alloca" 1>&6 if test $ac_cv_func_alloca = yes; then cat >> confdefs.h <<\EOF #define HAVE_ALLOCA 1 EOF fi if test $ac_cv_func_alloca = no; then # The SVR3 libPW and SVR4 libucb both contain incompatible functions # that cause trouble. Some versions do not even contain alloca or # contain a buggy version. If you still want to use their alloca, # use ar to extract alloca.o from them instead of compiling alloca.c. ALLOCA=alloca.o cat >> confdefs.h <<\EOF #define C_ALLOCA 1 EOF echo $ac_n "checking whether alloca needs Cray hooks""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_os_cray'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5 | egrep "webecray" >/dev/null 2>&1; then rm -rf conftest* ac_cv_os_cray=yes else rm -rf conftest* ac_cv_os_cray=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_os_cray" 1>&6 if test $ac_cv_os_cray = yes; then for ac_func in _getb67 GETB67 getb67; do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <&6 fi done fi echo $ac_n "checking stack direction for C alloca""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_c_stack_direction'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then ac_cv_c_stack_direction=0 else cat > conftest.$ac_ext < addr) ? 1 : -1; } main () { exit (find_stack_direction() < 0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_c_stack_direction=1 else ac_cv_c_stack_direction=-1 fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_c_stack_direction" 1>&6 cat >> confdefs.h <&6 if eval "test \"`echo '$''{'ac_cv_func_vprintf'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char vprintf(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_vprintf) || defined (__stub___vprintf) choke me #else vprintf(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_vprintf=yes" else rm -rf conftest* eval "ac_cv_func_vprintf=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'vprintf`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define HAVE_VPRINTF 1 EOF else echo "$ac_t""no" 1>&6 fi if test "$ac_cv_func_vprintf" != yes; then echo $ac_n "checking for _doprnt""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func__doprnt'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char _doprnt(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub__doprnt) || defined (__stub____doprnt) choke me #else _doprnt(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func__doprnt=yes" else rm -rf conftest* eval "ac_cv_func__doprnt=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'_doprnt`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define HAVE_DOPRNT 1 EOF else echo "$ac_t""no" 1>&6 fi fi for ac_func in fnmatch ftruncate memset mkdir rename rmdir do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 : else echo "$ac_t""no" 1>&6 LIBOBJS="$LIBOBJS ${ac_func}.o" fi done test "$ac_cv_func_strstr" = yes || LIBOBJS="$LIBOBJS strstr.o" echo $ac_n "checking for HP-UX needing gmalloc""... $ac_c" 1>&6 if test "`(uname -s) 2> /dev/null`" = 'HP-UX'; then echo "$ac_t""yes" 1>&6 LIBOBJS="$LIBOBJS gmalloc.o" cat >> confdefs.h <<\EOF #define HAVE_VALLOC 1 EOF else echo "$ac_t""no" 1>&6 for ac_func in valloc do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&6 fi done fi # The 3-argument open happens to go along with the O_* defines, which # are easier to check for. echo $ac_n "checking for 3-argument open""... $ac_c" 1>&6 cat > conftest.$ac_ext < #else #include #endif int main() { return 0; } int t() { int x = O_RDONLY ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* echo "$ac_t""yes" 1>&6 else rm -rf conftest* echo "$ac_t""no" 1>&6; cat >> confdefs.h <<\EOF #define EMUL_OPEN3 1 EOF fi rm -f conftest* echo $ac_n "checking for union wait""... $ac_c" 1>&6 cat > conftest.$ac_ext < #include int main() { return 0; } int t() { union wait status; int pid; pid = wait (&status); #ifdef WEXITSTATUS /* Some POSIXoid systems have both the new-style macros and the old union wait type, and they do not work together. If union wait conflicts with WEXITSTATUS et al, we don't want to use it at all. */ if (WEXITSTATUS (status) != 0) pid = -1; #endif ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* echo "$ac_t""yes" 1>&6; cat >> confdefs.h <<\EOF #define HAVE_UNION_WAIT 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&6 fi rm -f conftest* echo $ac_n "checking for remote shell""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_RSH'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$RSH"; then ac_cv_path_RSH=$RSH else ac_cv_path_RSH=no for ac_file in \ /usr/ucb/rsh /usr/bin/remsh /usr/bin/rsh /usr/bsd/rsh /usr/bin/nsh do if test -f $ac_file; then ac_cv_path_RSH=$ac_file break fi done fi fi echo "$ac_t""$ac_cv_path_RSH" 1>&6 if test $ac_cv_path_RSH = no; then for ac_hdr in netdb.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&6 fi done else cat >> confdefs.h <&6 if test -z "$DEFAULT_ARCHIVE"; then DEFAULT_ARCHIVE=- else if test -z "`ls $DEFAULT_ARCHIVE 2>/dev/null`"; then echo "configure: warning: DEFAULT_ARCHIVE \`$DEFAULT_ARCHIVE' not found on this system" 1>&2 fi # Look for DEFTAPE in . Rearrange, here. FIXME. case $DEFAULT_ARCHIVE in *[0-7][lmh]) device_prefix=`echo $DEFAULT_ARCHIVE | sed 's/[0-7][lmh]$//'` cat >> confdefs.h <> confdefs.h <<\EOF #define DENSITY_LETTER 1 EOF ;; *[0-7]) device_prefix=`echo $DEFAULT_ARCHIVE | sed 's/[0-7]$//'` cat >> confdefs.h <> confdefs.h <&6 echo $ac_n "checking for default blocking""... $ac_c" 1>&6 DEFAULT_BLOCKING=${DEFAULT_BLOCKING-20} cat >> confdefs.h <&6 echo $ac_n "checking if malloc debugging is wanted""... $ac_c" 1>&6 # Check whether --with-dmalloc or --without-dmalloc was given. withval="$with_dmalloc" if test -n "$withval"; then if test "$withval" = yes; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define WITH_DMALLOC 1 EOF LIBS="$LIBS -ldmalloc" LDFLAGS="$LDFLAGS -g" else echo "$ac_t""no" 1>&6 fi else echo "$ac_t""no" 1>&6 fi echo $ac_n "checking which of rx or regex is wanted""... $ac_c" 1>&6 # Check whether --with-regex or --without-regex was given. withval="$with_regex" if test -n "$withval"; then if test "$withval" = yes; then ac_with_regex=1 echo "$ac_t""regex" 1>&6 cat >> confdefs.h <<\EOF #define WITH_REGEX 1 EOF LIBOBJS="$LIBOBJS regex.o" fi fi if test -z "$ac_with_regex"; then echo "$ac_t""rx" 1>&6 echo $ac_n "checking for re_rx_search""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_re_rx_search'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char re_rx_search(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_re_rx_search) || defined (__stub___re_rx_search) choke me #else re_rx_search(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_re_rx_search=yes" else rm -rf conftest* eval "ac_cv_func_re_rx_search=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'re_rx_search`\" = yes"; then echo "$ac_t""yes" 1>&6 : else echo "$ac_t""no" 1>&6 LIBOBJS="$LIBOBJS rx.o" fi fi # ---------------------- # Beginning of NLS block. # for ac_hdr in locale.h nl_types.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&6 fi done for ac_func in setlocale do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&6 fi done if test $ac_cv_header_locale_h = yes; then echo $ac_n "checking for LC_MESSAGES""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ud_cv_val_LC_MESSAGES'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { return 0; } int t() { return LC_MESSAGES ; return 0; } EOF if eval $ac_link; then rm -rf conftest* ud_cv_val_LC_MESSAGES=yes else rm -rf conftest* ud_cv_val_LC_MESSAGES=no fi rm -f conftest* fi echo "$ac_t""$ud_cv_val_LC_MESSAGES" 1>&6 if test $ud_cv_val_LC_MESSAGES = yes; then cat >> confdefs.h <<\EOF #define HAVE_LC_MESSAGES 1 EOF fi fi echo $ac_n "checking whether NLS is requested""... $ac_c" 1>&6 # Check whether --enable-nls or --disable-nls was given. enableval="$enable_nls" if test -n "$enableval"; then nls_cv_use_nls=$enableval else nls_cv_use_nls=yes fi echo "$ac_t""$nls_cv_use_nls" 1>&6 if test "$nls_cv_use_nls" = "yes"; then cat >> confdefs.h <<\EOF #define ENABLE_NLS 1 EOF echo $ac_n "checking for explicitly using GNU gettext""... $ac_c" 1>&6 # Check whether --with-gnu-nls or --without-gnu-nls was given. withval="$with_gnu_nls" if test -n "$withval"; then nls_cv_force_use_gnu_nls=$withval else nls_cv_force_use_gnu_nls=no fi echo "$ac_t""$nls_cv_force_use_gnu_nls" 1>&6 if test "$nls_cv_force_use_gnu_nls" = "yes"; then nls_cv_use_gnu_nls=yes else echo $ac_n "checking for -lintl""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_lib_intl'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lintl $LIBS" cat > conftest.$ac_ext <&6 ac_tr_lib=HAVE_LIB`echo intl | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&6 fi echo $ac_n "checking for -li""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_lib_i'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-li $LIBS" cat > conftest.$ac_ext <&6 ac_tr_lib=HAVE_LIB`echo i | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&6 fi echo $ac_n "checking for gettext""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_gettext'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char gettext(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_gettext) || defined (__stub___gettext) choke me #else gettext(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_gettext=yes" else rm -rf conftest* eval "ac_cv_func_gettext=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'gettext`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define HAVE_GETTEXT 1 EOF # Extract the first word of "msgfmt", so it can be a program name with args. set dummy msgfmt; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_MSGFMT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$MSGFMT" in /*) ac_cv_path_MSGFMT="$MSGFMT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_MSGFMT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_path_MSGFMT" && ac_cv_path_MSGFMT="msgfmt" ;; esac fi MSGFMT="$ac_cv_path_MSGFMT" if test -n "$MSGFMT"; then echo "$ac_t""$MSGFMT" 1>&6 else echo "$ac_t""no" 1>&6 fi # Extract the first word of "gmsgfmt", so it can be a program name with args. set dummy gmsgfmt; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_GMSGFMT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$GMSGFMT" in /*) ac_cv_path_GMSGFMT="$GMSGFMT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_GMSGFMT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_path_GMSGFMT" && ac_cv_path_GMSGFMT="$MSGFMT" ;; esac fi GMSGFMT="$ac_cv_path_GMSGFMT" if test -n "$GMSGFMT"; then echo "$ac_t""$GMSGFMT" 1>&6 else echo "$ac_t""no" 1>&6 fi # Extract the first word of "xgettext", so it can be a program name with args. set dummy xgettext; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_XGETTEXT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$XGETTEXT" in /*) ac_cv_path_XGETTEXT="$XGETTEXT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_XGETTEXT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_path_XGETTEXT" && ac_cv_path_XGETTEXT="xgettext" ;; esac fi XGETTEXT="$ac_cv_path_XGETTEXT" if test -n "$XGETTEXT"; then echo "$ac_t""$XGETTEXT" 1>&6 else echo "$ac_t""no" 1>&6 fi INTLOBJS="\$(GETTOBJS)" CATOBJEXT=.mo DATADIRNAME=lib else echo "$ac_t""no" 1>&6 echo $ac_n "checking for catgets""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_catgets'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char catgets(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_catgets) || defined (__stub___catgets) choke me #else catgets(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_catgets=yes" else rm -rf conftest* eval "ac_cv_func_catgets=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'catgets`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define HAVE_CATGETS 1 EOF INTLOBJS="\$(CATOBJS)" # Extract the first word of "gencat", so it can be a program name with args. set dummy gencat; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_GENCAT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$GENCAT" in /*) ac_cv_path_GENCAT="$GENCAT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_GENCAT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_path_GENCAT" && ac_cv_path_GENCAT="echo gencat" ;; esac fi GENCAT="$ac_cv_path_GENCAT" if test -n "$GENCAT"; then echo "$ac_t""$GENCAT" 1>&6 else echo "$ac_t""no" 1>&6 fi for ac_prog in gmsgfmt msgfmt do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_GMSGFMT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$GMSGFMT" in /*) ac_cv_path_GMSGFMT="$GMSGFMT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_GMSGFMT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" ;; esac fi GMSGFMT="$ac_cv_path_GMSGFMT" if test -n "$GMSGFMT"; then echo "$ac_t""$GMSGFMT" 1>&6 else echo "$ac_t""no" 1>&6 fi test -n "$GMSGFMT" && break done test -n "$GMSGFMT" || GMSGFMT="msgfmt" # Extract the first word of "xgettext", so it can be a program name with args. set dummy xgettext; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_XGETTEXT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$XGETTEXT" in /*) ac_cv_path_XGETTEXT="$XGETTEXT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_XGETTEXT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_path_XGETTEXT" && ac_cv_path_XGETTEXT="xgettext" ;; esac fi XGETTEXT="$ac_cv_path_XGETTEXT" if test -n "$XGETTEXT"; then echo "$ac_t""$XGETTEXT" 1>&6 else echo "$ac_t""no" 1>&6 fi CATOBJEXT=.cat DATADIRNAME=lib INTLDEPS="../intl/libintl.a" INTLLIBS=$INTLDEPS nls_cv_header_intl=intl/libintl.h nls_cv_header_libgt=intl/libgettext.h else echo "$ac_t""no" 1>&6 echo "$ac_t""using GNU gettext" 1>&6 nls_cv_use_gnu_nls=yes fi fi fi if test "$nls_cv_use_gnu_nls" = "yes"; then INTLOBJS="\$(GETTOBJS)" # Extract the first word of "msgfmt", so it can be a program name with args. set dummy msgfmt; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_MSGFMT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$MSGFMT" in /*) ac_cv_path_MSGFMT="$MSGFMT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_MSGFMT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_path_MSGFMT" && ac_cv_path_MSGFMT="msgfmt" ;; esac fi MSGFMT="$ac_cv_path_MSGFMT" if test -n "$MSGFMT"; then echo "$ac_t""$MSGFMT" 1>&6 else echo "$ac_t""no" 1>&6 fi # Extract the first word of "gmsgfmt", so it can be a program name with args. set dummy gmsgfmt; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_GMSGFMT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$GMSGFMT" in /*) ac_cv_path_GMSGFMT="$GMSGFMT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_GMSGFMT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_path_GMSGFMT" && ac_cv_path_GMSGFMT="$MSGFMT" ;; esac fi GMSGFMT="$ac_cv_path_GMSGFMT" if test -n "$GMSGFMT"; then echo "$ac_t""$GMSGFMT" 1>&6 else echo "$ac_t""no" 1>&6 fi # Extract the first word of "xgettext", so it can be a program name with args. set dummy xgettext; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_path_XGETTEXT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else case "$XGETTEXT" in /*) ac_cv_path_XGETTEXT="$XGETTEXT" # Let the user override the test with a path. ;; *) IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_path_XGETTEXT="$ac_dir/$ac_word" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_path_XGETTEXT" && ac_cv_path_XGETTEXT="xgettext" ;; esac fi XGETTEXT="$ac_cv_path_XGETTEXT" if test -n "$XGETTEXT"; then echo "$ac_t""$XGETTEXT" 1>&6 else echo "$ac_t""no" 1>&6 fi CATOBJEXT=.gmo DATADIRNAME=share INTLDEPS="../intl/libintl.a" INTLLIBS=$INTLDEPS nls_cv_header_intl=intl/libintl.h nls_cv_header_libgt=intl/libgettext.h fi # We need to process the intl/ directory INTLSUB=intl fi if test -n "$CATOBJEXT"; then for lang in $LINGUAS; do CATALOGS="$CATALOGS $lang$CATOBJEXT"; done fi if test "x$prefix" = xNONE; then cat >> confdefs.h <> confdefs.h <&6 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&6 fi done echo $ac_n "checking for inline""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_c_inline'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_cv_c_inline=no for ac_kw in inline __inline__ __inline; do cat > conftest.$ac_ext <&6 case "$ac_cv_c_inline" in inline | yes) ;; no) cat >> confdefs.h <<\EOF #define inline EOF ;; *) cat >> confdefs.h <&6 if eval "test \"`echo '$''{'ac_cv_type_off_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #if STDC_HEADERS #include #endif EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "off_t" >/dev/null 2>&1; then rm -rf conftest* ac_cv_type_off_t=yes else rm -rf conftest* ac_cv_type_off_t=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_off_t" 1>&6 if test $ac_cv_type_off_t = no; then cat >> confdefs.h <<\EOF #define off_t long EOF fi echo $ac_n "checking size of unsigned short""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_sizeof_unsigned_short'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main() { FILE *f=fopen("conftestval", "w"); if (!f) exit(1); fprintf(f, "%d\n", sizeof(unsigned short)); exit(0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_sizeof_unsigned_short=`cat conftestval` else ac_cv_sizeof_unsigned_short=0 fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_sizeof_unsigned_short" 1>&6 cat >> confdefs.h <&6 if eval "test \"`echo '$''{'ac_cv_sizeof_unsigned_int'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main() { FILE *f=fopen("conftestval", "w"); if (!f) exit(1); fprintf(f, "%d\n", sizeof(unsigned int)); exit(0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_sizeof_unsigned_int=`cat conftestval` else ac_cv_sizeof_unsigned_int=0 fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_sizeof_unsigned_int" 1>&6 cat >> confdefs.h <&6 if eval "test \"`echo '$''{'ac_cv_func_mmap'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then ac_cv_func_mmap=no else cat > conftest.$ac_ext < #include #include #ifdef BSD # ifndef BSD4_1 # define HAVE_GETPAGESIZE # endif #endif #ifndef HAVE_GETPAGESIZE # include # ifdef EXEC_PAGESIZE # define getpagesize() EXEC_PAGESIZE # else # ifdef NBPG # define getpagesize() NBPG * CLSIZE # ifndef CLSIZE # define CLSIZE 1 # endif # else # ifdef NBPC # define getpagesize() NBPC # else # define getpagesize() PAGESIZE /* SVR4 */ # endif # endif # endif #endif #ifdef __osf__ # define valloc malloc #endif #ifdef __cplusplus extern "C" { void *valloc(unsigned), *malloc(unsigned); } #else char *valloc(), *malloc(); #endif int main() { char *buf1, *buf2, *buf3; int i = getpagesize(), j; int i2 = getpagesize()*2; int fd; buf1 = (char *)valloc(i2); buf2 = (char *)valloc(i); buf3 = (char *)malloc(i2); for (j = 0; j < i2; ++j) *(buf1 + j) = rand(); fd = open("conftestmmap", O_CREAT | O_RDWR, 0666); write(fd, buf1, i2); mmap(buf2, i, PROT_READ | PROT_WRITE, MAP_FIXED | MAP_PRIVATE, fd, 0); for (j = 0; j < i; ++j) if (*(buf1 + j) != *(buf2 + j)) exit(1); lseek(fd, (long)i, 0); read(fd, buf2, i); /* read into mapped memory -- file should not change */ /* (it does in i386 SVR4.0 - Jim Avera, jima@netcom.com) */ lseek(fd, (long)0, 0); read(fd, buf3, i2); for (j = 0; j < i2; ++j) if (*(buf1 + j) != *(buf3 + j)) exit(1); exit(0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_func_mmap=yes else ac_cv_func_mmap=no fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_func_mmap" 1>&6 if test $ac_cv_func_mmap = yes; then cat >> confdefs.h <<\EOF #define HAVE_MMAP 1 EOF fi for ac_func in putenv setenv do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&6 fi done test -d intl || mkdir intl case "$target" in *-linux*) cp $srcdir/intl/linux-msg.sed intl/po-to-msg.sed ;; *) cp $srcdir/intl/xopen-msg.sed intl/po-to-msg.sed ;; esac chmod +w intl/po-to-msg.sed if test -n "$nls_cv_header_libgt" && test -n "$nls_cv_header_intl"; then cp $srcdir/$nls_cv_header_libgt $nls_cv_header_intl chmod +w $nls_cv_header_intl fi # # End of NLS block. # ----------------- trap '' 1 2 15 cat > confcache <<\EOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs. It is not useful on other systems. # If it contains results you don't want to keep, you may remove or edit it. # # By default, configure uses ./config.cache as the cache file, # creating it if it does not exist already. You can give configure # the --cache-file=FILE option to use a different cache file; that is # what configure does when it calls configure scripts in # subdirectories, so they share the cache. # Giving --cache-file=/dev/null disables caching, for debugging configure. # config.status only pays attention to the cache file if you give it the # --recheck option to rerun configure. # EOF # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. (set) 2>&1 | sed -n "s/^\([a-zA-Z0-9_]*_cv_[a-zA-Z0-9_]*\)=\(.*\)/\1=\${\1='\2'}/p" \ >> confcache if cmp -s $cache_file confcache; then : else if test -w $cache_file; then echo "updating cache $cache_file" cat confcache > $cache_file else echo "not updating unwritable cache $cache_file" fi fi rm -f confcache trap 'rm -fr conftest* confdefs* core core.* *.core $ac_clean_files; exit 1' 1 2 15 test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' # Any assignment to VPATH causes Sun make to only execute # the first set of double-colon rules, so remove it if not needed. # If there is a colon in the path, we need to keep it. if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[^:]*$/d' fi trap 'rm -f $CONFIG_STATUS conftest*; exit 1' 1 2 15 DEFS=-DHAVE_CONFIG_H # Without the "./", some shells look in PATH for config.status. : ${CONFIG_STATUS=./config.status} echo creating $CONFIG_STATUS rm -f $CONFIG_STATUS cat > $CONFIG_STATUS </dev/null | sed 1q`: # # $0 $ac_configure_args # # Compiler output produced by configure, useful for debugging # configure, is in ./config.log if it exists. ac_cs_usage="Usage: $CONFIG_STATUS [--recheck] [--version] [--help]" for ac_option do case "\$ac_option" in -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) echo "running \${CONFIG_SHELL-/bin/sh} $0 $ac_configure_args --no-create --no-recursion" exec \${CONFIG_SHELL-/bin/sh} $0 $ac_configure_args --no-create --no-recursion ;; -version | --version | --versio | --versi | --vers | --ver | --ve | --v) echo "$CONFIG_STATUS generated by autoconf version 2.3" exit 0 ;; -help | --help | --hel | --he | --h) echo "\$ac_cs_usage"; exit 0 ;; *) echo "\$ac_cs_usage"; exit 1 ;; esac done ac_given_srcdir=$srcdir ac_given_INSTALL="$INSTALL" trap 'rm -fr `echo "Makefile doc/Makefile intl/Makefile lib/Makefile po/Makefile \ src/Makefile scripts/Makefile config.h" | sed "s/:[^ ]*//g"` conftest*; exit 1' 1 2 15 # Protect against being on the right side of a sed subst in config.status. sed 's/%@/@@/; s/@%/@@/; s/%g$/@g/; /@g$/s/[\\\\&%]/\\\\&/g; s/@@/%@/; s/@@/@%/; s/@g$/%g/' > conftest.subs <<\CEOF $ac_vpsub $extrasub s%@CFLAGS@%$CFLAGS%g s%@CPPFLAGS@%$CPPFLAGS%g s%@CXXFLAGS@%$CXXFLAGS%g s%@DEFS@%$DEFS%g s%@LDFLAGS@%$LDFLAGS%g s%@LIBS@%$LIBS%g s%@exec_prefix@%$exec_prefix%g s%@prefix@%$prefix%g s%@program_transform_name@%$program_transform_name%g s%@host@%$host%g s%@host_alias@%$host_alias%g s%@host_cpu@%$host_cpu%g s%@host_vendor@%$host_vendor%g s%@host_os@%$host_os%g s%@target@%$target%g s%@target_alias@%$target_alias%g s%@target_cpu@%$target_cpu%g s%@target_vendor@%$target_vendor%g s%@target_os@%$target_os%g s%@build@%$build%g s%@build_alias@%$build_alias%g s%@build_cpu@%$build_cpu%g s%@build_vendor@%$build_vendor%g s%@build_os@%$build_os%g s%@PACKAGE@%$PACKAGE%g s%@VERSION@%$VERSION%g s%@PROGRAMS@%$PROGRAMS%g s%@CC@%$CC%g s%@CPP@%$CPP%g s%@INSTALL_PROGRAM@%$INSTALL_PROGRAM%g s%@INSTALL_DATA@%$INSTALL_DATA%g s%@SET_MAKE@%$SET_MAKE%g s%@RANLIB@%$RANLIB%g s%@YACC@%$YACC%g s%@U@%$U%g s%@ANSI2KNR@%$ANSI2KNR%g s%@LIBOBJS@%$LIBOBJS%g s%@ALLOCA@%$ALLOCA%g s%@MSGFMT@%$MSGFMT%g s%@GMSGFMT@%$GMSGFMT%g s%@XGETTEXT@%$XGETTEXT%g s%@GENCAT@%$GENCAT%g s%@INTLOBJS@%$INTLOBJS%g s%@CATALOGS@%$CATALOGS%g s%@CATOBJEXT@%$CATOBJEXT%g s%@DATADIRNAME@%$DATADIRNAME%g s%@INTLDEPS@%$INTLDEPS%g s%@INTLLIBS@%$INTLLIBS%g s%@INTLSUB@%$INTLSUB%g s%@POTFILES@%$POTFILES%g CEOF EOF cat >> $CONFIG_STATUS <> $CONFIG_STATUS <<\EOF for ac_file in .. $CONFIG_FILES; do if test "x$ac_file" != x..; then # Support "outfile[:infile]", defaulting infile="outfile.in". case "$ac_file" in *:*) ac_file_in=`echo "$ac_file"|sed 's%.*:%%'` ac_file=`echo "$ac_file"|sed 's%:.*%%'` ;; *) ac_file_in="${ac_file}.in" ;; esac # Adjust relative srcdir, etc. for subdirectories. # Remove last slash and all that follows it. Not all systems have dirname. ac_dir=`echo $ac_file|sed 's%/[^/][^/]*$%%'` if test "$ac_dir" != "$ac_file" && test "$ac_dir" != .; then # The file is in a subdirectory. test ! -d "$ac_dir" && mkdir "$ac_dir" ac_dir_suffix="/`echo $ac_dir|sed 's%^\./%%'`" # A "../" for each directory in $ac_dir_suffix. ac_dots=`echo $ac_dir_suffix|sed 's%/[^/]*%../%g'` else ac_dir_suffix= ac_dots= fi case "$ac_given_srcdir" in .) srcdir=. if test -z "$ac_dots"; then top_srcdir=. else top_srcdir=`echo $ac_dots|sed 's%/$%%'`; fi ;; /*) srcdir="$ac_given_srcdir$ac_dir_suffix"; top_srcdir="$ac_given_srcdir" ;; *) # Relative path. srcdir="$ac_dots$ac_given_srcdir$ac_dir_suffix" top_srcdir="$ac_dots$ac_given_srcdir" ;; esac case "$ac_given_INSTALL" in [/$]*) INSTALL="$ac_given_INSTALL" ;; *) INSTALL="$ac_dots$ac_given_INSTALL" ;; esac echo creating "$ac_file" rm -f "$ac_file" configure_input="Generated automatically from `echo $ac_file_in|sed 's%.*/%%'` by configure." case "$ac_file" in *Makefile*) ac_comsub="1i\\ # $configure_input" ;; *) ac_comsub= ;; esac sed -e "$ac_comsub s%@configure_input@%$configure_input%g s%@srcdir@%$srcdir%g s%@top_srcdir@%$top_srcdir%g s%@INSTALL@%$INSTALL%g " -f conftest.subs $ac_given_srcdir/$ac_file_in > $ac_file fi; done rm -f conftest.subs # These sed commands are passed to sed as "A NAME B NAME C VALUE D", where # NAME is the cpp macro being defined and VALUE is the value it is being given. # # ac_d sets the value in "#define NAME VALUE" lines. ac_dA='s%^\([ ]*\)#\([ ]*define[ ][ ]*\)' ac_dB='\([ ][ ]*\)[^ ]*%\1#\2' ac_dC='\3' ac_dD='%g' # ac_u turns "#undef NAME" with trailing blanks into "#define NAME VALUE". ac_uA='s%^\([ ]*\)#\([ ]*\)undef\([ ][ ]*\)' ac_uB='\([ ]\)%\1#\2define\3' ac_uC=' ' ac_uD='\4%g' # ac_e turns "#undef NAME" without trailing blanks into "#define NAME VALUE". ac_eA='s%^\([ ]*\)#\([ ]*\)undef\([ ][ ]*\)' ac_eB='$%\1#\2define\3' ac_eC=' ' ac_eD='%g' CONFIG_HEADERS=${CONFIG_HEADERS-"config.h"} for ac_file in .. $CONFIG_HEADERS; do if test "x$ac_file" != x..; then # Support "outfile[:infile]", defaulting infile="outfile.in". case "$ac_file" in *:*) ac_file_in=`echo "$ac_file"|sed 's%.*:%%'` ac_file=`echo "$ac_file"|sed 's%:.*%%'` ;; *) ac_file_in="${ac_file}.in" ;; esac echo creating $ac_file rm -f conftest.frag conftest.in conftest.out cp $ac_given_srcdir/$ac_file_in conftest.in EOF # Transform confdefs.h into a sed script conftest.vals that substitutes # the proper values into config.h.in to produce config.h. And first: # Protect against being on the right side of a sed subst in config.status. # Protect against being in an unquoted here document in config.status. rm -f conftest.vals cat > conftest.hdr <<\EOF s/[\\&%]/\\&/g s%[\\$`]%\\&%g s%#define \([A-Za-z_][A-Za-z0-9_]*\) \(.*\)%${ac_dA}\1${ac_dB}\1${ac_dC}\2${ac_dD}%gp s%ac_d%ac_u%gp s%ac_u%ac_e%gp EOF sed -n -f conftest.hdr confdefs.h > conftest.vals rm -f conftest.hdr # This sed command replaces #undef with comments. This is necessary, for # example, in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. cat >> conftest.vals <<\EOF s%^[ ]*#[ ]*undef[ ][ ]*[a-zA-Z_][a-zA-Z_0-9]*%/* & */% EOF # Break up conftest.vals because some shells have a limit on # the size of here documents, and old seds have small limits too. # Maximum number of lines to put in a single here document. ac_max_here_lines=12 rm -f conftest.tail while : do ac_lines=`grep -c . conftest.vals` # grep -c gives empty output for an empty file on some AIX systems. if test -z "$ac_lines" || test "$ac_lines" -eq 0; then break; fi # Write a limited-size here document to conftest.frag. echo ' cat > conftest.frag <> $CONFIG_STATUS sed ${ac_max_here_lines}q conftest.vals >> $CONFIG_STATUS echo 'CEOF sed -f conftest.frag conftest.in > conftest.out rm -f conftest.in mv conftest.out conftest.in ' >> $CONFIG_STATUS sed 1,${ac_max_here_lines}d conftest.vals > conftest.tail rm -f conftest.vals mv conftest.tail conftest.vals done rm -f conftest.vals cat >> $CONFIG_STATUS <<\EOF rm -f conftest.frag conftest.h echo "/* $ac_file. Generated automatically by configure. */" > conftest.h cat conftest.in >> conftest.h rm -f conftest.in if cmp -s $ac_file conftest.h 2>/dev/null; then echo "$ac_file is unchanged" rm -f conftest.h else rm -f $ac_file mv conftest.h $ac_file fi fi; done test -z "$CONFIG_HEADERS" || echo timestamp > stamp-h exit 0 EOF chmod +x $CONFIG_STATUS rm -fr confdefs* $ac_clean_files test "$no_create" = yes || ${CONFIG_SHELL-/bin/sh} $CONFIG_STATUS || exit 1 tar-1.11.8/stamp-h.in 644 625 1 12 5770624672 7246 timestamp tar-1.11.8/doc/Makefile.in 644 625 1 5717 5770102022 10214 # Makefile for GNU tar documentation. # Copyright (C) 1994 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. PACKAGE = @PACKAGE@ VERSION = @VERSION@ SHELL = /bin/sh VPATH = @srcdir@ srcdir = @srcdir@ subdir = doc top_srcdir = @top_srcdir@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ MAKEINFO = makeinfo TEXI2DVI = texi2dvi TOUCH = echo timestamp > prefix = @prefix@ infodir = $(prefix)/info .SUFFIXES: DISTFILES = Makefile.in tar.texinfo docwarn.texi header.texi texinfo.tex \ stamp-vti version.texi \ tar.info tar.info-1 tar.info-2 tar.info-3 tar.info-4 tar.info-5 \ tar.info-6 tar.info-7 all: tar.info info: tar.info tar.info: tar.texinfo docwarn.texi header.texi version.texi cd $(srcdir) && $(MAKEINFO) tar.texinfo dvi: tar.dvi tar.dvi: tar.texinfo docwarn.texi header.texi $(TEXI2DVI) $(srcdir)/tar.texinfo version.texi: stamp-vti stamp-vti: tar.texinfo ../configure.in echo "@set EDITION $(VERSION)" > version.tmp echo "@set UPDATED `date -r $(srcdir)/tar.texinfo '+%B %Y'`" \ >> version.tmp echo "@set VERSION $(VERSION)" >> version.tmp if cmp -s version.tmp $(srcdir)/version.texi; then rm version.tmp; \ else mv version.tmp $(srcdir)/version.texi; fi $(TOUCH) $(srcdir)/stamp-vti header.texi: ../src/tar.h sed -n '/Standard Archive/,/End of Standard/p' $(srcdir)/../src/tar.h \ | expand | sed 's/\([{}]\)/@\1/g' > $(srcdir)/header.texi install: all $(top_srcdir)/mkinstalldirs $(infodir) cd $(srcdir); for file in tar.info*; do \ $(INSTALL_DATA) $$file $(infodir)/$$file; \ done uninstall: rm -f $(infodir)/tar.info* mostlyclean: rm -f *.aux *.cp *.cps *.dvi *.fn *.fns *.ky *.log *.pg *.toc *.tp *.vr rm -f *.tmp clean: mostlyclean distclean: clean rm -f Makefile maintainer-clean: distclean @echo "This command is intended only for maintainers to use;" @echo "rebuilding the deleted files may require special tools." rm -f stamp-vti version.texi tar.info* distdir = ../$(PACKAGE)-$(VERSION)/$(subdir) dist shar: $(DISTFILES) for file in $(DISTFILES); do \ ln $(srcdir)/$$file $(distdir) 2> /dev/null \ || cp -p $(srcdir)/$$file $(distdir); \ done Makefile: Makefile.in ../config.status cd .. && CONFIG_FILES=$(subdir)/$@ CONFIG_HEADERS= ./config.status # Tell versions [3.59,3.63) of GNU make not to export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: tar-1.11.8/doc/tar.texinfo 644 625 1 1175534 5770572014 10435 \input texinfo @c %**start of header @setfilename tar.info @settitle GNU tar @finalout @c %**end of header @c FIXME: clean the following list as the documentation is revised @c {"absolute-names", no_argument, NULL, 'P'}, @c {"absolute-paths", no_argument, NULL, 'P'}, @c {"after-date", required_argument, NULL, 'N'}, @c {"append", no_argument, NULL, 'r'}, @c {"atime-preserve", no_argument, &flag_atime_preserve, 1}, @c {"block-compress", no_argument, &flag_compress_block, 1}, @c {"block-size", required_argument, NULL, 'b'}, @c {"catenate", no_argument, NULL, 'A'}, @c {"compare", no_argument, NULL, 'd'}, @c {"compress", no_argument, NULL, 'Z'}, @c {"concatenate", no_argument, NULL, 'A'}, @c {"create", no_argument, NULL, 'c'}, @c {"delete", no_argument, NULL, OPTION_DELETE}, @c {"diff", no_argument, NULL, 'd'}, @c {"directory", required_argument, NULL, 'C'}, @c {"exclude", required_argument, NULL, OPTION_EXCLUDE}, @c {"exclude-from", required_argument, NULL, 'X'}, @c {"extract", no_argument, NULL, 'x'}, @c {"file", required_argument, NULL, 'f'}, @c {"files-from", required_argument, NULL, 'T'}, @c {"force-local", no_argument, &flag_force_local, 1}, @c {"get", no_argument, NULL, 'x'}, @c {"gunzip", no_argument, NULL, 'z'}, @c {"gzip", no_argument, NULL, 'z'}, @c {"ignore-failed-read", no_argument, &flag_ignore_failed_read, 1}, @c {"ignore-zeros", no_argument, NULL, 'i'}, @c {"incremental", no_argument, NULL, 'G'}, @c {"info-script", required_argument, NULL, 'F'}, @c {"keep-old-files", no_argument, NULL, 'k'}, @c {"label", required_argument, NULL, 'V'}, @c {"list", no_argument, NULL, 't'}, @c {"listed-incremental", required_argument, NULL, 'g'}, @c {"modification-time", no_argument, NULL, 'm'}, @c {"multi-volume", no_argument, NULL, 'M'}, @c {"new-volume-script", required_argument, NULL, 'F'}, @c {"newer", required_argument, NULL, 'N'}, @c {"newer-mtime", required_argument, NULL, OPTION_NEWER_MTIME}, @c {"null", no_argument, NULL, OPTION_NULL}, @c {"one-file-system", no_argument, NULL, 'l'}, @c {"preserve", no_argument, NULL, OPTION_PRESERVE}, @c {"preserve-order", no_argument, NULL, 's'}, @c {"preserve-permissions", no_argument, NULL, 'p'}, @c {"read-full-blocks", no_argument, NULL, 'B'}, @c {"remove-files", no_argument, &flag_remove_files, 1}, @c {"rsh-command", required_argument, NULL, OPTION_RSH_COMMAND}, @c {"same-order", no_argument, NULL, 's'}, @c {"same-owner", no_argument, &flag_do_chown, 1}, @c {"same-permissions", no_argument, NULL, 'p'}, @c {"sparse", no_argument, NULL, 'S'}, @c {"starting-file", required_argument, NULL, 'K'}, @c {"tape-length", required_argument, NULL, 'L'}, @c {"to-stdout", no_argument, NULL, 'O'}, @c {"uncompress", no_argument, NULL, 'Z'}, @c {"ungzip", no_argument, NULL, 'z'}, @c {"update", no_argument, NULL, 'u'}, @c {"use-compress-program", required_argument, NULL, OPTION_COMPRESS_PROG}, @c {"volno-file", required_argument, NULL, OPTION_VOLNO_FILE}, @set absolute-names @samp{--absolute-names} (@samp{-P}) @set after-date @samp{--after-date=@var{date}} (@samp{-N @var{date}}) @set append @samp{--append} (@samp{-r}) @set atime-preserve @samp{--atime-preserve} @set block-size @samp{--block-size=@var{512-size}} (@samp{-b @var{512-size}}) @set checkpoint @samp{--checkpoint} @set concatenate @samp{--concatenate} (@samp{-A}) @set compare @samp{--compare} (@samp{-d}) @set compress @samp{--compress} (@samp{-Z}) @set compress-block @samp{--compress-blocks} @set create @samp{--create} (@samp{-c}) @set delete @samp{--delete} @set dereference @samp{--dereference} (@samp{-h}) @set directory @samp{--directory=@var{directory}} (@samp{-C @var{directory}}) @set exclude @samp{--exclude=@var{pattern}} @set exclude-from @samp{--exclude-from=@var{file-of-patterns}} (@samp{-X @var{file-of-patterns}}) @set extract @samp{--extract} (@samp{-x}) @set file @samp{--file=@var{archive-name}} (@samp{-f @var{archive-name}}) @set files-from @samp{--files-from=@var{file-of-names}} (@samp{-T @var{file-of-names}}) @set force-local @samp{--force-local} @set gzip @samp{--gzip} (@samp{-z}) @set help @samp{--help} @set ignore-zeros @samp{--ignore-zeros} (@samp{-i}) @set incremental @samp{--incremental} (@samp{-G}) @set info-script @samp{--info-script=@var{script-name}} (@samp{-F @var{script-name}}) @set interactive @samp{--interactive} (@samp{-w}) @set keep-old-files @samp{--keep-old-files} (@samp{-k}) @set label @samp{--label=@var{archive-label}} (@samp{-V @var{archive-label}}) @set list @samp{--list} (@samp{-t}) @set listed-incremental @samp{--listed-incremental=@var{snapshot-file}} (@samp{-g @var{snapshot-file}}) @set modification-time @samp{--modification-time} (@samp{-m}) @set multi-volume @samp{--multi-volume} (@samp{-M}) @set newer-mtime @samp{--newer-mtime=@var{date}} @set null @samp{--null} @set old-archive @samp{--old-archive} (@samp{-o}) @set one-file-system @samp{--one-file-system} (@samp{-l}) @set preserve @samp{--preserve} @set read-full-blocks @samp{--read-full-blocks} (@samp{-B}) @set record-number @samp{--record-number} (@samp{-R}) @set same-order @samp{--same-order} (@samp{-s}) @set same-permissions @samp{--same-permissions} (@samp{-p}) @set show-omitted-dirs @samp{--show-omitted-dirs} @set sparse @samp{--sparse} (@samp{-S}) @set starting-file @samp{--starting-file=@var{name}} (@samp{-K @var{name}}) @set tape-length @samp{--tape-length=@var{1024-size}} (@samp{-L @var{1024-size}}) @set to-stdout @samp{--to-stdout} (@samp{-O}) @set totals @samp{--totals} @set update @samp{--update} (@samp{-u}) @set verbose @samp{--verbose} (@samp{-v}) @set verify @samp{--verify} (@samp{-W}) @set version @samp{--version} @set volno-file @samp{--volno-file=@var{file-of-number}} @include version.texi @c Put everything in one index (arbitrarily chosen to be the concept index). @syncodeindex fn cp @syncodeindex ky cp @syncodeindex pg cp @syncodeindex vr cp @ifinfo @set Francois Franc,ois @end ifinfo @tex @set Francois Fran\noexpand\ptexc cois @end tex @ifinfo @format START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY @end format @end ifinfo @ifinfo This file documents GNU @code{tar}, a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. @ignore Permission is granted to process this file through TeX and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). @end ignore Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation. @end ifinfo @titlepage @title GNU tar: an archiver tool (*DRAFT*) @subtitle For version @value{VERSION}, @value{UPDATED} @author Jay Fenlason, Michael Bushnell @author Amy Gorin, @value{Francois} Pinard @page @vskip 0pt plus 1filll Copyright @copyright{} 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation. @end titlepage @ifinfo @node Top, Introduction, (dir), (dir) @top GNU tar This file documents @code{tar}, a utility used to store, backup, and transport files. It is a rudimentary documentation for the GNU tape (or disk) archiver. It covers the release @value{VERSION}. This document has been quickly assembled from random notes and sources. I will of course accept documentation bug reports, but please do not torture yourself into systematically reporting all inadequacies for unrevised nodes. @end ifinfo @menu * Introduction:: * Tutorial:: * Invoking tar:: * Basic tar Operations:: * Specifying Names to tar:: * Being Careful:: * Format Control:: * Media:: * Backups and Restoration:: * Date input formats:: * Archive Format:: * Index:: --- The Detailed Node Listing --- Introduction * What tar Does:: * Authors:: * Bug reports:: * Support:: Support considerations * Stability:: * Rewriting:: * Why maintaining:: * MSDOS:: Tutorial Introduction to @code{tar} * How to Create Archives:: * How to List Archives:: * How to Extract Members from an Archive:: * How to Add Files to Existing Archives:: * How to Delete Members from Archives:: How to Create Archives * Creating Archives of Files bis:: * Using tar in Verbose Mode bis:: * How to Archive Directories:: * Creating an Archive of a Subdirectory bis:: * Compare bis:: * Using Compare from the Superior Directory bis:: How to Archive Directories * Creating an Archive of a Subdirectory bis:: How to List Archives * Listing files in an archive bis:: * Getting Additional File Information bis:: * List A Specific File in an Archive bis:: * Listing the Contents of a Stored Directory ter:: How to Extract Members from an Archive * Extracting Files bis:: * Extracting Files from an Archive ter:: * Extracting Specific Files ter:: * Extracting Directories ter:: How to Add Files to Existing Archives * Append bis:: * Update bis:: * Concatenate bis:: Invoking GNU @code{tar} * Synopsis:: * Option Styles:: * Options:: Many Styles for Options * Mnemonic Options:: * Short Options:: * Old Options:: * Mixing Styles:: All Available Options * Device Options:: * Blocking Options:: * Classification Options:: Basic @code{tar} Operations * Creating a New Archive:: * Adding to an Existing Archive:: * Updating an Archive:: * Combining Archives:: * Removing Archive Members:: * Listing Archive Members:: * Extracting Archive Members:: * Comparing Archives Members with Files:: * Matching Format Parameters:: Extracting Archive Members * Archive Reading Options:: * File Writing Options:: * Scarce Disk Space:: Specifying Names to @code{tar} * Changing the Archive Name:: * Characteristics:: * Selection Options:: Selecting Files by Characteristic * Reading Names from a File:: * Excluding Some Files:: * Operating Only on New Files:: * Crossing Filesystem Boundaries:: Local file selection * Changing Directory:: * Absolute File Names:: Being Even More Careful * Documentation:: * Checking Progress:: * Interactive Operation:: * Write Verification:: * Comparing:: * Portability:: * Write Protection:: Making @code{tar} Archives More Portable * Portable Names:: * Symbolic Links:: * Old V7 and POSIX:: * Checksumming Problems:: Controlling the Archive Format * Attributes Options:: * Type Options:: * Compression:: * Special Options for Archiving:: * Archive Structure:: * Modifiers Options:: Using Less Space through Compression * Compressed Archives:: * Dealing with Compressed Archives:: * Sparse Files:: Tapes and Other Archive Media * Device:: * Blocking:: * Many:: * Using Multiple Tapes:: * Archive Label:: Blocking * Format Variations:: * Blocking Factor:: Many archives on one tape * Tape Positioning:: * mt:: Using Multiple Tapes * Multi-Volume Archives:: * Tape Files:: Performing Backups and Restoring Files * Full Dumps:: * Inc Dumps:: * incremental and listed-incremental:: * Backup Levels:: * Backup Parameters:: * Scripted Backups:: * Scripted Restoration:: Setting Parameters for Backups and Restoration * backup-specs example:: * Script Syntax:: Date input formats * General date syntax:: * Calendar date item:: * Time of day item:: * Timezone item:: * Day of week item:: * Relative item in date strings:: * Pure numbers in date strings:: * Authors of getdate:: Format of @code{tar} archives * Standard:: * Extensions:: * cpio:: @end menu @node Introduction, Tutorial, Top, Top @chapter Introduction This chapter introduces of a few words which will recur all over this manual, like ``archive'', ``member'', ``name'', ``unpack'', etc. It then explains who wrote GNU @code{tar} and its documentation, and says where to send bug reports or comments. @menu * What tar Does:: * Authors:: * Bug reports:: * Support:: @end menu @node What tar Does, Authors, Introduction, Introduction @section What @code{tar} Does @cindex archive @cindex tar archive The @code{tar} program is used to create and manipulate @code{tar} archives. An @dfn{archive} is a single file which contains within it the contents of many files. In addition, the archive identifies the names of the files, their owner, and so forth. (Archives record access permissions, user and group, size in bytes, and last modification time. Some archives also record the file names in each archived directory, as well as other file and directory information.) @cindex member @cindex archive member @cindex file name @cindex member name The files inside an archive are called @dfn{members}. Within this manual, we use the term @dfn{file} to refer only to files accessible in the normal ways (by @code{ls}, @code{cat}, and so forth), and the term @dfn{members} to refer only to the members of an archive. Similarly, a @dfn{file name} is the name of a file, as it resides in the filesystem, and a @dfn{member name} is the name of an archive member within the archive. @cindex tar Initially, @code{tar} archives were used to store files conveniently on magnetic tape. The name @samp{tar} comes from this use; it stands for: @code{t}ape @code{ar}chiver. Despite the utility's name, @code{tar} can direct its output to any available device, as well as store it in a file or direct it to another program via a pipe. @code{tar} may even access, as archives, remote devices or files. You can use @code{tar} archives in many ways. We want to stress a few of them: storage, backup or transportation. @table @asis @item Storage Often, @code{tar} archives are used to store related files for convenient file transfer over a network. For example, the GNU Project distributes its software bundled into @code{tar} archives, so that all the files relating to a particular program (or set of related programs) can be transferred as a single unit. A magnetic tape can store several files in sequence, but has no names for them, just relative position on the tape. A @code{tar} archive or something like it is one way to store several files on one tape and retain their names. Even when the basic transfer mechanism can keep track of names, as FTP can, the nuisance of handling multiple files, directories, and multiple links, makes @code{tar} archives an attractive method. Archive files are also used for long-term storage, which you can think of as transportation from one time to another. @item Backup Because the archive created by @code{tar} is capable of preserving file information and directory structure, @code{tar} is commonly used for performing full and incremental backups of disks, putting all together bunch of files possibly pertaining to many users and different projects, to secure against accidental destruction of those disks. The GNU version of @code{tar} has special features that allow it to be used to make incremental and full dumps of all the files in a filesystem. @item Transportation Archive files can be used for transporting a group of files from one system to another: put all relevant files into an archive on one computer system, transfer the archive to another, and extract the contents there. The basic transfer medium might be magnetic tape, Internet FTP, or even electronic mail (though you must encode the archive with @code{uuencode} or some functional equivalent in order to transport it properly by mail). Both machines do not have to use the same operating system, as long as they both support the @code{tar} program. Piping one @code{tar} to another is an easy way to copy a directory's contents from one disk to another, while preserving the dates, modes, owners and link structure of all the files therein. @code{tar} is also ideal for transferring directories over networks. We sometimes see a copy of @code{tar} packing many files into one archive on one machine, and sending the produced archive over a pipe over the network to another copy of @code{tar} on another machine, reading its archive from the pipe and unpacking all files there. @end table @cindex extraction @cindex unpacking The @code{tar} program provides the ability to create @code{tar} archives, as well as for various other kinds of manipulation. For example, you can use @code{tar} on previously created archives to extract files, to store additional files, or to update or list files already stored. The term @dfn{extraction} is used to refer to the process of copying an archive member into a file in the filesystem. One might speak of extracting a single member. Extracting all the members of an archive is often called extracting the archive. Also, the term @dfn{unpack} is used to refer to the extraction of many or all the members of an archive. Conventionally, @code{tar} archives are given names ending with @samp{.tar}. This is not necessary for @code{tar} to operate properly, but this manual follows the convention in order to get the reader used to seeing it. @cindex tar file @cindex entry @cindex tar entry Occasionally, @code{tar} archives are referred to as @code{tar} files, archive members are referred to as files, or entries. For people familiar with the operation of @code{tar}, this causes no difficulty. However, this manual consistently uses the terminology above in referring to archives and archive members, to make it easier to learn how to use @code{tar}. @node Authors, Bug reports, What tar Does, Introduction @section GNU @code{tar} Authors GNU @code{tar} was originally written by John Gilmore, and modified by many people. The GNU enhancements were written by Jay Fenlason, and the whole package has been further maintained by Michael Bushnell, then @value{Francois} Pinard, with the help of numerous and kind users. I wish to stress that @code{tar} is somewhat a collective work, and owe much to all those people who reported problems, offerred solutions and other insights, or shared their thoughts and suggestions. Even if we lost track of many of those contributors, a partial list can be found in the @file{THANKS} file from the GNU @code{tar} distribution. Jay Fenlason put together a draft of a GNU @code{tar} manual, also borrowing notes from the original man page from John Gilmore, this draft has been distributed in @code{tar} versions 1.04 (or even before?) through 1.10, then withdrawn in version 1.11. Michael Bushnell and Amy Gorin worked at a tutorial and manual for GNU @code{tar}, and left a few unpublished versions of each. For version 1.11.8, @value{Francois} Pinard put together a new manual by grabbing from all these sources and merging them in a single manual. @c FIXME: Karl Berry proofread and properly indexed the thing. @cindex incompleteness of this manual I heard that there is another manual in the works, by another team, which should say everything about archives and related utilities, and which will surely be nicer than this one. In the meantime, please consider this manual is a placeholder for @code{tar} option list and a few random notes the maintainer wants to save somewhere, so users can read them. I wish GNU @code{tar} users will be happier with this imperfect manual than with no documentation at all. @node Bug reports, Support, Authors, Introduction @section Reporting bugs or suggestions @cindex bug reports @cindex reporting bugs Please report problems or suggestions about this program to @file{bug-gnu-utils@@prep.ai.mit.edu}. You may also write directly, and less officially, to @file{pinard@@iro.umontreal.ca}. There is a lot of mail flowing about @code{tar}, and some accumulated in the past years. You might expect a quick acknowledgement of your invoices, but the proper handling of your reports may be delayed for a long while. Many nodes of this document have not been revised much, these all start with a little comment telling so. I accept documentation bug reports, of course. But please do not torture yourself into systematically reporting all inadequacies for the unrevised nodes of this document, unless you really feel like revising them. @node Support, , Bug reports, Introduction @section Support considerations This informal appendix is for the maintainer to share a few words and thoughts, while considering GNU @code{tar} support. @menu * Stability:: * Rewriting:: * Why maintaining:: * MSDOS:: @end menu @node Stability, Rewriting, Support, Support @subsection Stability of GNU @code{tar} User reports mainly fall in three categories: portability problems, execution bugs, and requests for enhancements. For 1.11.X, the emphasis has been on solving portability problems, then trying to make GNU @code{tar} more solid. Enhancements have fairly low priority, yet I sometime slip one in just for taking a kind of rest :-). Many bugs have been corrected since 1.11.2. If you are curious, glance through ChangeLog. I had only very few reports for things that @emph{might} be new bugs not present in 1.11.2. If you are really curious, and have access to the FSF machines, see @file{/gd/gnu/tar/rmail/} hierarchy for all reports. Subdirectories @file{0}, @file{1}, @file{2} and @file{3} represent decreasing levels in priority. Most problems in there were reported against 1.10, 1.11 or 1.11.2 and still exist. The only thing I have consciously broken between 1.11.2 and 1.11.5 is @value{record-number}, because I wanted some modification to be done to @file{gnulib/error.c}, which is outside my control. This modification is now done, but I did not revisit this area yet. Here is my candid opinion. GNU @code{tar} has many areas of unreliability. See @file{BACKLOG} for the horrorful picture of the situation. Yet, for most users and usages, GNU @code{tar} looks very dependable. For me as a mere user, GNU @code{tar} did not give problems in years. And I think it offers a lot of functionality. Many problems have been solved since 1.11.2, even if true that many more remain to be solved. I'm not discouraged myself and feel positive about maintaining it, simply because when I bite, that usually lasts for quite long. I might not have all the time I would want, but I surely have good will and am happily surrounded by many collaborating pretesters. So, I still think GNU @code{tar} is on the winning side in the long run. @node Rewriting, Why maintaining, Stability, Support @subsection Should we rewrite the thing? Working in @code{tar} sources is not always pleasurable. The problem is that @code{tar} sources are very fragile. Just cleaning around breaks things. The current sequence of prereleases is for slowly trying to solidify it, so @code{tar} becomes more maintainable. I think that the ugliness of sources could be corrected to a certain extent, too. A few efforts to replace GNU @code{tar} have been done already and it seems that all failed so far. A toy program, for me, is another kind of failure. I think people underestimate the number of portability problems such a program can raise. This is not only a matter of programming style, there is really a wide variability in systems out there. GNU @code{tar} has a long history, met a rich variety of porting problems, machine peculiarities, system idiosyncrasies, which are unrelated to programming style. My own opinion is that we cannot dismiss all the experience gleaned along the years, and saved (if not hidden) in GNU @code{tar} sources, pretending to start anew, from scratch. Even if a new program replacing GNU @code{tar} would be marvelous, GNU @code{tar} stalled for a few years waiting for such a program, and we are now faced to nothing, with hundreds of user reports to catch on. We need a working archiver @emph{now}, and cannot live on promises. Any new program will take hundreds of user reports, and many years, to stabilize enough to become a plausible @code{tar} replacement. I rather plan to clean up GNU @code{tar}. This alone is a big task for me, because GNU @code{tar} coding is not ideal, and I have to find ways to transform it slowly, while having it fully working at all times. @node Why maintaining, MSDOS, Rewriting, Support @subsection Why maintaining it? I confess that I am a little afraid of @code{tar} maintainance. It is difficult for many reasons, the first tree being more evident than the others: @itemize @bullet @item the algorithmic design was initially oriented for machines having very small memory, it was later much adapted for new features without doing everything necessary for the whole to stay clean; @item the wide visibility of @code{tar} forces many stunts at portability; @item GNU @code{tar} has to be sensitive to file systems and device variance. @item GNU central has been seduced by some users promising to write wonderful @code{tar} replacements, which never came, so development has been put aside for years, while bug reports accumulated; @item the @code{tar} manual has been withdrawn, promising users a fine replacement for it, so raising their expectations; @item maintenance was once split between four maintainers (one for @code{tar}, one for @code{mt}, another for scripts, and a team for documentation), and also, @file{rtapelib.[ch]} from @code{tar} is used in @code{cpio}, and synchronisation has not always been easy. @end itemize However, even if difficult, I do feel like doing a careful cleanup, so @code{tar} would become less painful to maintain after a while (and less subject to criticism). And besides, I'm surrounded by a marvelous team of pretesters and by many other collaborating users, which I should learn to serve better. Getting more experience with maintainance in GNU, I hope being careful enough modifying @code{tar} so not hurting users too much, being aware that @code{tar} is a sensitive product in GNU. Once cleaned up, I might be happy to return @code{tar} maintainance to someone else@dots{} @code{tar} requires more work alone that all my other things together, and I have to resist being swallowed whole in it. This resistance makes @code{tar} development somewhat slower. Sorry! @node MSDOS, , Why maintaining, Support @subsection MSDOS and other systems? GNU does not necessarily support non-UNIX systems, that is to say, MSDOS is not supported. It is very true that ports can sometimes be very intrusive in the sources, cluttering them significantly with conditionals and extra code, and distract GNU maintainers from the main development line. However, a special argument might be made for @code{tar}. Both @code{tar} and @code{gzip} are the required tools for getting something out of the GNU archives, @code{tar} should be more opened to ports than the GNU rule states. Jean-loup did a tremendous job at porting @code{gzip} on smaller systems. It would be comfortable that a few other GNU tools be available on MSDOS and others, among which @code{tar}. These ports for @code{tar} have theoretically no priority at all. Nevertheless, a port is interesting, because @code{tar} is so central in GNU distributions, and @code{gzip} is already ported. Some porting efforts have been done in the past. There are traces of a few exchanges on this subject in @file{BACKLOG}. GNU @code{tar} sources have been modified a lot recently at a cosmetic level, and I would certainly have a hard time integrating diffs provided by someone else. If people want porting @code{tar} to MSDOS or other non-UNIX systems, they should be committed in supporting their ports after the fact, as I cannot do it myself. @node Tutorial, Invoking tar, Introduction, Top @chapter Tutorial Introduction to @code{tar} This chapter guides you through some basic examples of @code{tar} operations. If you already know how to use some other version of @code{tar}, then you probably don't need to read this chapter. This chapter omits complicated details about many of the ways @code{tar} works. See later chapters for full information. Before proceeding further with this tutorial chapter, be sure you understand already and clearly what is meant by ``archive'' and ``archive member''. @format FIXME: xref What tar Does @end format . This chapter guides you through some basic examples of @code{tar} operations. In the examples, the lines you should type are preceded by a @samp{%}, which is a typical shell prompt. We use mnemonic forms of operations and options in the examples, and in discussions in the text, but short forms produce the same result. Most of the options to @code{tar} come in both long forms and short forms. The options described in this tutorial have the following abbreviations (except @value{delete}, which has no shorthand form): @table @samp @item --create @samp{-c} @item --list @samp{-t} @item --extract @samp{-x} @item --append @samp{-r} @item --verbose @samp{-v} @item --file=@var{archive-name} @samp{-f @var{archive-name}} @end table These options make typing long @code{tar} commands easier. For example, instead of typing @example tar --create --file=/tmp/afiles.tar --verbose apple angst asparagus @end example you can type @example tar -c -f /tmp/afiles.tar -v apple angst asparagus @end example For more information on option syntax, @format FIXME: ref Invoking tar @end format . In discussions in the text, when we present some mnemonic option, we also give the corresponding short option within parentheses. @menu * How to Create Archives:: * How to List Archives:: * How to Extract Members from an Archive:: * How to Add Files to Existing Archives:: * How to Delete Members from Archives:: @end menu @node How to Create Archives, How to List Archives, Tutorial, Tutorial @section How to Create Archives @include docwarn.texi To create a new archive, use the @value{create} option to @code{tar}. You can use options to specify the name and format of the archive (as well as other characteristics), and you can use file name arguments to specify which files and directories are to be put in the archive. @format FIXME: xref Creating @end format , for more information about the @value{create} operation. To create a new archive, use the @value{create} option to @code{tar}. You should generally use the @value{file} option to specify the name the @code{tar} archive will have. Then specify the names of the files you wish to place in the new archive. For example, to place the files @file{apple}, @file{angst}, and @file{asparagus} into an archive named @file{afiles.tar}, use the following command: @example tar --create --file=afiles.tar apple angst asparagus @end example The order of the arguments is not important when using mnemonic option style. You could also say: @example tar apple --create angst --file=afiles.tar asparagus @end example This order is harder to understand however. In this manual, we will list the arguments in a reasonable order to make the commands easier to understand, but you can type them in any order you wish. If you don't specify the names of any files to put in the archive, then @code{tar} will create an empty archive. So, the following command will create an archive with nothing in it: @example tar --create --file=empty-archive.tar @end example Whenever you use @value{create}, @code{tar} will erase the current contents of the file named by @value{file} if it exists. To add files to an existing archive, you need to use a different option. @format FIXME: xref Adding to Archives, for information on how to do this. @end format When an archive is created through @value{create}, the member names of the members of the archive are exactly the same as the file names as you typed them in the @code{tar} command. So, the member names of @file{afiles} (as created by the first example above) are @file{apple}, @file{angst}, and @file{asparagus}. However, suppose an archive were created with this command: @example tar --create --file=bfiles.tar ./balloons baboon ./bodacious @end example Then, the three files @file{balloons}, @file{baboon}, and @file{bodacious} would get placed in the archive (because @file{./} is a synonym for the current directory), but their member names would be @file{./balloons}, @file{baboon}, and @file{./bodacious}. If you want to see the progress of @code{tar} as it writes files into the archive, you can use the @value{verbose} option. If one of the files named with @value{create} is a directory, then the operation of @code{tar} is more complicated. @format FIXME: xref Tar and Directories, FIXME: the last section of this tutorial, for more information. @end format If you don't specify the @value{file} option, then @code{tar} will use a default. Usually this default is some physical tape drive attached to your machine. If there is no tape drive attached, or the default is not meaningful, then @code{tar} will print an error message. This error message might look roughly like one of the following: @example tar: can't open /dev/rmt8 : No such device or address tar: can't open /dev/rsmt0 : I/O error @end example If you get an error like this, mentioning a file you didn't specify (@file{/dev/rmt8} or @file{/dev/rsmt0} in the examples above), then @code{tar} is using a default value for @value{file}. You should generally specify a @value{file} argument whenever you use @code{tar}, rather than relying on a default. To create a new archive, use the @value{create} option to @code{tar}. You can use options to specify the name and format of the archive (as well as other characteristics), and you can use file name arguments to specify which files to put in the archive. If you don't use any options or file name arguments, @code{tar} will use default values. @format FIXME: xref Creating Example @end format , for more information about the @value{create} option. @menu * Creating Archives of Files bis:: * Using tar in Verbose Mode bis:: * How to Archive Directories:: * Creating an Archive of a Subdirectory bis:: * Compare bis:: * Using Compare from the Superior Directory bis:: @end menu @node Creating Archives of Files bis, Using tar in Verbose Mode bis, How to Create Archives, How to Create Archives @subsection Creating Archives of Files @include docwarn.texi This example shows you how to create an archive file in your working directory containing other files in the same directory. The three files you archive in this example are called @file{blues}, @file{folk}, and @file{jazz}. The archive file is called @file{records}. While the archive in this example is written to the file system, it could also be written to tape. (If you want to follow along with this and future examples, create a practice subdirectory containing files with these names. To create the directory, type @samp{mkdir practice} at the system prompt. You can create the files using a text editor, such as @code{emacs}). While in the directory containing the files you want to archive, list the directory's contents. Type: @example % cd practice % ls @end example @noindent The system responds: @example blues folk jazz % @end example @noindent This is to check that the files to be archived do in fact exist in the working directory, and to check that the archive name you have chosen isn't already in use. If it is, @code{tar} will overwrite the old archive and its contents will be lost. Then, @itemize @bullet @item Create a new archive by giving @value{create} to @code{tar}. @item Explicitly name the archive file being created---@value{file}. If you don't use this option @code{tar} will write the archive to the default storage device, which varies from system to system. @item Specify which files to put into the archive. If you don't specify any @var{file name} arguments, @code{tar} will archive everything in the working directory. @end itemize @noindent Type: @example % tar --create --file=records blues folk jazz @end example @noindent If you now list the contents of the working directory (@samp{ls}), you will find the archive file listed as well as the files you saw previously. @example % ls blues folk jazz records % @end example This example shows you how to create an archive file in the working directory containing other files in the working directory. The three files you archive in this example are called @file{blues}, @file{folk}, and @file{jazz}. The archive file is called @file{records}. While the archive in this example is written to the file system, it could also be written to any other device. (If you want to follow along with this and future examples, create a directory called @file{practice} containing files called @file{blues}, @file{folk} and @file{jazz}. To create the directory, type @samp{mkdir practice} at the system prompt. It will probably be easiest to create the files using a text editor, such as Emacs.) First, change into the directory containing the files you want to archive: @example % cd practice @end example @file{~/practice} is now your working directory. Then, check that the files to be archived do in fact exist in the working directory, and make sure there isn't already a file in the working directory with the archive name you intend to use. If you specify an archive file name that is already in use, @code{tar} will overwrite the old file and its contents will be lost. To list the names of files in the working directory, type: @example % ls @end example The system responds: @example blues folk jazz % @end example Then, @itemize @bullet @item Create a new archive by giving the @value{create} option to @code{tar}. @item Explicitly name the archive file being created---@value{file}. If you don't use this option @code{tar} will write the archive to the default storage device, which varies from system to system. @format FIXME: this syntax may change. OK now--check before printing @end format @code{tar} interprets archive file names relative to the working directory. Make sure you have write access to the working directory before using @code{tar}. @item Specify which files to put into the archive (@code{tar} interprets file names relative to the working directory). If you don't use any @var{name} arguments, @code{tar} will archive everything in the working directory. @end itemize Type: @example % tar --create --file=records blues folk jazz @end example If you now list the contents of the working directory (@samp{ls}), you will find the archive file listed as well as the files you saw previously. @example % ls blues folk jazz records % @end example @node Using tar in Verbose Mode bis, How to Archive Directories, Creating Archives of Files bis, How to Create Archives @subsection Using @code{tar} in Verbose Mode @include docwarn.texi If you include the @value{verbose} option on the command line, @code{tar} will list the files it is acting on as it is working. The example above in verbose mode would be: @refill @example % tar --create --file=records --verbose blues folk jazz blues folk jazz @end example @noindent The first line, which is preceeded by a @samp{%}, is the command line. The lines after the first line are generated by @code{tar} as it works. In the following examples we usually use verbose mode, though it is almost never required. If you include the @value{verbose} option on the command line, @code{tar} will list the files it is acting on as it is working. In verbose mode, the creation example above would appear as: @example % tar --create --file=records --verbose blues folk jazz blues folk jazz @end example The first line is the command typed in by the user. The remaining lines are generated by @code{tar}. In the following examples we usually use verbose mode, though it is almost never required. @node How to Archive Directories, Creating an Archive of a Subdirectory bis, Using tar in Verbose Mode bis, How to Create Archives @subsection How to Archive Directories @include docwarn.texi When the names of files or members specify directories, the operation of @code{tar} is more complex. Generally, when a directory is named, @code{tar} also operates on all the contents of the directory, recursively. Thus, to @code{tar}, the file name @file{/} names the entire file system. To archive the entire contents of a directory, use @value{create} or @value{append} as usual, and specify the name of the directory. For example, to archive all the contents of the current directory, use @samp{tar --create --file=@var{archive-name} .}. Doing this will give the archive members names starting with @samp{./}. To archive the contents of a directory named @file{foodir}, use @samp{tar --create --file=@var{archive-name} foodir}. In this case, the member names will all start with @samp{foodir/}. If you give @code{tar} a command such as @samp{tar --create --file=foo.tar .}, it will report @samp{tar: foo.tar is the archive; not dumped}. This happens because the archive @file{foo.tar} is created before putting any files into it. Then, when @code{tar} attempts to add all the files in the directory @file{.} to the archive, it notices that the file @file{foo.tar} is the same as the archive, and skips it. (It makes no sense to put an archive into itself.) GNU @code{tar} will continue in this case, and create the archive as normal, except for the exclusion of that one file. Other versions of @code{tar}, however, are not so clever, and will enter an infinite loop when this happens, so you should not depend on this behavior. In general, make sure that the archive is not inside a directory being dumped. When extracting files, you can also name directory archive members on the command line. In this case, @code{tar} extracts all the archive members whose names begin with the name of the directory. As usual, @code{tar} is not particularly clever about interpreting member names. The command @samp{tar --extract --file=@var{archive-name} .} will not extract all the contents of the archive, but only those members whose member names begin with @samp{./}. @menu * Creating an Archive of a Subdirectory bis:: @end menu @node Creating an Archive of a Subdirectory bis, Compare bis, How to Archive Directories, How to Create Archives @subsection Creating an Archive from the Superior Directory @include docwarn.texi You can archive a directory by specifying its directory name as a file name argument to @code{tar}. The files in the directory will be archived relative to the working directory, and the directory will be re-created along with its contents when the archive is extracted. To archive a directory, first move to its superior directory. If you have been following the tutorial, you should type: @example % cd .. % @end example Once in the superior directory, you can specify the subdirectory as a file name argument. To store the directory @file{practice} in the archive file @file{music}, type: @example % tar --create --verbose --file=music practice @end example @noindent @code{tar} should output: @example practice/ practice/blues practice/folk practice/jazz practice/records @end example Note that the archive thus created is not in the subdirectory @file{practice}, but rather in the working directory---the directory from which @code{tar} was invoked. Before trying to archive a directory from its superior directory, you should make sure you have write access to the superior directory itself, not only the directory you are trying archive with @code{tar}. Trying to store your home directory in an archive by invoking @code{tar} from the root directory will probably not work. @format FIXME: xref absolute-names @end format (Note also that @file{records}, the original archive file, has itself been archived. @code{tar} will accept any file as a file to be archived, regardless of its content. When @file{music} is extracted, the archive file @file{records} will be re-written into the file system). You can store a directory in an archive by using the directory name as a file name argument to @code{tar}. When you specify a directory file, @code{tar} archives the directory file and all the files it contains. The names of the directory and the files it contains are stored in the archive relative to the current working directory--when the directory is extracted they will be written into the file system relative to the working directory at that time. @format FIXME: add an xref to --absolute-names @end format To archive a directory, first move to its superior directory. If you have been following the tutorial, you should type: @example % cd .. % @end example Once in the superior directory, specify the subdirectory using a file name argument. To store the directory file @file{~/practice} in the archive file @file{music}, type: @example % tar --create --verbose --file=music practice @end example @code{tar} should respond: @example practice/ practice/blues practice/folk practice/jazz practice/records @end example Note that @file{~/practice/records}, another archive file, has itself been archived. @code{tar} will accept any file as a file to be archived, even an archive file. @format FIXME: symbolic links and changing directories are now in main body, FIXME: not in tutorial. @end format @node Compare bis, Using Compare from the Superior Directory bis, Creating an Archive of a Subdirectory bis, How to Create Archives @subsection Comparing Files in an Archive with Files in the File System @include docwarn.texi While the @value{list} operation with the @value{verbose} option specified is useful in keeping files in the archive current with files in the file system (by allowing the user to compare size and modification dates), it is simpler to have @code{tar} itself compare file attributes and report back on file differences. To do so, use the @value{compare} or @samp{--diff} operation. The @value{compare} operation, as its name implies, causes @code{tar} to compare files and directories in the archive with their counterparts (files of the same name) in the file system, and report back differences in file size, mode, owner and modification date. When performing the @value{compare} operation, @code{tar} acts only on files actually in the archive---it will ignore files in the active file system that do not exist in the archive. If @code{tar} with @value{compare} specified is given, as a file name argument, the name of a file that does not exist in the archive, it will return an error message. To compare the files in the practice directory with their counterparts in the archive file @file{records}, in the same directory, you would, while in the @file{practice} directory: @itemize @bullet @item Invoke @code{tar} and specify the operation to compare files in the archive with their counterparts in the file system---@value{compare} or @samp{--diff}. @item Specify the name of the archive where the files to be compared are stored---@value{file}. @item Specify the names of the files or directories to be compared, as file name arguments (in this case, you are comparing all the files in the archive, so nothing need be specified). @end itemize @example % tar --compare --file=records % @end example @noindent While it looks like nothing has happened, @code{tar} has, in fact, done the comparison---and found nothing to report. The same example with the @value{verbose} option specified would list the files in the archive as they are being compared with their counterparts of the same name: @example % tar --compare --verbose --file=records blues folk jazz % @end example If @code{tar} had had anything to report, it would have done so as it was comparing each file. If you remove the file @file{jazz} from the file system (@samp{rm jazz}), and modify the file @file{blues} (for instance, by adding text to it with a text editor), the above example would look like: @example % tar --compare --verbose --file=records blues blues: mod time differs blues: size differs folk jazz jazz: does not exist % @end example You should note again that while @value{compare} does cause @code{tar} to report back on files in the archive that do not exist in the file system, @code{tar} will ignore files in the active file system that do not exist in the archive. To demonstrate this, create a file in the @file{practice} directory called @file{rock} (using any text editor). If you generate a directory listing the new file will appear. @example % ls blues folk records rock @end example @noindent If you run the @value{compare} example again you will obtain the following: @example % tar --compare --verbose --file=records blues blues: mod time differs blues: size differs folk jazz jazz: does not exist % @end example @code{tar} ignores the file @file{rock} because @code{tar} is comparing files in the archive to files in the file system, not vice versa. If @file{rock} had been passed to @code{tar} explicitly (as a file name argument), @code{tar} would have returned an error message, as follows: @example % tar --compare --verbose --file=records rock tar: rock not found in archive % @end example To compare the attributes of archive members with the attributes of their counterparts in the file system, use the @value{compare} or @samp{--diff}operation. While you could use @samp{--list --verbose} (@samp{-tv}) to manually compare some file attributes, it is simpler to have @code{tar} itself compare file attributes and report back on file differences. @format FIXME: "manually"? suggestions? @end format The @value{compare} operation, as its name implies, compares archive members with files of the same name in the file system, and reports back differences in file size, mode, owner and modification date. @samp{tar +compare} acts only on archive members--it ignores files in the file system that are not stored in the archive. If you give with @value{compare} a @var{name} argument that does not correspond to the name of an archive member, @code{tar} responds with an error message. To compare archive members in the archive file @file{records} with files in the @file{~/practice} directory, first change into the @file{practice} directory. Then: @itemize @bullet @item Invoke @code{tar} and specify the @value{compare} operation---@value{compare} or @samp{--diff}. @item Specify the archive where the files to be compared are stored---@value{file}. @item Specify the archive members to be compared. (In this example you are comparing all the archive members in the archive. Since this is the default, you don't need to use any file name arguments). @end itemize @example % tar --compare --file=records % @end example While it looks like nothing has happened, @code{tar} has, in fact, done the comparison---and found nothing to report. Use the @value{verbose} option to list the names of archive members as they are being compared with their counterparts of the same name in the file system: @example % tar --compare --verbose --file=records blues folk jazz % @end example If @code{tar} had had anything to report, it would have done so as it was comparing each file. If you remove the file @file{jazz} from the file system (@samp{rm jazz}), and modify the file @file{blues} (for instance, by adding text to it with an editor such as Emacs), the above example would look like: @example % tar --compare --verbose --file=records blues blues: mod time differs blues: size differs folk jazz jazz: does not exist % @end example Note again that while @value{compare} reports the names of archive members that do not have counterparts in the file system, @value{compare} ignores files in the file system that do not have counterparts in the archive. To demonstrate this, create a file in the @file{practice} directory called @file{rock} (using any text editor). The new file appears when you list the directory's contents: @format FIXME: Given an example @end format @node Using Compare from the Superior Directory bis, , Compare bis, How to Create Archives @subsection Using Compare from the Superior Directory @include docwarn.texi In addition to using @value{compare} to compare individual files in an archive with their counterparts in the file system, you can use @value{compare} to compare archived directories with their counterparts in the active file system. You could re-create the examples above using your home directory as the working directory, and using the archive file @file{music} (in which is stored the @file{practice} directory) instead of the archive file @file{records}. First, change into the home directory (@samp{cd ..}). Then, try the above example using @file{music} as the specified archive file, and the @file{practice} subdirectory as a file name argument. @example % tar --compare --verbose --file=music practice practice practice/blues practice/blues: mod time differs practice/blues: size differs practice/folk practice/jazz practice/jazz: does not exist practice/records @end example In addition to using @value{compare} to compare text files, you can use @value{compare} to compare directories. To illustrate this, re-create the examples above using your home directory as the working directory, and using the archive file @file{~/music} instead of the archive file @file{~/practice/records}. First, change into your home directory (@samp{cd ~}). Then, try the above example using @file{music} as the specified archive file, and @file{practice} as a file name argument. @example % tar --compare --verbose --file=music practice @end example If you have been following along with the tutorial, @code{tar} will respond: @example practice practice/blues practice/blues: mod time differs practice/blues: size differs practice/folk practice/jazz practice/jazz: does not exist practice/records @end example @node How to List Archives, How to Extract Members from an Archive, How to Create Archives, Tutorial @section How to List Archives @include docwarn.texi Use @value{list} to print the names of members stored in an archive. Use a @value{file} option just as with @value{create} to specify the name of the archive. For example, the archive @file{afiles.tar} created in the last section could be examined with the command @samp{tar --list --file=afiles.tar}. The output of @code{tar} would then be: @example apple angst asparagus @end example The archive @file{bfiles.tar} would list as follows: @example ./baloons baboon ./bodacious @end example (Of course, @samp{tar --list --file=empty-archive.tar} would produce no output.) If you use the @value{verbose} option with @value{list}, then @code{tar} will print out a listing reminiscent of @samp{ls -l}, showing owner, file size, and so forth. You can also specify member names when using @value{list}. In this case, @code{tar} will only list the names of members you identify. For example, @samp{tar --list --file=afiles.tar apple} would only print @samp{apple}. It is essential when specifying member names to @code{tar} that you give the exact member names. For example, @samp{tar --list --file=bfiles baloons} would produce no output, because there is no member named @file{baloons}, only one named @file{./baloons}. While the file names @file{baloons} and @file{./baloons} name the same file, member names are compared using a simplistic name comparison, in which an exact match is necessary. @menu * Listing files in an archive bis:: * Getting Additional File Information bis:: * List A Specific File in an Archive bis:: * Listing the Contents of a Stored Directory ter:: @end menu @node Listing files in an archive bis, Getting Additional File Information bis, How to List Archives, How to List Archives @subsection Listing the Contents of an Archive @include docwarn.texi You can list the contents of the archive you just created with another option of @code{tar}: @value{list}. To list the contents of an archive, type: @example % tar --list --file=records @end example @code{tar} will respond: @example blues folk jazz @end example @format FIXME: xref Listing Archive Contents @end format , for a more detailed tutorial of the @value{list} operation. @format FIXME: xref Listing Contents @end format for more information about the @value{list} operation. @format FIXME: @end format You can use @value{list} to output a list of the files in an archive. If you use file name arguments with this operation, @code{tar} will look in the archive for the files specified and display their names only if they are, in fact, stored. You can use @value{list} with the @value{verbose} option to find out the attributes (owner, size, etc.) of stored files. You can list the contents of an archive with another operation of @code{tar}: @value{list}. To list the contents of the archive you just created, type: @example % tar --list --file=records @end example @code{tar} will respond: @example blues folk jazz @end example @format FIXME: xref Listing Archive Contents @end format , for a more detailed tutorial of the @value{list} operation. @format FIXME: xref Listing Contents @end format , for more information about the @value{list} operation. In a previous example, you created the archive @file{music} in the home directory. To list the contents of @file{music}: @itemize @bullet @item List the contents of an archive by using @value{list} with @code{tar}. @item Specify the name of the archive to be listed---@value{file}. @end itemize Thus: @example % tar --list --file=music practice/ practice/blues practice/folk practice/jazz practice/records @end example Use @value{list} to print the names of files stored in an archive. If you use file name arguments with this operation, @code{tar} prints the names of the specified files if they are stored in the archive. If you use a directory name as a file name argument, @code{tar} also prints the names of all underlying files, including sub-directories. If you use no file name arguments, @code{tar} prints the names of all the archive members. You can use @value{list} with the @value{verbose} option to print archive members' attributes (owner, size, etc.). To list the names of files stored in an archive, use the @value{list} operation of @code{tar}. In a previous example, you created the archive @file{~/music}. To list the contents of @file{music}, while in your home directory: @itemize @bullet @item List the contents of an archive by using @value{--list} with @code{tar}. @item Specify the archive to be listed---@value{file}. @end itemize Thus: @example % tar --list --file=music practice/ practice/blues practice/folk practice/jazz practice/records @end example @node Getting Additional File Information bis, List A Specific File in an Archive bis, Listing files in an archive bis, How to List Archives @subsection Getting Additional File Information @include docwarn.texi When you specify the @value{verbose} option in conjunction with @value{list}, @code{tar} will print additional information about the files being listed (file protection, owner and group ID, size, and date and time of creation). The example above, in verbose mode, would be: @example % tar --list --verbose --file=music drwxrwxrwx myself/user 0 May 31 21:49 1990 practice/ -rw-rw-rw- myself/user 42 May 21 13:29 1990 practice/blues -rw-rw-rw- myself/user 62 May 23 10:55 1990 practice/folk -rw-rw-rw- myself/user 40 May 21 13:30 1990 practice/jazz -rw-rw-rw- myself/user 10240 May 31 21:49 1990 practice/records % @end example Note that using @value{verbose} with @value{list} does not cause @code{tar} to print the names of files as they are being acted on, though the @value{verbose} option will have this effect with all other operations. To get more information when you list the names of files stored in an archive, specify the @value{verbose} option in conjunction with @value{list}. @code{tar} will print archive member's file protection, owner and group ID, size, and date and time of creation. For example: @example % tar --list --verbose --file=music drwxrwxrwx myself/user 0 May 31 21:49 1990 practice/ -rw-rw-rw- myself/user 42 May 21 13:29 1990 practice/blues -rw-rw-rw- myself/user 62 May 23 10:55 1990 practice/folk -rw-rw-rw- myself/user 40 May 21 13:30 1990 practice/jazz -rw-rw-rw- myself/user 10240 May 31 21:49 1990 practice/records % @end example Note that when you use @value{verbose} with @value{list}, @code{tar} doesn't print the names of files as they are being acted on, though the @value{verbose} option will have this effect when used with all other operations. @node List A Specific File in an Archive bis, Listing the Contents of a Stored Directory ter, Getting Additional File Information bis, How to List Archives @subsection List A Specific File in an Archive @include docwarn.texi @format FIXME: @end format To to see if a particular file is in an archive, specify the name of the file in question as a file name argument while specifying the @value{list} operation. For example, if you wanted to see if the file @file{folk} were in the archive file @file{music}, you would: @itemize @bullet @item Invoke @code{tar}, and specify the operation to list the contents of an archive---@value{list}. @item Specify the name of the archive file to be acted on---@value{file}. @item Specify the name of the file @code{tar} is to look for, as a file name argument. Because @code{tar} preserves paths, file names must be specified as they appear in the archive (ie.. as they are relative to the directory from which the archive was created). @format FIXME: xref -P @end format @end itemize Type: @example % tar --list --file=music practice/folk @end example @noindent @code{tar} responds: @example practice/folk @end example @noindent If the file were not in the archive (for example, the file @file{practice/rock}), the example above would look like: @example % tar --list --file=music practice/rock tar: practice/rock not found in archive @end example The @value{verbose} option does not have any effect on execution of the @value{list} operation when you have specified file name arguments. @format FIXME: this is a bug (?) @end format To to see if a particular file is in an archive, use the name of the file in question as a file name argument while specifying the @value{list} operation. For example, to see whether the file @file{folk} is in the archive file @file{music}, do the following: @itemize @bullet @item Invoke @code{tar}, and specify the @value{list} operation. @item Specify the archive file to be acted on---@value{file}. @item Specify the files to look for, by typing their names as file name arguments. You have to type the file name as it appears in the archive (normally, as it is relative to the relative to the directory from which the archive was created). @format FIXME: xref absolute-names @end format @end itemize Type: @example % tar --list --file=music practice/folk @end example @code{tar} responds: @example practice/folk @end example If the file were not stored in the archive (for example, the file @file{practice/rock}), the example above would look like: @example % tar --list --file=music practice/rock tar: practice/rock not found in archive @end example If you had used @value{verbose} mode, the example above would look like: @example % tar --list --file=music practice/folk -rw-rw-rw- myself/user 62 May 23 10:55 1990 practice/folk @end example @node Listing the Contents of a Stored Directory ter, , List A Specific File in an Archive bis, How to List Archives @subsection Listing the Contents of a Stored Directory @include docwarn.texi To get information about the contents of an archived directory, use the directory name as a file name argument in conjunction with @value{list}. To find out file attributes, include the @value{verbose} option. For example, to find out about files in the directory @file{practice}, in the archive file @file{music}, type: @example % tar --list --file=music practice @end example @code{tar} responds: @example drwxrwxrwx myself/user 0 May 31 21:49 1990 practice/ -rw-rw-rw- myself/user 42 May 21 13:29 1990 practice/blues -rw-rw-rw- myself/user 62 May 23 10:55 1990 practice/folk -rw-rw-rw- myself/user 40 May 21 13:30 1990 practice/jazz -rw-rw-rw- myself/user 10240 May 31 21:49 1990 practice/records @end example When you use a directory name as a file name argument, @code{tar} acts on all the files (including sub-directories) in that directory. @node How to Extract Members from an Archive, How to Add Files to Existing Archives, How to List Archives, Tutorial @section How to Extract Members from an Archive @include docwarn.texi In order to extract members from an archive, use the @value{extract} option. Specify the name of the archive with @value{file}. To extract specific archive members, give their member names as arguments. It essential to give their exact member name, as printed by @value{list}. This will create a copy of the archive member, with a file name the same as its name in the archive. Keeping the example of the two archives created at the beginning of this tutorial, @samp{tar --extract --file=afiles.tar apple} would create a file @file{apple} in the current directory with the contents of the archive member @file{apple}. It would remove any file named @file{apple} already present in the directory, but it would not change the archive in any way. Remember that specifying the exact member name is important. @samp{tar --extract --file=bfiles.tar baloons} will fail, because there is no member named @file{baloons}. To extract the member named @file{./baloons} you would need to specify @samp{tar --extract --file=bfiles.tar ./baloons}. To find the exact member names of the members of an archive, use @value{list}. @format FIXME: xref Listing Archives. @end format If you do not list any archive member names, then @value{extract} will extract all the members of the archive. If you give the @value{verbose} option, then @value{extract} will print the names of the archive members as it extracts them. @menu * Extracting Files bis:: * Extracting Files from an Archive ter:: * Extracting Specific Files ter:: * Extracting Directories ter:: @end menu @node Extracting Files bis, Extracting Files from an Archive ter, How to Extract Members from an Archive, How to Extract Members from an Archive @subsection Extract Files from an Archive into Your Current Directory @include docwarn.texi Obviously, the ultimate goal of @code{tar} users is to eventually get their files back. To do this, use the @value{extract} or @samp{--get} operation. @value{extract} can be used to retrieve individual files from an archive, or can be used to write all the files in the archive back into the file system. In the previous example you concatenated two archives, @file{music}, and @file{practice/records}. To now retrieve the complete contents of @file{music} (the target file in the concatenation process), you would, from the home directory: @itemize @bullet @item Invoke @code{tar} and specify the operation to extract files from an archive (@value{extract} or @samp{--get}. @item Specify the name of the archive the files will be extracted from---@value{file}. @item Specify the names of the files you wish to extract, as file name arguments (in this case you want to extract the entire archive, so you don't need to specify anything). @end itemize @example % tar --extract --file=music tar: Could not make directory practice : File exists @end example @noindent Because the files stored originally in @file{music} were stored as files in a subdirectory (not as files in the working directory), they are stored in the archive with a leading directory name---@code{tar}, in restoring them, has tried to recreate that directory and failed: the directory already exists. The extraction has not been aborted, however. If you now change into the @file{practice} directory and generate a directory listing, you will find that @file{jazz}, which we removed in an earlier example, has been resurrected. @example % cd practice % ls blues classical folk jazz records rock @end example If you look more closely at the files in the directory, however, you will find that @file{blues} and @file{folk} are, in fact, the original versions of the file, which were stored in @file{music} at the beginning of the tutorial. @code{tar}, in extracting the original files from @file{music}, has overwritten the existing files in the file system. While the newer versions of the files were stored in @file{records} above, they can no longer be extracted from it. @file{records} too was archived by @code{tar} when the @file{practice} directory was stored in the archive file @file{music}, and was restored to its older incarnation when the files in @file{practice} were overwritten. However, the newer version of @file{records} was concatenated with @file{music}. The contents of the newer version of @file{records}, therefore, should have been extracted when all the contents of @file{music} were extracted. They were. @code{tar} has restored them into the working directory using the names with which they were originally stored. Because they were originally stored as part of @file{records}, in the @file{practice} directory, they had no preceeding directory stored as part of their file names. To find the latest versions of @file{blues}, @file{folk}, @file{jazz}, @file{rock} and @file{classical}, look in your home directory. You may wish to restore the files in your @file{practice} directory to their last state before we extracted the files from @file{music}. Rather than moving the files from your home directory to the @file{practice} subdirectory, you can run the same extraction procedure as above using the @file{practice} subdirectory as your working directory: @example % cd practice % tar --extract --verbose --file=~/music practice/ practice/blues practice/folk practice/jazz practice/records blues folk jazz blues rock blues classical % @end example @noindent If you now examine the files in the practice directory, you will find that the files have been restored to their previous, newer, states. The old versions of the files, which were stored in @file{music} with a preceeding directory name, have been written into a newly created subdirectory under the working directory (which is your @file{practice} subdirectory). The new subdirectory is also called @file{practice}. @node Extracting Files from an Archive ter, Extracting Specific Files ter, Extracting Files bis, How to Extract Members from an Archive @subsection Extracting Files from an Archive @include docwarn.texi Creating an archive is only half the job---there would be no point in storing files in an archive if you couldn't retrieve them. To extract files from an archive, use the @value{extract} operation. To extract specific files, use their names as file name arguments. If you use a directory name as a file name argument, @code{tar} extracts all the files (including subdirectories) in that directory. If you don't use any file name arguments, @code{tar} extracts all the files in the archive. Note: @code{tar} will extract an archive member into the file system without checking to see if there is already a file with the archive member's file name. If there is a file with that name, @code{tar} will @emph{overwrite} that file and its contents will be lost. @format FIXME: xref keep-old @end format @node Extracting Specific Files ter, Extracting Directories ter, Extracting Files from an Archive ter, How to Extract Members from an Archive @subsection Extracting Specific Files @include docwarn.texi To extract specific files, specify them using file name arguments. In an example above, you created the archive file @file{~/practice/records}, which contained the files @file{blues}, @file{folk} and @file{jazz} in the @file{practice} directory. If, for some reason, you were to lose one of those text files (@samp{rm ~/practice/blues}), you could extract it from the archive file. First, change into the @file{practice} directory. Then, @itemize @bullet @item Invoke @code{tar} and specify the @value{extract} or @samp{--get} operation. @item Specify the archive that the files will be extracted from---@value{file}. @item Specify the files to extract, using file name arguments (if you don't specify any files, @code{tar} extracts all the archive members) @end itemize @example % tar --extract --file=records blues @end example If you list the contents of the directory, you will see that @file{blues} is back: @example % ls folk jazz records blues @end example @node Extracting Directories ter, , Extracting Specific Files ter, How to Extract Members from an Archive @subsection Extracting Directories @include docwarn.texi To extract a directory and all the files it contains, use the directory's name as a file name argument in conjunction with @samp{tar +extract}. Remember--@code{tar} stores and extracts file names relative to the working directory. In a previous example you stored the directory @file{~/practice} in the archive file @file{~/music}. If you delete the contents of @file{practice}, you can restore them using @code{tar}. First, change into the @file{practice} subdirectory (@samp{cd ~/practice}). Then, remove all the files in @file{~/practice} (@samp{rm *}). If you list the contents of the directory, you should now see that it is empty: @example %ls % @end example Let's try to restore the contents of @file{practice} by extracting them from the archive file @file{~/music}: @example tar --extract --file=~/music practice @end example Now, list the contents of @file{practice} again: @example %ls practice @end example What happened to the files? When you created @file{~/music}, your working directory was your home directory. When you extracted @file{~/music}, your working directory was @file{~/practice}. @code{tar} stored the files in @file{practice} relative to your home directory, and then extracted them relative to @file{~/practice}. The files are now in a new subdirectory, called @file{~/practice/practice}. To restore your files to their old positions, delete the new directory and its contents, and then redo the example above with your home directory as the working directory: @example % rm ~/practice/practice/* % rmdir practice % cd .. % tar --extract --file=music practice @end example (@code{tar} will report that it is unable to create the directory @file{~/practice} because it already exists. This will not effect the extraction of the other archive members.) @node How to Add Files to Existing Archives, How to Delete Members from Archives, How to Extract Members from an Archive, Tutorial @section How to Add Files to Existing Archives @include docwarn.texi If you want to add files to an existing archive, then don't use @value{create}. That will erase the archive and create a new one in its place. Instead, use @value{append}. The command @samp{tar --append --file=afiles.tar arbalest} would add the file @file{arbalest} to the existing archive @file{afiles.tar}. The archive must already exist in order to use @value{append}. As with @value{create}, the member names of the newly added files will be the exact same as their names given on the command line. The @value{verbose} option will print out the names of the files as they are written into the archive. If you add a file to an archive using @value{append} with the same name as an archive member already present in the archive, then the old member is not deleted. What does happen, however, is somewhat complex. @format FIXME: xref Multiple Members with the Same Name. @end format If you want to replace an archive member, use @value{delete} first, and then use @value{append}. @format FIXME: we want people to use the script for backups, so I an not going FIXME: to use backups as an explanation in the tutorial. (people can still FIXME: do it if they really want to) @end format While you can use @code{tar} to create a new archive every time you want to store a file, it is more sometimes efficient to add files to an existing archive. To add new files to an existing archive, use the @value{append} operation. To add newer versions of archive members to an archive, use the @value{update} operation. While you can use @code{tar} to create an archive of an entire directory or directory tree, it is more efficient when performing backups to only archive those files which have been newly created or changed since the last backup. To add new files to an existing archive, or to add newer versions of old files, you can use the @value{append} operation, or the @value{update} operation. @menu * Append bis:: * Update bis:: * Concatenate bis:: @end menu @node Append bis, Update bis, How to Add Files to Existing Archives, How to Add Files to Existing Archives @subsection Appending Files to an Archive @include docwarn.texi The simplest method of adding a file to an already existing archive is the @value{append} operation, which writes the files specified into the archive without regard to whether or not they are already among the archived files. When you use @value{append} you must specify file name arguments, there is no default. If you specify a file that already exists in the archive another copy of the file will be added to the end of the archive anyway. In the previous examples you created a file called @file{rock} in the practice directory which did not exist in either the archive file @file{records}, in the practice directory, or the archive file @file{music}, in the home directory. To add @file{rock} to @file{records}, you would, while in the practice directory: @itemize @bullet @item Invoke @code{tar} and specify the operation to add a file---@value{append}. @item Specify the name of the archive to which the file will be added---@value{file}. @item Specify the name(s) of the file(s) to be added to the archive as the file name argument(s) @end itemize @example % tar --append --file=records rock @end example @noindent If you now use the @value{list} operation, you will see that @file{rock} has been added to the archive: @example % tar --list --file=records blues folk jazz rock @end example While all newly created files have now been added to @file{records}, it is still not current with respect to the contents of the practice directory. If you recall from the examples using @value{compare} above, @file{blues} was changed after the archive @file{records} was created. It is simple, however, to use @value{append} to correct the problem: @example % tar --append --verbose --file=records blues blues @end example @noindent Because you specified the @value{verbose} option, @code{tar} has printed the name of the file being appended as it was acted on. If you now use @code{tar} with the @value{list} option specified to get the contents of the archive, you will optain the following: @example % tar --list -f records blues folk jazz rock blues @end example @noindent The newest version of @file{blues} is now at the end of the archive. Because files are extracted from archives in the order in which they appear in the archive, and because extracted files are given the same names in the file system as they are stored under in the archive, when the files in @file{records} are extracted the newer version of @file{blues} (which has the same name as the older) will overwrite the version stored first. @format FIXME: xref Keep Old Files @end format @format FIXME: --update wont take a directory argument if files that have been FIXME: archived from that directory are now no longer in it. (I assume FIXME: because it looks in the archive first for the directory listing.) FIXME: this is a bug @end format The simplest method of adding a file to an existing archive is the @value{append} operation, which writes files into the archive without regard to whether or not they are already archive members. When you use @value{append} you must use file name arguments; there is no default. If you specify a file that is already stored in the archive, @code{tar} adds another copy of the file to the archive. If you have been following the previous examples, you should have a text file called @file{~/practice/rock} which has not been stored in either the archive file @file{~/practice/records}, or the archive file @file{~/music}. To add @file{rock} to @file{records}, first make @file{practice} the working directory (@samp{cd practice}). Then: @itemize @bullet @item Invoke @code{tar} and specify the @value{append} operation. @item Specify the archive to which the file will be added---@value{file}. @item Specify the files to be added to the archive, using file name arguments @end itemize For example: @example % tar --append --file=records rock @end example If you list the archive members in @file{records}, you will see that @file{rock} has been added to the archive: @example % tar --list --file=records blues folk jazz rock @end example @format FIXME: this should be some kind of node. @end format You can use @value{append} to keep archive members current with active files. Because @value{append} stores a file whether or not there is already an archive member with the same file name, you can use @value{append} to add newer versions of archive members to an archive. When you extract the file, only the version stored last will wind up in the file system. Because @value{extract} extracts files from an archive in sequence, and overwrites files with the same name in the file system, if a file name appears more than once in an archive the last version of the file will overwrite the previous versions which have just been extracted. If you recall from the examples using @value{compare} above, @file{blues} was changed after the archive @file{records} was created. It is simple, however, to use @value{append} to add the new version of @file{blues} to @file{records}: @example % tar --append --verbose --file=records blues blues @end example If you now list the contents of the archive, you will obtain the following: @example % tar --list -f records blues folk jazz rock blues @end example The newest version of @file{blues} is at the end of the archive. When the files in @file{records} are extracted, the newer version of @file{blues} (which has the same name as the older) will overwrite the version stored first. When @value{extract} is finished, only the newer version of @file{blues} is in the file system. @format FIXME: xref keep-old-files @end format @node Update bis, Concatenate bis, Append bis, How to Add Files to Existing Archives @subsection Updating Files in an Archive @include docwarn.texi While the @value{append} option is useful for updating files in an archive, to keep an archive current with @value{append} you must first use the @value{compare} or @value{list} options to determine what files have been changed (or be willing to waste space by adding identical copies of archived files to the ends of archives). It is simpler to use the @value{update} operation, and let @code{tar} do the work for you. The @value{update} option causes @code{tar} to add files to the end of an archive, just like the @value{append} option. When you invoke @code{tar} with the @value{update} option specified you must specify file name arguments. Unlike @value{append}, the @value{update} option causes @code{tar} to check the archive to be updated to see if the specified file is already stored. If the file (or one with the same name) is already in the archive, @code{tar} checks the modification date of the file in the archive and compares it to the file of the same name in the file system. The file is only appended to the archive if it is new or if its modification date has changed to a later one. @format FIXME: xref After-Date @end format To see the @value{update} option at work, create a new file, @file{classical}, in your practice directory, and add a line to the file @file{blues}, using any text editor. Then invoke @code{tar} with the @value{update} operation and the @value{verbose} option specified, using the names of all the files in the practice directory as file name arguments: @example % tar --update --verbose --file=records blues folk rock classical blues classical % @end example @noindent Because we have specified verbose mode, @code{tar} prints out the names of the files it is working on, which in this case are the names of the files that needed to be updated. If you now invoke @code{tar} with the @value{list} operation specified, to generate a listing of the files in the archive, you will see that @file{blues} and @file{classical} have been added to its end. [The reason @code{tar} does not overwrite the older file when updating it is because writing to the middle of a section of tape is a difficult process. Tapes are not designed to go backward. Even if they were, imagine what would happen if the newer version were longer than the older one.] To keep archive members up to date with their counterparts of the same name in the file system, use the @value{update} option. This adds a specified file to an archive if no file of that name is already stored in the archive. If there is already an archive member with the same name, @code{tar} checks the modification date of the archive member, and adds the file only if its modification date is later. If a file is stored in the archive but no longer exists under the same name in the active file system, @code{tar} reports an error. You could use the @value{append} option to keep an archive current, but do so you would either have to use the @value{compare} and @value{list} options to determine what files needed to be re-archived (which could waste a lot of time), or you would have to be willing to add identical copies of already archived files to the archive (which could waste a lot of space). You must use file name arguments with the @value{update} operation--if you don't specify any files, @code{tar} won't act on any files. To see the @value{update} option at work, create a new file, @file{~/practice/classical}, and modify the file @file{~/practice/blues} (you can use a text editor, such as Emacs, to do both these things). Then, with @file{practice} as your working directory, invoke @code{tar} with the @value{update} option, using the names of all the files in the practice directory as file name arguments, and specifying the @value{verbose} option: @example % tar --update --verbose --file=records blues folk rock classical blues classical % @end example Because you specified verbose mode, @code{tar} printed out the names of the files it acted on. If you now list the archive members of the archive, (@samp{tar --list --file=records}), you will see that the file @file{classical} and another version of the file @file{blues} have been added to @file{records}. Note: When you update an archive, @code{tar} does not overwrite old archive members when it stores newer versions of a file. This is because archive members appear in an archive in the order in which they are stored, and some archive devices do not allow writing in the middle of an archive. @node Concatenate bis, , Update bis, How to Add Files to Existing Archives @subsection Concatenating Archives @include docwarn.texi Rather than adding individual files onto the end of an archive, it may be more convenient to add archives themselves onto the end of an archive. While it may seem intuitive to use @code{cat}, the utility for adding files together, for this purpose, archives created by @code{tar} incorporate an end of file marker which must be removed if the concatenated archives are to be read properly as one archive @format FIXME: xref Ignore zeros. @end format To add archives to the end of another archive, therefore, you should use the @value{concatenate} operation. In earlier examples you created an archive file, @file{music}, in your home directory. You have, however, since changed the contents of the @file{practice} directory which was stored in that archive. @file{records}, the archive file in the @file{practice} directory, has recently been updated, and contains a current version of the files in @file{practice}. Rather than update the contents of @file{music}, let's add @file{records} to it. @itemize @bullet @item Change into the home directory (@samp{cd ..}) @item Invoke @code{tar}, and specify the operation to add archives to the end of another archive---@value{concatenate}. @item Specify the name of the archive file to be added to---@value{file}. @item Specify the file name arguments, which are, unusually, the names of archive files. Remember to include the directory name in the file name, if the archive file is not in your working directory. @end itemize @example % cd .. % tar --concatenate --file=music practice/records @end example Rather than list the new contents of @file{music}, let's extract all the files and see what happens. To concatenate archive files, use the @value{concatenate} option. This operation adds other archives to the end of an archive. While it may seem intuitive to concatenate archives using @code{cat}, the utility for adding files together, archive files which have been ``catted'' together cannot be read properly by @code{tar}. Archive files incorporate an end of file marker--if archives are concatenated using @code{cat}, this marker will appear before the end of the new archive. This will interfere with operations on that archive. @format FIXME: xref ignore-zeros @end format In earlier examples, you stored the @file{~/practice} directory in an archive file, @file{~/music}. If you have been following the examples, you have since changed the contents of the @file{~/practice} directory. There is a current version of the files in the @file{practice} directory, however, stored in the archive file @file{~/practice/records}. To store current versions of the files in @file{practice} in the archive file @file{music}, you can use @value{concatenate} to add the archive file @file{~/practice/records} to @file{music}. First, make sure you are in your home directory (@samp{cd ~}). Then: @itemize @bullet @item Invoke @code{tar}, and specify the @value{concatenate} operation. @item Specify the archive file to be added to---@value{file}. @item Specify the archives to be added, using file name arguments. In this case, the file name arguments are, unusually, the names of archive files. (Remember to include the path in the archive name, if the archive file is not in your working directory.) @end itemize @example % cd ~ % tar --concatenate --file=music practice/records @end example If you now list the contents of the @file{music}, you see it now contains the archive members of @file{practice/records}: @example %tar --list --file=music blues folk jazz rock blues practice/blues practice/folk practice/jazz practice/rock practice/blues practice/classical @end example @node How to Delete Members from Archives, , How to Add Files to Existing Archives, Tutorial @section How to Delete Members from Archives @include docwarn.texi You can delete members from an archive using @value{delete}. Specify the name of the archive with @value{file}. List the member names of the members to be deleted. (If you list no member names, then nothing will be deleted.) The @value{verbose} option will cause @code{tar} to print the names of the members as they are deleted. As with @value{extract}, it is important that you give the exact member names when using @samp{tar --delete}. Use @value{list} to find out the exact member names in an archive. @format FIXME: xref Listing Archives. @end format The @value{delete} option only works with archives stored on disk. You cannot delete members from an archive stored on a tape. In some instances, it may be advantageous to remove some files from an archive stored on disk (it is never advantageous to delete files from an archive stored on tape---the linear nature of tape storage makes this action likely to scramble the archive). You can use the @value{delete} operation to remove files from an archive. The names of files to be removed must be specified to @code{tar} as file name arguments. All versions of the named file are removed from the archive. Execution of the @value{delete} operation can be very slow. To delete all versions of the file @file{blues} from the archive @file{records} in the @file{practice} directory, make sure you are in that directory, and then, @itemize @bullet @item List the contents of the archive file @file{records} (see above for the steps involved) to insure that the file(s) you wish to delete are stored in the archive. (This step is optional) @item Invoke @code{tar} and specify the operation to delete files from an archive (@value{delete}) @item Specify the name of the archive file that the file(s) will be deleted---@value{file}. @item Specify the name(s) of the file(s) to be deleted, as file name arguments @item List the contents of the archive file again---note that the files have been removed. (this step is also optional) @end itemize @example % tar --list --file=records blues folk jazz % tar --delete --file=records blues % tar --list --file=records folk jazz % @end example In some instances, you may want to remove some files from an archive stored on disk @quotation @emph{Caution:} you should never delete files from an archive stored on tape--because of the linear nature of tape storage, doing this is likely to scramble the archive. @end quotation To remove archive members from an archive, use the @value{delete} operation. You must specify the names of files to be removed as file name arguments. All versions of the named file are removed from the archive. Execution of the @value{delete} operation can be very slow. To delete all versions of the file @file{blues} from the archive @file{records} in the @file{practice} directory, make sure you are in that directory, and then: @itemize @bullet @item List the contents of the archive file @file{records} (see above for the steps involved) to insure that the file(s) you wish to delete are stored in the archive. (This step is optional) @item Invoke @code{tar} and specify the @value{delete} operation (@value{delete}). @item Specify the name of the archive file that the file(s) will be deleted from---@value{file}. @item Specify the files to be deleted, using file name arguments. @item List the contents of the archive file again---note that the files have been removed. (this step is also optional) @end itemize @example % tar --list --file=records blues folk jazz % tar --delete --file=records blues % tar --list --file=records folk jazz % @end example @node Invoking tar, Basic tar Operations, Tutorial, Top @chapter Invoking GNU @code{tar} @include docwarn.texi @menu * Synopsis:: * Option Styles:: * Options:: @end menu @node Synopsis, Option Styles, Invoking tar, Invoking tar @section General Synopsis of @code{tar} The usual way to invoke @code{tar} is: @example tar @var{option}@dots{} [@var{name}]@dots{} @end example You can actually type in arguments in any order, but in this manual the options always precede the other arguments, to make examples easier to understand. Further, the option stating the main operation mode (the @code{tar} @dfn{main command}) is usually given first. There are surely many options to @code{tar}, and three different style for writing them: mnemonic options, short options, and old options. These styles are discussed below. Some options make sense with any main command, while others are meaningful only with particular main commands. One option should state the main command, all others are truly optional. Beware that @code{tar} options are case sensitive. For example, @value{List} or @value{List} options are not equivalent to @value{list}, in fact, they do not even exist. Options @samp{-T} and @samp{-t} are different options, the first requires an argument for stating the name of a file providing a list of @var{name}s, the second does not require an argument and is another way to write @value{list}. Each @var{name} in the synopsis above is interpreted as an archive member name when the main command is one of @value{compare}, @value{delete}, @value{extract}, @value{list} or @value{update}. For all other main commands, @var{name}s are interpreted as the names of files (including directories) in the file system. @code{tar} interprets relative file names as being relative to the working directory. @code{tar} will make all file names relative (by removing leading @samp{/}s when archiving or restoring files), unless you specify otherwise (using the @value{absolute-names} option). @format FIXME: xref File Name Interpretation @end format , for more information about @value{absolute-names}. @format FIXME: yet another node name that is probably wrong. @end format The distinction between file names and archive member names is especially important when shell globbing is used, and sometimes a source of confusion for newcomers. @dfn{Globbing} is the operation by which @dfn{wildcard} characters, @samp{*} or @samp{?} for example, are replaced and expanded into all existing files matching the given pattern. The problem is that shells may only glob using existing files in the file system. Only @code{tar} may glob on archive members, so when needed, you must ensure that wildcard characters reach @code{tar} without being interpreted by the shell first. Using a backslash before @samp{*} or @samp{?}, or putting the whole argument between quotes, is usually sufficient for this. Even if @var{name}s are often specified on the command line, they can also be read from a text file in the file system, using the @value{files-from} option. Each of the following subsection groups some options under a common functionality. You can use @code{tar} to store files in an archive, to extract them from an archive, and to do other types of archive manipulation. The primary argument to @code{tar}, which is called the @dfn{operation}, specifies which action to take. The other arguments to @code{tar} are either @dfn{options}, which change the way @code{tar} performs an operation, or @dfn{file names}, which specify the files @code{tar} is to act on. The typical @code{tar} command line syntax is: @cindex exit status @cindex return status GNU @code{tar} returns only a few exit statuses. I'm really aiming simplicity in that area, for now. If you are not using the @value{compare} option, zero means that everything went well, besides maybe innocuous warnings. Nonzero means that something went wrong. Right now, as of today, ``nonzero'' is almost always 2, except for remote operations, where it may be 128. @node Option Styles, Options, Synopsis, Invoking tar @section Many Styles for Options @menu * Mnemonic Options:: * Short Options:: * Old Options:: * Mixing Styles:: @end menu @node Mnemonic Options, Short Options, Option Styles, Option Styles @subsection Mnemonic Option Style Each @var{option} has at least one mnemonic option name starting with two dashes in a row, v.g. @value{list}. The mnemonic option names are more legible than the corresponding short or old option names, you may prefer them if you highly praise clarity. It sometimes happens that a single mnemonic option has many different different names, which are then synonymous. In addition, mnemonic option names can be given unique abbreviations. For example, @samp{--cre} can be used in place of @samp{--create} because there is no other mnemonic option which begins with @samp{cre}. Some options require an argument. This is the case of the @value{file} option, which tells the name of the @code{tar} archive. The argument of a mnemonic option is usually given right after the option itself, and introduced by an equal sign. For example, the @value{file} option is given the @file{archive.tar} file as argument by using the notation @samp{--file=archive.tar} for the mnemonic option. Mnemonic options are meant to be obvious and easy to remember, possibly more so than their corresponding short options, below. For example: @example tar --create --verbose --block-size=20 --file=/dev/rmt0 @end example @noindent gives a fairly good set of hints about what the command does, even for those not fully acquainted with @code{tar}. @node Short Options, Old Options, Mnemonic Options, Option Styles @subsection Short Option Style Most options, but not all of them, also have a short option name starting with a single dash, and followed by a single character, v.g. @samp{-t}. In fact, @samp{-t} is exactly the short option name for the mnemonic option @value{list}, both having exactly the same meaning. The forms are absolutely identical in function. The short option names are faster to type than mnemonic option names. All along this manual, whenever a mnemonic option name is given, its equivalent short option name follows between parentheses, if such a short option name exists. Short options which require arguments use the immediately following argument, so it may be thought as being merely introduced right after it, usually separate by white space. It is also possible to stick the argument right after the short option name, using no intervening space. So one might write @w{@samp{-f archive.tar}} or @samp{-farchive.tar} instead of using @samp{--file=archive.tar}. Both @samp{--file=@var{archive-name}} and @w{@samp{-f @var{archive-name}}} denote the option to give the archive a non-default name, which in the example is @file{archive.tar}. When the option is given separately, its argument follows it, as is usual for Unix programs. For example: @example tar -c -v -b 20 -f /dev/rmt0 @end example Short options letters may be lumped together, but contrary to old options, they do not necessarily have to. When short options are nevertheless coalesced, use a single dash for them all. Only the last one in such a set is allowed to have an argument. (Clustering many options, the last of which taking an argument, seems to be fairly opaque writing to me. I would even like that GNU @code{getopt} be helpful enough to make this illegal.) If you move short options in the command, be sure to move their arguments along with them, if any. @node Old Options, Mixing Styles, Short Options, Option Styles @subsection Old Option Style @include docwarn.texi Old options are single letters not preceeded by any dash at all, and appearing @emph{only} in the position immediately following the @samp{tar} keyword in the command, after some white space. The letter of an old option is exactly the same letter as the corresponding short option. For example, the old option @samp{t} is the same as the short option @samp{-t}, and consequently, the same as long option @value{list}. As far as we know, all @code{tar} programs, GNU and non-GNU, support old options. GNU @code{tar} supports them not only for historical reasons, but also because many people are used to them. All old options should be written as a single argument, without separating spaces, by lumping together all letters specifying these options. This set of letters should be the first to appear on the command line, after the @code{tar} program name; old options cannot appear anywhere else. Then, for any old option required an argument, the argument should follow on the command line. Arguments to the options should appear in the same order as the letters to which they correspond. The @code{tar} command synopsis might be rewritten: @example tar @var{letter}@dots{} [@var{argument}]@dots{} [@var{option}]@dots{} [@var{name}]@dots{} @end example @noindent when old options are being used. This command syntax is useful because it lets you type the single letter forms of the operation and options as a single argument to @code{tar}, without writing preceding @samp{-}s or inserting spaces between letters. @samp{tar cv} or @samp{tar -cv} are equivalent to @samp{tar -c -v}. @cindex option syntax, traditional For compatibility with Unix @code{tar}, the first argument can contain an option letter (or a cluster of option letters) @emph{not} introduced by a dash; for example, @samp{tar cv} specifies the option @samp{-v} in addition to the command @samp{-c}. When options that need arguments are given together with the command, all the associated arguments follow, in the same order as the options. Thus, the example above could also be written in the old style as follows: @example tar cvbf 20 /dev/rmt0 @end example @noindent Here @samp{20} is the argument of @samp{-b} and @samp{/dev/rmt0} is the argument of @samp{-f}. On the other hand, this old style syntax makes it difficult to match option letters with their corresponding arguments, and is often confusing. In the command @samp{tar cvbf 20 /dev/rmt0}, for example, @samp{20} is the argument for @samp{-b}, @samp{/dev/rmt0} is the argument for @samp{-f}, and @samp{-v} does not have a corresponding argument. Even using short options like in @samp{tar -c -v -b 20 -f /dev/rmt0} is clearer, putting all arguments next to the option they pertain to. If you want to reorder the letters in the old option argument, be sure to appropriately reorder any corresponding argument. This old way of writing @code{tar} options can surprise even experienced users. For example, the two commands: @example tar cfz archive.tar.gz file tar -cfz archive.tar.gz file @end example @noindent are quite different. The first example uses @file{archive.tar.gz} as the value for option @samp{f} and recognizes the option @samp{z}. The second example, however, uses @file{z} as the value for option @samp{f}---probably not what was intended. (I find it quite inelegant that @code{getopt} batches the remaining @samp{z} as the value for @samp{f}. I think that clarity dictates that clustering of option letters, when some require arguments, should be diagnosed and disallowed. But compatibility with traditional systems dictates it.) This second example could be corrected in many ways, among which: @example tar -czf archive.tar.gz file tar -cf archive.tar.gz -z file tar cf archive.tar.gz -z file @end example @node Mixing Styles, , Old Options, Option Styles @subsection Mixing Option Styles All three styles may be intermixed in a single @code{tar} command, as long as the rules for each style are fully respected. In GNU @code{tar} up to 1.11.6, using old style options was cutting out the possibility of using many options not having short forms. Many users rightly expressed their frustration at fighting with the current @code{tar} option decoder, so I changed it. However, GNU @code{tar} needs to be compatible with other @code{tar}s, in the things that other @code{tar}s can do. Short options should provide upward compatibility. So, if the current option decoding raises incompatibilities, please let me know. Old style options and modern options may be mixed on a single call to the @code{tar} program. However, old style options should be introduced in the first argument only; modern options may be given only after all arguments to old style options have been collected. If this rule is not respected, a modern option might be falsely interpreted as the value of the argument to one of the old style options. For example, currently, all the following commands are wholly equivalent, and illustrate many combinations and orderings of option styles. @example tar --create --file=archive.tar tar --create -f archive.tar tar --create -farchive.tar tar --file=archive.tar --create tar --file=archive.tar -c tar -c --file=archive.tar tar -c -f archive.tar tar -c -farchive.tar tar -cf archive.tar tar -cfarchive.tar tar -f archive.tar --create tar -f archive.tar -c tar -farchive.tar --create tar -farchive.tar -c tar c --file=archive.tar tar c -f archive.tar tar c -farchive.tar tar cf archive.tar tar f archive.tar --create tar f archive.tar -c tar fc archive.tar @end example On the other hand, the following commands are @emph{not} equivalent to the previous set: @example tar -f -c archive.tar tar -fc archive.tar tar -fcarchive.tar tar -farchive.tarc tar cfarchive.tar @end example @noindent These last examples mean something completely different of what the user might have intended. The first four specify that the @code{tar} archive would be a file named @samp{-c}, @samp{c}, @samp{carchive.tar} or @samp{archive.tarc}, respectively. The first two examples also specify a single non-option, @var{name} argument having value @samp{archive.tar}. The last example contains only old style option letters (repeating option @samp{c} twice) and no argument value. @node Options, , Option Styles, Invoking tar @section All Available Options @include docwarn.texi Options change the way @code{tar} performs an operation. @table @samp @item --absolute-names @item --after-date=@var{date} Limit the operation to files changed after the given date. @format FIXME: xref File Exclusion @end format . @item --block-size=@var{number} Specify the blocking factor of an archive. @format FIXME: xref Blocking Factor @end format . @item --compress Specify a compressed archive. @format FIXME: xref Compressed Archives @end format . @item --compress-block. Create a whole block sized compressed archive. @format FIXME: xref Compressed Archives @end format . @item --confirmation Solicit confirmation for each file. @format FIXME: xref Interactive Operation @end format @format FIXME: --selective should be a synonym. @end format @item --dereference Treat a symbolic link as an alternate name for the file the link points to. @format FIXME: xref Symbolic Links @end format . @item --directory=@file{directory} Change the working directory. @format FIXME: xref Changing Working Directory @end format . @item --exclude=@var{pattern} Exclude files which match the regular expression @var{pattern}. @format FIXME: xref File Exclusion @end format . @item --exclude-from=@file{file} Exclude files which match any of the regular expressions listed in the file @file{file}. @format FIXME: xref File Exclusion @end format . @item --file=@var{archive-name} Name the archive. @format FIXME: xref Archive Name @end format ). @item --files-from=@file{file} Read file name arguments from a file on the file system. @format FIXME: xref File Name Lists @end format . @item --ignore-umask Set modes of extracted files to those recorded in the archive. @format FIXME: xref File Writing Options @end format . @item --ignore-zeros Ignore end-of-archive entries. @format FIXME: xref Archive Reading Options @end format . @format FIXME: this should be changed to --ignore-end @end format @item --tape-length=@var{n} (-L) @format FIXME: alternate way of doing multi archive, will go to that length and FIXME: prompts for new tape, automatically turns on multi-volume. this FIXME: needs to be written into main body as well @end format @item --info-script=@var{program-file} Create a multi-volume archive via a script. @format FIXME: xref Multi-Volume Archives @end format . @item --interactive Ask for confirmation before performing any operation on a file or archive member. @item --keep-old-files Prevent overwriting during extraction. @format FIXME: xref File Writing Options @end format . @item --label=@var{archive-label} Include an archive-label in the archive being created. @format FIXME: xref Archive Label @end format . @item --modification-time Set the modification time of extracted files to the time they were extracted. @format FIXME: xref File Writing Options @end format . @item --multi-volume Specify a multi-volume archive. @format FIXME: xref Multi-Volume Archives @end format . @item --newer=@var{date} Limit the operation to files changed after the given date. @format FIXME: xref File Exclusion @end format . @item --newer-mtime=@var{date} Limit the operation to files modified after the given date. @format FIXME: xref File Exclusion @end format . @item --old Create an old format archive. @format FIXME: xref Old Style File Information @end format . @format FIXME: did we agree this should go away as a synonym? @end format @item --old-archive Create an old format archive. @format FIXME: xref Old Style File Information @end format . @item --one-file-system Prevent @code{tar} from crossing file system boundaries when archiving. @format FIXME: xref File Exclusion @end format . @item --portability Create an old format archive. @format FIXME: xref Old Style File Information @end format . @format FIXME: was portability, may still need to be changed @end format @item --preserve-order Help process large lists of file names on machines with small amounts of memory. @format FIXME: xref Archive Reading Options @end format . @item --preserve-permission Set modes of extracted files to those recorded in the archive. @format FIXME: xref File Writing Options @end format . @item --read-full-blocks Read an archive with a smaller than specified block size or which contains incomplete blocks. @format FIXME: xref Archive Reading Options @end format ). @format FIXME: should be --partial-blocks (!) @end format @item --record-number Print the record number where a message is generated. @format FIXME: xref Additional Information @end format . @item --same-order Help process large lists of file names on machines with small amounts of memory. @format FIXME: xref Archive Reading Options @end format . @item --same-permission Set the modes of extracted files to those recorded in the archive. @format FIXME: xref File Writing Options @end format . @item --sparse Archive sparse files sparsely. @format FIXME: xref Sparse Files @end format . @item --starting-file=@var{file name} Begin reading in the middle of an archive. @format FIXME: xref Scarce Disk Space @end format . @item --to-stdout Write files to the standard output. @format FIXME: xref File Writing Options @end format . @item --uncompress Specifdo a compressed archive. @format FIXME: xref Compressed Archives @end format . @item -V @var{archive-label} Include an archive-label in the archive being created. @format FIXME: xref Archive Label @end format . @format FIXME: was --volume @end format @item --verbose Print the names of files or archive members as they are being operated on. @format FIXME: xref Additional Information @end format . @item --verify Check for discrepancies in the archive immediately after it is written. @format FIXME: xref Write Verification @end format . @item -B Read an archive with a smaller than specified block size or which contains incomplete blocks. @format FIXME: xref Archive Reading Options @end format ). @item -K @var{file name} Begin reading in the middle of an archive. @format FIXME: xref Scarce Disk Space @end format . @item -M Specify a multi-volume archive. @format FIXME: xref Multi-Volume Archives @end format . @item -N @var{date} Limit operation to files changed after the given date. @format FIXME: xref File Exclusion @end format . @item -O Write files to the standard output. @format FIXME: xref File Writing Options @end format . @format FIXME: - P is absolute names, add when resolved. @end format @item -R Print the record number where a message is generated. @format FIXME: xref Additional Information @end format . @item -S Archive sparse files sparsely. @format FIXME: xref Sparse Files @end format . @item -T @var{file} Read file name arguments from a file on the file system. @format FIXME: xref File Name Lists @end format . @item -W Check for discrepancies in the archive immediately after it is written. @format FIXME: xref Write Verification @end format . @item -Z Specify a compressed archive. @format FIXME: xref Compressed Archives @end format . @item -b @var{number} Specify the blocking factor of an archive. @format FIXME: xref Blocking Factor @end format . @item -f @var{archive-name} Name the archive. @format FIXME: xref Archive Name @end format ). @item -h Treat a symbolic link as an alternate name for the file the link points to. @format FIXME: xref Symbolic Links @end format . @item -i Ignore end-of-archive entries. @format FIXME: xref Archive Reading Options @end format . @item -k Prevent overwriting during extraction. @format FIXME: xref File Writing Options @end format . @item -l Prevent @code{tar} from crossing file system boundaries when archiving. @format FIXME: xref File Exclusion @end format . @item -m Set the modification time of extracted files to the time they were extracted. @format FIXME: xref File Writing Options @end format . @item -o Create an old format archive. @format FIXME: xref Old Style File Information @end format . @item -p Set the modes of extracted files to those recorded in the archive. @format FIXME: xref File Writing Options @end format . @item -s Help process large lists of file names on machines with small amounts of memory. @format FIXME: xref Archive Reading Options @end format . @item -v Print the names of files or archive members they are being operated on. @format FIXME: xref Additional Information @end format . @item -w @format FIXME: see --interactive. @end format @item -z Specify a compressed archive. @format FIXME: xref Compressed Archives @end format . @item -z -z Create a whole block sized compressed archive. @format FIXME: xref Compressed Archives @end format . @format FIXME: I would rather this were -Z. it is the only double letter short FIXME: form. @end format @item -C @file{directory} Change the working directory. @format FIXME: xref Changing Working Directory @end format . @item -F @var{program-file} Create a multi-volume archive via a script. @format FIXME: xref Multi-Volume Archives @end format . @item -X @file{file} Exclude files which match any of the regular expressions listed in the file @file{file}. @format FIXME: xref File Exclusion @end format . @end table @menu * Device Options:: * Blocking Options:: * Classification Options:: @end menu @node Device Options, Blocking Options, Options, Options @subsection Device selection and switching @include docwarn.texi @table @code @item -f [@var{hostname}:]@var{file} @itemx --file=[@var{hostname}:]@var{file} Use archive file or device @var{file} on @var{hostname}. @format FIXME: xref Device @end format . @item --force-local Archive file is local even if it contains a colon. @format FIXME: xref Device @end format . @item --rsh-command=@var{command} Use remote @var{command} instead of @code{rsh}. @format FIXME: xref Device @end format . @item -[0-7][lmh] Specify drive and density. @format FIXME: xref Device @end format . @item -M @itemx --multi-volume Create/list/extract multi-volume archive. @format FIXME: xref Multi @end format . @item -L @var{num} @itemx --tape-length=@var{num} Change tape after writing @var{num} x 1024 bytes. @format FIXME: xref Multi @end format . @item -F @var{file} @itemx --info-script=@var{file} @itemx --new-volume-script=@var{file} Execute @file{file} at end of each tape. This implies @value{multi-volume}). @format FIXME: xref Multi @end format . @end table @node Blocking Options, Classification Options, Device Options, Options @subsection Device blocking @include docwarn.texi @table @code @item -b @var{blocks} @itemx --block-size=@var{blocks} Set block size to @math{@var{blocks} * 512} bytes. @format FIXME: xref Blocking @end format . @item --block-compress Block the output of compression for tapes. @format FIXME: xref Blocking @end format . @item -i @itemx --ignore-zeros Ignore blocks of zeros in archive (means EOF). @format FIXME: xref Blocking @end format . @item -B @itemx --read-full-blocks Reblock as we read (for reading 4.2BSD pipes). @format FIXME: xref Blocking @end format . @end table @node Classification Options, , Blocking Options, Options @subsection Old classification of options @include docwarn.texi The information here is to be revised and merged into the remainder of this document, possibly altering its structure. Options could be regrouped in three categories: @table @asis @item General Options Options that are always meaningful. @item Creation Options Options for creating or updating an archive. @item Extraction Options Options for listing or extracting files. @end table Here are the options that are always meaningful. @table @asis @item @samp{-B @var{number}}, @samp{--block-size @var{number}} @item @samp{-f @var{filename}}, @samp{--file @var{filename}} @item @samp{-C @var{dir}}, @samp{--directory @var{dir}} @item @samp{-M}, @samp{--multi-volume} @item @samp{-N @var{date}}, @samp{--after-date @var{date}} @item @samp{-R}, @value{record-number} @item @samp{-T @var{filename}}, @samp{--files-from @var{filename}} @item @samp{-v}, @value{verbose} @item @samp{-w}, @samp{--interactive} @item @samp{-X @var{file}}, @samp{--exclude @var{file}} @item @samp{-z}, @samp{-Z}, @samp{--compress}, @samp{--uncompress} @end table Here are the options for creating or updating an archive. These options are used to control which files @code{tar} puts in an archive, or to control the format the archive is written in @format FIXME: ref Format @end format . Except as noted elsewhere, these options are useful with the @value{create}, @value{append}, @value{update}, @value{concatenate}, and @value{delete} commands. Also note that the @value{read-full-block} option @format FIXME: (pxref Extraction Options), @end format is also useful with the @value{append}, @value{update}, @value{concatenate}, and @value{delete} commands. @table @asis @item @samp{-G}, @samp{--incremental} @item @samp{-h}, @value{dereference} @item @samp{-l}, @samp{--one-file-system} @item @samp{-o}, @value{old-archive} @item @samp{--old}, @samp{--portability} @item @samp{-S}, @samp{--sparse} @item @samp{-V NAME}, @samp{--volume NAME} @item @samp{-W}, @samp{--verify} @end table Here are the options for listing or extracting files. The options in this section are meaningful with the @value{extract} command. Unless otherwise stated, they are also meaningful with the @value{list} command. @table @asis @item @samp{-B}, @samp{--read-full-blocks} @item @samp{-G}, @samp{--incremental} @item @samp{-i}, @samp{--ignore-zeros} @item @samp{-k}, @samp{--keep-old-files} @item @samp{-K @var{filename}}, @samp{--starting-file @var{filename}} @item @samp{-m}, @samp{--modification-time} @item @samp{-O}, @samp{--to-stdout} @item @samp{-p}, @samp{--same-permissions}, @samp{--preserve-permissions} @item @samp{-P}, @value{absolute-names} @item @samp{-s}, @samp{--same-order}, @samp{--preserve-order} @item @samp{--preserve} @end table @node Basic tar Operations, Specifying Names to tar, Invoking tar, Top @chapter Basic @code{tar} Operations @include docwarn.texi This chapter describes the basic operations supported by the @code{tar} program. A given invocation of @code{tar} will do exactly one of these operations. An archive member in normally extracted into a file with the same name as the archive member. However, you can use the @value{to-stdout} to cause @code{tar} to write extracted archive members to standard output. If you extract multiple members, they appear on standard output concatenated, in the order they are found in the archive. The @value{create} operation writes a new archive, and the @value{extract} operation reads files from an archive and writes them into the file system. You can use other @code{tar} operations to write new information into an existing archive (adding files to it, adding another archive to it, or deleting files from it), and you can read a list of the files in an archive without extracting it using the @value{list} operation. The primary argument to @code{tar} is the @dfn{operation}, which specifies what @code{tar} does. @code{tar} can be used to: @itemize @bullet @item Add files to an existing archive---@value{append}. @item Compare files in an archive with files in the file system---@value{compare} or @samp{--diff}. @item Add archives to another archive---@value{concatenate}. @item Create an archive---@value{create}. @item Delete files from an archive---@value{delete}. @item Extract files from an archive---@value{extract} or @samp{--get}. @item List the files in an archive---@value{list}. @item Update an archive by appending newer versions of already stored files---@value{update}. @end itemize @format FIXME: xref Reading and Writing @end format , for more information about these operations. @dfn{Option} arguments to @code{tar} change details of the operation, such as archive format, archive name, or level of user interaction. You can specify more than one option. All options are optional. @dfn{File Name} arguments specify which files (including directory files) to archive, extract, delete or otherwise operate on. If you don't use any file name arguments, @value{append}, @value{update} and @value{delete} will do nothing. The other operations of @code{tar} will act on defaults. When you use a file name argument to specify a directory file, @code{tar} acts on all the files in that directory, including sub-directories. You must give exactly one option from the following list to @code{tar}. This option specifies the basic operation for @code{tar} to perform. @table @samp @item --create @item -c Create a new archive @item --catenate @item --concatenate @item -A Add the contents of one or more archives to another archive @item --append @item -a Add files to an existing archive @item --list @item -t List the members in an archive @item --delete Delete members from an archive @item --extract @item --get @item -x Extract members from an archive @item --compare @item --diff @item -d Compare members in an archive with files in the file system @item --update @item -u Update an archive by appending newer versions of already stored files @end table The remaining options to @code{tar} change details of the operation, such as archive format, archive name, or level of user interaction. You can specify more than one option. The remaining arguments are interpreted either as file names or as member names, depending on the basic operation @code{tar} is performing. For @value{append} and @value{create} these arguments specify the names of files (which must already exist) to place in the archive. For the remaining operation types, the additional arguments specify archive members to compare, delete, extract, list, or update. When naming archive members, you must give the exact name of the member in the archive, as it is printed by @value{list}. When naming files, the normal file name rules apply. If you don't use any additional arguments, @value{append}, @value{concatenate}, and @value{delete} will do nothing. Naturally, @value{create} will make an empty archive if given no files to add. The other operations of @code{tar} (@value{list}, @value{extract}, @value{compare}, and @value{update}) will act on the entire contents of the archive. If you give the name of a directory as either a file name or a member name, then @code{tar} acts recursively on all the files and directories beneath that directory. For example, the name @file{/} identifies all the files in the filesystem to @code{tar}. The operation argument to @code{tar} specifies which action you want to take. @table @samp @item -A Adds copies of an archive or archives to the end of another archive. @item -c Creates a new archive. @item -d Compares files in the archive with their counterparts in the file system, and reports differences in file size, mode, owner, modification date and contents. @item -r Adds files to the end of the archive. @item -t Prints a list of the contents of the archive. @item -x Reads files from the archive and writes them into the active file system. @item -u Adds files to the end of the archive, but only if they are newer than their counterparts already in the archive, or if they do not already exist in the archive. @item --catenate Adds copies of an archive or archives to the end of another archive. @item --append Adds files to the end of the archive. @item --append Adds files to the end of the archive. @item --catenate Adds copies of an archive or archives to the end of another archive. @item --compare Compares files in the archive with their counterparts in the file system, and reports differences in file size, mode, owner, modification date and contents. @item --concatenate Adds copies of an archive or archives to the end of another archive. @item --create Creates a new archive. @item --delete Deletes files from the archive. All versions of the files are deleted. @item --diff Compares files in the archive with their counterparts in the file system, and reports differences in file size, mode, owner, modification date and contents. @item --extract Reads files from the archive and writes them into the active file system. @item --get Reads files from the archive and writes them into the active file system. @item --list Prints a list of the contents of the archive. @item --update Adds files to the end of the archive, but only if they are newer than their counterparts already in the archive, or if they do not already exist in the archive. @item --version Prints the version number of the @code{tar} program to the standard error. @end table The program @code{tar} can create an archive, extract files from an archive, modify an archive, or list an archive's contents. Each time you run @code{tar}, you must give a @dfn{command} to specify which one of these things you want to do. The command must always be in the first argument to @code{tar}. This argument can also contain options ( @format FIXME: pxref Invoking tar @end format ). For compatibility with Unix @code{tar}, the first argument is always treated as containing command and option letters even if it doesn't start with @samp{-}. Thus, @samp{tar c} is equivalent to @w{@samp{tar -c}:} both of them specify the @value{create} command to create an archive. In addition, a set of long-named options are provided which can be used instead of or intermixed with the single-letter flags. The long-named options are meant to be easy to remember and logical, while the single letter flags may not always be. Long-named options begin with @samp{--}. Arguments after the first are either options, if they start with @samp{-} or @samp{--}, or files to operate on. The file names that you give as arguments are the files that @code{tar} will act on---for example, they are the files to put in the archive, or the files to extract from it. If you don't give any file name arguments, the default depends on which command you used. Some commands use all relevant files; some commands have no default and will report an error if you don't specify files. @cindex directory arguments If a file name argument actually names a directory, then that directory and all files and subdirectories (recursively) in it are used. Here is a list of the @code{tar} commands: @table @code @item -c @itemx --create Create a new archive. This command tells @code{tar} to create a new archive that contains the file(s) specified on the command line. If you don't specify files, all the files in the current directory are used. If the archive file already exists, it is overwritten; the old contents are lost. @item -x @itemx --extract @itemx --get Extract files from an archive. This command causes @code{tar} to extract the specified files from the archive. If no file names are given, all the files in the archive will be extracted. @item -t @itemx --list List the contents of an archive. This command causes @code{tar} to display a list of the files in the archive. If you specify file names, only the files that you specify will be mentioned (but each of them is mentioned only if it appears in the archive). @item -d @itemx --diff @itemx --compare Find differences between an archive and the corresponding online files. This command causes @code{tar} to compare the archive with the files in the file system. It will report differences in file size, mode, owner, and contents. If a file exists in the archive, but not in the file system, @code{tar} will report this. If you specify file names, those files are compared with the tape and they must all exist in the archive. If you don't specify files, all the files in the archive are compared. @item -r @itemx --append Append files to the end of an archive. This command causes @code{tar} to add the specified file(s) to the end of the archive. This assumes that the archive file already exists and is in the proper format (which probably means it was created previously with the @code{tar} program). If the archive is not in a format that @code{tar} understands, the results will be unpredictable. You must specify the files to be used; there is no default. @item -u @itemx --update Only append files newer than the version in an archive. This command causes @code{tar} to add the specified files to the end of the archive, like @value{append}, but only when a file doesn't already exist in the archive or is newer than the version in the archive (the last-modification time is compared). Adding files to the end of an archive can be very slow. You must specify the files to be used; there is no default. @item -A @itemx --catenate @itemx --concatenate Append existing archives to another archive. This command is used for concatenating several archive files into one big archive file. The files to operate on should all be archive files. They are all appended to the end of the archive file which @code{tar} works on. (The other files are not changed). You might be tempted to use @code{cat} for this, but it won't ordinarily work. A @code{tar} archive contains data which indicates the end of the archive, so appended material is ignored. This command works because it removes the end-of-archive markers from the middle of the result. @item --delete Delete from the archive (not on tapes!). This command causes @code{tar} to delete the specified files from the archive. This command is extremely slow. Warning: Use of this command on archives stored on magnetic tape may result in a scrambled archive. There is no safe way (except for completely re-writing the archive) to delete files from a magnetic tape. @end table The program @code{tar} can create an archive, extract files from an archive, modify an archive, or list an archive's contents. Each time you run @code{tar}, you must give a @dfn{command} to specify which one of these things you want to do. The command must always be in the first argument to @code{tar}. This argument can also contain options ( @format FIXME: pxref Invoking tar @end format ). For compatibility with Unix @code{tar}, the first argument is always treated as containing command and option letters even if it doesn't start with @samp{-}. Thus, @samp{tar c} is equivalent to @w{@samp{tar -c}:} both of them specify the @value{create} command to create an archive. In addition, a set of long-named options are provided which can be used instead of or intermixed with the single-letter flags. The long-named options are meant to be easy to remember and logical, while the single letter flags may not always be. Long-named options begin with @samp{--}. Arguments after the first are either options, if they start with @samp{-} or @samp{--}, or files to operate on. The file names that you give as arguments are the files that @code{tar} will act on---for example, they are the files to put in the archive, or the files to extract from it. If you don't give any file name arguments, the default depends on which command you used. Some commands use all relevant files; some commands have no default and will report an error if you don't specify files. @cindex directory arguments If a file name argument actually names a directory, then that directory and all files and subdirectories (recursively) in it are used. Modifying Archives @cindex Modifying archives Once an archive is created, you can add new archive members to it, add the contents of another archive, add newer versions of members already stored, or delete archive members already stored. To find out what files are already stored in an archive, use @samp{tar --list --file=@var{archive-name}}. @format FIXME: xref Listing Contents @end format . @menu * Creating a New Archive:: * Adding to an Existing Archive:: * Updating an Archive:: * Combining Archives:: * Removing Archive Members:: * Listing Archive Members:: * Extracting Archive Members:: * Comparing Archives Members with Files:: * Matching Format Parameters:: @end menu @node Creating a New Archive, Adding to an Existing Archive, Basic tar Operations, Basic tar Operations @section Creating a New Archive @include docwarn.texi The @value{create} option causes @code{tar} to create a new archive. The files to be archived are then named on the command line. Each file will be added to the archive with a member name exactly the same as the name given on the command line. (When you give an absolute file name @code{tar} actually modifies it slightly, @format FIXME: ref Absolute Names @end format .) If you list no files to be archived, then an empty archive is created. If there are two many files to conveniently list on the command line, you can list the names in a file, and @code{tar} will read that file. @format FIXME: xref Reading Names from a File @end format . If you name a directory, then @code{tar} will archive not only the directory, but all its contents, recursively. For example, if you name @file{/}, then @code{tar} will archive the entire filesystem. Do not use the option to add files to an existing archive; it will delete the archive and write a new one. Use @value{append} instead. ( @format FIXME: xref Adding to an Existing Archive @end format .) There are various ways of causing @code{tar} to skip over some files, and not archive them. @format FIXME: xref Specifying Names to tar @end format . @format FIXME: operations should probably have examples, not tables. @end format @cindex Writing new archives @cindex Archive creation To create an archive, use @value{create}. To name the archive, use @samp{--file=@var{archive-name}} in conjunction with the @value{create} operation ( @format FIXME: pxref Archive Name @end format ). If you do not name the archive, @code{tar} uses the value of the environment variable @code{TAPE} as the file name for the archive, or, if that is not available, @code{tar} uses a default archive name, usually that for tape unit zero. @format FIXME: xref Archive Name @end format , for more information about specifying an archive name. The following example creates an archive named @file{stooges}, containing the files @file{larry}, @file{moe} and @file{curley}: @example tar --create --file=stooges larry moe curley @end example If you specify a directory name as a file name argument, @code{tar} will archive all the files in that directory. The following example creates an archive named @file{hail/hail/fredonia}, containing the contents of the directory @file{marx}: @example tar --create --file=hail/hail/fredonia marx @end example If you don't specify files to put in the archive, @code{tar} archives all the files in the working directory. The following example creates an archive named @file{home} containing all the files in the working directory: @example tar --create --file=home @end example @format FIXME: xref File Name Lists @end format , for other ways to specify files to archive. Note: In the example above, an archive containing all the files in the working directory is being written to the working directory. GNU @code{tar} stores files in the working directory in an archive which is itself in the working directory without falling into an infinite loop. Other versions of @code{tar} may fall into this trap. @node Adding to an Existing Archive, Updating an Archive, Creating a New Archive, Basic tar Operations @section Adding to an Existing Archive @include docwarn.texi The @value{append} option will case @code{tar} to add new files to an existing archive. It interprets file names and member names in exactly the same manner as @value{create}. Nothing happens if you don't list any names. This option never deletes members. If a new member is added under the same name as an existing member, then both will be in the archive, with the new member after the old one. For information on how this affects reading the archive, @format FIXME: ref Multiple Members with the Same Name @end format . This operation cannot be performed on some tape drives, unfortunately, due to deficiencies in the formats thoes tape drives use. @cindex Adding files to an archive @cindex Updating an archive To add files to an archive, use @value{append}. The archive to be added to must already exist and be in proper archive format (which normally means it was created previously using @code{tar}). If the archive was created with a different block size than now specified, @code{tar} will report an error ( @format FIXME: pxref Blocking Factor @end format ). If the archive is not a valid @code{tar} archive, the results will be unpredictable. You cannot add files to a compressed archive, however you can add files to the last volume of a multi-volume archive. @format FIXME: xref Matching Format Parameters @end format . The following example adds the file @file{shemp} to the archive @file{stooges} created above: @example tar --append --file=stooges shemp @end example You must specify the files to be added; there is no default. @value{update} acts like @value{append}, but does not add files to the archive if there is already a file entry with that name in the archive that has the same modification time. Both @value{update} and @value{append} work by adding to the end of the archive. When you extract a file from the archive, only the version stored last will wind up in the file system. Because @value{extract} extracts files from an archive in sequence, and overwrites files with the same name in the file system, if a file name appears more than once in an archive the last version of the file will overwrite the previous versions which have just been extracted. You should avoid storing older versions of a file later in the archive. Note: @value{update} is not suitable for performing backups, because it doesn't change directory content entries, and because it lengthens the archive every time it is used. @format FIXME: xref to scripted backup, listed incremental, for info on backups. @end format @node Updating an Archive, Combining Archives, Adding to an Existing Archive, Basic tar Operations @section Updating an Archive @include docwarn.texi The @value{update} option updates a @code{tar} archive by comparing the date of the specified archive members against the date of the file with the same name. If the file has been modified more recently than the archive member, then the archive member is deleted (as with @value{delete}) and then the file is added to the archive (as with @value{append}). On media where the @value{delete} option cannot be performed (such as magnetic tapes), the @value{update} option similarly fails. If no archive members are named (either on the command line or via @value{files-from}), then the entire archive is processed in this manner. @node Combining Archives, Removing Archive Members, Updating an Archive, Basic tar Operations @section Combining Archives @include docwarn.texi The @value{concatenate} or @value{catenate} option causes @code{tar} to add the contents of several archives to an existing archive. Name the archives to be catenated on the command line. (Nothing happens if you don't list any.) The members, and their member names, will be copied verbatim from those archives. If this causes multiple members to have the same name, it does not delete either; all the members with the same name coexist. For information on how this affects reading the archive, @format FIXME: ref Multiple Members with the Same Name @end format . You must use this option to concatenate archives. If you just combine them with @code{cat}, the result will not be a valid @code{tar} format archive. This operation cannot be performed on some tape drives, unfortunately, due to deficiencies in the formats thoes tape drives use. @cindex Adding archives to an archive @cindex Concatenating Archives To append copies of an archive or archives to the end of another archive, use @value{concatenate}. The source and target archives must already exist and have been created using compatable format parameters ( @format FIXME: pxref Matching Format Parameters @end format ). @code{tar} will stop reading an archive if it encounters an end-of-archive marker. The @code{cat} utility does not remove end-of-archive markers, and is therefore unsuitable for concatenating archives. @value{concatenate} removes the end-of-archive marker from the target archive before each new archive is appended. @format FIXME: xref ignore-zeros @end format You must specify the source archives using @value{file} ( @format FIXME: pxref Archive Name @end format ). If you do not specify the target archive , @code{tar} uses the value of the environment variable @code{TAPE}, or, if this has not been set, the default archive name. The following example adds the contents of the archive @file{hail/hail/fredonia} to the archive @file{stooges} (both archives were created in examples above): @example tar --catenate --file=stooges hail/hail/fredonia @end example If you need to retrieve files from an archive that was added to using the @code{cat} utility, use the @value{ignore-zeros} option ( @format FIXME: pxref Archive Reading Options @end format ). @node Removing Archive Members, Listing Archive Members, Combining Archives, Basic tar Operations @section Removing Archive Members @include docwarn.texi You can use the @value{delete} option to remove members from an archive. Name the members on the command line to be deleted. This option will rewrite the archive; because of this, it does not work on tape drives. If you list no members to be deleted, nothing happens. @cindex Deleting files from an archive @cindex Removing files from an archive To delete archive members from an archive, use @value{delete}. You must specify the file names of the members to be deleted. All archive members with the specified file names will be removed from the archive. The following example removes the file @file{curley} from the archive @file{stooges}: @example tar --delete --file=stooges curley @end example You can only use @value{delete} on an archive if the archive device allows you to write to any point on the media. @quotation @strong{Warning:} Don't try to delete an archive member from a magnetic tape, lest you scramble the archive. There is no safe way (except by completely re-writing the archive) to delete files from most kinds of magnetic tape. @end quotation @format FIXME: how about automatic detection of archive media? give error FIXME: unless the archive device is either an ordinary file or different FIXME: input and output (--file=-). @end format @node Listing Archive Members, Extracting Archive Members, Removing Archive Members, Basic tar Operations @section Listing Archive Members @include docwarn.texi The @value{list} option will list the names of members of the archive. Name the members to be listed on the command line (to modify the way these names are interpreted, @format FIXME: pxref Specifying Names to tar @end format ). If you name no members, then @value{list} will list the names of all the members of the archive. To see more than just the names of the members, use the @value{verbose} option to cause @code{tar} to print out a listing similar to that of @samp{ls -l}. Listing the Contents of an Archive @cindex Names of the files in an archive @cindex Archive contents, list of @cindex Archive members, list of @value{list} prints a list of the file names of the archive members on the standard output. If you specify @var{file name} arguments on the command line (or using the @value{files-from} option, @format FIXME: pxref File Name Lists @end format ), only the files you specify will be listed, and only if they exist in the archive. Files not specified will be ignored, unless they are under a specific directory. If you include the @value{verbose} option, @code{tar} prints an @samp{ls -l} type listing for the archive. @format FIXME: pxref Additional Information @end format , for a description of the @value{verbose} option. If the blocking factor of the archive differs from the default, @code{tar} reports this. @format FIXME: xref Blocking Factor @end format . @format FIXME: xref Archive Reading Options @end format for a list of options which can be used to modify @value{list}'s operation. This example prints a list of the archive members of the archive @file{stooges}: @example tar --list --file=stooges @end example @noindent @code{tar} responds: @example larry moe shemp marx/julius marx/alexander marx/karl @end example This example generates a verbose list of the archive members of the archive file @file{dwarves}, which has a blocking factor of two: @example tar --list -v --file=blocks @end example @noindent @code{tar} responds: @example tar: Blocksize = 2 records -rw------- ringo/user 42 May 1 13:29 1990 .bashful -rw-rw-rw- ringo/user 42 Oct 4 13:29 1990 doc -rw-rw-rw- ringo/user 42 Jul 20 18:01 1969 dopey -rw-rw---- ringo/user 42 Nov 26 13:42 1963 grumpy -rw-rw-rw- ringo/user 42 May 5 13:29 1990 happy -rw-rw-rw- ringo/user 42 May 1 12:00 1868 sleepy -rw-rw-rw- ringo/user 42 Jul 4 17:29 1776 sneezy @end example @node Extracting Archive Members, Comparing Archives Members with Files, Listing Archive Members, Basic tar Operations @section Extracting Archive Members @include docwarn.texi Use @value{extract} or @samp{--get} to extract members from an archive. For each member named (or for the entire archive if no members are named) on the command line---or with @value{files-from}---the a file is created with the contents of the archive member. The name of the file is the same as the member name. Various options cause @code{tar} to extract more than just file contents, such as the owner, the permissions, the modification date, and so forth. @format FIXME: begin @end format The @value{same-permissions} or @samp{--preserve-permissions} options cause @code{tar} to cause the new file to have the same permissions as the original file did when it was placed in the archive. Without this option, the current @code{umask} is used to affect the permissions. When extrating, @code{tar} normally sets the modification time of the file to the value recorded in the archive. The @value{modification-time} option causes @code{tar} to omit doing this. @format FIXME: end @end format @cindex Extraction @cindex Retrieving files from an archive @cindex Resurrecting files from an archive To read archive members from the archive and write them into the file system, use @value{extract}. The archive itself is left unchanged. If you do not specify the files to extract, @code{tar} extracts all the files in the archive. If you specify the name of a directory as a file name argument, @code{tar} will extract all files which have been stored as part of that directory. If a file was stored with a directory name as part of its file name, and that directory does not exist under the working directory when the file is extracted, @code{tar} will create the directory. @format FIXME: xref Selecting Archive Members @end format , for information on specifying files to extract. The following example shows the extraction of the archive @file{stooges} into an empty directory: @example tar --extract --file=stooges @end example @noindent Generating a listing of the directory (@samp{ls}) produces: @example larry moe shemp marx @end example @noindent The subdirectory @file{marx} contains the files @file{julius}, @file{alexander} and @file{karl}. If you wanted to just extract the files in the subdirectory @file{marx}, you could specify that directory as a file name argument in conjunction with the @value{extract} operation: @example tar --extract --file=stooges marx @end example @quotation @strong{Warning:} Extraction can overwrite files in the file system. To avoid losing files in the file system when extracting files from the archive with the same name, use the @value{keep-old-files} option ( @format FIXME: pxref File Writing Options @end format ). @end quotation If the archive was created using @value{block-size}, @value{compress} or @value{multi-volume}, you must specify those format options again when extracting files from the archive ( @format FIXME: pxref Format Variations @end format ). @menu * Archive Reading Options:: * File Writing Options:: * Scarce Disk Space:: @end menu @node Archive Reading Options, File Writing Options, Extracting Archive Members, Extracting Archive Members @subsection Options to Help Read Archives @cindex Options when reading archives @cindex Reading incomplete blocks @cindex Blocks, incomplete @cindex End-of-archive entries, ignoring @cindex Ignoring end-of-archive entries @cindex Large lists of file names on small machines @cindex Small memory @cindex Running out of space @include docwarn.texi @format FIXME: each option wants its own node. summary after menu @end format Normally, @code{tar} will request data in full block increments from an archive storage device. If the device cannot return a full block, @code{tar} will report an error. However, some devices do not always return full blocks, or do not require the last block of an archive to be padded out to the next block boundary. To keep reading until you obtain a full block, or to accept an incomplete block if it contains an end-of-archive marker, specify the @value{read-full-blocks} option in conjunction with the @value{extract} or @value{list} operations. @format FIXME: xref Listing Contents @end format . The @value{read-full-blocks} option is turned on by default when @code{tar} reads an archive from standard input, or from a remote machine. This is because on BSD Unix systems, attempting to read a pipe returns however much happens to be in the pipe, even if it is less than was requested. If this option were not enabled, @code{tar} would fail as soon as it read an incomplete block from the pipe. If you're not sure of the blocking factor of an archive, you can read the archive by specifying @value{read-full-blocks} and @value{block-size}, using a blocking factor larger than what the archive uses. This lets you avoid having to determine the blocking factor of an archive. @format FIXME: xref Blocking Factor @end format . @table @samp @item --read-full-blocks @item -B Use in conjunction with @value{extract} to read an archive which contains incomplete blocks, or one which has a blocking factor less than the one specified. @end table Normally @code{tar} stops reading when it encounters a block of zeros between file entries (which usually indicates the end of the archive). @value{ignore-zeros} allows @code{tar} to completely read an archive which contains a block of zeros before the end (i.e.@: a damaged archive, or one which was created by @code{cat}-ing several archives together). The @value{ignore-zeros} option is turned off by default because many versions of @code{tar} write garbage after the end-of-archive entry, since that part of the media is never supposed to be read. GNU @code{tar} does not write after the end of an archive, but seeks to maintain compatablity among archiving utilities. @table @samp @item --ignore-zeros @itemx -i To ignore blocks of zeros (ie.@: end-of-archive entries) which may be encountered while reading an archive. Use in conjunction with @value{extract} or @value{list}. @end table If you are using a machine with a small amount of memory, and you need to process large list of file names, you can reduce the amount of space @code{tar} needs to process the list. To do so, specify the @value{same-order} option and provide an ordered list of file names. This option tells @code{tar} that the @var{name} arguments provided on the command line, or read from a file using the @value{files-from} option, are listed in the same order as the files in the archive. You can create a file containing an ordered list of files in the archive by storing the output produced by @samp{tar --list --file=@var{archive-name}}. @format FIXME: xref Listing Contents @end format , for information on the @value{list} operation. This option is probably never needed on modern computer systems. @table @samp @item --same-order @itemx --preserve-order @itemx -s To process large lists of file names on machines with small amounts of memory. Use in conjunction with @value{compare}, @value{list} or @value{extract}. @end table @format FIXME: we don't need/want --preserve to exist any more @end format @node File Writing Options, Scarce Disk Space, Archive Reading Options, Extracting Archive Members @subsection Changing How @code{tar} Writes Files @format FIXME: find a better title @end format @cindex Overwriting old files, prevention @cindex Protecting old files @cindex Modification times of extracted files @cindex Permissions of extracted files @cindex Modes of extracted files @cindex Writing extracted files to standard output @cindex Standard output, writing extracted files to @include docwarn.texi Normally, @code{tar} writes extracted files into the file system without regard to the files already on the system---files with the same name as archive members are overwritten. To prevent @code{tar} from extracting an archive member from an archive, if doing so will overwrite a file in the file system, use @value{keep-old-files} in conjunction with the @value{extract} operation. When this option is specified, @code{tar} reports an error stating the name of the files in conflict, instead of writing the file from the archive. @table @samp @item --keep-old files @itemx -k Prevents @code{tar} from overwriting files in the file system during extraction. @end table Normally, @code{tar} sets the modification times of extracted files to the modification times recorded for the files in the archive, but limits the permissions of extracted files by the current @code{umask} setting. To set the modification times of extracted files to the time when the files were extracted, use the @value{modification-time} option in conjunction with @value{extract}. @table @samp @item --modification-time @itemx -m Sets the modification time of extracted archive members to the time they were extracted, not the time recorded for them in the archive. Use in conjunction with @value{extract}. @end table To set the modes (access permissions) of extracted files to those recorded for those files in the archive, use the @value{same-persmissions} option in conjunction with the @value{extract} operation. @format FIXME: mib --- should be aliased to ignore-umask. @end format @table @samp @item --preserve-permission @itemx --same-permission @itemx --ignore-umask @itemx -p Set modes of extracted archive members to those recorded in the archive, instead of current umask settings. Use in conjunction with @value{extract}. @end table @format FIXME: following paragraph needs to be rewritten: why doesnt' this cat FIXME: files together, why is this useful. is it really useful with FIXME: more than one file? @end format To write the files extracted to the standard output, instead of creating the files on the file system, use @value{to-stdout} in conjunction with @value{extract}. This option is useful if you are extracting files to send them through a pipe, and do not need to preserve them in the file system. @table @samp @item --to-stdout @itemx -O Writes files to the standard output. Used in conjunction with @value{extract}. @end table @format FIXME: why would you want to do such a thing, how are files separated on FIXME: the standard output? is this useful with more that one file? are FIXME: pipes the real reason? @end format @node Scarce Disk Space, , File Writing Options, Extracting Archive Members @subsection Recovering From Scarce Disk Space @cindex Middle of the archive, starting in the @cindex Running out of space during extraction @cindex Disk space, running out of @cindex Space on the disk, recovering from lack of @include docwarn.texi If a previous attempt to extract files failed due to lack of disk space, you can use @value{starting-file} to start extracting only after file @var{name} when extracting files from the archive. This assumes, of course, that there is now free space, or that you are now extracting into a different file system. @table @samp @item --starting-file=@var{file name} @itemx -K @var{file name} Starts an operation in the middle of an archive. Use in conjunction with @value{extract} or @value{list}. @end table If you notice you are running out of disk space during an extraction operation, you can also suspend @code{tar}, remove unnecessary files from the file system, and then restart the same @code{tar} operation. In this case, @value{starting-file} is not necessary. @format FIXME: xref --incremental, xref --interactive, xref --exclude @end format @node Comparing Archives Members with Files, Matching Format Parameters, Extracting Archive Members, Basic tar Operations @section Comparing Archives Members with Files @include docwarn.texi The @value{compare} or @samp{--diff} option compares the contents of the specified archive members against the files with the same names, and reports its findings. If no members are named on the command line, or through @value{files-from}, then the entire archive is so compared. @node Matching Format Parameters, , Comparing Archives Members with Files, Basic tar Operations @section Matching the Format Parameters @include docwarn.texi Some format parameters must be taken into consideration when modifying an archive: Compressed archives cannot be modified. You have to specify the block size of the archive when modifying an archive with a non-default block size. Multi-volume archives can be modified like any other archive. To add files to a multi-volume archive, you need to only mount the last volume of the archive media (and new volumes, if needed). For all other operations, you need to use the entire archive. If a multi-volume archive was labeled using @value{label} ( @format FIXME: pxref Archive Label @end format ) when it was created, @code{tar} will not automatically label volumes which are added later. To label subsequent volumes, specify @value{label} again in conjunction with the @value{append}, @value{update} or @value{concatenate} operation. @cindex Labelling multi-volume archives @format FIXME: example @end format @format FIXME: xref somewhere, for more information about format parameters. @end format @node Specifying Names to tar, Being Careful, Basic tar Operations, Top @chapter Specifying Names to @code{tar} @include docwarn.texi @menu * Changing the Archive Name:: * Characteristics:: * Selection Options:: @end menu @node Changing the Archive Name, Characteristics, Specifying Names to tar, Specifying Names to tar @section Changing the Archive Name @include docwarn.texi By default, @code{tar} uses an archive file name compiled in when @code{tar} was built. Usually this refers to some physical tape drive on the machine. Often, the installer of @code{tar} didn't set the default to anything meaningful at all. As a result, most uses of @code{tar} need to tell @code{tar} where to find (or create) the archive. The @value{file} option selects another file to use as the archive. If the archive file name includes a colon (@samp{:}), then it is assumed to be a file on another machine. If the archive file is @samp{@var{user}@@@var{host}:@var{file}}, then @var{file} is used on the host @var{host}. The remote host is accessed using the @code{rsh} program, with a username of @var{user}. If the username is omitted (along with the @samp{@@} sign), then your user name will be used. (This is the normal @code{rsh} behavior.) It is necessary for the remote machine, in addition to permitting your @code{rsh} access, to have the @file{/usr/ucb/rmt} program installed. If you need to use a file whose name includes a colon, then the remote tape drive behavior can be inhibited by using the @value{force-local} option. If the file name you give to @value{file} is a single dash (@samp{-}), then @code{tar} will read the archive from (or write it to) standard input (or standard output). The Name of an Archive @cindex Naming an archive @cindex Archive Name @cindex Directing output @cindex Where is the archive? An archive can be saved as a file in the file system, sent through a pipe or over a network, or written to an I/O device such as a tape or disk drive. To specify the name of the archive, use the @value{file} option. An archive name can be the name of an ordinary file or the name of an I/O device. @code{tar} always needs an archive name---if you do not specify an archive name, the archive name comes from the environment variable @code{TAPE} or, if that variable is not specified, a default archive name, which is usually the name of tape unit zero (ie. /dev/tu00). If you use @file{-} as an @var{archive-name}, @code{tar} reads the archive from standard input (when listing or extracting files), or writes it to standard output (when creating an archive). If you use @file{-} as an @var{archive-name} when modifying an archive, @code{tar} reads the original archive from its standard input and writes the entire new archive to its standard output. @format FIXME: does standard input and output redirection work with all FIXME: operations? FIXME: need example for standard input and output (screen and keyboard?) @end format @cindex Standard input and output @cindex tar to standard input and output To specify an archive file on a device attached to a remote machine, use the following: @example --file=@var{hostname}:/@var{dev}/@var{file name} @end example @noindent @code{tar} will complete the remote connection, if possible, and prompt you for a username and password. If you use @samp{--file=@@@var{hostname}:/@var{dev}/@var{file name}}, @code{tar} will complete the remote connection, if possible, using your username as the username on the remote machine. @format FIXME: is this clear? @end format @table @samp @item --file=@var{archive-name} @itemx -f @var{archive-name} Names the archive to create or operate on. Use in conjunction with any operation. @end table Selecting Archive Members @cindex Specifying files to act on @cindex Specifying archive members @dfn{File Name arguments} specify which files in the file system @code{tar} operates on, when creating or adding to an archive, or which archive members @code{tar} operates on, when reading or deleting from an archive. ( @format FIXME: pxref Reading and Writing @end format .) To specify file names, you can include them as the last arguments on the command line, as follows: @example tar @var{operation} [@var{option1} @var{option2} ..] [@var{file name-1} @var{file name-2} ...] @end example If you specify a directory name as a file name argument, all the files in that directory are operated on by @code{tar}. If you do not specify files when @code{tar} is invoked, @code{tar} operates on all the non-directory files in the working directory (if the operation is @value{create}), all the archive members in the archive (if a read operation is specified), or does nothing (if any other operation is specified). When specifying the names of files or members to @code{tar}, it by default takes the names of the files from the command line. There are other ways, however, to specify file or member names, or to modify the manner in which @code{tar} selects the files or members upon which to operate. In general, these methods work both for specifying the names of files and archive members. @node Characteristics, Selection Options, Changing the Archive Name, Specifying Names to tar @section Selecting Files by Characteristic @cindex File names, excluding files by @cindex Excluding files by name and pattern @cindex Excluding files by file system @cindex File system boundaries, not crossing @cindex Excluding file by age @cindex Modification time, excluding files by @cindex Age, excluding files by To avoid crossing file system boundaries when archiving parts of a directory tree, use @value{one-file-system}. This option only affects files that are archived because they are in a directory that is being archived; files explicitly named on the command line are archived regardless of where they reside. This option is useful for making full or incremental archival backups of a file system. If this option is used in conjunction with @value{verbose}, files that are excluded are mentioned by name on the standard error. @table @samp @item --one-file-system @itemx -l Prevents @code{tar} from crossing file system boundaries when archiving. Use in conjunction with any write operation. @end table To avoid operating on files whose names match a particular pattern, use the @value{exclude} or @value{exclude-from} options. When you specify the @value{exclude} option, @code{tar} ignores files which match the @var{pattern}, which can be a single file name or a more complex expression. Thus, if you invoke @code{tar} with @samp{tar --create --exclude=*.o}, no files whose names end in @file{.o} are included in the archive. @format FIXME: what other things can you use besides "*"? @end format @value{exclude-from} acts like @value{exclude}, but specifies a file @var{file} containing a list of patterns. @code{tar} ignores files with names that fit any of these patterns. You can use either option more than once in a single command. @table @samp @item --exclude=@var{pattern} Causes @code{tar} to ignore files that match the @var{pattern}. @item --exclude-from=@var{file} Causes @code{tar} to ignore files that match the patterns listed in @var{file}. @end table @format FIXME: --exclude-from used to be "--exclude", --exclude didn't used to FIXME: exist. @end format To operate only on files with modification or status-change times after a particular date, use @value{after-date}. You can use this option with @value{create} or @value{append} to insure only new files are archived, or with @value{extract} to insure only recent files are resurrected. @format FIXME: or --newer @var{date} @end format @value{newer-mtime} acts like @value{after-date} but tests just the modification times of the files, ignoring status-change times. @format FIXME: need example of --newer-mtime with quoted argument @end format Remember that the entire date argument should be quoted if it contains any spaces. @strong{Please Note:} @value{after-date} and @value{newer-mtime} should not be used for incremental backups. Some files (such as those in renamed directories) are not selected up properly by these options. @format FIXME: xref to incremental backup chapter when node name is decided. @end format @table @samp @item --after-date=@var{date} @itemx --newer=@var{date} @itemx -N @var{date} Acts on files only if their modification or inode-changed times are later than @var{date}. Use in conjunction with any operation. @item --newer-mtime=@var{date} Acts like @value{after-date}, but only looks at modification times. @end table @format FIXME: following is the getdate date format --- needs to be re-written, FIXME: made a sub-node: @end format Time/Date Formats Accepted by getdate (omitting obscure constructions) The input consists of one or more of: time zone day date year in any order. Those in turn consist of (`|' and `/' mean `or', `[]' means `optional'): time: H am/pm | H:M [am/pm] | H:M:S [am/pm] zone: timezone-name | timezone-name dst day: day-name | day-name, | N day-name date: M/D | M/D/Y | month-name D | month-name D, Y | D month-name | D month-name Y year: Y am can also be a.m., pm can also be p.m. case and spaces around punctuation are not significant. @format FIXME: month and day names can be abbreviated. @end format @menu * Reading Names from a File:: * Excluding Some Files:: * Operating Only on New Files:: * Crossing Filesystem Boundaries:: @end menu @node Reading Names from a File, Excluding Some Files, Characteristics, Characteristics @subsection Reading Names from a File @include docwarn.texi Instead of giving the names of files or archive members on the command line, you can put the names into a file, and then use the @value{files-from} option to @code{tar}. Give the name of the file which contains the list as the argument to @value{files-from}. The file names should be separated by newlines in the list. If you give a single dash as a file name for @value{files-from}, that is, you specify @samp{--files-from=-} (@samp{-T -}), then the file names are read from standard input. If you want to specify names that might contain newlines, use the @value{null} option. Then, the file names should be separated by NUL characters (ASCII 000) instead of newlines. In addition, the @value{null} option turns off the @value{directory} option ( @format FIXME: pxref Changing Directory @end format ). Reading a List of File Names from a File @cindex Lists of file names @cindex File Name arguments, alternatives @include docwarn.texi To read file names from a file on the file system, instead of from the command line, use the @value{files-from} option. If you specify @samp{-} as @var{file}, the file names are read from standard input. Note that using both @samp{--files-from=-} (@samp{-T -}) and @samp{--file=-} (@samp{-f -}) in the same command will not work unless the operation is @value{create}. @format FIXME: xref Archive Name @end format , for an explanation of the @value{file} option. @table @samp @item --files-from=@var{file} @itemx -T @var{file} Reads file name arguments from a file on the file system, instead of from the command line. Use in conjunction with any operation. @end table @node Excluding Some Files, Operating Only on New Files, Reading Names from a File, Characteristics @subsection Excluding Some Files @include docwarn.texi The @value{exclude} option will prevent any file or member which matches the regular expression @var{pattern} from being operated on. For example, if you want to create an archive with all the contents of @file{/tmp} except the file @file{/tmp/foo}, you can use the command @samp{tar --create --file=arch.tar --exclude=foo}. If there are many files you want to exclude, you can use the @value{exclude-from} option. This works just like the @value{files-from} option: specify the name of a file as @var{exclude-list} which contains the list of patterns you want to exclude. @format FIXME: xref Regular Expressions @end format for more information on the syntax and meaning of regular expressions. @node Operating Only on New Files, Crossing Filesystem Boundaries, Excluding Some Files, Characteristics @subsection Operating Only on New Files @include docwarn.texi The @value{after-date} or @samp{--newer=@var{date}} limits @code{tar} to only operating on files which have been modified after the date specified. (For more information on how to specify a date, @format FIXME: xref Date Formats @end format .) A file is considered to have changed if the contents have been modified, or if the owner, permissions, and so forth, have been changed. If you only want @code{tar} make the date comparison on the basis of the actual contents of the file's modification, then use the @value{newer-mtime} option. You should never use this option for making incremental dumps. To learn how to use @code{tar} to make backups, @format FIXME: ref Making Backups @end format . @node Crossing Filesystem Boundaries, , Operating Only on New Files, Characteristics @subsection Crossing Filesystem Boundaries @include docwarn.texi The @value{one-file-system} option causes @code{tar} to modify its normal behavior in archiving the contents of directories. If a file in a directory is not on the same filesystem as the directory itself (because it is a mounted filesystem in its own right), then @code{tar} will not archive that file, or (if it is a directory itself) anything beneath it. This does not necessarily limit @code{tar} to only archiving the contents of a single filesystem, because all files named on the command line, or through the @value{files-from} option, will always be archived. @node Selection Options, , Characteristics, Specifying Names to tar @section Local file selection @include docwarn.texi Local file selection @table @code @item -C @var{dir} @itemx --directory @var{dir} Change to directory @var{dir}. This option causes @code{tar} to change into the directory @var{dir} before continuing. This option can be interspersed with the files @code{tar} is to work on. For example, @example tar -c iggy ziggy -C baz melvin @end example @noindent will place the files @samp{iggy} and @samp{ziggy} from the current directory on the tape, followed by the file @file{melvin} from the directory @file{baz}. This option is especially useful when you have several widely separated files that you want to store in the same directory in the archive. Here, the file @file{melvin} is recorded in the archive under the precise name @file{melvin}, @emph{not} @file{baz/melvin}. Thus, the archive will contain three files that all appear to have come from the same directory; if the archive is extracted with plain @w{@samp{tar -x}}, all three files will be created in the current directory. Contrast this with the command: @example tar -c iggy ziggy bar/melvin @end example @noindent which records the third file in the archive under the name @file{bar/melvin} so that, if plain @samp{tar -x} is used, the third file will be created in a subdirectory named @file{bar}. Suppose that, without changing your current directory, you want to call @code{tar} to dump files from @file{/users/ctd/dipp} say. Then @value{directory} is for you. You could do things like: @example tar cfC archive.tar /users/ctd/dipp . @end example @noindent (the @file{.} means the current directory, once the @value{directory} obeyed). Some people might want some option to extract everything from an archive in the current directory, ignore directory structure in the archive. This is so rarely proper that I doubt such an option would be really useful. It would only help getting around improper @code{tar} usage, it might even encourage improper usage. In general, @value{directory} might be used to produce archives with a cleaner structure in the first place. @item -T @var{filename} @itemx --files-from=@var{filename} Get names to extract or create from file @var{filename}. Instead of taking the list of files to work on from the command line, the list of files to work on is read from the file @var{filename}. If @var{filename} is given as @samp{-}, the list is read from standard input. Note that using both @samp{-T -} and @samp{-f -} will not work unless you are using the @value{create} command. This is typically useful when you have generated the list of files to archive with @code{find}. @item --null This option causes @value{files-from} to read file names terminated by a @key{NUL} instead of a newline, so files whose names contain newlines can be archived using @value{files-from}. The @value{null} option is just like the one in GNU @code{xargs} and @code{cpio}, and is useful with the @samp{-print0} predicate of GNU @code{find}. In @code{tar}, @value{null} also causes @value{directory} options to be treated as file names to archive, in case there are any files out there called @file{-C}. @item --exclude=@var{file} Exclude file @var{file}. @item -X @var{file} @itemx --exclude-from=@var{file} Exclude files listed in @var{file}. This option causes @code{tar} to read a list of regular expressions (in shell wildcard syntax), one per line, from @var{file}; @code{tar} will ignore files matching those regular expressions. Thus if @code{tar} is called as @w{@samp{tar -c -X foo .}} and the file @file{foo} contains a single line @file{*.o}, no files whose names end in @file{.o} will be added to the archive. Multiple @value{exclude} options may be given. @item -P @itemx --absolute-names Do not strip leading @kbd{/}s from file names. By default, GNU @code{tar} drops a leading @samp{/} on input or output. This option turns off this behavior; it's equivalent to changing to the root directory before running @code{tar} (except it also turns off the usual warning message). @item -l @itemx --one-file-system Stay in local filesystem when creating archive. This option causes @code{tar} to not cross filesystem boundaries when archiving parts of a directory tree. This option only affects files that are archived because they are in a directory that is archived; files named on the command line are archived regardless, and they can be from various file systems. This option is useful for making full or incremental archival backups of a filesystem, as with the Unix @code{dump} command. Files skipped due to this option are mentioned on standard error. @item -K @var{name} @itemx --starting-file=@var{name} Begin at file @var{name} in the archive. The @value{starting-file} option causes @code{tar} to begin extracting or listing the archive with the file @var{filename}, and to consider only the files starting at that point in the archive. This is useful if a previous attempt to extract files failed when it reached @var{filename} due to lack of free space. (Assuming, of course, that there is now free space, or that you are now extracting into a different file system.) @item -N @var{date} @itemx --newer=@var{date} @itemx --after-date=@var{date} Only store files newer than @var{date}. This option causes @code{tar} to only work on files whose modification or inode-changed times are newer than the @var{date} given. The main use is for creating an archive; then only new files are written. If extracting, only newer files are extracted. Remember that the entire date argument must be quoted if it contains any spaces. The date is parsed using @code{getdate}. @end table Changing the Names of Members when Archiving @menu * Changing Directory:: * Absolute File Names:: @end menu @node Changing Directory, Absolute File Names, Selection Options, Selection Options @subsection Changing Directory @include docwarn.texi The @value{directory} option causes @code{tar} to change its current working directory to @var{directory}. Unlike most options, this one is processed at the point it occurs within the list of files to be processed. Consider the following command: @example tar --create --file=foo.tar -C /etc passwd hosts -C /lib libc.a @end example This command will place the files @file{/etc/passwd}, @file{/etc/hosts}, and @file{/lib/libc.a} into the archive. However, the names of the archive members will be exactly what they were on the command line: @file{passwd}, @file{hosts}, and @file{libc.a}. The @value{directory} option is frequently used to make the archive independent of the original name of the directory holding the files. Note that @value{directory} options are interpreted consecutively. If @value{directory} option specifies a relative file name, it is interpreted relative to the then current directory, which might not be the same as the original current working directory of @code{tar}, due to a previous @value{directory} option. When using @value{files-from} ( @format FIXME: pxref Reading Names from a File @end format ), you can put @samp{-C} options in the file list. Unfortunately, you cannot put @samp{--directory} options in the file list. (This interpretation can be disabled by using the @value{null} option.) Changing the Working Directory Within a List of File Names @cindex Directory, changing in mid-stream @cindex Working directory, specifying @include docwarn.texi To change working directory in the middle of a list of file names, either on the command line or in a file specified using @value{files-from}, use @value{directory}. This will change the working directory to the directory @var{directory} after that point in the list. For example, @example tar --create iggy ziggy --directory=baz melvin @end example @noindent will place the files @file{iggy} and @file{ziggy} from the current directory into the archive, followed by the file @file{melvin} from the directory @file{baz}. This option is especially useful when you have several widely separated files that you want to store in the same directory in the archive. Note that the file @file{melvin} is recorded in the archive under the precise name @file{melvin}, @emph{not} @file{baz/melvin}. Thus, the archive will contain three files that all appear to have come from the same directory; if the archive is extracted with plain @samp{tar --extract}, all three files will be written in the current directory. Contrast this with the command @example tar -c iggy ziggy bar/melvin @end example @noindent which records the third file in the archive under the name @file{bar/melvin} so that, if the archive is extracted using @samp{tar --extract}, the third file will be written in a subdirectory named @file{bar}. @table @samp @item --directory=@file{directory} @itemx -C @file{directory} Changes the working directory. @end table @format FIXME: need to test how extract deals with this, and add an example @end format @node Absolute File Names, , Changing Directory, Selection Options @subsection Absolute File Names @include docwarn.texi When @code{tar} extracts archive members from an archive, it strips any leading slashes (@samp{/}) from the member name. This causes absolute member names in the archive to be treated as relative file names. This allows you to have such members extracted wherever you want, instead of being restricted to extracting the member in the exact directory named in the archive. For example, if the archive member has the name @file{/etc/passwd}, @code{tar} will extract it as if the name were really @file{etc/passwd}. Other @code{tar} programs do not do this. As a result, if you create an archive whose member names start with a slash, they will be difficult for other people with an inferior @code{tar} program to use. Therefore, GNU @code{tar} also strips leading slashes from member names when putting members into the archive. For example, if you ask @code{tar} to add the file @file{/bin/ls} to an archive, it will do so, but the member name will be @file{bin/ls}. If you use the @value{absolute-names} option, @code{tar} will do neither of these transformations. @format FIXME: is this what this does, or does it just preserve the slash? @end format To archive or extract files relative to the root directory, specify the @value{absolute-names} option. Normally, @code{tar} acts on files relative to the working directory---ignoring superior directory names when archiving, and ignoring leading slashes when extracting. When you specify @value{absolute-names}, @code{tar} stores file names including all superior directory names, and preserves leading slashes. If you only invoked @code{tar} from the root directory you would never need the @value{absolute-names} option, but using this option may be more convenient than switching to root. @format FIXME: should be an example in the tutorial/wizardry section using this FIXME: to transfer files between systems. @end format @format FIXME: is write access an issue? @end format @table @samp @item --absolute-names Preserves full file names (inclusing superior dirctory names) when archiving files. Preserves leading slash when extracting files. @end table @node Being Careful, Format Control, Specifying Names to tar, Top @chapter Being Even More Careful @menu * Documentation:: * Checking Progress:: * Interactive Operation:: * Write Verification:: * Comparing:: * Portability:: * Write Protection:: @end menu @node Documentation, Checking Progress, Being Careful, Being Careful @section GNU @code{tar} documentation Being careful, the first thing is really checking that you are using GNU @code{tar}, indeed. The @value{version} option will generate a message giving confirmation that you are using GNU @code{tar}, with the precise version of GNU @code{tar} you are using. @code{tar} identifies itself and prints the version number to the standard output, then immediately exits successfully, without doing anything else, ignoring all other options. For example, @w{@samp{tar --version}} might return: @example GNU tar version @value{VERSION} @end example Another thing you might want to do is checking the spelling or meaning of some particular @code{tar} option, without resorting to this manual, for once you have carefully read it. GNU @code{tar} has a short help feature, triggerable through the @value{help} option. By using this option, @code{tar} will print a usage message listing all available options on standard output, then exit successfully, without doing anything else and ignoring all other options. Even if this is only a brief summary, it may be several screens long. So, if you are not using some kind of scrollable window, you might prefer to use something like: @example tar --help | less @end example @noindent presuming, here, that you like using @code{less} for a pager. Other popular pagers are @code{more} and @code{pg}. The perceptive reader would have noticed some contradiction in the previous paragraphs. It is written that both @value{version} and @value{help} print something, and have all other options ignored. In fact, they cannot ignore each other, and one of them has to win. We do not specify which is stronger, here; experiment if you really wonder! The short help output is quite succint, and you might have to get back to the full documentation for precise points. If you are reading this paragraph, you already have the @code{tar} manual in some form. This manual is available in printed form, as a kind of small book. It may printed out of the GNU @code{tar} distribution, provided you have @TeX{} already installed somewhere, and a laser printer around. Just configure the distribution, execute the command @w{@samp{make dvi}}, then print @file{doc/tar.dvi} the usual way (contact your local guru to know how). If GNU @code{tar} has been conveniently installed at your place, this manual is also available in interactive, hypertextual form as an Info file. Just call @w{@samp{info tar}} or, if you do not have the @code{info} program handy, use the Info reader provided within GNU Emacs, calling @samp{tar} from the main Info menu. @node Checking Progress, Interactive Operation, Documentation, Being Careful @section Checking @code{tar} progress @cindex Progress information @cindex Status information @cindex Information on progress and status of operations @cindex Verbose operation @cindex Record number where error occured @cindex Error message, record number of @cindex Version of the @code{tar} program @cindex Getting more information during the operation @cindex Information during operation @cindex Feedback from @code{tar} Typically, @code{tar} performs most operations without reporting any information to the user except error messages. When using @code{tar} with many options, particularly ones with complicated or difficult-to-predict behavior, it is possible to make serious mistakes. @code{tar} provides several options that make observing @code{tar} easier. These options cause @code{tar} to print information as it progresses in its job, and you might want to use them just for being more careful about what is going on, or merely for entertaining yourself. If you have encountered a problem when operating on an archive, however, you may need more information than just an error message in order to solve the problem. The following options can be helpful diagnostic tools. Normally, the @value{list} command to list an archive prints just the file names (one per line) and the other commands are silent. When used with most operations, the @value{verbose} option causes @code{tar} to print the name of each file or archive member as it is processed. This and the other options which make @code{tar} print status information can be useful in monitoring @code{tar}. With @value{create} or @value{extract}, @value{verbose} used once just prints the names of the files or members as they are processed. Using it twice causes @code{tar} to print a longer listing (reminiscent of @samp{ls -l}) for each member. Since @value{list} already prints the names of the members, @value{verbose} used once with @value{list} causes @code{tar} to print an @samp{ls -l} type listing of the files in the archive. The following examples both extract members with long list output: @example tar --extract --file=archive.tar --verbose --verbose tar xvv archive.tar @end example Verbose output appears on the standard output except when an archive is being written to the standard output, as with @samp{tar --create --file=- --verbose} (@samp{tar cfv -}, or even @samp{tar cv}---if the installer let standard output be the default archive). In that case @code{tar} writes verbose output to the standard error stream. The @value{totals} option---which is only meaningful when used with @value{create}---causes @code{tar} to print the total amount written to the archive, after it has been fully created. The @value{checkpoint} option prints an occasional message as @code{tar} reads or writes the archive. In fact, it print directory names while reading the archive. It is designed for those who don't need the more detailed (and voluminous) output of @value{record-number}, but do want visual confirmation that @code{tar} is actually making forward progress. @format FIXME: There is some confusion here. It seems that -R once wrote a FIXME: message at @samp{every} block read or written. @end format The @value{show-omitted-dirs} option, when reading an archive---with @value{list} or @value{extract}, for example---causes a message to be printed for each directory in the archive which is skipped. This happens regardless of the reason for skipping: the directory might not have been named on the command line (implicitly or explicitly), it might be excluded by the use of the @value{exclude} option, or some other reason. If @value{record-number} is used, @code{tar} prints, along with every message it would normally produce, the record number within the archive where the message was triggered. This option is especially useful when reading damaged archives, since it helps pinpoint the damaged sections. It can also be used with @value{list} when listing a file-system backup tape, allowing you to choose among several backup tapes when retrieving a file later, in favor of the tape where the file appears earliest (closest to the front of the tape). @format FIXME: xref when the node name is set and the backup section written @end format @node Interactive Operation, Write Verification, Checking Progress, Being Careful @section Asking for Confirmation During Operations @cindex Interactive operation Typically, @code{tar} carries out a command without stopping for further instructions. In some situations however, you may want to exclude some files and archive members from the operation (for instance if disk or storage space is tight). You can do this by excluding certain files automatically ( @format FIXME: pxref File Exclusion @end format ), or by performing an operation interactively, using the @value{interactive} option. @code{tar} also accepts @samp{--confirmation} for this option. When the @value{interactive} option is specified, before reading, writing, or deleting files, @code{tar} first prints a message for each such file, telling what operation it intends to take, then asks for confirmation on the terminal. The actions which require confirmation include adding a file to the archive, extracting a file from the archive, deleting a file from the archive, and deleting a file from disk. To confirm the action, you must type a line of input beginning with @samp{y}. If your input line begins with anything other than @samp{y}, @code{tar} skips that file. If @code{tar} is reading the archive from the standard input, @code{tar} opens the file @file{/dev/tty} to support the interactive communications. @node Write Verification, Comparing, Interactive Operation, Being Careful @section Verifying Data as It is Stored @cindex Verifying a write operation @cindex Double-checking a write operation You can insure the accuracy of an archive by comparing files in the system with archive members. @code{tar} can compare an archive to the file system as the archive is being written, to verify a write operation, or can compare a previously written archive, to insure that it is up to date. To check for discrepancies in an archive immediately after it is written, use the @value{verify} option in conjunction with the @value{create} operation. When this option is specified, @code{tar} checks archive members against their counterparts in the file system, and reports discrepancies on the standard error. In multi-volume archives, each volume is verified after it is written, before the next volume is written. To verify an archive, you must be able to read it from before the end of the last written entry. This option is useful for detecting data errors on some tapes. Archives written to pipes, some cartridge tape drives, and some other devices cannot be verified. @node Comparing, Portability, Write Verification, Being Careful @section Comparing an Archive with the File System @cindex Verifying the currency of an archive @include docwarn.texi @value{compare} compares archive members in an existing archive with their counterparts in the file system, and reports differences in file size, mode, owner, modification date and contents. If a file is represented in the archive but does not exist in the file system, @code{tar} reports a difference. If you use @var{file name} arguments in conjunction with @samp{tar --compare}, @code{tar} compares the archived versions of the files specified with their counterparts in the file system. If you specify a file that is not in the archive, @code{tar} will report an error. If you don't specify any files, @code{tar} compares all the files in the archive. Because @code{tar} only checks files in the archive against files in the file system, and not vice versa, it ignores files in the file system that do not exist in the archive. The following example compares the archive members @file{larry}, @file{moe} and @file{curly} in the archive @file{stooges} with files of the same name in the file system. @example tar --compare --file=stooges larry moe curly @end example @noindent If a file, for example @file{curly}, did not exist in the archive, @code{tar} would report an error, as follows: @example curly: does not exist @end example @node Portability, Write Protection, Comparing, Being Careful @section Making @code{tar} Archives More Portable Creating a @code{tar} archive on a particular system, meant to be later useful on many other machines and with other versions of @code{tar}, is more a challenge than you might think. @code{tar} archive formats evolved since the first versions of Unix, many such formats are flying around, not always comptabile between them. This section wants to discuss a few problems, and give some advice, for making @code{tar} archives more portable. One golden rule is simplicity. For example, limit your @code{tar} archives to contain only regular files and directories, avoiding other kind of special files. Do not attempt to save sparse files or contiguous files as such. Let's discuss a few more problems, in turn. @menu * Portable Names:: * Symbolic Links:: * Old V7 and POSIX:: * Checksumming Problems:: @end menu @node Portable Names, Symbolic Links, Portability, Portability @subsection Portable Names Use @emph{straight} file and directory names, made up of printable ASCII characters, avoiding colons, slashes, backslashes, and other @emph{dangerous} characters. Avoid deep directory nesting. Accounting for oldish System V machines, limit your file and directory names to 14 characters or less. If you intend to have your @code{tar} archives to be read under MSDOS, you should not rely on case distinction for file names, and you might use the GNU @code{doschk} program for helping you further diagnosing illegal MSDOS names, which are even more limited than System V's. @node Symbolic Links, Old V7 and POSIX, Portable Names, Portability @subsection Symbolic Links @cindex File names, using symbolic links @cindex Symbolic link as file name Normally, when @code{tar} archives a symbolic link, it writes a record to the archive naming the target of the link. In that way, the @code{tar} archive is a faithful record of the filesystem contents. @value{dereference} is used with @value{create}, and causes @code{tar} to archive the files symbolic links point to, instead of the links themselves. When this option is used, when @code{tar} encounters a symbolic link, it will archive the linked-to file, instead of simply recording the presence of a symbolic link. The name under which the file is stored in the file system is not recorded in the archive. To record both the symbolic link name and the file name in the system, archive the file under both names. If all links were recorded automatically by @code{tar}, an extracted file might be linked to a file name that no longer exists in the file system. If a linked-to file is encountered again by @code{tar} while creating the same archive, an entire second copy of it will be stored. (This @emph{might} be considered a bug.) So, for portable archives, do not archive symbolic links as such, and use @value{dereference}: many systems do not support symbolic links, and moreover, your distribution might be unusable if it contains unresolved symbolic links. @node Old V7 and POSIX, Checksumming Problems, Symbolic Links, Portability @subsection Old V7 and POSIX Archives GNU @code{tar} implements an early draft of the POSIX 1003.1 @code{ustar} standard which is different from the final standard. Adding support for the new changes in a backward-compatible fashion is not trivial. @cindex Format, old style @cindex Old style format @cindex Old style archives Certain old versions of @code{tar} cannot handle additional information recorded by newer @code{tar} programs. To create an archive in V7 format (not ANSI), which can be read by these old versions, specify the @value{old-archive} option in conjunction with the @value{create}. @code{tar} also accepts @samp{--portability} for this option. When you specify it, @code{tar} leaves out information about directories, pipes, fifos, contiguous files, and device files, and specifies file ownership by group and user IDs instead of group and user names. When updating an archive, do not use @value{old-archive} unless the archive was created with using this option. In most cases, a @emph{new} format archive can be read by an @emph{old} @code{tar} program without serious trouble, so this option should seldom be needed. On the other hand, most modern @code{tar}s are able to read old format archives, so it might be safer for you to always use @value{old-archive} for your distributions. @node Checksumming Problems, , Old V7 and POSIX, Portability @subsection Checksumming Problems SunOS and HP-UX @code{tar} fail to accept archives created using GNU @code{tar} and containing non-ASCII file names, because they use signed checksums, while GNU @code{tar} uses unsigned checksums while creating archives, as per POSIX standards. On reading, GNU @code{tar} computes both checksums and accept any. It is somewhat worrying that a lot of people may go around doing backup of their files using faulty (or at least non-standard) software, not learning about it until it's time to restore their missing files with an incompatible file extractor, or vice versa. GNU @code{tar} is supposed to compute both checksums, signed and unsigned, and accept any. However, 1.11.2 has a bug by which signed checksums are incorrectly initialized, so they do not work. This is corrected in the subsequent GNU @code{tar} versions. However, GNU @code{tar} has not been modified to @emph{produce} incorrect archives to be read by buggy @code{tar}'s. I've been told that when Sun first imported @code{tar} on their system, they recompiled it without realizing that the checksums were computed differently, because of a change in the default signing of @code{char}'s in their compiler. So they started computing checksums wrongly, and stayed compatible with themselves afterwards. It now falls on the shoulders of SunOS and HP-UX users to get a @code{tar} able to read the good archives they receive. @node Write Protection, , Portability, Being Careful @section Write Protection All tapes and disks can be @dfn{write protected}, to protect data on them from being changed. Once an archive is written, you should write protect the media to prevent the archive from being accidently overwritten or deleted. (This will protect the archive from being changed with a tape or floppy drive---it will not protect it from magnet fields or other physical hazards). The write protection device itself is usually an integral part of the physical media, and can be a two position (write enabled/write disabled) switch, a notch which can be popped out or covered, a ring which can be removed from the center of a tape reel, or some other changeable feature. @node Format Control, Media, Being Careful, Top @chapter Controlling the Archive Format @menu * Attributes Options:: * Type Options:: * Compression:: * Special Options for Archiving:: * Archive Structure:: * Modifiers Options:: @end menu @node Attributes Options, Type Options, Format Control, Format Control @section Handling of file attributes @include docwarn.texi Handling of file attributes @table @code @item --atime-preserve Do not change access times on dumped files. @item -m @itemx --modification-time Do not extract file modified time. When this option is used, @code{tar} leaves the modification times of the files it extracts as the time when the files were extracted, instead of setting it to the time recorded in the archive. This option is meaningless with @value{list}. @item --same-owner Create extracted files with the same ownership. @item -p @itemx --same-permissions @itemx --preserve-permissions Extract all protection information. This option causes @code{tar} to set the modes (access permissions) of extracted files exactly as recorded in the archive. If this option is not used, the current @code{umask} setting limits the permissions on extracted files. This option is meaningless with @value{list}. @item -s @itemx --same-order @itemx --preserve-order Sort names to extract to match archive. This option tells @code{tar} that the list of file names to be listed or extracted is sorted in the same order as the files in the archive. This allows a large list of names to be used, even on a small machine that would not otherwise be able to hold all the names in memory at the same time. Such a sorted list can easily be created by running @samp{tar -t} on the archive and editing its output. This option is probably never needed on modern computer systems. @item --preserve Same as both @value{same-permissions} and @value{same-order}. The @value{preserve} option has no equivalent short option name. It is equivalent to @value{same-permissions} plus @value{same-order}. @end table @node Type Options, Compression, Attributes Options, Format Control @section Archive format selection @include docwarn.texi Archive format selection @table @code @item -V @var{name} @itemx --label=@var{name} Create archive with volume name @var{name}. This option causes @code{tar} to write out a @dfn{volume header} at the beginning of the archive. If @value{multi-volume} is used, each volume of the archive will have a volume header of @samp{@var{name} Volume @var{n}}, where @var{n} is 1 for the first volume, 2 for the next, and so on. @item -z @itemx --gzip @itemx --ungzip Filter the archive through @code{gzip}. This option works on physical devices (tape drives, etc.) and remote files as well as on normal files; data to or from such devices or remote files is reblocked by another copy of the @code{tar} program to enforce the specified (or default) block size. The default compression parameters are used; if you need to override them, avoid the @value{gzip} option and run @code{gzip} explicitly. (Or set the @samp{GZIP} environment variable.) If the @value{gzip} option is given twice, or the @value{compress-block} option is used, @code{tar} will pad the archive out to the next block boundary ( @format FIXME: pxref Blocking @end format ). This may be useful with some devices that require that all write operations be a multiple of a certain size. The @value{gzip} option does not work with the @value{multi-volume} option, or with the @value{update}, @value{append}, @value{concatenate}, or @value{delete} commands. It is not exact to say that GNU @code{tar} is to work in concert with @code{gzip} in a way similar to @code{zip}, say. Surely, it is possible that @code{tar} and @code{gzip} be done with a single call, like in: @example tar cfz archive.tar.gz subdir @end example @noindent to save all of @samp{subdir} into a @code{gzip}'ed archive. Later you can do: @example tar xfz archive.tar.gz @end example @noindent to explode and unpack. The difference is that the whole archive is compressed. With @code{zip}, archive members are archived individually. @code{tar}'s method yields better compression. On the other hand, one can view the contents of a @code{zip} archive without having to decompress it. As for the @code{tar} and @code{gzip} tandem, you need to decompress the archive to see its contents. However, this may be done without needing disk space, by using pipes internally: @example tar tfz archive.tar.gz @end example @cindex corrupted archives About corrupted compressed archives: @code{gzip}'ed files have no redundancy, for maximum compression. The adaptive nature of the compression scheme means that the compression tables are implicitly spread all over the archive. If you lose a few blocks, the dynamic construction of the compression tables becomes unsychronized, and there is little chance that you could recover later in the archive. There are pending suggestions for having a per-volume or per-file compression in GNU @code{tar}. This would allow for viewing the contents without decompression, and for resynchronizing decompression at every volume or file, in case of corrupted archives. Doing so, we might loose some compressibility. But this would have make recovering easier. So, there are pros and cons. We'll see! @item -Z @itemx --compress @itemx --uncompress Filter the archive through @code{compress}. Otherwise like @value{gzip}. @item --use-compress-program=@var{prog} Filter through @var{prog} (must accept @samp{-d}). @end table @node Compression, Special Options for Archiving, Type Options, Format Control @section Using Less Space through Compression @menu * Compressed Archives:: * Dealing with Compressed Archives:: * Sparse Files:: @end menu @node Compressed Archives, Dealing with Compressed Archives, Compression, Compression @subsection Creating and Reading Compressed Archives @cindex Compressed archives @cindex Storing archives in compressed format @include docwarn.texi @value{compress} indicates an archive stored in compressed format. The @value{compress} option is useful in saving time over networks and space in pipes, and when storage space is at a premium. @value{compress} causes @code{tar} to compress when writing the archive, or to uncompress when reading the archive. To perform compression and uncompression on the archive, @code{tar} runs the @code{compress} utility. @code{tar} uses the default compression parameters; if you need to override them, avoid the @value{compress} option and run the @code{compress} utility explicitly. It is useful to be able to call the @code{compress} utility from within @code{tar} because the @code{compress} utility by itself cannot access remote tape drives. The @value{compress} option will not work in conjunction with the @value{multi-volume} option or the @value{append}, @value{update}, @value{append} and @value{delete} operations. @format FIXME: xref Modifying @end format , for more information on these operations. If there is no compress utility available, @code{tar} will report an error. @value{compress-block} is like @value{compress}, but when used in conjunction with @value{create} also causes @code{tar} to pad the last block of the archive out to the next block boundary as it is written. This is useful with certain devices which require all write operations be a multiple of a specific size. @quotation @strong{Please Note:} The @code{compress} program may be covered by a patent, and therefore we recommend you stop using it. We hope to have a different compress program in the future. We may change the name of this option at that time. @end quotation @table @samp @item --compress @itemx --uncompress @itemx -z @itemx -Z When this option is specified, @code{tar} will compress (when writing an archive), or uncompress (when reading an archive). Used in conjunction with the @value{create}, @value{extract}, @value{list} and @value{compare} operations. @item --compress-block @itemx -z -z Acts like @value{compress}, but pads the archive out to the next block boundary as it is written when used in conjunction with the @value{create} operation. @end table @format FIXME: why not use -Z instead of -z -z ? @end format @node Dealing with Compressed Archives, Sparse Files, Compressed Archives, Compression @subsection Dealing with Compressed Archives @include docwarn.texi You can have archives be compressed by using the @value{gzip} option. This will arrange for @code{tar} to use the @code{gzip} program to be used to compress or uncompress the archive wren writing or reading it. To use the older, obsolete, @code{compress} program, use the @value{compress} option. The GNU Project recommends you not use @code{compress}, because there is a patent covering the algorithm it uses. Merely by running @code{compress} you could be sued for patent infringment. When using either @value{gzip} or @value{compress}, @code{tar} does not do blocking ( @format FIXME: pxref Blocking @end format ) correctly. Use @samp{--gzip-block} or @value{compress-block} instead when using real tape drives. @node Sparse Files, , Dealing with Compressed Archives, Compression @subsection Archiving Sparse Files @cindex Sparse Files @include docwarn.texi A file is sparse if it contains blocks of zeros whose existance is recorded, but that have no space allocated on disk. When you specify the @value{sparse} option in conjunction with the @value{create} operation, @code{tar} tests all files for sparseness while archiving. If @code{tar} finds a file to be sparse, it uses a sparse representation of the file in the archive. @format FIXME: xref Creating Archives @end format , for more information about creating archives. @value{sparse} is useful when archiving files, such as dbm files, likely to contain many nulls. This option dramatically decreases the amount of space needed to store such an archive. @quotation @strong{Please Note:} Always use @value{sparse} when performing file system backups, to avoid archiving the expanded forms of files stored sparsely in the system.@refill Even if your system has no no sparse files currently, some may be created in the future. If you use @value{sparse} while making file system backups as a matter of course, you can be assured the archive will always take no more space on the media than the files take on disk (otherwise, archiving a disk filled with sparse files might take hundreds of tapes).@refill @format FIXME: xref incremental when node name is set. @end format @end quotation @code{tar} ignores the @value{sparse} option when reading an archive. @table @samp @item --sparse @itemx -S Files stored sparsely in the file system are represented sparsely in the archive. Use in conjunction with write operations. @end table @node Special Options for Archiving, Archive Structure, Compression, Format Control @section Special Options for Archiving @include docwarn.texi To give the archive a name which will be recorded in it, use the @value{label} option. This will write a special record identifying @var{volume-label} as the name of the archive to the front of the archive which will be displayed when the archive is listed with @value{list}. If you are creating a multi-volume archive with @value{multi-volume} ( @format FIXME: pxref Using Multiple Tapes @end format ), then the volume label will have @samp{Volume @var{nnn}} appended to the name you give, where @var{nnn} is the number of the volume of the archive. (If you use the @value{label} option when reading an archive, it checks to make sure the label on the tape matches the one you give. @format FIXME: xref Special Options for Archiving @end format .) Files in the filesystem occasionally have ``holes.'' A hole in a file is a section of the file's contents which was never written. The contents of a hole read as all zeros. On many operating systems, actual@c disk storage is not allocated for holes, but they are counted in the length of the file. If you archive such a file, @code{tar} could create an archive longer than the original. To have @code{tar} attempt to recognize the holes in a file, use @value{sparse}. When you use the @value{sparse} option, then, for any file using less disk space than would be expected from its length, @code{tar} searches the file for consecutive stretches of zeros. It then records in the archive for the file where the consecutive stretches of zeros are, and only archives the ``real contents'' of the file. On extraction (using @value{sparse} is not needed on extraction) any such files have hols created wherever the continuous stretches of zeros were found. Thus, if you use @value{sparse}, @code{tar} archives won't take more space than the original. When @code{tar} reads files, this causes them to have the access times updated. To have @code{tar} attempt to set the access times back to what they were before they were read, use the @value{atime-preserve} option. This doesn't work for files that you don't own, unless you're root, and it doesn't interact with incremental dumps nicely ( @format FIXME: pxref Making Backups @end format ), but it is good enough for some purposes. @node Archive Structure, Modifiers Options, Special Options for Archiving, Format Control @section The Structure of an Archive @include docwarn.texi While an archive may contain many files, the archive itself is a single ordinary file. Like any other file, an archive file can be written to a storage device such as a tape or disk, sent through a pipe or over a network, saved on the active file system, or even stored in another archive. An archive file is not easy to read or manipulate without using the @code{tar} utility or Tar mode in Emacs. Physically, an archive consists of a series of file entries terminated by an end-of-archive entry, which consists of 512 zero bytes. A file entry usually describes one of the files in the archive (an @dfn{archive member}), and consists of a file header and the contents of the file. File headers contain file names and statistics, checksum information which @code{tar} uses to detect file corruption, and information about file types. More than archive member can have the same file name. One way this situation can occur is if more than one version of a file has been stored in the archive. For information about adding new versions of a file to an archive, @format FIXME: pxref Modifying @end format . In addition to entries describing archive members, an archive may contain entries which @code{tar} itself uses to store information. @format FIXME: xref Archive Label @end format , for an example of such an archive entry. @node Modifiers Options, , Archive Structure, Format Control @section Operation mode modifiers @include docwarn.texi Operation mode modifiers @table @code @item -W @itemx --verify Attempt to verify the archive after writing. This option causes @code{tar} to verify the archive after writing it. Each volume is checked after it is written, and any discrepancies are recorded on the standard error output. Verification requires that the archive be on a back-space-able medium. This means pipes, some cartridge tape drives, and some other devices cannot be verified. @item --remove-files Remove files after adding them to the archive. @item -k @itemx --keep-old-files Do not overwrite existing files from archive. The @value{keep-old-files} option prevents @code{tar} from over-writing existing files with files with the same name from the archive. The @value{keep-old-files} option is meaningless with @value{list}. @item -S @itemx --sparse Handle sparse files efficiently. This option causes all files to be put in the archive to be tested for sparseness, and handled specially if they are. The @value{sparse} option is useful when many @code{dbm} files, for example, are being backed up. Using this option dramatically decreases the amount of space needed to store such a file. In later versions, this option may be removed, and the testing and treatment of sparse files may be done automatically with any special GNU options. For now, it is an option needing to be specified on the command line with the creation or updating of an archive. @item -O @itemx --to-stdout Extract files to standard output. When this option is used, instead of creating the files specified, @code{tar} writes the contents of the files extracted to its standard output. This may be useful if you are only extracting the files in order to send them through a pipe. This option is meaningless with @value{list}. @item --ignore-failed-read Do not exit with non-zero on unreadable files. @end table @format FIXME: This section needs to be written @end format @strong{To come:} using Unix file linking capability to recreate directory structures---linking files into one subdirectory and then @code{tar}ring that directory. @strong{to come:} nice hairy example using absolute-names, newer, etc. Piping one @code{tar} to another is an easy way to copy a directory's contents from one disk to another, while preserving the dates, modes, owners and link-structure of all the files therein. @example cd sourcedirectory; tar cf - . | (cd targetdir; tar xf -) @end example @noindent or @format FIXME: the following using standard input/output correct?? @end format @example cd sourcedirectory; tar --create --file=- . | (cd targetdir; tar --extract --file=-) @end example @noindent Archive files can be used for transporting a group of files from one system to another: put all relevant files into an archive on one computer system, transfer the archive to another, and extract the contents there. The basic transfer medium might be magnetic tape, Internet FTP, or even electronic mail (though you must encode the archive with @code{uuencode} in order to transport it properly by mail). Both machines do not have to use the same operating system, as long as they both support the @code{tar} program. @findex uuencode @format FIXME: mention uuencode on a paragraph of its own @end format @format FIXME: end construction @end format @node Media, Backups and Restoration, Format Control, Top @chapter Tapes and Other Archive Media @include docwarn.texi A few special cases about tape handling warrant more detailed description. These special cases are discussed below. Many complexities surround the use of @code{tar} on tape drives. Since the creation and manipulation of archives located on magnetic tape was the original purpose of @code{tar}, it contains many features making such manipulation easier. Archives are usually written on dismountable media---tape cartridges, mag tapes, or floppy disks. The amount of data a tape or disk holds depends not only on its size, but also on how it is formatted. A 2400 foot long reel of mag tape holds 40 megabytes of data when formated at 1600 bits per inch. The physically smaller EXABYTE tape cartridge holds 2.3 gigabytes. Magnetic media are re-usable---once the archive on a tape is no longer needed, the archive can be erased and the tape or disk used over. Media quality does deteriorate with use, however. Most tapes or disks should be disgarded when they begin to produce data errors. EXABYTE tape cartridges should be disgarded when they generate an @dfn{error count} (number of non-usable bits) of more than 10k. Magnetic media are written and erased using magnetic fields, and should be protected from such fields to avoid damage to stored data. Sticking a floppy disk to a filing cabinet using a magnet is probably not a good idea. @menu * Device:: * Blocking:: * Many:: * Using Multiple Tapes:: * Archive Label:: @end menu @node Device, Blocking, Media, Media @section Device selection and switching @include docwarn.texi @table @code @item -f [@var{hostname}:]@var{file} @itemx --file=[@var{hostname}:]@var{file} Use archive file or device @var{file} on @var{hostname}. This option is used to specify the file name of the archive @code{tar} works on. If the file name is @samp{-}, @code{tar} reads the archive from standard input (when listing or extracting), or writes it to standard output (when creating). If the @samp{-} file name is given when updating an archive, @code{tar} will read the original archive from its standard input, and will write the entire new archive to its standard output. If the file name contains a @samp{:}, it is interpreted as @samp{hostname:filename}. If the @var{hostname} contains an @dfn{at} sign (@kbd{@@}), it is treated as @samp{user@@hostname:filename}. In either case, @code{tar} will invoke the command @code{rsh} (or @code{remsh}) to start up an @file{/etc/rmt} on the remote machine. If you give an alternate login name, it will be given to the @code{rsh}. Naturally, the remote machine must have an executable @file{/etc/rmt}. This program is free software from the University of California, and a copy of the source code can be found with the sources for @code{tar}; it's compiled and installed by default. If this option is not given, but the environment variable @code{TAPE} is set, its value is used; otherwise, old versions of @code{tar} used a default archive name (which was picked when @code{tar} was compiled). The default is normally set up to be the @dfn{first} tape drive or other transportable I/O medium on the system. Starting with version 1.11.5, GNU @code{tar} uses standard input and standard output as the default device, and I will not try anymore supporting automatic device detection at installation time. This was failing really in too many cases, it was hopeless. This is now completely left to the installer to override standard input and standard output for default device, if this seems preferrable to him/her. Further, I think @emph{most} actual usages of @code{tar} are done with pipes or disks, not really tapes, cartridges or diskettes. Some users think that using standard input and output is running after trouble. This could lead to a nasty surprise on your screen if you forget to specify an output file name---especially if you are going through a network or terminal server capable of buffering large amounts of output. We had so many bug reports in that area of configuring default tapes automatically, and so many contradicting requests, that we finally consider the problem to be portably intractable. We could of course use something like @samp{/dev/tape} as a default, but this is @emph{also} running after various kind of trouble, going from hung processes to accidental destruction of real tapes. After having seen all this mess, using standard input and output as a default really sounds like the only clean choice left, and a very useful one too. GNU @code{tar} reads and writes archive in blocks, I suspect this is the main reason why block devices are preferred over character devices. Most probably, block devices are more efficient too. The installer could also check for @samp{DEFTAPE} in @file{}. @item --force-local Archive file is local even if it contains a colon. @item --rsh-command=@var{command} Use remote @var{command} instead of @code{rsh}. This option exists so that people who use something other than the standard @code{rsh} (e.g., a Kerberized @code{rsh}) can access a remote device. When this command is not used, the shell command found when the @code{tar} program was installed is used instead. This is the first found of @file{/usr/ucb/rsh}, @file{/usr/bin/remsh}, @file{/usr/bin/rsh}, @file{/usr/bsd/rsh} or @file{/usr/bin/nsh}. The installer may have overriden this by defining the environment variable @code{RSH} @emph{at installation time}. @item -[0-7][lmh] Specify drive and density. @item -M @itemx --multi-volume Create/list/extract multi-volume archive. This option causes @code{tar} to write a @dfn{multi-volume} archive---one that may be larger than will fit on the medium used to hold it. @format FIXME: xref Multi @end format . @item -L @var{num} @itemx --tape-length=@var{num} Change tape after writing @var{num} x 1024 bytes. This option might be useful when your tape drivers do not properly detect end of physical tapes. By being slightly conservative on the maximum tape length, you might avoid the problem entirely. @item -F @var{file} @itemx --info-script=@var{file} @itemx --new-volume-script=@var{file} Execute @file{file} at end of each tape. This implies @value{multi-volume}. @end table The Remote Tape Server @cindex remote tape drive @pindex rmt In order to access the tape drive on a remote machine, @code{tar} uses the remote tape server written at the University of California at Berkeley. The remote tape server must be installed as @file{/etc/rmt} on any machine whose tape drive you want to use. @code{tar} calls @file{/etc/rmt} by running an @code{rsh} or @code{remsh} to the remote machine, optionally using a different login name if one is supplied. A copy of the source for the remote tape server is provided. It is Copyright @copyright{} 1983 by the Regents of the University of California, but can be freely distributed. Instructions for compiling and installing it are included in the @file{Makefile}. @cindex absolute file names Unless you use the @value{absolue-names} option, GNU @code{tar} will not allow you to create an archive that contains absolute file names (a file name beginning with @samp{/}.) If you try, @code{tar} will automatically remove the leading @samp{/} from the file names it stores in the archive. It will also type a warning message telling you what it is doing. When reading an archive that was created with a different @code{tar} program, GNU @code{tar} automatically extracts entries in the archive which have absolute file names as if the file names were not absolute. This is an important feature. A visitor here once gave a @code{tar} tape to an operator to restore; the operator used Sun @code{tar} instead of GNU @code{tar}, and the result was that it replaced large portions of our @file{/bin} and friends with versions from the tape; needless to say, we were unhappy about having to recover the file system from backup tapes. For example, if the archive contained a file @file{/usr/bin/computoy}, GNU @code{tar} would extract the file to @file{usr/bin/computoy}, relative to the current directory. If you want to extract the files in an archive to the same absolute names that they had when the archive was created, you should do a @samp{cd /} before extracting the files from the archive, or you should either use the @value{absolute-names} option, or use the command @samp{tar -C / @dots{}}. @cindex Ultrix 3.1 and write failure Some versions of Unix (Ultrix 3.1 is know to have this problem), can claim that a short write near the end of a tape succeeded, when it actually failed. This will result in the -M option not working correctly. The best workaround at the moment is to use a significantly larger blocksize than the default 20. In order to update an archive, @code{tar} must be able to backspace the archive in order to reread or rewrite a block that was just read (or written). This is currently possible only on two kinds of files: normal disk files (or any other file that can be backspaced with @samp{lseek}), and industry-standard 9-track magnetic tape (or any other kind of tape that can be backspaced with the @code{MTIOCTOP} @code{ioctl}. This means that the @value{append}, @value{update}, @value{concatenate}, and @value{delete} commands will not work on any other kind of file. Some media simply cannot be backspaced, which means these commands and options will never be able to work on them. These non-backspacing media include pipes and cartridge tape drives. Some other media can be backspaced, and @code{tar} will work on them once @code{tar} is modified to do so. Archives created with the @value{multi-volume}, @value{label}, and @value{incremental} options may not be readable by other version of @code{tar}. In particular, restoring a file that was split over a volume boundary will require some careful work with @code{dd}, if it can be done at all. Other versions of @code{tar} may also create an empty file whose name is that of the volume header. Some versions of @code{tar} may create normal files instead of directories archived with the @value{incremental} option. Some Common Problems and their Solutions: @format errors from system: permission denied no such file or directory not owner errors from @code{tar}: directory checksum error header format error errors from media/system: i/o error device busy @end format @node Blocking, Many, Device, Media @section Blocking @include docwarn.texi When writing to tapes, @code{tar} writes the contents of the archive in chunks known as @dfn{blocks}. To change the default blocksize, use the @value{block-size} option. Each block will then be composed of @var{size} records. (Each @code{tar} record is 512 bytes. @format FIXME: xref Archive Format @end format .) Each file written to the archive uses at least one full block. As a result, using a larger block size can result in more wasted space for small files. On the other hand, a larger block size can ofter be read and written much more efficiently. Further complicating the problem is that some tape drives ignore the blocking entirely. For these, a larger block size can still improve performance (because the software layers above the tape drive still honor the blocking), but not as dramatically as on tape drives that honor blocking. Wher reading an archive, @code{tar} can usually figure out the block size on itself. When this is the case, and a non-standard block size was used when the archive was created, @code{tar} will print a message about a non-standard blocking factor, and then operate normally. On some tape devices, however, @code{tar} cannot figure out the block size itself. On most of those, you can specify a blocking factor (with @value{block-size}) larger than the actual blocking factor, and then use the @value{read-full-blocks} option. (If you specify a blocking factor with @value{block-size} and don't use the @value{read-full-blocks} option, then @code{tar} will not attempt to figure out the blocking size itself.) On some devices, you must always specify the block size exactly with @value{block-size} when reading, because @code{tar} cannot figure it out. In any case, use @value{list} before doing any extractions to see whether @code{tar} is reading the archive correctly. If you use a blocking factor larger than 20, older @code{tar} programs might not be able to read the archive, so we recommend this as a limit to use in practice. GNU @code{tar}, however, will support arbitrarily large block sizes, limited only by the amount of virtual memory or the physical characteristics of the tape device. If you are writing a compressed archive to tape with @value{compress} or @value{gzip} ( @format FIXME: pxref Input and Output @end format ), @code{tar} will not block the archive correctly. This doesn't matter if you are writing the archive to a normal file or through a pipe, but if you are writing it to a tape drive, then this causes problems. Use @value{compress-block} or @samp{--gzip-block} instead, to cause @code{tar} to arrange to have blocking work correctly. @menu * Format Variations:: * Blocking Factor:: @end menu @node Format Variations, Blocking Factor, Blocking, Blocking @subsection Format Variations @cindex Format Parameters @cindex Format Options @cindex Options to specify archive format. @include docwarn.texi Format parameters specify how an archive is written on the archive media. The best choice of format parameters will vary depending on the type and number of files being archived, and on the media used to store the archive. To specify format parameters when accessing or creating an archive, you can use the options described in the following sections. If you do not specify any format parameters, @code{tar} uses default parameters. You cannot modify a compressed archive. If you create an archive with the @value{block-size} option specified ( @format FIXME: pxref Blocking Factor @end format ), you must specify that block-size when operating on the archive. @format FIXME: xref Matching Format Parameters @end format , for other examples of format parameter considerations. @node Blocking Factor, , Format Variations, Blocking @subsection The Blocking Factor of an Archive @cindex Blocking Factor @cindex Block Size @cindex Number of records per block @cindex Number of bytes per block @cindex Bytes per block @cindex Records per block @include docwarn.texi The data in an archive is grouped into records, which are 512 bytes. Records are read and written in whole number multiples called @dfn{blocks}. The number of records in a block (ie. the size of a block in units of 512 bytes) is called the @dfn{blocking factor}. The @value{block-size} option specifies the blocking factor of an archive. The default blocking factor is typically 20 (ie.@: 10240 bytes), but can be specified at installation. To find out the blocking factor of an existing archive, use @samp{tar --list --file=@var{archive-name}}. This may not work on some devices. Blocks are seperated by gaps, which waste space on the archive media. If you are archiving on magnetic tape, using a larger blocking factor (and therefore larger blocks) provides faster throughput and allows you to fit more data on a tape (because there are fewer gaps). If you are archiving on cartridge, a very large blocking factor (say 126 or more) greatly increases performance. A smaller blocking factor, on the other hand, may be usefull when archiving small files, to avoid archiving lots of nulls as @code{tar} fills out the archive to the end of the block. In general, the ideal block size depends on the size of the inter-block gaps on the tape you are using, and the average size of the files you are archiving. @format FIXME: xref Creating Archives @end format , for information on writing archives. @format FIXME: need example of using a cartridge with blocksize=126 or more @end format Archives with blocking factors larger than 20 cannot be read by very old versions of @code{tar}, or by some newer versions of @code{tar} running on old machines with small address spaces. With GNU @code{tar}, the blocking factor of an archive is limited only by the maximum block size of the device containing the archive, or by the amount of available virtual memory. If you use a non-default blocking factor when you create an archive, you must specify the same blocking factor when you modify that archive. Some archive devices will also require you to specify the blocking factor when reading that archive, however this is not typically the case. Usually, you can use @value{list} without specifying a blocking factor---@code{tar} reports a non-default block size and then lists the archive members as it would normally. To extract files from an archive with a non-standard blocking factor (particularly if you're not sure what the blocking factor is), you can usually use the @value{read-full-blocks} option while specifying a blocking factor larger then the blocking factor of the archive (ie. @samp{tar --extract --read-full-blocks --block-size=300}. @format FIXME: xref Listing Contents @end format for more information on the @value{list} operation. @format FIXME: xref read-full-blocks @end format for a more detailed explanation of that option. @table @samp @item --block-size=@var{number} @itemx -b @var{number} Specifies the blocking factor of an archive. Can be used with any operation, but is usually not necessary with @value{list}. @end table Device blocking @table @code @item -b @var{blocks} @itemx --block-size=@var{blocks} Set block size to @math{@var{blocks} * 512} bytes. This option is used to specify a @dfn{blocking factor} for the archive. When reading or writing the archive, @code{tar}, will do reads and writes of the archive in blocks of @math{@var{block}*512} bytes. The default blocking factor is set when @code{tar} is compiled, and is typically 20. Blocking factors larger than 20 cannot be read by very old versions of @code{tar}, or by some newer versions of @code{tar} running on old machines with small address spaces. With a magnetic tape, larger blocks give faster throughput and fit more data on a tape (because there are fewer inter-record gaps). If the archive is in a disk file or a pipe, you may want to specify a smaller blocking factor, since a large one will result in a large number of null bytes at the end of the archive. When writing cartridge or other streaming tapes, a much larger blocking factor (say 126 or more) will greatly increase performance. However, you must specify the same blocking factor when reading or updating the archive. With GNU @code{tar} the blocking factor is limited only by the maximum block size of the device containing the archive, or by the amount of available virtual memory. @item --block-compress Block the output of compression for tapes. @item -i @itemx --ignore-zeros Ignore blocks of zeros in archive (means EOF). The @value{ignore-zeros} option causes @code{tar} to ignore blocks of zeros in the archive. Normally a block of zeros indicates the end of the archive, but when reading a damaged archive, or one which was created by @code{cat}-ing several archives together, this option allows @code{tar} to read the entire archive. This option is not on by default because many versions of @code{tar} write garbage after the zeroed blocks. Note that this option causes @code{tar} to read to the end of the archive file, which may sometimes avoid problems when multiple files are stored on a single physical tape. @item -B @itemx --read-full-blocks Reblock as we read (for reading 4.2BSD pipes). If @value{read-full-blocks} is used, @code{tar} will not panic if an attempt to read a block from the archive does not return a full block. Instead, @code{tar} will keep reading until it has obtained a full block. This option is turned on by default when @code{tar} is reading an archive from standard input, or from a remote machine. This is because on BSD Unix systems, a read of a pipe will return however much happens to be in the pipe, even if it is less than @code{tar} requested. If this option was not used, @code{tar} would fail as soon as it read an incomplete block from the pipe. This option is also useful with the commands for updating an archive. @end table Tape blocking @format FIXME: Appropriate options should be moved here from elsewhere. @end format @cindex blocking factor @cindex tape blocking When handling various tapes or cartridges, you have to take care of selecting a proper blocking, that is, the number of disk blocks you put together as a single tape block on the tape, without intervening tape gaps. A @dfn{tape gap} is a small landing area on the tape with no information on it, used for decelerating the tape to a full stop, and for later regaining the reading or writing speed. When the driver starts reading a tape block, the tape block has to be read whole without stopping, as a tape gap is needed to stop the tape motion without loosing information. @cindex Exabyte blocking @cindex DAT blocking Using higher blocking (putting more disk blocks per tape block) will use the tape more efficiently as there will be less tape gaps. But reading such tapes may be more difficult for the system, as more memory will be required to receive at once the whole block. Further, if there is a reading error on a huge tape block, this is less likely that the system will succeed in recovering the information. So, blocking should not be too low, nor it should be too high. @code{tar} uses by default a blocking of 20 for historical reasons, and it does not really matter when reading or writing to disk. Current tape technology would easily accomodate higher blockings. Sun recommends a blocking of 126 for Exabytes and 96 for DATs. Other manufacturers may use different recommendations for the same tapes. This might also depends of the buffering techniques used inside modern tape controllers. Some imposes a minimum blocking, or a maximum blocking. Others request blocking to be some exponent of two. So, there is no fixed rule for blocking. But blocking at read time should ideally be the same as blocking used at write time. At one place I know, with a wide variety of equipment, they found it best to use a blocking of 32 to guarantee that their tapes are fully interchangeable. I was also told that, for recycled tapes, prior erasure (by the same drive unit that will be used to create the archives) sometimes lowers the error rates observed at rewriting time. @node Many, Using Multiple Tapes, Blocking, Media @section Many archives on one tape @format FIXME: Appropriate options should be moved here from elsewhere. @end format @findex ntape @r{device} Most tape devices have two entries in the @file{/dev} directory, or entries that come in pairs, which differ only in the minor number for this device. Let's take for example @file{/dev/tape}, which often points to the only or usual tape device of a given system. There might be a corresponding @file{/dev/nrtape} or @file{/dev/ntape}. The simpler name is the @emph{rewinding} version of the device, while the name having @samp{nr} in it is the @emph{no rewinding} version of the same device. A rewinding tape device will bring back the tape to its beginning point automatically when this device is opened or closed. Since @code{tar} opens the archive file before using it and closes it afterwards, this means that a simple: @example tar cf /dev/tape @var{directory} @end example @noindent will reposition the tape to its beginning both prior and after saving @var{directory} contents to it, thus erasing prior tape contents and making it so that any subsequent write operation will destroy what has just been saved. @cindex tape positioning So, a rewinding device is normally meant to hold one and only one file. If you want to put more than one @code{tar} archive on a given tape, you will need to avoid using the rewinding version of the tape device. You will also have to pay special attention to tape positioning. Errors in positionning may overwrite the valuable data already on your tape. Many people, burnt by past experiences, will only use rewinding devices and limit themselves to one file per tape, precisely to avoid the risk of such errors. Be fully aware that writing at the wrong position on a tape loses all information past this point and most probably until the end of the tape, and this destroyed information @emph{cannot} be recovered. To save @var{directory-1} as a first archive at the beginning of a tape, and leave that tape ready for a second archive, you should use: @example mt -f /dev/nrtape rewind tar cf /dev/nrtape @var{directory-1} @end example @cindex tape marks @dfn{Tape marks} are special magnetic patterns written on the tape media, which are later recognizable by the reading hardware. These marks are used after each file, when there are many on a single tape. An empty file (that is to say, two tape marks in a row) signal the logical end of the tape, after which no file exist. Usually, non-rewinding tape device drivers will react to the close request issued by @code{tar} by first writing two tape marks after your archive, and by backspacing over one of these. So, if you remove the tape at that time from the tape drive, it is properly terminated. But if you write another file at the current position, the second tape mark will be erased by the new information, leaving only one tape mark between files. So, you may now save @var{directory-2} as a second archive after the first on the same tape by issuing the command: @example tar cf /dev/nrtape @var{directory-2} @end example @noindent and so on for all the archives you want to put on the same tape. Another usual case is that you do not write all the archives the same day, and you need to remove and store the tape between two archive sessions. In general, you must remember how many files are already saved on your tape. Suppose your tape already has 16 files on it, and that you are ready to write the 17th. You have to take care of skipping the first 16 tape marks before saving @var{directory-17}, say, by using these commands: @example mt -f /dev/nrtape rewind mt -f /dev/nrtape fsf 16 tar cf /dev/nrtape @var{directory-17} @end example In all the previous examples, we put aside blocking considerations, but you should do the proper things for that as well. @format FIXME: xref Blocking @end format . @menu * Tape Positioning:: * mt:: @end menu @node Tape Positioning, mt, Many, Many @subsection Tape Positions and Tape Marks @include docwarn.texi Just as archives can store more than one file from the file system, tapes can store more than one archive file. To keep track of where archive files (or any other type of file stored on tape) begin and end, tape archive devices write magnetic @dfn{tape marks} on the archive media. Tape drives write one tape mark between files, two at the end of all the file entries. If you think of data as a series of "0000"'s, and tape marks as "x"'s, a tape might look like the following: @example 0000x000000x00000x00x00000xx------------------------- @end example Tape devices read and write tapes using a read/write @dfn{tape head}---a physical part of the device which can only access one point on the tape at a time. When you use @code{tar} to read or write archive data from a tape device, the device will begin reading or writing from wherever on the tape the tape head happens to be, regardless of which archive or what part of the archive the tape head is on. Before writing an archive, you should make sure that no data on the tape will be overwritten (unless it is no longer needed). Before reading an archive, you should make sure the tape head is at the beginning of the archive you want to read. (The @code{restore} script will find the archive automatically. @format FIXME: xref Scripted Restoration @end format ). @format FIXME: xref mt @end format , for an explanation of the tape moving utility. If you want to add new archive file entries to a tape, you should advance the tape to the end of the existing file entries, backspace over the last tape mark, and write the new archive file. If you were to add two archives to the example above, the tape might look like the following: @example 0000x000000x00000x00x00000x000x0000xx---------------- @end example @node mt, , Tape Positioning, Many @subsection The @code{mt} Utility @include docwarn.texi @format FIXME: is it true that this only works on non-block devices? should FIXME: explain the difference, xref to block-size (fixed or variable). @end format You can use the @code{mt} utility to advance or rewind a tape past a specified number of archive files on the tape. This will allow you to move to the beginning of an archive before extracting or reading it, or to the end of all the archives before writing a new one. @format FIXME: why isn't there an "advance 'til you find two tape marks together"? @end format The syntax of the @code{mt} command is: @example mt [-f @var{tapename}] @var{operation} [@var{number}] @end example where @var{tapename} is the name of the tape device, @var{number} is the number of times an operation is performed (with a default of one), and @var{operation} is one of the following: @format FIXME: is there any use for record operations? @end format @table @code @item eof @itemx weof Writes @var{number} tape marks at the current position on the tape. @item fsf Moves tape position forward @var{number} files. @item bsf Moves tape position back @var{number} files. @item rewind Rewinds the tape. (Ignores @var{number}). @item offline @itemx rewoff1 Rewinds the tape and takes the tape device off-line. (Ignores @var{number}). @item status Prints status information about the tape unit. @end table @format FIXME: is there a better way to frob the spacing on the list? @end format If you don't specify a @var{tapename}, @code{mt} uses the environment variable TAPE; if TAPE does not exist, @code{mt} uses the device @file{/dev/rmt12}. @code{mt} returns a 0 exit status when the operation(s) were successful, 1 if the command was unrecognized, and 2 if an operation failed. @format FIXME: new node on how to find an archive? @end format If you use @value{extract} with the @value{label} option specified, @code{tar} will read an archive label (the tape head has to be positioned on it) and print an error if the archive label doesn't match the @var{archive-name} specified. @var{archive-name} can be any regular expression. If the labels match, @code{tar} extracts the archive. @format FIXME: xref Archive Label @end format . @format FIXME: xref Matching Format Parameters @end format . @format FIXME: fix cross references @end format @samp{tar --list --label} will cause @code{tar} to print the label. @format FIXME: program to list all the labels on a tape? @end format @node Using Multiple Tapes, Archive Label, Many, Media @section Using Multiple Tapes @include docwarn.texi Often you might want to write a large archive, one larger than will fit on the actual tape you are using. In such a case, you can run multiple @code{tar} commands, but this can be inconvenient, particularly if you are using options like @value{exclude} or dumping entire filesystems. Therefore, @code{tar} supports multiple tapes automatically. Use @value{multi-volume} on the command line, and then @code{tar} will, when it reaches the end of the tape, prompt for another tape, and continue the archive. Each tape will have an independent archive, and can be read without needing the other. (As an exception to this, the file that @code{tar} was archiving when it ran out of tape will usually be split between the two archives; in this case you need to extract from the first archive, using @value{multi-volume}, and then put in the second tape when prompted, so @code{tar} can restore both halves of the file.) When prompting for a new tape, @code{tar} accepts any of the following responses: @table @samp @item ? Request @code{tar} to explain possible responses @item q Request @code{tar} to exit immediately. @item n @var{file name} Request @code{tar} to write the next volume on the file @var{file name}. @item ! Request @code{tar} to run a subshell. @item y Request @code{tar} to begin writing the next volume. @end table (You should only type @samp{y} after you have changed the tape; otherwise @code{tar} will write over the volume it just finished.) If you want more elaborate behavior than this, give @code{tar} the @value{info-script} option. The file @var{script-name} is expected to be a program (or shell script) to be run instead of the normal prompting procedure. When the program finishes, @code{tar} will immediately begin writing the next volume. The behavior of the @samp{n} response to the normal tape-change prompt is not available if you use @value{info-script}. The method @code{tar} uses to detect end of tape is not perfect, and fails on some operating systems or on some devices. You can use the @value{tape-length} option if @code{tar} can't detect the end of the tape itself. The @var{size} argument should be the size of the tape. The volume number used by @code{tar} in its tape-change prompt can be changed; if you give the @value{volno-file} option, then @var{file-of-number} should contain a decimal number. That number will be used as the volume number of the first volume written. When @code{tar} is finished, it will rewrite the file with the now-current volume number. (This does not change the volume number written on a tape label ( @format FIXME: pxref Special Options for Archiving @end format ; it @emph{only} affects the number used in the prompt.) If you want @code{tar} to cycle through a series of tape drives, then you can use the @samp{n} response to the tape-change prompt. This is error prone, however, and doesn't work at all with @value{info-script}. Therefore, if you give @code{tar} multiple @value{file} options, then the specified files will be used, in sequence, as the successive volumes of the archive. Only when the first one in the sequence needs to be used again will @code{tar} prompt for a tape change (or run the info script). Multi-volume archives With @value{multi-volume}, @code{tar} will not abort when it cannot read or write any more data. Instead, it will ask you to prepare a new volume. If the archive is on a magnetic tape, you should change tapes now; if the archive is on a floppy disk, you should change disks, etc. Each volume of a multi-volume archive is an independent @code{tar} archive, complete in itself. For example, you can list or extract any volume alone; just don't specify @value{multi-volume}. However, if one file in the archive is split across volumes, the only way to extract it successfully is with a multi-volume extract command @samp{--extract --multi-volume} (@samp{-xM}) starting on or before the volume where the file begins. @menu * Multi-Volume Archives:: * Tape Files:: @end menu @node Multi-Volume Archives, Tape Files, Using Multiple Tapes, Using Multiple Tapes @subsection Archives Longer than One Tape or Disk @cindex Multi-volume archives @include docwarn.texi To create an archive that is larger than will fit on a single unit of the media, use the @value{multi-volume} option in conjunction with the @value{create} option ( @format FIXME: pxref Creating Archives @end format ). A @dfn{multi-volume} archive can be manipulated like any other archive (provided the @value{multi-volume} option is specified), but is stored on more than one tape or disk. When you specify @value{multi-volume}, @code{tar} does not report an error when it comes to the end of an archive volume (when reading), or the end of the media (when writing). Instead, it prompts you to load a new storage volume. If the archive is on a magnetic tape, you should change tapes when you see the prompt; if the archive is on a floppy disk, you should change disks; etc. You can read each individual volume of a multi-volume archive as if it were an archive by itself. For example, to list the contents of one volume, use @value{list}, without @value{multi-volume} specified. To extract an archive member from one volume (assuming it is described that volume), use @value{extract}, again without @value{multi-volume}. If an archive member is split across volumes (ie. its entry begins on one volume of the media and ends on another), you need to specify @value{multi-volume} to extract it successfully. In this case, you should load the volume where the archive member starts, and use @samp{tar --extract --multi-volume}---@code{tar} will prompt for later volumes as it needs them. @format FIXME: xref Extracting From Archives @end format for more information about extracting archives. @value{info-script} is like @value{multi-volume}, except that @code{tar} does not prompt you directly to change media volumes when a volume is full---instead, @code{tar} runs commands you have stored in @var{script-name}. This option can be used to broadcast messages such as @samp{Someone please come change my tape} when performing unattended backups. When @var{script-name} is done, @code{tar} will assume that the media has been changed. @format FIXME: There should be a sample program here, including an exit before FIXME: end. @end format @table @samp @item --multi-volume @itemx -M Creates a multi-volume archive, when used in conjunction with @value{create}. To perform any other operation on a multi-volume archive, specify @value{multi-volume} in conjunction with that operation. @item --info-script=@var{program-file} @itemx -F @var{program-file} Creates a multi-volume archive via a script. Used in conjunction with @value{create}. @end table @node Tape Files, , Multi-Volume Archives, Using Multiple Tapes @subsection Tape Files @include docwarn.texi When @code{tar} writes an archive to tape, it creates a single tape file. If multiple archives are written to the same tape, one after the other, they each get written as separate tape files. When extracting, it is necessary to position the tape at the right place before running @code{tar}. To do this, use the @code{mt} command. For more information on the @code{mt} command and on the organization of tapes into a sequence of tape files. @format FIXME: see ***. @end format @node Archive Label, , Using Multiple Tapes, Media @section Including a Label in the Archive @cindex Labeling an archive @cindex Labels on the archive media @include docwarn.texi @format FIXME: Should the arg to --label be a quoted string?? no - ringo @end format To avoid problems caused by misplaced paper labels on the archive media, you can include a @dfn{label} entry---an archive member which contains the name of the archive---in the archive itself. Use the @value{label} option in conjunction with the @value{create} operation to include a label entry in the archive as it is being created. If you create an archive using both @value{label} and @value{multi-volume}, each volume of the archive will have an archive label of the form @samp{@var{archive-label} Volume @var{n}}, where @var{n} is 1 for the first volume, 2 for the next, and so on. @format FIXME: xref Multi-Volume Archives @end format , for information on creating multiple volume archives. If you extract an archive using @value{label}, @code{tar} will print an error if the archive label doesn't match the @var{archive-label} specified, and will then not extract the archive. You can include a regular expression in @var{archive-label}, in this case only. @format FIXME: why is a reg. exp. useful here? (to limit extraction to a FIXME: specific group? ie for multi-volume??? @end format To find out an archive's label entry (or to find out if an archive has a label at all), use @samp{tar --list --verbose}. @code{tar} will print the label first, and then print archive member information, as in the example below: @example % tar --verbose --list --file=iamanarchive V--------- 0/0 0 Mar 7 12:01 1992 iamalabel--Volume Header-- -rw-rw-rw- ringo/user 40 May 21 13:30 1990 iamafilename @end example @table @samp @item --label=@var{archive-label} @itemx -V @var{archive-label} Includes an @dfn{archive-label} at the beginning of the archive when the archive is being created, when used in conjunction with the @value{create} option. Checks to make sure the archive label matches the one specified (when used in conjunction with the @value{extract} option. @end table @format FIXME: was --volume @end format @node Backups and Restoration, Date input formats, Media, Top @chapter Performing Backups and Restoring Files @include docwarn.texi @example .* dumps . + what are dumps . + different levels of dumps . - full dump = dump everything . - level 1, level 2 dumps etc, - A level n dump dumps everything changed since the last level n-1 dump (?) . + how to use scripts for dumps (ie, the concept) . - scripts to run after editing backup specs (details) . + Backup Specs, what is it. . - how to customize . - actual text of script [/sp/dump/backup-specs] . + Problems . - rsh doesn't work . - rtape isn't installed . - (others?) . + the --incremental option of tar . + tapes . - write protection . - types of media . : different sizes and types, useful for different things . - files and tape marks one tape mark between files, two at end. . - positioning the tape MT writes two at end of write, backspaces over one when writing again. @end example To @dfn{back up} a file system means to create archives that contain all the files in that file system. Those archives can then be used to restore any or all of those files (for instance if a disk crashes or a file is accidently deleted). File system @dfn{backups} are also called @dfn{dumps}. @menu * Full Dumps:: * Inc Dumps:: * incremental and listed-incremental:: * Backup Levels:: * Backup Parameters:: * Scripted Backups:: * Scripted Restoration:: @end menu @node Full Dumps, Inc Dumps, Backups and Restoration, Backups and Restoration @section Using @code{tar} to Perform Full Dumps @include docwarn.texi @cindex full dumps @cindex dumps, full @cindex corrupted archives Full dumps should only be made when no other people or programs are modifying files in the filesystem. If files are modified while @code{tar} is making the backup, they may not be stored properly in the archive, in which case you won't be able to restore them if you have to. (Files not being modified are written with no trouble, and do not corrupt the entire archive.) You will want to use the @value{label} option to give the archive a volume label, so you can tell what this archive is even if the label falls off the tape, or anything like that. Unless the filesystem you are dumping is guaranteed to fit on one volume, you will need to use the @value{multi-volume} option. Make sure you have enough tapes on hand to complete the backup. If you want to dump each filesystem separately you will need to use the @value{one-file-system} option to prevent @code{tar} from crossing filesystem boundaries when storing (sub)directories. The @value{incremental} option is not needed, since this is a complete copy of everything in the filesystem, and a full restore from this backup would only be done onto a completely empty disk. Unless you are in a hurry, and trust the @code{tar} program (and your tapes), it is a good idea to use the @value{verify} option, to make sure your files really made it onto the dump properly. This will also detect cases where the file was modified while (or just after) it was being archived. Not all media (notably cartridge tapes) are capable of being verified, unfortunately. @value{listed-incremental} take a file name argument always. If the file doesn't exist, run a level zero dump, creating the file. If the file exists, uses that file to see what has changed. @value{incremental} @format FIXME: look it up @end format @value{incremental} handle old GNU-format incremental backup. This option should only be used when creating an incremental backup of a filesystem. When the @value{incremental} option is used, @code{tar} writes, at the beginning of the archive, an entry for each of the directories that will be operated on. The entry for a directory includes a list of all the files in the directory at the time the dump was done, and a flag for each file indicating whether the file is going to be put in the archive. This information is used when doing a complete incremental restore. Note that this option causes @code{tar} to create a non-standard archive that may not be readable by non-GNU versions of the @code{tar} program. The @value{incremental} option means the archive is an incremental backup. Its meaning depends on the command that it modifies. If the @value{incremental} option is used with @value{list}, @code{tar} will list, for each directory in the archive, the list of files in that directory at the time the archive was created. This information is put out in a format that is not easy for humans to read, but which is unambiguous for a program: each file name is preceded by either a @samp{Y} if the file is present in the archive, an @samp{N} if the file is not included in the archive, or a @samp{D} if the file is a directory (and is included in the archive). Each file name is terminated by a null character. The last file is followed by an additional null and a newline to indicate the end of the data. If the @value{incremental} option is used with @value{extract}, then when the entry for a directory is found, all files that currently exist in that directory but are not listed in the archive @emph{are deleted from the directory}. This behavior is convenient when you are restoring a damaged file system from a succession of incremental backups: it restores the entire state of the file system to that which obtained when the backup was made. If you don't use @value{incremental}, the file system will probably fill up with files that shouldn't exist any more. @value{listed-incremental} handle new GNU-format incremental backup. @value{listed-incremental} acts like @value{incremental}, but when used in conjunction with @value{create} will also cause @code{tar} to use the file @var{file}, which contains information about the state of the filesystem at the time of the last backup, to decide which files to include in the archive being created. That file will then be updated by @code{tar}. If the file @var{file} does not exist when this option is specified, @code{tar} will create it, and include all appropriate files in the archive. The file, which is archive independent, contains the date it was last modified and a list of devices, inode numbers and directory names. @code{tar} will archive files with newer mod dates or inode change times, and directories with an unchanged inode number and device but a changed directory name. The file is updated after the files to be archived are determined, but before the new archive is actually created. @node Inc Dumps, incremental and listed-incremental, Full Dumps, Backups and Restoration @section Using @code{tar} to Perform Incremental Dumps @include docwarn.texi @cindex incremental dumps @cindex dumps, incremental Performing incremental dumps is similar to performing full dumps, although a few more options will usually be needed. You will need to use the @samp{-N @var{date}} option to tell @code{tar} to only store files that have been modified since @var{date}. @var{date} should be the date and time of the last full/incremental dump. A standard scheme is to do a @emph{monthly} (full) dump once a month, a @emph{weekly} dump once a week of everything since the last monthly and a @emph{daily} every day of everything since the last (weekly or monthly) dump. Here is a copy of the script used to dump the filesystems of the machines here at the Free Software Foundation. This script is run via @code{cron} late at night when people are least likely to be using the machines. This script dumps several filesystems from several machines at once (via NFS). The operator is responsible for ensuring that all the machines will be up at the time the dump happens. If a machine is not running, its files will not be dumped, and the next day's incremental dump will @emph{not} store files that would have gone onto that dump. @example #!/bin/csh # Dump thingie set now = `date` set then = `cat date.nfs.dump` /u/hack/bin/tar -c -G -v\ -f /dev/rtu20\ -b 126\ -N "$then"\ -V "Dump from $then to $now"\ /alpha-bits/gp\ /gnu/hack\ /hobbes/u\ /spiff/u\ /sugar-bombs/u echo $now > date.nfs.dump mt -f /dev/rtu20 rew @end example Output from this script is stored in a file, for the operator to read later. This script uses the file @file{date.nfs.dump} to store the date/time of the last dump. Since this is a streaming tape drive, no attempt to verify the archive is done. This is also why the high blocking factor (126) is used. The tape drive must also be rewound by the @code{mt} command after the dump is made. @node incremental and listed-incremental, Backup Levels, Inc Dumps, Backups and Restoration @section The Incremental Options @include docwarn.texi @value{incremental} is used in conjunction with @value{create}, @value{extract} or @value{list} when backing up and restoring file systems. An archive cannot be extracted or listed with the @value{incremental} option specified unless it was created with the option specified. This option should only be used by a script, not by the user, and is usually disregarded in favor of @value{listed-incremental}, which is described below. @value{incremental} in conjunction with @value{create} causes @code{tar} to write, at the beginning of the archive, an entry for each of the directories that will be archived. The entry for a directory includes a list of all the files in the directory at the time the archive was created and a flag for each file indicating whether or not the file is going to be put in the archive. Note that this option causes @code{tar} to create a non-standard archive that may not be readable by non-GNU versions of the @code{tar} program. @value{incremental} in conjunction with @value{extract} causes @code{tar} to read the lists of directory contents previously stored in the archive, @emph{delete} files in the file system that did not exist in their directories when the archive was created, and then extract the files in the archive. This behavior is convenient when restoring a damaged file system from a succession of incremental backups: it restores the entire state of the file system to that which obtained when the backup was made. If @value{incremental} isn't specified, the file system will probably fill up with files that shouldn't exist any more. @value{incremental} in conjunction with @value{list}, causes @code{tar} to print, for each directory in the archive, the list of files in that directory at the time the archive was created. This information is put out in a format that is not easy for humans to read, but which is unambiguous for a program: each file name is preceded by either a @samp{Y} if the file is present in the archive, an @samp{N} if the file is not included in the archive, or a @samp{D} if the file is a directory (and is included in the archive). Each file name is terminated by a null character. The last file is followed by an additional null and a newline to indicate the end of the data. @value{listed-incremental} acts like @value{incremental}, but when used in conjunction with @value{create} will also cause @code{tar} to use the file @var{snapshot-file}, which contains information about the state of the file system at the time of the last backup, to decide which files to include in the archive being created. That file will then be updated by @code{tar}. If the file @var{file} does not exist when this option is specified, @code{tar} will create it, and include all appropriate files in the archive. The file @var{file}, which is archive independent, contains the date it was last modified and a list of devices, inode numbers and directory names. @code{tar} will archive files with newer mod dates or inode change times, and directories with an unchanged inode number and device but a changed directory name. The file is updated after the files to be archived are determined, but before the new archive is actually created. @format FIXME: this section needs to be written @end format @node Backup Levels, Backup Parameters, incremental and listed-incremental, Backups and Restoration @section Levels of Backups @include docwarn.texi An archive containing all the files in the file system is called a @dfn{full backup} or @dfn{full dump}. You could insure your data by creating a full dump every day. This strategy, however, would waste a substantial amount of archive media and user time, as unchanged files are daily re-archived. It is more efficient to do a full dump only occasionally. To back up files between full dumps, you can a incremental dump. A @dfn{level one} dump archives all the files that have changed since the last full dump. A typical dump strategy would be to perform a full dump once a week, and a level one dump once a day. This means some versions of files will in fact be archived more than once, but this dump strategy makes it possible to restore a file system to within one day of accuracy by only extracting two archives---the last weekly (full) dump and the last daily (level one) dump. The only information lost would be in files changed or created since the last daily backup. (Doing dumps more than once a day is usually not worth the trouble). GNU @code{tar} comes with scripts you can use to do full and level-one dumps. Using scripts (shell programs) to perform backups and restoration is a convenient and reliable alternative to typing out file name lists and @code{tar} commands by hand. Before you use these scripts, you need to edit the file @file{backup-specs}, which specifies parameters used by the backup scripts and by the restore script. @format FIXME: xref Script Syntax @end format . Once the backup parameters are set, you can perform backups or restoration by running the appropriate script. The name of the restore script is @code{restore}. The names of the level one and full backup scripts are, respectively, @code{level-1} and @code{level-0}. The @code{level-0} script also exists under the name @code{weekly}, and the @code{level-1} under the name @code{daily}---these additional names can be changed according to your backup schedule. @format FIXME: xref Scripted Restoration @end format , for more information on running the restoration script. @format FIXME: xref Scripted Backups @end format , for more information on running the backup scripts. @emph{Please Note:} The backup scripts and the restoration scripts are designed to be used together. While it is possible to restore files by hand from an archive which was created using a backup script, and to create an archive by hand which could then be extracted using the restore script, it is easier to use the scripts. @format FIXME: xref incremental and listed-incremental @end format , before making such an attempt. @format FIXME: shorten node names @end format @node Backup Parameters, Scripted Backups, Backup Levels, Backups and Restoration @section Setting Parameters for Backups and Restoration @include docwarn.texi The file @file{backup-specs} specifies backup parameters for the backup and restoration scripts provided with @code{tar}. You must edit @file{backup-specs} to fit your system configuration and schedule before using these scripts. @format FIXME: This about backup scripts needs to be written: BS is a shell FIXME: script .... thus ... @file{backup-specs} is in shell script FIXME: syntax. xref Script Syntax, for an explanation of this syntax. FIXME: FIXME: whats a parameter .... looked at by the backup scripts ... which FIXME: will be expecting to find ... now syntax ... value is linked to FIXME: lame ... @file{backup-specs} specifies the following parameters: @end format @table @code @item ADMINISTRATOR The user name of the backup administrator. @item BACKUP_HOUR The hour at which the backups are done. This can be a number from 0 to 23, or the string @samp{now}. @item TAPE_FILE The device @code{tar} writes the archive to. This device should be attached to the host on which the dump scripts are run. @format FIXME: examples for all ... @end format @item TAPE_STATUS The command to use to obtain the status of the archive device, including error count. On some tape drives there may not be such a command; in that case, simply use `TAPE_STATUS=false'. @item BLOCKING The blocking factor @code{tar} will use when writing the dump archive. @format FIXME: xref Blocking Factor @end format . @item BACKUP_DIRS A list of file systems to be dumped. You can include any directory name in the list---subdirectories on that file system will be included, regardless of how they may look to other networked machines. Subdirectories on other file systems will be ignored. The host name specifies which host to run @code{tar} on, and should normally be the host that actually contains the file system. However, the host machine must have GNU @code{tar} installed, and must be able to access the directory containing the backup scripts and their support files using the same file name that is used on the machine where the scripts are run (ie. what @code{pwd} will print when in that directory on that machine). If the host that contains the file system does not have this capability, you can specify another host as long as it can access the file system through NFS. @item BACKUP_FILES A list of individual files to be dumped. These should be accessible from the machine on which the backup script is run. @format FIXME: same file name, be specific. through nfs ... @end format @end table @menu * backup-specs example:: * Script Syntax:: @end menu @node backup-specs example, Script Syntax, Backup Parameters, Backup Parameters @subsection An Example Text of @file{Backup-specs} @include docwarn.texi The following is the text of @file{backup-specs} as it appears at FSF: @example # site-specific parameters for file system backup. ADMINISTRATOR=friedman BACKUP_HOUR=1 TAPE_FILE=/dev/nrsmt0 TAPE_STATUS="mts -t $TAPE_FILE" BLOCKING=124 BACKUP_DIRS=" albert:/fs/fsf apple-gunkies:/gd albert:/fs/gd2 albert:/fs/gp geech:/usr/jla churchy:/usr/roland albert:/ albert:/usr apple-gunkies:/ apple-gunkies:/usr gnu:/hack gnu:/u apple-gunkies:/com/mailer/gnu apple-gunkies:/com/archive/gnu" BACKUP_FILES="/com/mailer/aliases /com/mailer/league*[a-z]" @end example @node Script Syntax, , backup-specs example, Backup Parameters @subsection Syntax for @file{Backup-specs} @include docwarn.texi @file{backup-specs} is in shell script syntax. The following conventions should be considered when editing the script: @format FIXME: "conventions?" @end format A quoted string is considered to be contiguous, even if it is on more than one line. Therefore, you cannot include commented-out lines within a multi-line quoted string. BACKUP_FILES and BACKUP_DIRS are the two most likely parameters to be multi-line. A quoted string typically cannot contain wildcards. In @file{backup-specs}, however, the parameters BACKUP_DIRS and BACKUP_FILES can contain wildcards. @node Scripted Backups, Scripted Restoration, Backup Parameters, Backups and Restoration @section Using the Backup Scripts @include docwarn.texi The syntax for running a backup script is: @example @file{script-name} [@var{time-to-be-run}] @end example where @var{time-to-be-run} can be a specific system time, or can be @kbd{now}. If you do not specify a time, the script runs at the time specified in @file{backup-specs} ( @format FIXME: pxref Script Syntax @end format ). You should start a script with a tape or disk mounted. Once you start a script, it prompts you for new tapes or disks as it needs them. Media volumes don't have to correspond to archive files---a multi-volume archive can be started in the middle of a tape that already contains the end of another multi-volume archive. The @code{restore} script prompts for media by its archive volume, so to avoid an error message you should keep track of which tape (or disk) contains which volume of the archive. @format FIXME: xref Scripted Restoration @end format . @format FIXME: have file names changed? @end format The backup scripts write two files on the file system. The first is a record file in @file{/etc/tar-backup/}, which is used by the scripts to store and retrieve information about which files were dumped. This file is not meant to be read by humans, and should not be deleted by them. @format FIXME: xref incremental and listed-incremental @end format , for a more detailed explanation of this file. The second file is a log file containing the names of the file systems and files dumped, what time the backup was made, and any error messages that were generated, as well as how much space was left in the media volume after the last volume of the archive was written. You should check this log file after every backup. The file name is @file{log-@var{mmm-ddd-yyyy}-level-1} or @file{log-@var{mmm-ddd-yyyy}-full}. The script also prints the name of each system being dumped to the standard output. @format FIXME: the section on restore scripts is commented out. FIXME: a section on non-scripted testore mya be a good idea @end format @node Scripted Restoration, , Scripted Backups, Backups and Restoration @section Using the Restore Script @format FIXME: subject to change as things develop @end format @include docwarn.texi (This node was @@ignore'd---merely listing it for now.) To restore files that were archived using a scripted backup, use the @code{restore} script. The syntax for the script is: where ***** are the file systems to restore from, and ***** is a regular expression which specifies which files to restore. If you specify --all, the script restores all the files in the file system. You should start the restore script with the media containing the first volume of the archive mounted. The script will prompt for other volumes as they are needed. If the archive is on tape, you don't need to rewind the tape to to its beginning---if the tape head is positioned past the beginning of the archive, the script will rewind the tape as needed. @format FIXME: xref Media @end format , for a discussion of tape positioning. If you specify @samp{--all} as the @var{files} argument, the @code{restore} script extracts all the files in the archived file system into the active file system. @quotation @strong{Warning:}The script will delete files from the active file system if they were not in the file system when the archive was made. @end quotation @format FIXME: xref incremental and listed-incremental @end format , for an explanation of how the script makes that determination. @format FIXME: this may be an option, not a given @end format @node Date input formats, Archive Format, Backups and Restoration, Top @chapter Date input formats @cindex date input formats @findex getdate This section describes the textual date representations that GNU programs accept. These are the strings you, as a user, can supply as arguments to the various programs. The C interface (via the @code{getdate} function) is not described here. @cindex beginning of time, for Unix @cindex epoch, for Unix Although the date syntax here can represent any possible time since zero A.D., computer integers are not big enough for such a (comparatively) long time. The earliest date semantically allowed on Unix systems is midnight, 1 January 1970 UCT. @menu * General date syntax:: * Calendar date item:: * Time of day item:: * Timezone item:: * Day of week item:: * Relative item in date strings:: * Pure numbers in date strings:: * Authors of getdate:: @end menu @node General date syntax, Calendar date item, Date input formats, Date input formats @section General date syntax @cindex general date syntax @cindex items in date strings A @dfn{date} is a string, possibly empty, containing many items separated by whitespace. The whitespace may be omitted when no ambiguity arises. The empty string means the beginning of today (i.e., midnight). Order of the items is immaterial. A date string may contain many flavors of items: @itemize @bullet @item calendar date items @item time of the day items @item time zone items @item day of the week items @item relative items @item pure numbers. @end itemize @noindent We describe each of these item types in turn, below. @cindex numbers, written-out @cindex ordinal numbers @findex first @r{in date strings} @findex next @r{in date strings} @findex last @r{in date strings} A few numbers may be written out in words in most contexts. This is most useful for specifying day of the week items or relative items (see below). Here is the list: @samp{first} for 1, @samp{next} for 2, @samp{third} for 3, @samp{fourth} for 4, @samp{fifth} for 5, @samp{sixth} for 6, @samp{seventh} for 7, @samp{eighth} for 8, @samp{ninth} for 9, @samp{tenth} for 10, @samp{eleventh} for 11 and @samp{twelfth} for 12. Also, @samp{last} means exactly @math{-1}. @cindex months, written-out When a month is written this way, it is still considered to be written numerically, instead of being ``spelled in full''; this changes the allowed strings. @cindex case, ignored in dates @cindex comments, in dates Alphabetic case is completely ignored in dates. Comments may be introduced between round parentheses, as long as included parentheses are properly nested. Hyphens not followed by a digit are currently ignored. Leading zeros on numbers are ignored. @node Calendar date item, Time of day item, General date syntax, Date input formats @section Calendar date item @cindex calendar date item A @dfn{calendar date item} specifies a day of the year. It is specified differently, depending on whether the month is specified numerically or literally. All these strings specify the same calendar date: @example 1970-9-17 # ISO 8601. 70-9-17 # This century assumed by default. 70-09-17 # Leading zeros are ignored. 9/17/72 # Common U.S. writing. 24 September 1972 24 Sept 72 # September has a special abbreviation. 24 Sep 72 # Three-letter abbreviations always allowed. Sep 24, 1972 24-sep-72 24sep72 @end example The year can also be omitted. In this case, the last specified year is used, or the current year if none. For example: @example 9/17 sep 17 @end example Here are the rules. @cindex ISO 8601 date format @cindex date format, ISO 8601 For numeric months, the ISO 8601 format @samp{@var{year}-@var{month}-@var{day}} is allowed, where @var{year} is any positive number, @var{month} is a number between 1 and 12, and @var{day} is a number between 1 and 31. If @var{year} is less than 100, then 1900 is added to it to force a date in this century. The construct @samp{@var{month}/@var{day}/@var{year}}, popular in the United States, is accepted. Also @samp{@var{month}/@var{day}}, omitting the year. @cindex month names in date strings @cindex abbreviations for months Literal months may be spelled out in full: @samp{January}, @samp{February}, @samp{March}, @samp{April}, @samp{May}, @samp{June}, @samp{July}, @samp{August}, @samp{September}, @samp{October}, @samp{November} or @samp{December}. Literal months may be abbreviated to their first three letters, possibly followed by an abbreviating dot. It is also permitted to write @samp{Sept} instead of @samp{September}. When months are written literally, the calendar date may be given as any of the following: @example @var{day} @var{month} @var{year} @var{day} @var{month} @var{month} @var{day} @var{year} @var{day}-@var{month}-@var{year} @end example Or, omitting the year: @example @var{month} @var{day} @end example @node Time of day item, Timezone item, Calendar date item, Date input formats @section Time of day item @cindex time of day item A @dfn{time of day item} in date strings specifies the time on a given day. Here are some examples, all of which represent the same time: @example 20:02:0 20:02 8:02pm 20:02-0500 # In EST (Eastern U.S. Standard Time). @end example More generally, the time of the day may be given as @samp{@var{hour}:@var{minute}:@var{second}}, where @var{hour} is a number between 0 and 23, @var{minute} is a number between 0 and 59, and @var{second} is a number between 0 and 59. Alternatively, @samp{:@var{second}} can be omitted, in which case it is taken to be zero. @findex am @r{in date strings} @findex pm @r{in date strings} @findex midnight @r{in date strings} @findex noon @r{in date strings} If the time is followed by @samp{am} or @samp{pm} (or @samp{a.m.} or @samp{p.m.}), @var{hour} is restricted to run from 1 to 12, and @samp{:@var{minute}} may be omitted (taken to be zero). @samp{am} indicates the first half of the day, @samp{pm} indicates the second half of the day. In this notation, 12 is the predecessor of 1: midnight is @samp{12am} while noon is @samp{12pm}. @cindex timezone correction @cindex minutes, timezone correction by The time may alternatively be followed by a timezone correction, expressed as @samp{@var{s}@var{hh}@var{mm}}, where @var{s} is @samp{+} or @samp{-}, @var{hh} is a number of zone hours and @var{mm} is a number of zone minutes. When a timezone correction is given this way, it forces interpretation of the time in UTC, overriding any previous specification for the timezone or the local timezone. The @var{minute} part of the time of the day may not be elided when a timezone correction is used. This is the only way to specify a timezone correction by fractional parts of an hour. Either @samp{am}/@samp{pm} or a timezone correction may be specified, but not both. @node Timezone item, Day of week item, Time of day item, Date input formats @section Timezone item @cindex timezone item A @dfn{timezone item} specifies an international timezone, indicated by a small set of letters. Any included period is ignored. Military timezone designations use a single letter. Currently, only integral zone hours may be represented in a timezone item. See the previous section for a finer control over the timezone correction. Here are many non-daylight-savings-time timezones, indexed by the zone hour value. @table @asis @item +000 @cindex Greenwich Mean Time @cindex Universal Coordinated Time @cindex Western European Time @samp{GMT} for Greenwich Mean, @samp{UT} or @samp{UTC} for Universal (Coordinated), @samp{WET} for Western European and @samp{Z} for militaries. @item +100 @cindex West African Time @samp{WAT} for West Africa and @samp{A} for militaries. @item +200 @cindex Azores Time @samp{AT} for Azores and @samp{B} for militaries. @item +300 @samp{C} for militaries. @item +400 @cindex Atlantic Standard Time @samp{AST} for Atlantic Standard and @samp{D} for militaries. @item +500 @cindex Eastern Standard Time @samp{E} for militaries and @samp{EST} for Eastern Standard. @item +600 @cindex Central Standard Time @samp{CST} for Central Standard and @samp{F} for militaries. @item +700 @cindex Mountain Standard Time @samp{G} for militaries and @samp{MST} for Mountain Standard. @item +800 @cindex Pacific Standard Time @samp{H} for militaries and @samp{PST} for Pacific Standard. @item +900 @cindex Yukon Standard Time @samp{I} for militaries and @samp{YST} for Yukon Standard. @item +1000 @cindex Alaska-Hawaii Time @cindex Central Alaska Time @cindex Hawaii Standard Time @samp{AHST} for Alaska-Hawaii Standard, @samp{CAT} for Central Alaska, @samp{HST} for Hawaii Standard and @samp{K} for militaries. @item +1100 @cindex Nome Standard Time @samp{L} for militaries and @samp{NT} for Nome. @item +1200 @cindex International Date Line West @samp{IDLW} for International Date Line West and @samp{M} for militaries. @item -100 @cindex Central European Time @cindex Middle European Time @cindex Middle European Winter Time @cindex French Winter Time @cindex Swedish Winter Time @samp{CET} for Central European, @samp{FWT} for French Winter, @samp{MET} for Middle European, @samp{MEWT} for Middle European Winter, @samp{N} for militaries and @samp{SWT} for Swedish Winter. @item -200 @cindex Eastern European Time @cindex USSR Zone @samp{EET} for Eastern European, USSR Zone 1 and @samp{O} for militaries. @item -300 @cindex Baghdad Time @samp{BT} for Baghdad, USSR Zone 2 and @samp{P} for militaries. @item -400 @samp{Q} for militaries and @samp{ZP4} for USSR Zone 3. @item -500 @samp{R} for militaries and @samp{ZP5} for USSR Zone 4. @item -600 @samp{S} for militaries and @samp{ZP6} for USSR Zone 5. @item -700 @cindex West Australian Standard Time @samp{T} for militaries and @samp{WAST} for West Australian Standard. @item -800 @cindex China Coast Time @samp{CCT} for China Coast, USSR Zone 7 and @samp{U} for militaries. @item -900 @cindex Japan Standard Time @samp{JST} for Japan Standard, USSR Zone 8 and @samp{V} for militaries. @item -1000 @cindex East Australian Standard Time @cindex Guam Standard Time @samp{EAST} for East Australian Standard, @samp{GST} for Guam Standard, USSR Zone 9 and @samp{W} for militaries. @item -1100 @samp{X} for militaries. @item -1200 @cindex International Date Line East @cindex New Zealand Standard Time @samp{IDLE} for International Date Line East, @samp{NZST} for New Zealand Standard, @samp{NZT} for New Zealand and @samp{Y} for militaries. @end table @cindex daylight savings time Here are many DST timezones, indexed by the zone hour value. Also, by following a non-DST timezone by the string @samp{DST} in a separate word (that is, separated by some whitespace), the corresponding DST timezone may be specified. @table @asis @item 0 @samp{BST} for British Summer. @item +400 @samp{ADT} for Atlantic Daylight. @item +500 @samp{EDT} for Eastern Daylight. @item +600 @samp{CDT} for Central Daylight. @item +700 @samp{MDT} for Mountain Daylight. @item +800 @samp{PDT} for Pacific Daylight. @item +900 @samp{YDT} for Yukon Daylight. @item +1000 @samp{HDT} for Hawaii Daylight. @item -100 @samp{MEST} for Middle European Summer, @samp{MESZ} for Middle European Summer, @samp{SST} for Swedish Summer and @samp{FST} for French Summer. @item -700 @samp{WADT} for West Australian Daylight. @item -1000 @samp{EADT} for Eastern Australian Daylight. @item -1200 @samp{NZDT} for New Zealand Daylight. @end table @node Day of week item, Relative item in date strings, Timezone item, Date input formats @section Day of week item @cindex day of week item The explicit mention of a day of the week will forward the date (only if necessary) to reach that day of the week in the future. Days of the week may be spelled out in full: @samp{Sunday}, @samp{Monday}, @samp{Tuesday}, @samp{Wednesday}, @samp{Thursday}, @samp{Friday} or @samp{Saturday}. Days may be abbreviated to their first three letters, optionally followed by a period. The special abbreviations @samp{Tues} for @samp{Tuesday}, @samp{Wednes} for @samp{Wednesday} and @samp{Thur} or @samp{Thurs} for @samp{Thursday} are also allowed. @findex next @var{day} @findex last @var{day} A number may precede a day of the week item to move forward supplementary weeks. It is best used in expression like @samp{third monday}. In this context, @samp{last @var{day}} or @samp{next @var{day}} is also acceptable; they move one week before or after the day that @var{day} by itself would represent. A comma following a day of the week item is ignored. @node Relative item in date strings, Pure numbers in date strings, Day of week item, Date input formats @section Relative item in date strings @cindex relative items in date strings @cindex displacement of dates @dfn{Relative items} adjust a date (or the current date if none) forward or backward. The effect of relative items accumulate. Here are some examples: @example 1 year 1 year ago 3 years 2 days @end example @findex year @r{in date strings} @findex month @r{in date strings} @findex fortnight @r{in date strings} @findex week @r{in date strings} @findex day @r{in date strings} @findex hour @r{in date strings} @findex minute @r{in date strings} The unit of time displacement may be selected by the string @samp{year} or @samp{month} for moving by whole years or months. These are fuzzy units, as years and months are not all of equal duration. More precise units are @samp{fortnight} which is worth 14 days, @samp{week} worth 7 days, @samp{day} worth 24 hours, @samp{hour} worth 60 minutes, @samp{minute} or @samp{min} worth 60 seconds, and @samp{second} or @samp{sec} worth one second. An @samp{s} suffix on these units is accepted and ignored. @findex ago @r{in date strings} The unit of time may be preceded by a multiplier, given as an optionally signed number. Unsigned numbers are taken as positively signed. No number at all implies 1 for a multiplier. Following a relative item by the string @samp{ago} is equivalent to preceding the unit by a multiplicator with value @math{-1}. @findex day @r{in date strings} @findex tomorrow @r{in date strings} @findex yesterday @r{in date strings} The string @samp{tomorrow} is worth one day in the future (equivalent to @samp{day}), the string @samp{yesterday} is worth one day in the past (equivalent to @samp{day ago}). @findex now @r{in date strings} @findex today @r{in date strings} @findex this @r{in date strings} The strings @samp{now} or @samp{today} are relative items corresponding to zero-valued time displacement, these strings come from the fact a zero-valued time displacement represents the current time when not otherwise change by previous items. They may be used to stress other items, like in @samp{12:00 today}. The string @samp{this} also has the meaning of a zero-valued time displacement, but is preferred in date strings like @samp{this thursday}. When a relative item makes the resulting date to cross the boundary between DST and non-DST (or vice-versa), the hour is adjusted according to the local time. @node Pure numbers in date strings, Authors of getdate, Relative item in date strings, Date input formats @section Pure numbers in date strings @cindex pure numbers in date strings The precise intepretation of a pure decimal number is dependent of the context in the date string. If the decimal number is of the form @var{yyyy}@var{mm}@var{dd} and no other calendar date item ( @format FIXME: pxref Calendar date item @end format ) appears before it in the date string, then @var{yyyy} is read as the year, @var{mm} as the month number and @var{dd} as the day of the month, for the specified calendar date. If the decimal number is of the form @var{hh}@var{mm} and no other time of day item appears before it in the date string, then @var{hh} is read as the hour of the day and @var{mm} as the minute of the hour, for the specified time of the day. @var{mm} can also be omitted. If both a calendar date and a time of day appear to the left of a number in the date string, but no relative item, then the number overrides the year. @node Authors of getdate, , Pure numbers in date strings, Date input formats @section Authors of @code{getdate} @cindex authors of @code{getdate} @cindex Bellovin, Steven M. @cindex Salz, Rich @cindex Berets, Jim @cindex MacKenzie, David @cindex Meyering, Jim @code{getdate} was originally implemented by Steven M. Bellovin (@samp{smb@@research.att.com}) while at the University of North Carolina at Chapel Hill. The code was later tweaked by a couple of people on Usenet, then completely overhauled by Rich $alz (@samp{rsalz@@bbn.com}) and Jim Berets (@samp{jberets@@bbn.com}) in August, 1990. Various revisions for the GNU system were made by David MacKenzie, Jim Meyering, and others. @cindex Pinard, F. @cindex Berry, K. This chapter was originally produced by @value{Francois} Pinard (@samp{pinard@@iro.umontreal.ca}) from the @file{getdate.y} source code, and then edited by K.@: Berry (@samp{kb@@cs.umb.edu}). @node Archive Format, Index, Date input formats, Top @chapter Format of @code{tar} archives @include docwarn.texi @menu * Standard:: * Extensions:: * cpio:: @end menu @node Standard, Extensions, Archive Format, Archive Format @section The Standard Format @include docwarn.texi A @code{tar} archive file contains a series of records. Each record contains @code{RECORDSIZE} bytes. Although this format may be thought of as being on magnetic tape, other media are often used. Each file archived is represented by a header record which describes the file, followed by zero or more records which give the contents of the file. At the end of the archive file there may be a record filled with binary zeros as an end-of-file marker. A reasonable system should write a record of zeros at the end, but must not assume that such a record exists when reading an archive. The records may be @dfn{blocked} for physical I/O operations. Each block of @var{n} records (where @var{n} is set by the @value{block-size} option to @code{tar}) is written with a single @w{@samp{write ()}} operation. On magnetic tapes, the result of such a write is a single tape record. When writing an archive, the last block of records should be written at the full size, with records after the zero record containing all zeroes. When reading an archive, a reasonable system should properly handle an archive whose last block is shorter than the rest, or which contains garbage records after a zero record. The header record is defined in C as follows. In the GNU @code{tar} distribution, this is part of file @file{src/tar.h}: @example @include header.texi @end example All characters in header records are represented by using 8-bit characters in the local variant of ASCII. Each field within the structure is contiguous; that is, there is no padding used within the structure. Each character on the archive medium is stored contiguously. Bytes representing the contents of files (after the header record of each file) are not translated in any way and are not constrained to represent characters in any character set. The @code{tar} format does not distinguish text files from binary files, and no translation of file contents is performed. The @code{name}, @code{linkname}, @code{magic}, @code{uname}, and @code{gname} are null-terminated character strings. All other fileds are zero-filled octal numbers in ASCII. Each numeric field of width @var{w} contains @var{w} minus 2 digits, a space, and a null, except @code{size}, and @code{mtime}, which do not contain the trailing null. The @code{name} field is the file name of the file, with directory names (if any) preceding the file name, separated by slashes. @format FIXME: how big a name before field overflows? @end format The @code{mode} field provides nine bits specifying file permissions and three bits to specify the Set UID, Set GID, and Save Text (@dfn{sticky}) modes. Values for these bits are defined above. When special permissions are required to create a file with a given mode, and the user restoring files from the archive does not hold such permissions, the mode bit(s) specifying those special permissions are ignored. Modes which are not supported by the operating system restoring files from the archive will be ignored. Unsupported modes should be faked up when creating or updating an archive; e.g. the group permission could be copied from the @emph{other} permission. The @code{uid} and @code{gid} fields are the numeric user and group ID of the file owners, respectively. If the operating system does not support numeric user or group IDs, these fields should be ignored. The @code{size} field is the size of the file in bytes; linked files are archived with this field specified as zero. @format FIXME: xref Modifiers @end format , in particular the @value{incremental} option. The @code{mtime} field is the modification time of the file at the time it was archived. It is the ASCII representation of the octal value of the last time the file was modified, represented as an integer number of seconds since January 1, 1970, 00:00 Coordinated Universal Time. The @code{chksum} field is the ASCII representation of the octal value of the simple sum of all bytes in the header record. Each 8-bit byte in the header is added to an unsigned integer, initialized to zero, the precision of which shall be no less than seventeen bits. When calculating the checksum, the @code{chksum} field is treated as if it were all blanks. The @code{typeflag} field specifies the type of file archived. If a particular implementation does not recognize or permit the specified type, the file will be extracted as if it were a regular file. As this action occurs, @code{tar} issues a warning to the standard error. The @code{atime} and @code{ctime} fields are used in making incremental backups; they store, respectively, the particular file's access time and last inode-change time. The @code{offset} is used by the @value{multi-volume} option, when making a multi-volume archive. The offset is number of bytes into the file that we need to restart at to continue the file on the next tape, i.e., where we store the location that a continued file is continued at. The following fields were added to deal with sparse files. A file is @dfn{sparse} if it takes in unallocated blocks which end up being represented as zeros, i.e., no useful data. A test to see if a file is sparse is to look at the number blocks allocated for it versus the number of characters in the file; if there are fewer blocks allocated for the file than would normally be allocated for a file of that size, then the file is sparse. This is the method @code{tar} uses to detect a sparse file, and once such a file is detected, it is treated differently from non-sparse files. Sparse files are often @code{dbm} files, or other database-type files which have data at some points and emptiness in the greater part of the file. Such files can appear to be very large when an @samp{ls -l} is done on them, when in truth, there may be a very small amount of important data contained in the file. It is thus undesirable to have @code{tar} think that it must back up this entire file, as great quantities of room are wasted on empty blocks, which can lead to running out of room on a tape far earlier than is necessary. Thus, sparse files are dealt with so that these empty blocks are not written to the tape. Instead, what is written to the tape is a description, of sorts, of the sparse file: where the holes are, how big the holes are, and how much data is found at the end of the hole. This way, the file takes up potentially far less room on the tape, and when the file is extracted later on, it will look exactly the way it looked beforehand. The following is a description of the fields used to handle a sparse file: The @code{sp} is an array of @code{struct sparse}. Each @code{struct sparse} contains two 12-character strings which represent an offset into the file and a number of bytes to be written at that offset. The offset is absolute, and not relative to the offset in preceding array element. The header can hold four of these @code{struct sparse} at the moment; if more are needed, they are not stored in the header. The @code{isextended} flag is set when an @code{extended_header} is needed to deal with a file. Note that this means that this flag can only be set when dealing with a sparse file, and it is only set in the event that the description of the file will not fit in the alloted room for sparse structures in the header. In other words, an extended_header is needed. The @code{extended_header} structure is used for sparse files which need more sparse structures than can fit in the header. The header can fit 4 such structures; if more are needed, the flag @code{isextended} gets set and the next record is an @code{extended_header}. Each @code{extended_header} structure contains an array of 21 sparse structures, along with a similar @code{isextended} flag that the header had. There can be an indeterminate number of such @code{extended_header}s to describe a sparse file. @table @asis @item @code{LF_NORMAL} @itemx @code{LF_OLDNORMAL} These flags represent a regular file. In order to be compatible with older versions of @code{tar}, a @code{typeflag} value of @code{LF_OLDNORMAL} should be silently recognized as a regular file. New archives should be created using @code{LF_NORMAL}. Also, for backward compatibility, @code{tar} treats a regular file whose name ends with a slash as a directory. @item @code{LF_LINK} This flag represents a file linked to another file, of any type, previously archived. Such files are identified in Unix by each file having the same device and inode number. The linked-to name is specified in the @code{linkname} field with a trailing null. @item @code{LF_SYMLINK} This represents a symbolic link to another file. The linked-to name is specified in the @code{linkname} field with a trailing null. @item @code{LF_CHR} @itemx @code{LF_BLK} These represent character special files and block special files respectively. In this case the @code{devmajor} and @code{devminor} fields will contain the major and minor device numbers respectively. Operating systems may map the device specifications to their own local specification, or may ignore the entry. @item @code{LF_DIR} This flag specifies a directory or sub-directory. The directory name in the @code{name} field should end with a slash. On systems where disk allocation is performed on a directory basis, the @code{size} field will contain the maximum number of bytes (which may be rounded to the nearest disk block allocation unit) which the directory may hold. A @code{size} field of zero indicates no such limiting. Systems which do not support limiting in this manner should ignore the @code{size} field. @item @code{LF_FIFO} This specifies a FIFO special file. Note that the archiving of a FIFO file archives the existence of this file and not its contents. @item @code{LF_CONTIG} This specifies a contiguous file, which is the same as a normal file except that, in operating systems which support it, all its space is allocated contiguously on the disk. Operating systems which do not allow contiguous allocation should silently treat this type as a normal file. @item @code{A} @dots{} @code{Z} These are reserved for custom implementations. Some of these are used in the GNU modified format, as described below. @end table Other values are reserved for specification in future revisions of the P1003 standard, and should not be used by any @code{tar} program. The @code{magic} field indicates that this archive was output in the P1003 archive format. If this field contains @code{TMAGIC}, the @code{uname} and @code{gname} fields will contain the ASCII representation of the owner and group of the file respectively. If found, the user and group IDs are used rather than the values in the @code{uid} and @code{gid} fields. @node Extensions, cpio, Standard, Archive Format @section GNU Extensions to the Archive Format @include docwarn.texi The GNU format uses additional file types to describe new types of files in an archive. These are listed below. @table @code @item LF_DUMPDIR @itemx 'D' This represents a directory and a list of files created by the @value{incremental} option. The @code{size} field gives the total size of the associated list of files. Each file name is preceded by either a @samp{Y} (the file should be in this archive) or an @samp{N}. (The file is a directory, or is not stored in the archive.) Each file name is terminated by a null. There is an additional null after the last file name. @item LF_MULTIVOL @itemx 'M' This represents a file continued from another volume of a multi-volume archive created with the @value{multi-volume} option. The original type of the file is not given here. The @code{size} field gives the maximum size of this piece of the file (assuming the volume does not end before the file is written out). The @code{offset} field gives the offset from the beginning of the file where this part of the file begins. Thus @code{size} plus @code{offset} should equal the original size of the file. @item LF_SPARSE @itemx 'S' This flag indicates that we are dealing with a sparse file. Note that archiving a sparse file requires special operations to find holes in the file, which mark the positions of these holes, along with the number of bytes of data to be found after the hole. @item LF_VOLHDR @itemx 'V' This file type is used to mark the volume header that was given with the @value{label} option when the archive was created. The @code{name} field contains the @code{name} given after the @value{label} option. The @code{size} field is zero. Only the first file in each volume of an archive should have this type. @end table You may have trouble reading a GNU format archive on a non-GNU system if the options @value{incremental}, @value{multi-volume}, @value{sparse}, or @value{label} were used when writing the archive. In general, if @code{tar} does not use the GNU-added fields of the header, other versions of @code{tar} should be able to read the archive. Otherwise, the @code{tar} program will give an error, the most likely one being a checksum error. @node cpio, , Extensions, Archive Format @section Comparison of @code{tar} and @code{cpio} @include docwarn.texi Here is a summary of differences between @code{tar} and @code{cpio}. The accuracy of the following information has not been verified. The following people contributed to this section, mainly through a survey conducted in 1991. The remainder of this section does not otherwise try to relate topics to people. @example Bent Bertelsen dmdata@@login.dkuug.dk David Hoopes talgras!david Guy Harris guy@@auspex.com Kai Petzke wpp@@marie.physik.tu-berlin.de Kristen Nielsen dmdata@@login.dkuug.dk Leslie Mikesell les@@chinet.chi.il.us @end example @format FIXME: Reorganize the following material @end format @code{tar} handles symbolic links in the form in which it comes in BSD; @code{cpio} doesn't handle symbolic links in the form in which it comes in System V prior to SVR4, and some vendors may have added symlinks to their system without enhancing @code{cpio} to know about them. Others may have enhanced it in a way other than the way I did it at Sun, and which was adopted by AT&T (and which is, I think, also present in the @code{cpio} that Berkeley picked up from AT&T and put into a later BSD release---I think I gave them my changes). (SVR4 does some funny stuff with @code{tar}; basically, its @code{cpio} can handle @code{tar} format input, and write it on output, and it probably handles symbolic links. They may not have bothered doing anything to enhance @code{tar} as a result.) @code{cpio} handles special files; traditional @code{tar} doesn't. @code{tar} comes with V7, System III, System V, and BSD source; @code{cpio} comes only with System III, System V, and later BSD (4.3-tahoe and later). @code{tar}'s way of handling multiple hard links to a file can handle file systems that support 32-bit inumbers (e.g., the BSD file system); @code{cpio}s way requires you to play some games (in its "binary" format, i-numbers are only 16 bits, and in its "portable ASCII" format, they're 18 bits---it would have to play games with the "file system ID" field of the header to make sure that the file system ID/i-number pairs of different files were always different), and I don't know which @code{cpio}s, if any, play those games. Those that don't might get confused and think two files are the same file when they're not, and make hard links between them. @code{tar}s way of handling multiple hard links to a file places only one copy of the link on the tape, but the name attached to that copy is the @emph{only} one you can use to retrieve the file; @code{cpio}s way puts one copy for every link, but you can retrieve it using any of the names. @quotation >What type of check sum (if any) is used, and how is this calculated. @end quotation See the attached manual pages for @code{tar} and @code{cpio} format. @code{tar} uses a checksum which is the sum of all the bytes in the @code{tar} header for a file; @code{cpio} uses no checksum. @quotation >If anyone knows why @code{cpio} was made when @code{tar} was prasent >at the unix scene, @end quotation It wasn't. @code{cpio} first showed up in PWB/UNIX 1.0; no generally-available version of UNIX had @code{tar} at the time. I don't know whether any version that was generally available @emph{within AT&T} had @code{tar}, or, if so, whether the people within AT&T who did @code{cpio} knew about it. On restore, if there is a corruption on a tape @code{tar} will stop at that point, while @code{cpio} will skip over it and try to restore the rest of the files. The main difference is just in the command syntax and header format. @code{tar} is a little more tape-oriented in that everything is blocked to start on a block boundary. @quotation >Is there any differences between the ability to recover crashed >archives between the two of them. (Is there any chance of recovering >crashed archives at all.) @end quotation Theoretically it should be easier under @code{tar} since the blocking lets you find a header with some variation of @samp{dd skip=@var{nn}}. However, modern @code{cpio}'s and variations have an option to just search for the next file header after an error with a reasonable chance of re-syncing. However, lots of tape driver software won't allow you to continue past a media error which should be the only reason for getting out of sync unless a file changed sizes while you were writing the archive. @quotation >If anyone knows why @code{cpio} was made when @code{tar} was prasent >at the unix scene, please tell me about this too. @end quotation Probably because it is more media efficient (by not blocking everything and using only the space needed for the headers where @code{tar} always uses 512 bytes per file header) and it knows how to archive special files. You might want to look at the freely available alternatives. The major ones are @code{afio}, GNU @code{tar}, and @code{pax}, each of which have their own extensions with some backwards compatibility. Sparse files were @code{tar}red as sparse files (which you can easily test, because the resulting archive gets smaller, and GNU @code{cpio} can no longer read it). @node Index, , Archive Format, Top @unnumbered Index @printindex cp @summarycontents @contents @bye @c Local variables: @c texinfo-column-for-description: 32 @c End: tar-1.11.8/doc/docwarn.texi 644 625 1 130 5764667730 10470 @quotation @emph{(This message will disappear, once this node revised.)} @end quotation tar-1.11.8/doc/header.texi 644 625 1 11066 5770625003 10315 /* Standard Archive Format - Standard TAR - USTAR. */ /* Header block on tape. We use traditional DP naming conventions here. A "block" is a big chunk of stuff that we do I/O on. A "record" is a piece of info that we care about. Typically many "record"s fit into a "block". */ #define RECORDSIZE 512 #define NAMSIZ 100 #define TUNMLEN 32 #define TGNMLEN 32 #define SPARSE_EXT_HDR 21 #define SPARSE_IN_HDR 4 struct sparse @{ char offset[12]; char numbytes[12]; @}; union record @{ char charptr[RECORDSIZE]; struct header @{ char arch_name[NAMSIZ]; char mode[8]; char uid[8]; char gid[8]; char size[12]; char mtime[12]; char chksum[8]; char linkflag; char arch_linkname[NAMSIZ]; char magic[8]; char uname[TUNMLEN]; char gname[TGNMLEN]; char devmajor[8]; char devminor[8]; /* The following fields were added for GNU and are not standard. */ char atime[12]; char ctime[12]; char offset[12]; char longnames[4]; /* Some compilers would insert the pad themselves, so pad was once autoconfigured. It is simpler to always insert it! */ char pad; struct sparse sp[SPARSE_IN_HDR]; char isextended; char realsize[12]; /* true size of the sparse file */ #if 0 char ending_blanks[12]; /* number of nulls at the end of the file, if any */ #endif @} header; struct extended_header @{ struct sparse sp[21]; char isextended; @} ext_hdr; @}; /* The checksum field is filled with this while the checksum is computed. */ #define CHKBLANKS " " /* 8 blanks, no null */ /* The magic field is filled with this value if uname and gname are valid, marking the archive as being in standard POSIX format (though GNU tar itself is not POSIX conforming). */ #define TMAGIC "ustar " /* 7 chars and a null */ /* The magic field is filled with this if this is a GNU format dump entry. But I suspect this is not true anymore. */ #define GNUMAGIC "GNUtar " /* 7 chars and a null */ /* The linkflag defines the type of file. */ #define LF_OLDNORMAL '\0' /* normal disk file, Unix compat */ #define LF_NORMAL '0' /* normal disk file */ #define LF_LINK '1' /* link to previously dumped file */ #define LF_SYMLINK '2' /* symbolic link */ #define LF_CHR '3' /* character special file */ #define LF_BLK '4' /* block special file */ #define LF_DIR '5' /* directory */ #define LF_FIFO '6' /* FIFO special file */ #define LF_CONTIG '7' /* contiguous file */ /* Further link types may be defined later. */ /* Note that the standards committee allows only capital A through capital Z for user-defined expansion. This means that defining something as, say '8' is a *bad* idea. */ /* This is a dir entry that contains the names of files that were in the dir at the time the dump was made. */ #define LF_DUMPDIR 'D' /* Identifies the NEXT file on the tape as having a long linkname. */ #define LF_LONGLINK 'K' /* Identifies the NEXT file on the tape as having a long name. */ #define LF_LONGNAME 'L' /* This is the continuation of a file that began on another volume. */ #define LF_MULTIVOL 'M' /* For storing filenames that didn't fit in 100 characters. */ #define LF_NAMES 'N' /* This is for sparse files. */ #define LF_SPARSE 'S' /* This file is a tape/volume header. Ignore it on extraction. */ #define LF_VOLHDR 'V' #if 0 /* The following two blocks of #define's are unused in GNU tar. */ /* Bits used in the mode field - values in octal */ #define TSUID 04000 /* set UID on execution */ #define TSGID 02000 /* set GID on execution */ #define TSVTX 01000 /* save text (sticky bit) */ /* File permissions */ #define TUREAD 00400 /* read by owner */ #define TUWRITE 00200 /* write by owner */ #define TUEXEC 00100 /* execute/search by owner */ #define TGREAD 00040 /* read by group */ #define TGWRITE 00020 /* write by group */ #define TGEXEC 00010 /* execute/search by group */ #define TOREAD 00004 /* read by other */ #define TOWRITE 00002 /* write by other */ #define TOEXEC 00001 /* execute/search by other */ #endif /* End of Standard Archive Format description. */ tar-1.11.8/doc/texinfo.tex 444 625 1 435354 5717772521 10431 %% TeX macros to handle texinfo files % Copyright (C) 1985, 86, 88, 90, 91, 92, 93, 1994 Free Software Foundation, Inc. %This texinfo.tex file is free software; you can redistribute it and/or %modify it under the terms of the GNU General Public License as %published by the Free Software Foundation; either version 2, or (at %your option) any later version. %This texinfo.tex file is distributed in the hope that it will be %useful, but WITHOUT ANY WARRANTY; without even the implied warranty %of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU %General Public License for more details. %You should have received a copy of the GNU General Public License %along with this texinfo.tex file; see the file COPYING. If not, write %to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, %USA. %In other words, you are welcome to use, share and improve this program. %You are forbidden to forbid anyone else to use, share and improve %what you give them. Help stamp out software-hoarding! % Send bug reports to bug-texinfo@prep.ai.mit.edu. % Please include a *precise* test case in each bug report. % Make it possible to create a .fmt file just by loading this file: % if the underlying format is not loaded, start by loading it now. % Added by gildea November 1993. \expandafter\ifx\csname fmtname\endcsname\relax\input plain\fi % This automatically updates the version number based on RCS. \def\deftexinfoversion$#1: #2 ${\def\texinfoversion{#2}} \deftexinfoversion$Revision: 2.145 $ \message{Loading texinfo package [Version \texinfoversion]:} % If in a .fmt file, print the version number % and turn on active characters that we couldn't do earlier because % they might have appeared in the input file name. \everyjob{\message{[Texinfo version \texinfoversion]}\message{} \catcode`+=\active \catcode`\_=\active} % Save some parts of plain tex whose names we will redefine. \let\ptextilde=\~ \let\ptexlbrace=\{ \let\ptexrbrace=\} \let\ptexdots=\dots \let\ptexdot=\. \let\ptexstar=\* \let\ptexend=\end \let\ptexbullet=\bullet \let\ptexb=\b \let\ptexc=\c \let\ptexi=\i \let\ptext=\t \let\ptexl=\l \let\ptexL=\L % Be sure we're in horizontal mode when doing a tie, since we make space % equivalent to this in @example-like environments. Otherwise, a space % at the beginning of a line will start with \penalty -- and % since \penalty is valid in vertical mode, we'd end up putting the % penalty on the vertical list instead of in the new paragraph. {\catcode`@ = 11 \gdef\tie{\leavevmode\penalty\@M\ } } \let\~ = \tie % And make it available as @~. \message{Basics,} \chardef\other=12 % If this character appears in an error message or help string, it % starts a new line in the output. \newlinechar = `^^J % Set up fixed words for English. \ifx\putwordChapter\undefined{\gdef\putwordChapter{Chapter}}\fi% \def\putwordInfo{Info}% \ifx\putwordSee\undefined{\gdef\putwordSee{See}}\fi% \ifx\putwordsee\undefined{\gdef\putwordsee{see}}\fi% \ifx\putwordfile\undefined{\gdef\putwordfile{file}}\fi% \ifx\putwordpage\undefined{\gdef\putwordpage{page}}\fi% \ifx\putwordsection\undefined{\gdef\putwordsection{section}}\fi% \ifx\putwordSection\undefined{\gdef\putwordSection{Section}}\fi% \ifx\putwordTableofContents\undefined{\gdef\putwordTableofContents{Table of Contents}}\fi% \ifx\putwordShortContents\undefined{\gdef\putwordShortContents{Short Contents}}\fi% \ifx\putwordAppendix\undefined{\gdef\putwordAppendix{Appendix}}\fi% % Ignore a token. % \def\gobble#1{} \hyphenation{ap-pen-dix} \hyphenation{mini-buf-fer mini-buf-fers} \hyphenation{eshell} % Margin to add to right of even pages, to left of odd pages. \newdimen \bindingoffset \bindingoffset=0pt \newdimen \normaloffset \normaloffset=\hoffset \newdimen\pagewidth \newdimen\pageheight \pagewidth=\hsize \pageheight=\vsize % Sometimes it is convenient to have everything in the transcript file % and nothing on the terminal. We don't just call \tracingall here, % since that produces some useless output on the terminal. % \def\gloggingall{\begingroup \globaldefs = 1 \loggingall \endgroup}% \def\loggingall{\tracingcommands2 \tracingstats2 \tracingpages1 \tracingoutput1 \tracinglostchars1 \tracingmacros2 \tracingparagraphs1 \tracingrestores1 \showboxbreadth\maxdimen\showboxdepth\maxdimen }% %---------------------Begin change----------------------- % %%%% For @cropmarks command. % Dimensions to add cropmarks at corners Added by P. A. MacKay, 12 Nov. 1986 % \newdimen\cornerlong \newdimen\cornerthick \newdimen \topandbottommargin \newdimen \outerhsize \newdimen \outervsize \cornerlong=1pc\cornerthick=.3pt % These set size of cropmarks \outerhsize=7in %\outervsize=9.5in % Alternative @smallbook page size is 9.25in \outervsize=9.25in \topandbottommargin=.75in % %---------------------End change----------------------- % \onepageout takes a vbox as an argument. Note that \pagecontents % does insertions itself, but you have to call it yourself. \chardef\PAGE=255 \output={\onepageout{\pagecontents\PAGE}} \def\onepageout#1{\hoffset=\normaloffset \ifodd\pageno \advance\hoffset by \bindingoffset \else \advance\hoffset by -\bindingoffset\fi {\escapechar=`\\\relax % makes sure backslash is used in output files. \shipout\vbox{{\let\hsize=\pagewidth \makeheadline} \pagebody{#1}% {\let\hsize=\pagewidth \makefootline}}}% \advancepageno \ifnum\outputpenalty>-20000 \else\dosupereject\fi} %%%% For @cropmarks command %%%% % Here is a modification of the main output routine for Near East Publications % This provides right-angle cropmarks at all four corners. % The contents of the page are centerlined into the cropmarks, % and any desired binding offset is added as an \hskip on either % site of the centerlined box. (P. A. MacKay, 12 November, 1986) % \def\croppageout#1{\hoffset=0pt % make sure this doesn't mess things up {\escapechar=`\\\relax % makes sure backslash is used in output files. \shipout \vbox to \outervsize{\hsize=\outerhsize \vbox{\line{\ewtop\hfill\ewtop}} \nointerlineskip \line{\vbox{\moveleft\cornerthick\nstop} \hfill \vbox{\moveright\cornerthick\nstop}} \vskip \topandbottommargin \centerline{\ifodd\pageno\hskip\bindingoffset\fi \vbox{ {\let\hsize=\pagewidth \makeheadline} \pagebody{#1} {\let\hsize=\pagewidth \makefootline}} \ifodd\pageno\else\hskip\bindingoffset\fi} \vskip \topandbottommargin plus1fill minus1fill \boxmaxdepth\cornerthick \line{\vbox{\moveleft\cornerthick\nsbot} \hfill \vbox{\moveright\cornerthick\nsbot}} \nointerlineskip \vbox{\line{\ewbot\hfill\ewbot}} }} \advancepageno \ifnum\outputpenalty>-20000 \else\dosupereject\fi} % % Do @cropmarks to get crop marks \def\cropmarks{\let\onepageout=\croppageout } \newinsert\margin \dimen\margin=\maxdimen \def\pagebody#1{\vbox to\pageheight{\boxmaxdepth=\maxdepth #1}} {\catcode`\@ =11 \gdef\pagecontents#1{\ifvoid\topins\else\unvbox\topins\fi % marginal hacks, juha@viisa.uucp (Juha Takala) \ifvoid\margin\else % marginal info is present \rlap{\kern\hsize\vbox to\z@{\kern1pt\box\margin \vss}}\fi \dimen@=\dp#1 \unvbox#1 \ifvoid\footins\else\vskip\skip\footins\footnoterule \unvbox\footins\fi \ifr@ggedbottom \kern-\dimen@ \vfil \fi} } % % Here are the rules for the cropmarks. Note that they are % offset so that the space between them is truly \outerhsize or \outervsize % (P. A. MacKay, 12 November, 1986) % \def\ewtop{\vrule height\cornerthick depth0pt width\cornerlong} \def\nstop{\vbox {\hrule height\cornerthick depth\cornerlong width\cornerthick}} \def\ewbot{\vrule height0pt depth\cornerthick width\cornerlong} \def\nsbot{\vbox {\hrule height\cornerlong depth\cornerthick width\cornerthick}} % Parse an argument, then pass it to #1. The argument is the rest of % the input line (except we remove a trailing comment). #1 should be a % macro which expects an ordinary undelimited TeX argument. % \def\parsearg#1{% \let\next = #1% \begingroup \obeylines \futurelet\temp\parseargx } % If the next token is an obeyed space (from an @example environment or % the like), remove it and recurse. Otherwise, we're done. \def\parseargx{% % \obeyedspace is defined far below, after the definition of \sepspaces. \ifx\obeyedspace\temp \expandafter\parseargdiscardspace \else \expandafter\parseargline \fi } % Remove a single space (as the delimiter token to the macro call). {\obeyspaces % \gdef\parseargdiscardspace {\futurelet\temp\parseargx}} {\obeylines % \gdef\parseargline#1^^M{% \endgroup % End of the group started in \parsearg. % % First remove any @c comment, then any @comment. % Result of each macro is put in \toks0. \argremovec #1\c\relax % \expandafter\argremovecomment \the\toks0 \comment\relax % % % Call the caller's macro, saved as \next in \parsearg. \expandafter\next\expandafter{\the\toks0}% }% } % Since all \c{,omment} does is throw away the argument, we can let TeX % do that for us. The \relax here is matched by the \relax in the call % in \parseargline; it could be more or less anything, its purpose is % just to delimit the argument to the \c. \def\argremovec#1\c#2\relax{\toks0 = {#1}} \def\argremovecomment#1\comment#2\relax{\toks0 = {#1}} % \argremovec{,omment} might leave us with trailing spaces, though; e.g., % @end itemize @c foo % will have two active spaces as part of the argument with the % `itemize'. Here we remove all active spaces from #1, and assign the % result to \toks0. % % This loses if there are any *other* active characters besides spaces % in the argument -- _ ^ +, for example -- since they get expanded. % Fortunately, Texinfo does not define any such commands. (If it ever % does, the catcode of the characters in questionwill have to be changed % here.) But this means we cannot call \removeactivespaces as part of % \argremovec{,omment}, since @c uses \parsearg, and thus the argument % that \parsearg gets might well have any character at all in it. % \def\removeactivespaces#1{% \begingroup \ignoreactivespaces \edef\temp{#1}% \global\toks0 = \expandafter{\temp}% \endgroup } % Change the active space to expand to nothing. % \begingroup \obeyspaces \gdef\ignoreactivespaces{\obeyspaces\let =\empty} \endgroup \def\flushcr{\ifx\par\lisppar \def\next##1{}\else \let\next=\relax \fi \next} %% These are used to keep @begin/@end levels from running away %% Call \inENV within environments (after a \begingroup) \newif\ifENV \ENVfalse \def\inENV{\ifENV\relax\else\ENVtrue\fi} \def\ENVcheck{% \ifENV\errmessage{Still within an environment. Type Return to continue.} \endgroup\fi} % This is not perfect, but it should reduce lossage % @begin foo is the same as @foo, for now. \newhelp\EMsimple{Type to continue.} \outer\def\begin{\parsearg\beginxxx} \def\beginxxx #1{% \expandafter\ifx\csname #1\endcsname\relax {\errhelp=\EMsimple \errmessage{Undefined command @begin #1}}\else \csname #1\endcsname\fi} % @end foo executes the definition of \Efoo. % \def\end{\parsearg\endxxx} \def\endxxx #1{% \removeactivespaces{#1}% \edef\endthing{\the\toks0}% % \expandafter\ifx\csname E\endthing\endcsname\relax \expandafter\ifx\csname \endthing\endcsname\relax % There's no \foo, i.e., no ``environment'' foo. \errhelp = \EMsimple \errmessage{Undefined command `@end \endthing'}% \else \unmatchedenderror\endthing \fi \else % Everything's ok; the right environment has been started. \csname E\endthing\endcsname \fi } % There is an environment #1, but it hasn't been started. Give an error. % \def\unmatchedenderror#1{% \errhelp = \EMsimple \errmessage{This `@end #1' doesn't have a matching `@#1'}% } % Define the control sequence \E#1 to give an unmatched @end error. % \def\defineunmatchedend#1{% \expandafter\def\csname E#1\endcsname{\unmatchedenderror{#1}}% } % Single-spacing is done by various environments (specifically, in % \nonfillstart and \quotations). \newskip\singlespaceskip \singlespaceskip = 12.5pt \def\singlespace{% % Why was this kern here? It messes up equalizing space above and below % environments. --karl, 6may93 %{\advance \baselineskip by -\singlespaceskip %\kern \baselineskip}% \setleading \singlespaceskip } %% Simple single-character @ commands % @@ prints an @ % Kludge this until the fonts are right (grr). \def\@{{\tt \char '100}} % This is turned off because it was never documented % and you can use @w{...} around a quote to suppress ligatures. %% Define @` and @' to be the same as ` and ' %% but suppressing ligatures. %\def\`{{`}} %\def\'{{'}} % Used to generate quoted braces. \def\mylbrace {{\tt \char '173}} \def\myrbrace {{\tt \char '175}} \let\{=\mylbrace \let\}=\myrbrace % @: forces normal size whitespace following. \def\:{\spacefactor=1000 } % @* forces a line break. \def\*{\hfil\break\hbox{}\ignorespaces} % @. is an end-of-sentence period. \def\.{.\spacefactor=3000 } % @enddots{} is an end-of-sentence ellipsis. \gdef\enddots{$\mathinner{\ldotp\ldotp\ldotp\ldotp}$\spacefactor=3000} % @! is an end-of-sentence bang. \gdef\!{!\spacefactor=3000 } % @? is an end-of-sentence query. \gdef\?{?\spacefactor=3000 } % @w prevents a word break. Without the \leavevmode, @w at the % beginning of a paragraph, when TeX is still in vertical mode, would % produce a whole line of output instead of starting the paragraph. \def\w#1{\leavevmode\hbox{#1}} % @group ... @end group forces ... to be all on one page, by enclosing % it in a TeX vbox. We use \vtop instead of \vbox to construct the box % to keep its height that of a normal line. According to the rules for % \topskip (p.114 of the TeXbook), the glue inserted is % max (\topskip - \ht (first item), 0). If that height is large, % therefore, no glue is inserted, and the space between the headline and % the text is small, which looks bad. % \def\group{\begingroup \ifnum\catcode13=\active \else \errhelp = \groupinvalidhelp \errmessage{@group invalid in context where filling is enabled}% \fi % % The \vtop we start below produces a box with normal height and large % depth; thus, TeX puts \baselineskip glue before it, and (when the % next line of text is done) \lineskip glue after it. (See p.82 of % the TeXbook.) Thus, space below is not quite equal to space % above. But it's pretty close. \def\Egroup{% \egroup % End the \vtop. \endgroup % End the \group. }% % \vtop\bgroup % We have to put a strut on the last line in case the @group is in % the midst of an example, rather than completely enclosing it. % Otherwise, the interline space between the last line of the group % and the first line afterwards is too small. But we can't put the % strut in \Egroup, since there it would be on a line by itself. % Hence this just inserts a strut at the beginning of each line. \everypar = {\strut}% % % Since we have a strut on every line, we don't need any of TeX's % normal interline spacing. \offinterlineskip % % OK, but now we have to do something about blank % lines in the input in @example-like environments, which normally % just turn into \lisppar, which will insert no space now that we've % turned off the interline space. Simplest is to make them be an % empty paragraph. \ifx\par\lisppar \edef\par{\leavevmode \par}% % % Reset ^^M's definition to new definition of \par. \obeylines \fi % % Do @comment since we are called inside an environment such as % @example, where each end-of-line in the input causes an % end-of-line in the output. We don't want the end-of-line after % the `@group' to put extra space in the output. Since @group % should appear on a line by itself (according to the Texinfo % manual), we don't worry about eating any user text. \comment } % % TeX puts in an \escapechar (i.e., `@') at the beginning of the help % message, so this ends up printing `@group can only ...'. % \newhelp\groupinvalidhelp{% group can only be used in environments such as @example,^^J% where each line of input produces a line of output.} % @need space-in-mils % forces a page break if there is not space-in-mils remaining. \newdimen\mil \mil=0.001in \def\need{\parsearg\needx} % Old definition--didn't work. %\def\needx #1{\par % %% This method tries to make TeX break the page naturally %% if the depth of the box does not fit. %{\baselineskip=0pt% %\vtop to #1\mil{\vfil}\kern -#1\mil\penalty 10000 %\prevdepth=-1000pt %}} \def\needx#1{% % Go into vertical mode, so we don't make a big box in the middle of a % paragraph. \par % % Don't add any leading before our big empty box, but allow a page % break, since the best break might be right here. \allowbreak \nointerlineskip \vtop to #1\mil{\vfil}% % % TeX does not even consider page breaks if a penalty added to the % main vertical list is 10000 or more. But in order to see if the % empty box we just added fits on the page, we must make it consider % page breaks. On the other hand, we don't want to actually break the % page after the empty box. So we use a penalty of 9999. % % There is an extremely small chance that TeX will actually break the % page at this \penalty, if there are no other feasible breakpoints in % sight. (If the user is using lots of big @group commands, which % almost-but-not-quite fill up a page, TeX will have a hard time doing % good page breaking, for example.) However, I could not construct an % example where a page broke at this \penalty; if it happens in a real % document, then we can reconsider our strategy. \penalty9999 % % Back up by the size of the box, whether we did a page break or not. \kern -#1\mil % % Do not allow a page break right after this kern. \nobreak } % @br forces paragraph break \let\br = \par % @dots{} output some dots \def\dots{$\ldots$} % @page forces the start of a new page \def\page{\par\vfill\supereject} % @exdent text.... % outputs text on separate line in roman font, starting at standard page margin % This records the amount of indent in the innermost environment. % That's how much \exdent should take out. \newskip\exdentamount % This defn is used inside fill environments such as @defun. \def\exdent{\parsearg\exdentyyy} \def\exdentyyy #1{{\hfil\break\hbox{\kern -\exdentamount{\rm#1}}\hfil\break}} % This defn is used inside nofill environments such as @example. \def\nofillexdent{\parsearg\nofillexdentyyy} \def\nofillexdentyyy #1{{\advance \leftskip by -\exdentamount \leftline{\hskip\leftskip{\rm#1}}}} %\hbox{{\rm#1}}\hfil\break}} % @include file insert text of that file as input. \def\include{\parsearg\includezzz} %Use \input\thisfile to avoid blank after \input, which may be an active %char (in which case the blank would become the \input argument). %The grouping keeps the value of \thisfile correct even when @include %is nested. \def\includezzz #1{\begingroup \def\thisfile{#1}\input\thisfile \endgroup} \def\thisfile{} % @center line outputs that line, centered \def\center{\parsearg\centerzzz} \def\centerzzz #1{{\advance\hsize by -\leftskip \advance\hsize by -\rightskip \centerline{#1}}} % @sp n outputs n lines of vertical space \def\sp{\parsearg\spxxx} \def\spxxx #1{\par \vskip #1\baselineskip} % @comment ...line which is ignored... % @c is the same as @comment % @ignore ... @end ignore is another way to write a comment \def\comment{\catcode 64=\other \catcode 123=\other \catcode 125=\other% \parsearg \commentxxx} \def\commentxxx #1{\catcode 64=0 \catcode 123=1 \catcode 125=2 } \let\c=\comment % Prevent errors for section commands. % Used in @ignore and in failing conditionals. \def\ignoresections{% \let\chapter=\relax \let\unnumbered=\relax \let\top=\relax \let\unnumberedsec=\relax \let\unnumberedsection=\relax \let\unnumberedsubsec=\relax \let\unnumberedsubsection=\relax \let\unnumberedsubsubsec=\relax \let\unnumberedsubsubsection=\relax \let\section=\relax \let\subsec=\relax \let\subsubsec=\relax \let\subsection=\relax \let\subsubsection=\relax \let\appendix=\relax \let\appendixsec=\relax \let\appendixsection=\relax \let\appendixsubsec=\relax \let\appendixsubsection=\relax \let\appendixsubsubsec=\relax \let\appendixsubsubsection=\relax \let\contents=\relax \let\smallbook=\relax \let\titlepage=\relax } % Used in nested conditionals, where we have to parse the Texinfo source % and so want to turn off most commands, in case they are used % incorrectly. % \def\ignoremorecommands{% \let\defcv = \relax \let\deffn = \relax \let\deffnx = \relax \let\defindex = \relax \let\defivar = \relax \let\defmac = \relax \let\defmethod = \relax \let\defop = \relax \let\defopt = \relax \let\defspec = \relax \let\deftp = \relax \let\deftypefn = \relax \let\deftypefun = \relax \let\deftypevar = \relax \let\deftypevr = \relax \let\defun = \relax \let\defvar = \relax \let\defvr = \relax \let\ref = \relax \let\xref = \relax \let\printindex = \relax \let\pxref = \relax \let\settitle = \relax \let\include = \relax \let\lowersections = \relax \let\down = \relax \let\raisesections = \relax \let\up = \relax \let\set = \relax \let\clear = \relax \let\item = \relax \let\message = \relax } % Ignore @ignore ... @end ignore. % \def\ignore{\doignore{ignore}} % Also ignore @ifinfo, @ifhtml, @html, @menu, and @direntry text. % \def\ifinfo{\doignore{ifinfo}} \def\ifhtml{\doignore{ifhtml}} \def\html{\doignore{html}} \def\menu{\doignore{menu}} \def\direntry{\doignore{direntry}} % Ignore text until a line `@end #1'. % \def\doignore#1{\begingroup % Don't complain about control sequences we have declared \outer. \ignoresections % % Define a command to swallow text until we reach `@end #1'. \long\def\doignoretext##1\end #1{\enddoignore}% % % Make sure that spaces turn into tokens that match what \doignoretext wants. \catcode32 = 10 % % And now expand that command. \doignoretext } % What we do to finish off ignored text. % \def\enddoignore{\endgroup\ignorespaces}% \newif\ifwarnedobs\warnedobsfalse \def\obstexwarn{% \ifwarnedobs\relax\else % We need to warn folks that they may have trouble with TeX 3.0. % This uses \immediate\write16 rather than \message to get newlines. \immediate\write16{} \immediate\write16{***WARNING*** for users of Unix TeX 3.0!} \immediate\write16{This manual trips a bug in TeX version 3.0 (tex hangs).} \immediate\write16{If you are running another version of TeX, relax.} \immediate\write16{If you are running Unix TeX 3.0, kill this TeX process.} \immediate\write16{ Then upgrade your TeX installation if you can.} \immediate\write16{If you are stuck with version 3.0, run the} \immediate\write16{ script ``tex3patch'' from the Texinfo distribution} \immediate\write16{ to use a workaround.} \immediate\write16{} \warnedobstrue \fi } % **In TeX 3.0, setting text in \nullfont hangs tex. For a % workaround (which requires the file ``dummy.tfm'' to be installed), % uncomment the following line: %%%%%\font\nullfont=dummy\let\obstexwarn=\relax % Ignore text, except that we keep track of conditional commands for % purposes of nesting, up to an `@end #1' command. % \def\nestedignore#1{% \obstexwarn % We must actually expand the ignored text to look for the @end % command, so that nested ignore constructs work. Thus, we put the % text into a \vbox and then do nothing with the result. To minimize % the change of memory overflow, we follow the approach outlined on % page 401 of the TeXbook: make the current font be a dummy font. % \setbox0 = \vbox\bgroup % Don't complain about control sequences we have declared \outer. \ignoresections % % Define `@end #1' to end the box, which will in turn undefine the % @end command again. \expandafter\def\csname E#1\endcsname{\egroup\ignorespaces}% % % We are going to be parsing Texinfo commands. Most cause no % trouble when they are used incorrectly, but some commands do % complicated argument parsing or otherwise get confused, so we % undefine them. % % We can't do anything about stray @-signs, unfortunately; % they'll produce `undefined control sequence' errors. \ignoremorecommands % % Set the current font to be \nullfont, a TeX primitive, and define % all the font commands to also use \nullfont. We don't use % dummy.tfm, as suggested in the TeXbook, because not all sites % might have that installed. Therefore, math mode will still % produce output, but that should be an extremely small amount of % stuff compared to the main input. % \nullfont \let\tenrm = \nullfont \let\tenit = \nullfont \let\tensl = \nullfont \let\tenbf = \nullfont \let\tentt = \nullfont \let\smallcaps = \nullfont \let\tensf = \nullfont % Similarly for index fonts (mostly for their use in % smallexample) \let\indrm = \nullfont \let\indit = \nullfont \let\indsl = \nullfont \let\indbf = \nullfont \let\indtt = \nullfont \let\indsc = \nullfont \let\indsf = \nullfont % % Don't complain when characters are missing from the fonts. \tracinglostchars = 0 % % Don't bother to do space factor calculations. \frenchspacing % % Don't report underfull hboxes. \hbadness = 10000 % % Do minimal line-breaking. \pretolerance = 10000 % % Do not execute instructions in @tex \def\tex{\doignore{tex}} } % @set VAR sets the variable VAR to an empty value. % @set VAR REST-OF-LINE sets VAR to the value REST-OF-LINE. % % Since we want to separate VAR from REST-OF-LINE (which might be % empty), we can't just use \parsearg; we have to insert a space of our % own to delimit the rest of the line, and then take it out again if we % didn't need it. % \def\set{\parsearg\setxxx} \def\setxxx#1{\setyyy#1 \endsetyyy} \def\setyyy#1 #2\endsetyyy{% \def\temp{#2}% \ifx\temp\empty \global\expandafter\let\csname SET#1\endcsname = \empty \else \setzzz{#1}#2\endsetzzz % Remove the trailing space \setxxx inserted. \fi } % Can't use \xdef to pre-expand #2 and save some time, since \temp or % \next or other control sequences that we've defined might get us into % an infinite loop. Consider `@set foo @cite{bar}'. \def\setzzz#1#2 \endsetzzz{\expandafter\gdef\csname SET#1\endcsname{#2}} % @clear VAR clears (i.e., unsets) the variable VAR. % \def\clear{\parsearg\clearxxx} \def\clearxxx#1{\global\expandafter\let\csname SET#1\endcsname=\relax} % @value{foo} gets the text saved in variable foo. % \def\value#1{\expandafter \ifx\csname SET#1\endcsname\relax {\{No value for ``#1''\}} \else \csname SET#1\endcsname \fi} % @ifset VAR ... @end ifset reads the `...' iff VAR has been defined % with @set. % \def\ifset{\parsearg\ifsetxxx} \def\ifsetxxx #1{% \expandafter\ifx\csname SET#1\endcsname\relax \expandafter\ifsetfail \else \expandafter\ifsetsucceed \fi } \def\ifsetsucceed{\conditionalsucceed{ifset}} \def\ifsetfail{\nestedignore{ifset}} \defineunmatchedend{ifset} % @ifclear VAR ... @end ifclear reads the `...' iff VAR has never been % defined with @set, or has been undefined with @clear. % \def\ifclear{\parsearg\ifclearxxx} \def\ifclearxxx #1{% \expandafter\ifx\csname SET#1\endcsname\relax \expandafter\ifclearsucceed \else \expandafter\ifclearfail \fi } \def\ifclearsucceed{\conditionalsucceed{ifclear}} \def\ifclearfail{\nestedignore{ifclear}} \defineunmatchedend{ifclear} % @iftex always succeeds; we read the text following, through @end % iftex). But `@end iftex' should be valid only after an @iftex. % \def\iftex{\conditionalsucceed{iftex}} \defineunmatchedend{iftex} % We can't just want to start a group at @iftex (for example) and end it % at @end iftex, since then @set commands inside the conditional have no % effect (they'd get reverted at the end of the group). So we must % define \Eiftex to redefine itself to be its previous value. (We can't % just define it to fail again with an ``unmatched end'' error, since % the @ifset might be nested.) % \def\conditionalsucceed#1{% \edef\temp{% % Remember the current value of \E#1. \let\nece{prevE#1} = \nece{E#1}% % % At the `@end #1', redefine \E#1 to be its previous value. \def\nece{E#1}{\let\nece{E#1} = \nece{prevE#1}}% }% \temp } % We need to expand lots of \csname's, but we don't want to expand the % control sequences after we've constructed them. % \def\nece#1{\expandafter\noexpand\csname#1\endcsname} % @asis just yields its argument. Used with @table, for example. % \def\asis#1{#1} % @math means output in math mode. % We don't use $'s directly in the definition of \math because control % sequences like \math are expanded when the toc file is written. Then, % we read the toc file back, the $'s will be normal characters (as they % should be, according to the definition of Texinfo). So we must use a % control sequence to switch into and out of math mode. % % This isn't quite enough for @math to work properly in indices, but it % seems unlikely it will ever be needed there. % \let\implicitmath = $ \def\math#1{\implicitmath #1\implicitmath} % @bullet and @minus need the same treatment as @math, just above. \def\bullet{\implicitmath\ptexbullet\implicitmath} \def\minus{\implicitmath-\implicitmath} \def\node{\ENVcheck\parsearg\nodezzz} \def\nodezzz#1{\nodexxx [#1,]} \def\nodexxx[#1,#2]{\gdef\lastnode{#1}} \let\nwnode=\node \let\lastnode=\relax \def\donoderef{\ifx\lastnode\relax\else \expandafter\expandafter\expandafter\setref{\lastnode}\fi \global\let\lastnode=\relax} \def\unnumbnoderef{\ifx\lastnode\relax\else \expandafter\expandafter\expandafter\unnumbsetref{\lastnode}\fi \global\let\lastnode=\relax} \def\appendixnoderef{\ifx\lastnode\relax\else \expandafter\expandafter\expandafter\appendixsetref{\lastnode}\fi \global\let\lastnode=\relax} \let\refill=\relax % @setfilename is done at the beginning of every texinfo file. % So open here the files we need to have open while reading the input. % This makes it possible to make a .fmt file for texinfo. \def\setfilename{% \readauxfile \opencontents \openindices \fixbackslash % Turn off hack to swallow `\input texinfo'. \global\let\setfilename=\comment % Ignore extra @setfilename cmds. \comment % Ignore the actual filename. } \outer\def\bye{\pagealignmacro\tracingstats=1\ptexend} \def\inforef #1{\inforefzzz #1,,,,**} \def\inforefzzz #1,#2,#3,#4**{\putwordSee{} \putwordInfo{} \putwordfile{} \file{\ignorespaces #3{}}, node \samp{\ignorespaces#1{}}} \message{fonts,} % Font-change commands. % Texinfo supports the sans serif font style, which plain TeX does not. % So we set up a \sf analogous to plain's \rm, etc. \newfam\sffam \def\sf{\fam=\sffam \tensf} \let\li = \sf % Sometimes we call it \li, not \sf. %% Try out Computer Modern fonts at \magstephalf \let\mainmagstep=\magstephalf % Set the font macro #1 to the font named #2, adding on the % specified font prefix (normally `cm'). \def\setfont#1#2{\font#1=\fontprefix#2} % Use cm as the default font prefix. % To specify the font prefix, you must define \fontprefix % before you read in texinfo.tex. \ifx\fontprefix\undefined \def\fontprefix{cm} \fi \ifx\bigger\relax \let\mainmagstep=\magstep1 \setfont\textrm{r12} \setfont\texttt{tt12} \else \setfont\textrm{r10 scaled \mainmagstep} \setfont\texttt{tt10 scaled \mainmagstep} \fi % Instead of cmb10, you many want to use cmbx10. % cmbx10 is a prettier font on its own, but cmb10 % looks better when embedded in a line with cmr10. \setfont\textbf{b10 scaled \mainmagstep} \setfont\textit{ti10 scaled \mainmagstep} \setfont\textsl{sl10 scaled \mainmagstep} \setfont\textsf{ss10 scaled \mainmagstep} \setfont\textsc{csc10 scaled \mainmagstep} \font\texti=cmmi10 scaled \mainmagstep \font\textsy=cmsy10 scaled \mainmagstep % A few fonts for @defun, etc. \setfont\defbf{bx10 scaled \magstep1} %was 1314 \setfont\deftt{tt10 scaled \magstep1} \def\df{\let\tentt=\deftt \let\tenbf = \defbf \bf} % Fonts for indices and small examples. % We actually use the slanted font rather than the italic, % because texinfo normally uses the slanted fonts for that. % Do not make many font distinctions in general in the index, since they % aren't very useful. \setfont\ninett{tt9} \setfont\indrm{r9} \setfont\indit{sl9} \let\indsl=\indit \let\indtt=\ninett \let\indsf=\indrm \let\indbf=\indrm \setfont\indsc{csc10 at 9pt} \font\indi=cmmi9 \font\indsy=cmsy9 % Fonts for headings \setfont\chaprm{bx12 scaled \magstep2} \setfont\chapit{ti12 scaled \magstep2} \setfont\chapsl{sl12 scaled \magstep2} \setfont\chaptt{tt12 scaled \magstep2} \setfont\chapsf{ss12 scaled \magstep2} \let\chapbf=\chaprm \setfont\chapsc{csc10 scaled\magstep3} \font\chapi=cmmi12 scaled \magstep2 \font\chapsy=cmsy10 scaled \magstep3 \setfont\secrm{bx12 scaled \magstep1} \setfont\secit{ti12 scaled \magstep1} \setfont\secsl{sl12 scaled \magstep1} \setfont\sectt{tt12 scaled \magstep1} \setfont\secsf{ss12 scaled \magstep1} \setfont\secbf{bx12 scaled \magstep1} \setfont\secsc{csc10 scaled\magstep2} \font\seci=cmmi12 scaled \magstep1 \font\secsy=cmsy10 scaled \magstep2 % \setfont\ssecrm{bx10 scaled \magstep1} % This size an font looked bad. % \setfont\ssecit{cmti10 scaled \magstep1} % The letters were too crowded. % \setfont\ssecsl{sl10 scaled \magstep1} % \setfont\ssectt{tt10 scaled \magstep1} % \setfont\ssecsf{ss10 scaled \magstep1} %\setfont\ssecrm{b10 scaled 1315} % Note the use of cmb rather than cmbx. %\setfont\ssecit{ti10 scaled 1315} % Also, the size is a little larger than %\setfont\ssecsl{sl10 scaled 1315} % being scaled magstep1. %\setfont\ssectt{tt10 scaled 1315} %\setfont\ssecsf{ss10 scaled 1315} %\let\ssecbf=\ssecrm \setfont\ssecrm{bx12 scaled \magstephalf} \setfont\ssecit{ti12 scaled \magstephalf} \setfont\ssecsl{sl12 scaled \magstephalf} \setfont\ssectt{tt12 scaled \magstephalf} \setfont\ssecsf{ss12 scaled \magstephalf} \setfont\ssecbf{bx12 scaled \magstephalf} \setfont\ssecsc{csc10 scaled \magstep1} \font\sseci=cmmi12 scaled \magstephalf \font\ssecsy=cmsy10 scaled \magstep1 % The smallcaps and symbol fonts should actually be scaled \magstep1.5, % but that is not a standard magnification. % Fonts for title page: \setfont\titlerm{bx12 scaled \magstep3} \let\authorrm = \secrm % In order for the font changes to affect most math symbols and letters, % we have to define the \textfont of the standard families. Since % texinfo doesn't allow for producing subscripts and superscripts, we % don't bother to reset \scriptfont and \scriptscriptfont (which would % also require loading a lot more fonts). % \def\resetmathfonts{% \textfont0 = \tenrm \textfont1 = \teni \textfont2 = \tensy \textfont\itfam = \tenit \textfont\slfam = \tensl \textfont\bffam = \tenbf \textfont\ttfam = \tentt \textfont\sffam = \tensf } % The font-changing commands redefine the meanings of \tenSTYLE, instead % of just \STYLE. We do this so that font changes will continue to work % in math mode, where it is the current \fam that is relevant in most % cases, not the current. Plain TeX does, for example, % \def\bf{\fam=\bffam \tenbf} By redefining \tenbf, we obviate the need % to redefine \bf itself. \def\textfonts{% \let\tenrm=\textrm \let\tenit=\textit \let\tensl=\textsl \let\tenbf=\textbf \let\tentt=\texttt \let\smallcaps=\textsc \let\tensf=\textsf \let\teni=\texti \let\tensy=\textsy \resetmathfonts} \def\chapfonts{% \let\tenrm=\chaprm \let\tenit=\chapit \let\tensl=\chapsl \let\tenbf=\chapbf \let\tentt=\chaptt \let\smallcaps=\chapsc \let\tensf=\chapsf \let\teni=\chapi \let\tensy=\chapsy \resetmathfonts} \def\secfonts{% \let\tenrm=\secrm \let\tenit=\secit \let\tensl=\secsl \let\tenbf=\secbf \let\tentt=\sectt \let\smallcaps=\secsc \let\tensf=\secsf \let\teni=\seci \let\tensy=\secsy \resetmathfonts} \def\subsecfonts{% \let\tenrm=\ssecrm \let\tenit=\ssecit \let\tensl=\ssecsl \let\tenbf=\ssecbf \let\tentt=\ssectt \let\smallcaps=\ssecsc \let\tensf=\ssecsf \let\teni=\sseci \let\tensy=\ssecsy \resetmathfonts} \def\indexfonts{% \let\tenrm=\indrm \let\tenit=\indit \let\tensl=\indsl \let\tenbf=\indbf \let\tentt=\indtt \let\smallcaps=\indsc \let\tensf=\indsf \let\teni=\indi \let\tensy=\indsy \resetmathfonts} % Set up the default fonts, so we can use them for creating boxes. % \textfonts % Count depth in font-changes, for error checks \newcount\fontdepth \fontdepth=0 % Fonts for short table of contents. \setfont\shortcontrm{r12} \setfont\shortcontbf{bx12} \setfont\shortcontsl{sl12} %% Add scribe-like font environments, plus @l for inline lisp (usually sans %% serif) and @ii for TeX italic % \smartitalic{ARG} outputs arg in italics, followed by an italic correction % unless the following character is such as not to need one. \def\smartitalicx{\ifx\next,\else\ifx\next-\else\ifx\next.\else\/\fi\fi\fi} \def\smartitalic#1{{\sl #1}\futurelet\next\smartitalicx} \let\i=\smartitalic \let\var=\smartitalic \let\dfn=\smartitalic \let\emph=\smartitalic \let\cite=\smartitalic \def\b#1{{\bf #1}} \let\strong=\b % We can't just use \exhyphenpenalty, because that only has effect at % the end of a paragraph. Restore normal hyphenation at the end of the % group within which \nohyphenation is presumably called. % \def\nohyphenation{\hyphenchar\font = -1 \aftergroup\restorehyphenation} \def\restorehyphenation{\hyphenchar\font = `- } \def\t#1{% {\tt \nohyphenation \rawbackslash \frenchspacing #1}% \null } \let\ttfont = \t %\def\samp #1{`{\tt \rawbackslash \frenchspacing #1}'\null} \def\samp #1{`\tclose{#1}'\null} \def\key #1{{\tt \nohyphenation \uppercase{#1}}\null} \def\ctrl #1{{\tt \rawbackslash \hat}#1} \let\file=\samp % @code is a modification of @t, % which makes spaces the same size as normal in the surrounding text. \def\tclose#1{% {% % Change normal interword space to be same as for the current font. \spaceskip = \fontdimen2\font % % Switch to typewriter. \tt % % But `\ ' produces the large typewriter interword space. \def\ {{\spaceskip = 0pt{} }}% % % Turn off hyphenation. \nohyphenation % \rawbackslash \frenchspacing #1% }% \null } % We *must* turn on hyphenation at `-' and `_' in \code. % Otherwise, it is too hard to avoid overful hboxes % in the Emacs manual, the Library manual, etc. % Unfortunately, TeX uses one parameter (\hyphenchar) to control % both hyphenation at - and hyphenation within words. % We must therefore turn them both off (\tclose does that) % and arrange explicitly to hyphenate an a dash. % -- rms. { \catcode`\-=\active \catcode`\_=\active \global\def\code{\begingroup \catcode`\-=\active \let-\codedash \catcode`\_=\active \let_\codeunder \codex} % The following is used by \doprintindex to insure that long function names % wrap around. It is necessary for - and _ to be active before the index is % read from the file, as \entry parses the arguments long before \code is % ever called. -- mycroft \global\def\indexbreaks{\catcode`\-=\active \let-\realdash \catcode`\_=\active \let_\realunder} } \def\realdash{-} \def\realunder{_} \def\codedash{-\discretionary{}{}{}} \def\codeunder{\normalunderscore\discretionary{}{}{}} \def\codex #1{\tclose{#1}\endgroup} %\let\exp=\tclose %Was temporary % @kbd is like @code, except that if the argument is just one @key command, % then @kbd has no effect. \def\xkey{\key} \def\kbdfoo#1#2#3\par{\def\one{#1}\def\three{#3}\def\threex{??}% \ifx\one\xkey\ifx\threex\three \key{#2}% \else\tclose{\look}\fi \else\tclose{\look}\fi} % Typeset a dimension, e.g., `in' or `pt'. The only reason for the % argument is to make the input look right: @dmn{pt} instead of % @dmn{}pt. % \def\dmn#1{\thinspace #1} \def\kbd#1{\def\look{#1}\expandafter\kbdfoo\look??\par} \def\l#1{{\li #1}\null} % \def\r#1{{\rm #1}} % roman font % Use of \lowercase was suggested. \def\sc#1{{\smallcaps#1}} % smallcaps font \def\ii#1{{\it #1}} % italic font \message{page headings,} \newskip\titlepagetopglue \titlepagetopglue = 1.5in \newskip\titlepagebottomglue \titlepagebottomglue = 2pc % First the title page. Must do @settitle before @titlepage. \def\titlefont#1{{\titlerm #1}} \newif\ifseenauthor \newif\iffinishedtitlepage \def\shorttitlepage{\parsearg\shorttitlepagezzz} \def\shorttitlepagezzz #1{\begingroup\hbox{}\vskip 1.5in \chaprm \centerline{#1}% \endgroup\page\hbox{}\page} \def\titlepage{\begingroup \parindent=0pt \textfonts \let\subtitlerm=\tenrm % I deinstalled the following change because \cmr12 is undefined. % This change was not in the ChangeLog anyway. --rms. % \let\subtitlerm=\cmr12 \def\subtitlefont{\subtitlerm \normalbaselineskip = 13pt \normalbaselines}% % \def\authorfont{\authorrm \normalbaselineskip = 16pt \normalbaselines}% % % Leave some space at the very top of the page. \vglue\titlepagetopglue % % Now you can print the title using @title. \def\title{\parsearg\titlezzz}% \def\titlezzz##1{\leftline{\titlefont{##1}} % print a rule at the page bottom also. \finishedtitlepagefalse \vskip4pt \hrule height 4pt width \hsize \vskip4pt}% % No rule at page bottom unless we print one at the top with @title. \finishedtitlepagetrue % % Now you can put text using @subtitle. \def\subtitle{\parsearg\subtitlezzz}% \def\subtitlezzz##1{{\subtitlefont \rightline{##1}}}% % % @author should come last, but may come many times. \def\author{\parsearg\authorzzz}% \def\authorzzz##1{\ifseenauthor\else\vskip 0pt plus 1filll\seenauthortrue\fi {\authorfont \leftline{##1}}}% % % Most title ``pages'' are actually two pages long, with space % at the top of the second. We don't want the ragged left on the second. \let\oldpage = \page \def\page{% \iffinishedtitlepage\else \finishtitlepage \fi \oldpage \let\page = \oldpage \hbox{}}% % \def\page{\oldpage \hbox{}} } \def\Etitlepage{% \iffinishedtitlepage\else \finishtitlepage \fi % It is important to do the page break before ending the group, % because the headline and footline are only empty inside the group. % If we use the new definition of \page, we always get a blank page % after the title page, which we certainly don't want. \oldpage \endgroup \HEADINGSon } \def\finishtitlepage{% \vskip4pt \hrule height 2pt width \hsize \vskip\titlepagebottomglue \finishedtitlepagetrue } %%% Set up page headings and footings. \let\thispage=\folio \newtoks \evenheadline % Token sequence for heading line of even pages \newtoks \oddheadline % Token sequence for heading line of odd pages \newtoks \evenfootline % Token sequence for footing line of even pages \newtoks \oddfootline % Token sequence for footing line of odd pages % Now make Tex use those variables \headline={{\textfonts\rm \ifodd\pageno \the\oddheadline \else \the\evenheadline \fi}} \footline={{\textfonts\rm \ifodd\pageno \the\oddfootline \else \the\evenfootline \fi}\HEADINGShook} \let\HEADINGShook=\relax % Commands to set those variables. % For example, this is what @headings on does % @evenheading @thistitle|@thispage|@thischapter % @oddheading @thischapter|@thispage|@thistitle % @evenfooting @thisfile|| % @oddfooting ||@thisfile \def\evenheading{\parsearg\evenheadingxxx} \def\oddheading{\parsearg\oddheadingxxx} \def\everyheading{\parsearg\everyheadingxxx} \def\evenfooting{\parsearg\evenfootingxxx} \def\oddfooting{\parsearg\oddfootingxxx} \def\everyfooting{\parsearg\everyfootingxxx} {\catcode`\@=0 % \gdef\evenheadingxxx #1{\evenheadingyyy #1@|@|@|@|\finish} \gdef\evenheadingyyy #1@|#2@|#3@|#4\finish{% \global\evenheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\oddheadingxxx #1{\oddheadingyyy #1@|@|@|@|\finish} \gdef\oddheadingyyy #1@|#2@|#3@|#4\finish{% \global\oddheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\everyheadingxxx #1{\everyheadingyyy #1@|@|@|@|\finish} \gdef\everyheadingyyy #1@|#2@|#3@|#4\finish{% \global\evenheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}} \global\oddheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\evenfootingxxx #1{\evenfootingyyy #1@|@|@|@|\finish} \gdef\evenfootingyyy #1@|#2@|#3@|#4\finish{% \global\evenfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\oddfootingxxx #1{\oddfootingyyy #1@|@|@|@|\finish} \gdef\oddfootingyyy #1@|#2@|#3@|#4\finish{% \global\oddfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\everyfootingxxx #1{\everyfootingyyy #1@|@|@|@|\finish} \gdef\everyfootingyyy #1@|#2@|#3@|#4\finish{% \global\evenfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}} \global\oddfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} % }% unbind the catcode of @. % @headings double turns headings on for double-sided printing. % @headings single turns headings on for single-sided printing. % @headings off turns them off. % @headings on same as @headings double, retained for compatibility. % @headings after turns on double-sided headings after this page. % @headings doubleafter turns on double-sided headings after this page. % @headings singleafter turns on single-sided headings after this page. % By default, they are off. \def\headings #1 {\csname HEADINGS#1\endcsname} \def\HEADINGSoff{ \global\evenheadline={\hfil} \global\evenfootline={\hfil} \global\oddheadline={\hfil} \global\oddfootline={\hfil}} \HEADINGSoff % When we turn headings on, set the page number to 1. % For double-sided printing, put current file name in lower left corner, % chapter name on inside top of right hand pages, document % title on inside top of left hand pages, and page numbers on outside top % edge of all pages. \def\HEADINGSdouble{ %\pagealignmacro \global\pageno=1 \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\folio\hfil\thistitle}} \global\oddheadline={\line{\thischapter\hfil\folio}} } % For single-sided printing, chapter title goes across top left of page, % page number on top right. \def\HEADINGSsingle{ %\pagealignmacro \global\pageno=1 \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\thischapter\hfil\folio}} \global\oddheadline={\line{\thischapter\hfil\folio}} } \def\HEADINGSon{\HEADINGSdouble} \def\HEADINGSafter{\let\HEADINGShook=\HEADINGSdoublex} \let\HEADINGSdoubleafter=\HEADINGSafter \def\HEADINGSdoublex{% \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\folio\hfil\thistitle}} \global\oddheadline={\line{\thischapter\hfil\folio}} } \def\HEADINGSsingleafter{\let\HEADINGShook=\HEADINGSsinglex} \def\HEADINGSsinglex{% \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\thischapter\hfil\folio}} \global\oddheadline={\line{\thischapter\hfil\folio}} } % Subroutines used in generating headings % Produces Day Month Year style of output. \def\today{\number\day\space \ifcase\month\or January\or February\or March\or April\or May\or June\or July\or August\or September\or October\or November\or December\fi \space\number\year} % Use this if you want the Month Day, Year style of output. %\def\today{\ifcase\month\or %January\or February\or March\or April\or May\or June\or %July\or August\or September\or October\or November\or December\fi %\space\number\day, \number\year} % @settitle line... specifies the title of the document, for headings % It generates no output of its own \def\thistitle{No Title} \def\settitle{\parsearg\settitlezzz} \def\settitlezzz #1{\gdef\thistitle{#1}} \message{tables,} % @tabs -- simple alignment % These don't work. For one thing, \+ is defined as outer. % So these macros cannot even be defined. %\def\tabs{\parsearg\tabszzz} %\def\tabszzz #1{\settabs\+#1\cr} %\def\tabline{\parsearg\tablinezzz} %\def\tablinezzz #1{\+#1\cr} %\def\&{&} % Tables -- @table, @ftable, @vtable, @item(x), @kitem(x), @xitem(x). % default indentation of table text \newdimen\tableindent \tableindent=.8in % default indentation of @itemize and @enumerate text \newdimen\itemindent \itemindent=.3in % margin between end of table item and start of table text. \newdimen\itemmargin \itemmargin=.1in % used internally for \itemindent minus \itemmargin \newdimen\itemmax % Note @table, @vtable, and @vtable define @item, @itemx, etc., with % these defs. % They also define \itemindex % to index the item name in whatever manner is desired (perhaps none). \newif\ifitemxneedsnegativevskip \def\itemxpar{\par\ifitemxneedsnegativevskip\vskip-\parskip\nobreak\fi} \def\internalBitem{\smallbreak \parsearg\itemzzz} \def\internalBitemx{\itemxpar \parsearg\itemzzz} \def\internalBxitem "#1"{\def\xitemsubtopix{#1} \smallbreak \parsearg\xitemzzz} \def\internalBxitemx "#1"{\def\xitemsubtopix{#1} \itemxpar \parsearg\xitemzzz} \def\internalBkitem{\smallbreak \parsearg\kitemzzz} \def\internalBkitemx{\itemxpar \parsearg\kitemzzz} \def\kitemzzz #1{\dosubind {kw}{\code{#1}}{for {\bf \lastfunction}}% \itemzzz {#1}} \def\xitemzzz #1{\dosubind {kw}{\code{#1}}{for {\bf \xitemsubtopic}}% \itemzzz {#1}} \def\itemzzz #1{\begingroup % \advance\hsize by -\rightskip \advance\hsize by -\tableindent \setbox0=\hbox{\itemfont{#1}}% \itemindex{#1}% \nobreak % This prevents a break before @itemx. % % Be sure we are not still in the middle of a paragraph. %{\parskip = 0in %\par %}% % % If the item text does not fit in the space we have, put it on a line % by itself, and do not allow a page break either before or after that % line. We do not start a paragraph here because then if the next % command is, e.g., @kindex, the whatsit would get put into the % horizontal list on a line by itself, resulting in extra blank space. \ifdim \wd0>\itemmax % % Make this a paragraph so we get the \parskip glue and wrapping, % but leave it ragged-right. \begingroup \advance\leftskip by-\tableindent \advance\hsize by\tableindent \advance\rightskip by0pt plus1fil \leavevmode\unhbox0\par \endgroup % % We're going to be starting a paragraph, but we don't want the % \parskip glue -- logically it's part of the @item we just started. \nobreak \vskip-\parskip % % Stop a page break at the \parskip glue coming up. Unfortunately % we can't prevent a possible page break at the following % \baselineskip glue. \nobreak \endgroup \itemxneedsnegativevskipfalse \else % The item text fits into the space. Start a paragraph, so that the % following text (if any) will end up on the same line. Since that % text will be indented by \tableindent, we make the item text be in % a zero-width box. \noindent \rlap{\hskip -\tableindent\box0}\ignorespaces% \endgroup% \itemxneedsnegativevskiptrue% \fi } \def\item{\errmessage{@item while not in a table}} \def\itemx{\errmessage{@itemx while not in a table}} \def\kitem{\errmessage{@kitem while not in a table}} \def\kitemx{\errmessage{@kitemx while not in a table}} \def\xitem{\errmessage{@xitem while not in a table}} \def\xitemx{\errmessage{@xitemx while not in a table}} %% Contains a kludge to get @end[description] to work \def\description{\tablez{\dontindex}{1}{}{}{}{}} \def\table{\begingroup\inENV\obeylines\obeyspaces\tablex} {\obeylines\obeyspaces% \gdef\tablex #1^^M{% \tabley\dontindex#1 \endtabley}} \def\ftable{\begingroup\inENV\obeylines\obeyspaces\ftablex} {\obeylines\obeyspaces% \gdef\ftablex #1^^M{% \tabley\fnitemindex#1 \endtabley \def\Eftable{\endgraf\afterenvbreak\endgroup}% \let\Etable=\relax}} \def\vtable{\begingroup\inENV\obeylines\obeyspaces\vtablex} {\obeylines\obeyspaces% \gdef\vtablex #1^^M{% \tabley\vritemindex#1 \endtabley \def\Evtable{\endgraf\afterenvbreak\endgroup}% \let\Etable=\relax}} \def\dontindex #1{} \def\fnitemindex #1{\doind {fn}{\code{#1}}}% \def\vritemindex #1{\doind {vr}{\code{#1}}}% {\obeyspaces % \gdef\tabley#1#2 #3 #4 #5 #6 #7\endtabley{\endgroup% \tablez{#1}{#2}{#3}{#4}{#5}{#6}}} \def\tablez #1#2#3#4#5#6{% \aboveenvbreak % \begingroup % \def\Edescription{\Etable}% Neccessary kludge. \let\itemindex=#1% \ifnum 0#3>0 \advance \leftskip by #3\mil \fi % \ifnum 0#4>0 \tableindent=#4\mil \fi % \ifnum 0#5>0 \advance \rightskip by #5\mil \fi % \def\itemfont{#2}% \itemmax=\tableindent % \advance \itemmax by -\itemmargin % \advance \leftskip by \tableindent % \exdentamount=\tableindent \parindent = 0pt \parskip = \smallskipamount \ifdim \parskip=0pt \parskip=2pt \fi% \def\Etable{\endgraf\afterenvbreak\endgroup}% \let\item = \internalBitem % \let\itemx = \internalBitemx % \let\kitem = \internalBkitem % \let\kitemx = \internalBkitemx % \let\xitem = \internalBxitem % \let\xitemx = \internalBxitemx % } % This is the counter used by @enumerate, which is really @itemize \newcount \itemno \def\itemize{\parsearg\itemizezzz} \def\itemizezzz #1{% \begingroup % ended by the @end itemsize \itemizey {#1}{\Eitemize} } \def\itemizey #1#2{% \aboveenvbreak % \itemmax=\itemindent % \advance \itemmax by -\itemmargin % \advance \leftskip by \itemindent % \exdentamount=\itemindent \parindent = 0pt % \parskip = \smallskipamount % \ifdim \parskip=0pt \parskip=2pt \fi% \def#2{\endgraf\afterenvbreak\endgroup}% \def\itemcontents{#1}% \let\item=\itemizeitem} % Set sfcode to normal for the chars that usually have another value. % These are `.?!:;,' \def\frenchspacing{\sfcode46=1000 \sfcode63=1000 \sfcode33=1000 \sfcode58=1000 \sfcode59=1000 \sfcode44=1000 } % \splitoff TOKENS\endmark defines \first to be the first token in % TOKENS, and \rest to be the remainder. % \def\splitoff#1#2\endmark{\def\first{#1}\def\rest{#2}}% % Allow an optional argument of an uppercase letter, lowercase letter, % or number, to specify the first label in the enumerated list. No % argument is the same as `1'. % \def\enumerate{\parsearg\enumeratezzz} \def\enumeratezzz #1{\enumeratey #1 \endenumeratey} \def\enumeratey #1 #2\endenumeratey{% \begingroup % ended by the @end enumerate % % If we were given no argument, pretend we were given `1'. \def\thearg{#1}% \ifx\thearg\empty \def\thearg{1}\fi % % Detect if the argument is a single token. If so, it might be a % letter. Otherwise, the only valid thing it can be is a number. % (We will always have one token, because of the test we just made. % This is a good thing, since \splitoff doesn't work given nothing at % all -- the first parameter is undelimited.) \expandafter\splitoff\thearg\endmark \ifx\rest\empty % Only one token in the argument. It could still be anything. % A ``lowercase letter'' is one whose \lccode is nonzero. % An ``uppercase letter'' is one whose \lccode is both nonzero, and % not equal to itself. % Otherwise, we assume it's a number. % % We need the \relax at the end of the \ifnum lines to stop TeX from % continuing to look for a . % \ifnum\lccode\expandafter`\thearg=0\relax \numericenumerate % a number (we hope) \else % It's a letter. \ifnum\lccode\expandafter`\thearg=\expandafter`\thearg\relax \lowercaseenumerate % lowercase letter \else \uppercaseenumerate % uppercase letter \fi \fi \else % Multiple tokens in the argument. We hope it's a number. \numericenumerate \fi } % An @enumerate whose labels are integers. The starting integer is % given in \thearg. % \def\numericenumerate{% \itemno = \thearg \startenumeration{\the\itemno}% } % The starting (lowercase) letter is in \thearg. \def\lowercaseenumerate{% \itemno = \expandafter`\thearg \startenumeration{% % Be sure we're not beyond the end of the alphabet. \ifnum\itemno=0 \errmessage{No more lowercase letters in @enumerate; get a bigger alphabet}% \fi \char\lccode\itemno }% } % The starting (uppercase) letter is in \thearg. \def\uppercaseenumerate{% \itemno = \expandafter`\thearg \startenumeration{% % Be sure we're not beyond the end of the alphabet. \ifnum\itemno=0 \errmessage{No more uppercase letters in @enumerate; get a bigger alphabet} \fi \char\uccode\itemno }% } % Call itemizey, adding a period to the first argument and supplying the % common last two arguments. Also subtract one from the initial value in % \itemno, since @item increments \itemno. % \def\startenumeration#1{% \advance\itemno by -1 \itemizey{#1.}\Eenumerate\flushcr } % @alphaenumerate and @capsenumerate are abbreviations for giving an arg % to @enumerate. % \def\alphaenumerate{\enumerate{a}} \def\capsenumerate{\enumerate{A}} \def\Ealphaenumerate{\Eenumerate} \def\Ecapsenumerate{\Eenumerate} % Definition of @item while inside @itemize. \def\itemizeitem{% \advance\itemno by 1 {\let\par=\endgraf \smallbreak}% \ifhmode \errmessage{\in hmode at itemizeitem}\fi {\parskip=0in \hskip 0pt \hbox to 0pt{\hss \itemcontents\hskip \itemmargin}% \vadjust{\penalty 1200}}% \flushcr} % @multitable macros % Amy Hendrickson, 8/18/94 % % @multitable ... @endmultitable will make as many columns as desired. % Contents of each column will wrap at width given in preamble. Width % can be specified either with sample text given in a template line, % or in percent of \hsize, the current width of text on page. % Table can continue over pages but will only break between lines. % To make preamble: % % Either define widths of columns in terms of percent of \hsize: % @multitable @percentofhsize .2 .3 .5 % @item ... % % Numbers following @percentofhsize are the percent of the total % current hsize to be used for each column. You may use as many % columns as desired. % Or use a template: % @multitable {Column 1 template} {Column 2 template} {Column 3 template} % @item ... % using the widest term desired in each column. % Each new table line starts with @item, each subsequent new column % starts with @tab. Empty columns may be produced by supplying @tab's % with nothing between them for as many times as empty columns are needed, % ie, @tab@tab@tab will produce two empty columns. % @item, @tab, @multicolumn or @endmulticolumn do not need to be on their % own lines, but it will not hurt if they are. % Sample multitable: % @multitable {Column 1 template} {Column 2 template} {Column 3 template} % @item first col stuff @tab second col stuff @tab third col % @item % first col stuff % @tab % second col stuff % @tab % third col % @item first col stuff @tab second col stuff % @tab Many paragraphs of text may be used in any column. % % They will wrap at the width determined by the template. % @item@tab@tab This will be in third column. % @endmultitable % Default dimensions may be reset by user. % @intableparskip will set vertical space between paragraphs in table. % @intableparindent will set paragraph indent in table. % @spacebetweencols will set horizontal space to be left between columns. % @spacebetweenlines will set vertical space to be left between lines. %%%% % Dimensions \newdimen\intableparskip \newdimen\intableparindent \newdimen\spacebetweencols \newdimen\spacebetweenlines \intableparskip=0pt \intableparindent=6pt \spacebetweencols=12pt \spacebetweenlines=12pt %%%% % Macros used to set up halign preamble: \let\endsetuptable\relax \def\xendsetuptable{\endsetuptable} \let\percentofhsize\relax \def\xpercentofhsize{\percentofhsize} \newif\ifsetpercent \newcount\colcount \def\setuptable#1{\def\firstarg{#1}% \ifx\firstarg\xendsetuptable\let\go\relax% \else \ifx\firstarg\xpercentofhsize\global\setpercenttrue% \else \ifsetpercent \if#1.\else% \global\advance\colcount by1 % \expandafter\xdef\csname col\the\colcount\endcsname{.#1\hsize}% \fi \else \global\advance\colcount by1 \setbox0=\hbox{#1}% \expandafter\xdef\csname col\the\colcount\endcsname{\the\wd0}% \fi% \fi% \let\go\setuptable% \fi\go} %%%% % multitable syntax \def\tab{&} %%%% % @multitable ... @endmultitable definitions: \def\multitable#1\item{\bgroup \let\item\cr \tolerance=9500 \hbadness=9500 \parskip=\intableparskip \parindent=\intableparindent \overfullrule=0pt \global\colcount=0\relax% \def\Emultitable{\global\setpercentfalse\global\everycr{}\cr\egroup\egroup}% % To parse everything between @multitable and @item : \def\one{#1}\expandafter\setuptable\one\endsetuptable % Need to reset this to 0 after \setuptable. \global\colcount=0\relax% % % This preamble sets up a generic column definition, which will % be used as many times as user calls for columns. % \vtop will set a single line and will also let text wrap and % continue for many paragraphs if desired. \halign\bgroup&\global\advance\colcount by 1\relax% \vtop{\hsize=\expandafter\csname col\the\colcount\endcsname % In order to keep entries from bumping into each other % we will add a \leftskip of \spacebetweencols to all columns after % the first one. % If a template has been used, we will add \spacebetweencols % to the width of each template entry. % If user has set preamble in terms of percent of \hsize % we will use that dimension as the width of the column, and % the \leftskip will keep entries from bumping into each other. % Table will start at left margin and final column will justify at % right margin. \ifnum\colcount=1 \else \ifsetpercent \else % If user has set preamble in terms of percent of \hsize % we will advance \hsize by \spacebetweencols \advance\hsize by \spacebetweencols \fi % In either case we will make \leftskip=\spacebetweencols: \leftskip=\spacebetweencols \fi \noindent##}\cr% % \everycr will reset column counter, \colcount, at the end of % each line. Every column entry will cause \colcount to advance by one. % The table preamble % looks at the current \colcount to find the correct column width. \global\everycr{\noalign{\nointerlineskip\vskip\spacebetweenlines \filbreak%% keeps underfull box messages off when table breaks over pages. \global\colcount=0\relax}}} \message{indexing,} % Index generation facilities % Define \newwrite to be identical to plain tex's \newwrite % except not \outer, so it can be used within \newindex. {\catcode`\@=11 \gdef\newwrite{\alloc@7\write\chardef\sixt@@n}} % \newindex {foo} defines an index named foo. % It automatically defines \fooindex such that % \fooindex ...rest of line... puts an entry in the index foo. % It also defines \fooindfile to be the number of the output channel for % the file that accumulates this index. The file's extension is foo. % The name of an index should be no more than 2 characters long % for the sake of vms. \def\newindex #1{ \expandafter\newwrite \csname#1indfile\endcsname% Define number for output file \openout \csname#1indfile\endcsname \jobname.#1 % Open the file \expandafter\xdef\csname#1index\endcsname{% % Define \xxxindex \noexpand\doindex {#1}} } % @defindex foo == \newindex{foo} \def\defindex{\parsearg\newindex} % Define @defcodeindex, like @defindex except put all entries in @code. \def\newcodeindex #1{ \expandafter\newwrite \csname#1indfile\endcsname% Define number for output file \openout \csname#1indfile\endcsname \jobname.#1 % Open the file \expandafter\xdef\csname#1index\endcsname{% % Define \xxxindex \noexpand\docodeindex {#1}} } \def\defcodeindex{\parsearg\newcodeindex} % @synindex foo bar makes index foo feed into index bar. % Do this instead of @defindex foo if you don't want it as a separate index. \def\synindex #1 #2 {% \expandafter\let\expandafter\synindexfoo\expandafter=\csname#2indfile\endcsname \expandafter\let\csname#1indfile\endcsname=\synindexfoo \expandafter\xdef\csname#1index\endcsname{% % Define \xxxindex \noexpand\doindex {#2}}% } % @syncodeindex foo bar similar, but put all entries made for index foo % inside @code. \def\syncodeindex #1 #2 {% \expandafter\let\expandafter\synindexfoo\expandafter=\csname#2indfile\endcsname \expandafter\let\csname#1indfile\endcsname=\synindexfoo \expandafter\xdef\csname#1index\endcsname{% % Define \xxxindex \noexpand\docodeindex {#2}}% } % Define \doindex, the driver for all \fooindex macros. % Argument #1 is generated by the calling \fooindex macro, % and it is "foo", the name of the index. % \doindex just uses \parsearg; it calls \doind for the actual work. % This is because \doind is more useful to call from other macros. % There is also \dosubind {index}{topic}{subtopic} % which makes an entry in a two-level index such as the operation index. \def\doindex#1{\edef\indexname{#1}\parsearg\singleindexer} \def\singleindexer #1{\doind{\indexname}{#1}} % like the previous two, but they put @code around the argument. \def\docodeindex#1{\edef\indexname{#1}\parsearg\singlecodeindexer} \def\singlecodeindexer #1{\doind{\indexname}{\code{#1}}} \def\indexdummies{% % Take care of the plain tex accent commands. \def\"{\realbackslash "}% \def\`{\realbackslash `}% \def\'{\realbackslash '}% \def\^{\realbackslash ^}% \def\~{\realbackslash ~}% \def\={\realbackslash =}% \def\b{\realbackslash b}% \def\c{\realbackslash c}% \def\d{\realbackslash d}% \def\u{\realbackslash u}% \def\v{\realbackslash v}% \def\H{\realbackslash H}% % Take care of the plain tex special European modified letters. \def\oe{\realbackslash oe}% \def\ae{\realbackslash ae}% \def\aa{\realbackslash aa}% \def\OE{\realbackslash OE}% \def\AE{\realbackslash AE}% \def\AA{\realbackslash AA}% \def\o{\realbackslash o}% \def\O{\realbackslash O}% \def\l{\realbackslash l}% \def\L{\realbackslash L}% \def\ss{\realbackslash ss}% % Take care of texinfo commands likely to appear in an index entry. \def\_{{\realbackslash _}}% \def\w{\realbackslash w }% \def\bf{\realbackslash bf }% \def\rm{\realbackslash rm }% \def\sl{\realbackslash sl }% \def\sf{\realbackslash sf}% \def\tt{\realbackslash tt}% \def\gtr{\realbackslash gtr}% \def\less{\realbackslash less}% \def\hat{\realbackslash hat}% \def\char{\realbackslash char}% \def\TeX{\realbackslash TeX}% \def\dots{\realbackslash dots }% \def\copyright{\realbackslash copyright }% \def\tclose##1{\realbackslash tclose {##1}}% \def\code##1{\realbackslash code {##1}}% \def\samp##1{\realbackslash samp {##1}}% \def\t##1{\realbackslash r {##1}}% \def\r##1{\realbackslash r {##1}}% \def\i##1{\realbackslash i {##1}}% \def\b##1{\realbackslash b {##1}}% \def\cite##1{\realbackslash cite {##1}}% \def\key##1{\realbackslash key {##1}}% \def\file##1{\realbackslash file {##1}}% \def\var##1{\realbackslash var {##1}}% \def\kbd##1{\realbackslash kbd {##1}}% \def\dfn##1{\realbackslash dfn {##1}}% \def\emph##1{\realbackslash emph {##1}}% } % \indexnofonts no-ops all font-change commands. % This is used when outputting the strings to sort the index by. \def\indexdummyfont#1{#1} \def\indexdummytex{TeX} \def\indexdummydots{...} \def\indexnofonts{% % Just ignore accents. \let\"=\indexdummyfont \let\`=\indexdummyfont \let\'=\indexdummyfont \let\^=\indexdummyfont \let\~=\indexdummyfont \let\==\indexdummyfont \let\b=\indexdummyfont \let\c=\indexdummyfont \let\d=\indexdummyfont \let\u=\indexdummyfont \let\v=\indexdummyfont \let\H=\indexdummyfont % Take care of the plain tex special European modified letters. \def\oe{oe}% \def\ae{ae}% \def\aa{aa}% \def\OE{OE}% \def\AE{AE}% \def\AA{AA}% \def\o{o}% \def\O{O}% \def\l{l}% \def\L{L}% \def\ss{ss}% \let\w=\indexdummyfont \let\t=\indexdummyfont \let\r=\indexdummyfont \let\i=\indexdummyfont \let\b=\indexdummyfont \let\emph=\indexdummyfont \let\strong=\indexdummyfont \let\cite=\indexdummyfont \let\sc=\indexdummyfont %Don't no-op \tt, since it isn't a user-level command % and is used in the definitions of the active chars like <, >, |... %\let\tt=\indexdummyfont \let\tclose=\indexdummyfont \let\code=\indexdummyfont \let\file=\indexdummyfont \let\samp=\indexdummyfont \let\kbd=\indexdummyfont \let\key=\indexdummyfont \let\var=\indexdummyfont \let\TeX=\indexdummytex \let\dots=\indexdummydots } % To define \realbackslash, we must make \ not be an escape. % We must first make another character (@) an escape % so we do not become unable to do a definition. {\catcode`\@=0 \catcode`\\=\other @gdef@realbackslash{\}} \let\indexbackslash=0 %overridden during \printindex. \let\SETmarginindex=\relax %initialize! % workhorse for all \fooindexes % #1 is name of index, #2 is stuff to put there \def\doind #1#2{% % Put the index entry in the margin if desired. \ifx\SETmarginindex\relax\else% \insert\margin{\hbox{\vrule height8pt depth3pt width0pt #2}}% \fi% {\count10=\lastpenalty % {\indexdummies % Must do this here, since \bf, etc expand at this stage \escapechar=`\\% {\let\folio=0% Expand all macros now EXCEPT \folio \def\rawbackslashxx{\indexbackslash}% \indexbackslash isn't defined now % so it will be output as is; and it will print as backslash in the indx. % % Now process the index-string once, with all font commands turned off, % to get the string to sort the index by. {\indexnofonts \xdef\temp1{#2}% }% % Now produce the complete index entry. We process the index-string again, % this time with font commands expanded, to get what to print in the index. \edef\temp{% \write \csname#1indfile\endcsname{% \realbackslash entry {\temp1}{\folio}{#2}}}% \temp }% }\penalty\count10}} \def\dosubind #1#2#3{% {\count10=\lastpenalty % {\indexdummies % Must do this here, since \bf, etc expand at this stage \escapechar=`\\% {\let\folio=0% \def\rawbackslashxx{\indexbackslash}% % % Now process the index-string once, with all font commands turned off, % to get the string to sort the index by. {\indexnofonts \xdef\temp1{#2 #3}% }% % Now produce the complete index entry. We process the index-string again, % this time with font commands expanded, to get what to print in the index. \edef\temp{% \write \csname#1indfile\endcsname{% \realbackslash entry {\temp1}{\folio}{#2}{#3}}}% \temp }% }\penalty\count10}} % The index entry written in the file actually looks like % \entry {sortstring}{page}{topic} % or % \entry {sortstring}{page}{topic}{subtopic} % The texindex program reads in these files and writes files % containing these kinds of lines: % \initial {c} % before the first topic whose initial is c % \entry {topic}{pagelist} % for a topic that is used without subtopics % \primary {topic} % for the beginning of a topic that is used with subtopics % \secondary {subtopic}{pagelist} % for each subtopic. % Define the user-accessible indexing commands % @findex, @vindex, @kindex, @cindex. \def\findex {\fnindex} \def\kindex {\kyindex} \def\cindex {\cpindex} \def\vindex {\vrindex} \def\tindex {\tpindex} \def\pindex {\pgindex} \def\cindexsub {\begingroup\obeylines\cindexsub} {\obeylines % \gdef\cindexsub "#1" #2^^M{\endgroup % \dosubind{cp}{#2}{#1}}} % Define the macros used in formatting output of the sorted index material. % This is what you call to cause a particular index to get printed. % Write % @unnumbered Function Index % @printindex fn \def\printindex{\parsearg\doprintindex} \def\doprintindex#1{% \tex \dobreak \chapheadingskip {10000} \catcode`\%=\other\catcode`\&=\other\catcode`\#=\other \catcode`\$=\other \catcode`\~=\other \indexbreaks % % The following don't help, since the chars were translated % when the raw index was written, and their fonts were discarded % due to \indexnofonts. %\catcode`\"=\active %\catcode`\^=\active %\catcode`\_=\active %\catcode`\|=\active %\catcode`\<=\active %\catcode`\>=\active % % \def\indexbackslash{\rawbackslashxx} \indexfonts\rm \tolerance=9500 \advance\baselineskip -1pt \begindoublecolumns % % See if the index file exists and is nonempty. \openin 1 \jobname.#1s \ifeof 1 % \enddoublecolumns gets confused if there is no text in the index, % and it loses the chapter title and the aux file entries for the % index. The easiest way to prevent this problem is to make sure % there is some text. (Index is nonexistent) \else % % If the index file exists but is empty, then \openin leaves \ifeof % false. We have to make TeX try to read something from the file, so % it can discover if there is anything in it. \read 1 to \temp \ifeof 1 (Index is empty) \else \input \jobname.#1s \fi \fi \closein 1 \enddoublecolumns \Etex } % These macros are used by the sorted index file itself. % Change them to control the appearance of the index. % Same as \bigskipamount except no shrink. % \balancecolumns gets confused if there is any shrink. \newskip\initialskipamount \initialskipamount 12pt plus4pt \def\initial #1{% {\let\tentt=\sectt \let\tt=\sectt \let\sf=\sectt \ifdim\lastskip<\initialskipamount \removelastskip \penalty-200 \vskip \initialskipamount\fi \line{\secbf#1\hfill}\kern 2pt\penalty10000}} % This typesets a paragraph consisting of #1, dot leaders, and then #2 % flush to the right margin. It is used for index and table of contents % entries. The paragraph is indented by \leftskip. % \def\entry #1#2{\begingroup % % Start a new paragraph if necessary, so our assignments below can't % affect previous text. \par % % Do not fill out the last line with white space. \parfillskip = 0in % % No extra space above this paragraph. \parskip = 0in % % Do not prefer a separate line ending with a hyphen to fewer lines. \finalhyphendemerits = 0 % % \hangindent is only relevant when the entry text and page number % don't both fit on one line. In that case, bob suggests starting the % dots pretty far over on the line. Unfortunately, a large % indentation looks wrong when the entry text itself is broken across % lines. So we use a small indentation and put up with long leaders. % % \hangafter is reset to 1 (which is the value we want) at the start % of each paragraph, so we need not do anything with that. \hangindent=2em % % When the entry text needs to be broken, just fill out the first line % with blank space. \rightskip = 0pt plus1fil % % Start a ``paragraph'' for the index entry so the line breaking % parameters we've set above will have an effect. \noindent % % Insert the text of the index entry. TeX will do line-breaking on it. #1% % The following is kluged to not output a line of dots in the index if % there are no page numbers. The next person who breaks this will be % cursed by a Unix daemon. \def\tempa{{\rm }}% \def\tempb{#2}% \edef\tempc{\tempa}% \edef\tempd{\tempb}% \ifx\tempc\tempd\ \else% % % If we must, put the page number on a line of its own, and fill out % this line with blank space. (The \hfil is overwhelmed with the % fill leaders glue in \indexdotfill if the page number does fit.) \hfil\penalty50 \null\nobreak\indexdotfill % Have leaders before the page number. % % The `\ ' here is removed by the implicit \unskip that TeX does as % part of (the primitive) \par. Without it, a spurious underfull % \hbox ensues. \ #2% The page number ends the paragraph. \fi% \par \endgroup} % Like \dotfill except takes at least 1 em. \def\indexdotfill{\cleaders \hbox{$\mathsurround=0pt \mkern1.5mu ${\it .}$ \mkern1.5mu$}\hskip 1em plus 1fill} \def\primary #1{\line{#1\hfil}} \newskip\secondaryindent \secondaryindent=0.5cm \def\secondary #1#2{ {\parfillskip=0in \parskip=0in \hangindent =1in \hangafter=1 \noindent\hskip\secondaryindent\hbox{#1}\indexdotfill #2\par }} %% Define two-column mode, which is used in indexes. %% Adapted from the TeXbook, page 416. \catcode `\@=11 \newbox\partialpage \newdimen\doublecolumnhsize \def\begindoublecolumns{\begingroup % Grab any single-column material above us. \output = {\global\setbox\partialpage =\vbox{\unvbox255\kern -\topskip \kern \baselineskip}}% \eject % % Now switch to the double-column output routine. \output={\doublecolumnout}% % % Change the page size parameters. We could do this once outside this % routine, in each of @smallbook, @afourpaper, and the default 8.5x11 % format, but then we repeat the same computation. Repeating a couple % of assignments once per index is clearly meaningless for the % execution time, so we may as well do it once. % % First we halve the line length, less a little for the gutter between % the columns. We compute the gutter based on the line length, so it % changes automatically with the paper format. The magic constant % below is chosen so that the gutter has the same value (well, +- < % 1pt) as it did when we hard-coded it. % % We put the result in a separate register, \doublecolumhsize, so we % can restore it in \pagesofar, after \hsize itself has (potentially) % been clobbered. % \doublecolumnhsize = \hsize \advance\doublecolumnhsize by -.04154\hsize \divide\doublecolumnhsize by 2 \hsize = \doublecolumnhsize % % Double the \vsize as well. (We don't need a separate register here, % since nobody clobbers \vsize.) \vsize = 2\vsize \doublecolumnpagegoal } \def\enddoublecolumns{\eject \endgroup \pagegoal=\vsize \unvbox\partialpage} \def\doublecolumnsplit{\splittopskip=\topskip \splitmaxdepth=\maxdepth \global\dimen@=\pageheight \global\advance\dimen@ by-\ht\partialpage \global\setbox1=\vsplit255 to\dimen@ \global\setbox0=\vbox{\unvbox1} \global\setbox3=\vsplit255 to\dimen@ \global\setbox2=\vbox{\unvbox3} \ifdim\ht0>\dimen@ \setbox255=\vbox{\unvbox0\unvbox2} \global\setbox255=\copy5 \fi \ifdim\ht2>\dimen@ \setbox255=\vbox{\unvbox0\unvbox2} \global\setbox255=\copy5 \fi } \def\doublecolumnpagegoal{% \dimen@=\vsize \advance\dimen@ by-2\ht\partialpage \global\pagegoal=\dimen@ } \def\pagesofar{\unvbox\partialpage % \hsize=\doublecolumnhsize % have to restore this since output routine \wd0=\hsize \wd2=\hsize \hbox to\pagewidth{\box0\hfil\box2}} \def\doublecolumnout{% \setbox5=\copy255 {\vbadness=10000 \doublecolumnsplit} \ifvbox255 \setbox0=\vtop to\dimen@{\unvbox0} \setbox2=\vtop to\dimen@{\unvbox2} \onepageout\pagesofar \unvbox255 \penalty\outputpenalty \else \setbox0=\vbox{\unvbox5} \ifvbox0 \dimen@=\ht0 \advance\dimen@ by\topskip \advance\dimen@ by-\baselineskip \divide\dimen@ by2 \splittopskip=\topskip \splitmaxdepth=\maxdepth {\vbadness=10000 \loop \global\setbox5=\copy0 \setbox1=\vsplit5 to\dimen@ \setbox3=\vsplit5 to\dimen@ \ifvbox5 \global\advance\dimen@ by1pt \repeat \setbox0=\vbox to\dimen@{\unvbox1} \setbox2=\vbox to\dimen@{\unvbox3} \global\setbox\partialpage=\vbox{\pagesofar} \doublecolumnpagegoal } \fi \fi } \catcode `\@=\other \message{sectioning,} % Define chapters, sections, etc. \newcount \chapno \newcount \secno \secno=0 \newcount \subsecno \subsecno=0 \newcount \subsubsecno \subsubsecno=0 % This counter is funny since it counts through charcodes of letters A, B, ... \newcount \appendixno \appendixno = `\@ \def\appendixletter{\char\the\appendixno} \newwrite \contentsfile % This is called from \setfilename. \def\opencontents{\openout \contentsfile = \jobname.toc} % Each @chapter defines this as the name of the chapter. % page headings and footings can use it. @section does likewise \def\thischapter{} \def\thissection{} \def\seccheck#1{\if \pageno<0 % \errmessage{@#1 not allowed after generating table of contents}\fi % } \def\chapternofonts{% \let\rawbackslash=\relax% \let\frenchspacing=\relax% \def\result{\realbackslash result} \def\equiv{\realbackslash equiv} \def\expansion{\realbackslash expansion} \def\print{\realbackslash print} \def\TeX{\realbackslash TeX} \def\dots{\realbackslash dots} \def\copyright{\realbackslash copyright} \def\tt{\realbackslash tt} \def\bf{\realbackslash bf } \def\w{\realbackslash w} \def\less{\realbackslash less} \def\gtr{\realbackslash gtr} \def\hat{\realbackslash hat} \def\char{\realbackslash char} \def\tclose##1{\realbackslash tclose {##1}} \def\code##1{\realbackslash code {##1}} \def\samp##1{\realbackslash samp {##1}} \def\r##1{\realbackslash r {##1}} \def\b##1{\realbackslash b {##1}} \def\key##1{\realbackslash key {##1}} \def\file##1{\realbackslash file {##1}} \def\kbd##1{\realbackslash kbd {##1}} % These are redefined because @smartitalic wouldn't work inside xdef. \def\i##1{\realbackslash i {##1}} \def\cite##1{\realbackslash cite {##1}} \def\var##1{\realbackslash var {##1}} \def\emph##1{\realbackslash emph {##1}} \def\dfn##1{\realbackslash dfn {##1}} } \newcount\absseclevel % used to calculate proper heading level \newcount\secbase\secbase=0 % @raise/lowersections modify this count % @raisesections: treat @section as chapter, @subsection as section, etc. \def\raisesections{\global\advance\secbase by -1} \let\up=\raisesections % original BFox name % @lowersections: treat @chapter as section, @section as subsection, etc. \def\lowersections{\global\advance\secbase by 1} \let\down=\lowersections % original BFox name % Choose a numbered-heading macro % #1 is heading level if unmodified by @raisesections or @lowersections % #2 is text for heading \def\numhead#1#2{\absseclevel=\secbase\advance\absseclevel by #1 \ifcase\absseclevel \chapterzzz{#2} \or \seczzz{#2} \or \numberedsubseczzz{#2} \or \numberedsubsubseczzz{#2} \else \ifnum \absseclevel<0 \chapterzzz{#2} \else \numberedsubsubseczzz{#2} \fi \fi } % like \numhead, but chooses appendix heading levels \def\apphead#1#2{\absseclevel=\secbase\advance\absseclevel by #1 \ifcase\absseclevel \appendixzzz{#2} \or \appendixsectionzzz{#2} \or \appendixsubseczzz{#2} \or \appendixsubsubseczzz{#2} \else \ifnum \absseclevel<0 \appendixzzz{#2} \else \appendixsubsubseczzz{#2} \fi \fi } % like \numhead, but chooses numberless heading levels \def\unnmhead#1#2{\absseclevel=\secbase\advance\absseclevel by #1 \ifcase\absseclevel \unnumberedzzz{#2} \or \unnumberedseczzz{#2} \or \unnumberedsubseczzz{#2} \or \unnumberedsubsubseczzz{#2} \else \ifnum \absseclevel<0 \unnumberedzzz{#2} \else \unnumberedsubsubseczzz{#2} \fi \fi } \def\thischaptername{No Chapter Title} \outer\def\chapter{\parsearg\chapteryyy} \def\chapteryyy #1{\numhead0{#1}} % normally numhead0 calls chapterzzz \def\chapterzzz #1{\seccheck{chapter}% \secno=0 \subsecno=0 \subsubsecno=0 \global\advance \chapno by 1 \message{\putwordChapter \the\chapno}% \chapmacro {#1}{\the\chapno}% \gdef\thissection{#1}% \gdef\thischaptername{#1}% % We don't substitute the actual chapter name into \thischapter % because we don't want its macros evaluated now. \xdef\thischapter{\putwordChapter{} \the\chapno: \noexpand\thischaptername}% {\chapternofonts% \edef\temp{{\realbackslash chapentry {#1}{\the\chapno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \donoderef % \global\let\section = \numberedsec \global\let\subsection = \numberedsubsec \global\let\subsubsection = \numberedsubsubsec }} \outer\def\appendix{\parsearg\appendixyyy} \def\appendixyyy #1{\apphead0{#1}} % normally apphead0 calls appendixzzz \def\appendixzzz #1{\seccheck{appendix}% \secno=0 \subsecno=0 \subsubsecno=0 \global\advance \appendixno by 1 \message{Appendix \appendixletter}% \chapmacro {#1}{\putwordAppendix{} \appendixletter}% \gdef\thissection{#1}% \gdef\thischaptername{#1}% \xdef\thischapter{\putwordAppendix{} \appendixletter: \noexpand\thischaptername}% {\chapternofonts% \edef\temp{{\realbackslash chapentry {#1}{\putwordAppendix{} \appendixletter}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \appendixnoderef % \global\let\section = \appendixsec \global\let\subsection = \appendixsubsec \global\let\subsubsection = \appendixsubsubsec }} \outer\def\top{\parsearg\unnumberedyyy} \outer\def\unnumbered{\parsearg\unnumberedyyy} \def\unnumberedyyy #1{\unnmhead0{#1}} % normally unnmhead0 calls unnumberedzzz \def\unnumberedzzz #1{\seccheck{unnumbered}% \secno=0 \subsecno=0 \subsubsecno=0 % % This used to be simply \message{#1}, but TeX fully expands the % argument to \message. Therefore, if #1 contained @-commands, TeX % expanded them. For example, in `@unnumbered The @cite{Book}', TeX % expanded @cite (which turns out to cause errors because \cite is meant % to be executed, not expanded). % % Anyway, we don't want the fully-expanded definition of @cite to appear % as a result of the \message, we just want `@cite' itself. We use % \the to achieve this: TeX expands \the only once, % simply yielding the contents of the . \toks0 = {#1}\message{(\the\toks0)}% % \unnumbchapmacro {#1}% \gdef\thischapter{#1}\gdef\thissection{#1}% {\chapternofonts% \edef\temp{{\realbackslash unnumbchapentry {#1}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \unnumbnoderef % \global\let\section = \unnumberedsec \global\let\subsection = \unnumberedsubsec \global\let\subsubsection = \unnumberedsubsubsec }} \outer\def\numberedsec{\parsearg\secyyy} \def\secyyy #1{\numhead1{#1}} % normally calls seczzz \def\seczzz #1{\seccheck{section}% \subsecno=0 \subsubsecno=0 \global\advance \secno by 1 % \gdef\thissection{#1}\secheading {#1}{\the\chapno}{\the\secno}% {\chapternofonts% \edef\temp{{\realbackslash secentry % {#1}{\the\chapno}{\the\secno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \donoderef % \penalty 10000 % }} \outer\def\appenixsection{\parsearg\appendixsecyyy} \outer\def\appendixsec{\parsearg\appendixsecyyy} \def\appendixsecyyy #1{\apphead1{#1}} % normally calls appendixsectionzzz \def\appendixsectionzzz #1{\seccheck{appendixsection}% \subsecno=0 \subsubsecno=0 \global\advance \secno by 1 % \gdef\thissection{#1}\secheading {#1}{\appendixletter}{\the\secno}% {\chapternofonts% \edef\temp{{\realbackslash secentry % {#1}{\appendixletter}{\the\secno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \appendixnoderef % \penalty 10000 % }} \outer\def\unnumberedsec{\parsearg\unnumberedsecyyy} \def\unnumberedsecyyy #1{\unnmhead1{#1}} % normally calls unnumberedseczzz \def\unnumberedseczzz #1{\seccheck{unnumberedsec}% \plainsecheading {#1}\gdef\thissection{#1}% {\chapternofonts% \edef\temp{{\realbackslash unnumbsecentry{#1}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \unnumbnoderef % \penalty 10000 % }} \outer\def\numberedsubsec{\parsearg\numberedsubsecyyy} \def\numberedsubsecyyy #1{\numhead2{#1}} % normally calls numberedsubseczzz \def\numberedsubseczzz #1{\seccheck{subsection}% \gdef\thissection{#1}\subsubsecno=0 \global\advance \subsecno by 1 % \subsecheading {#1}{\the\chapno}{\the\secno}{\the\subsecno}% {\chapternofonts% \edef\temp{{\realbackslash subsecentry % {#1}{\the\chapno}{\the\secno}{\the\subsecno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \donoderef % \penalty 10000 % }} \outer\def\appendixsubsec{\parsearg\appendixsubsecyyy} \def\appendixsubsecyyy #1{\apphead2{#1}} % normally calls appendixsubseczzz \def\appendixsubseczzz #1{\seccheck{appendixsubsec}% \gdef\thissection{#1}\subsubsecno=0 \global\advance \subsecno by 1 % \subsecheading {#1}{\appendixletter}{\the\secno}{\the\subsecno}% {\chapternofonts% \edef\temp{{\realbackslash subsecentry % {#1}{\appendixletter}{\the\secno}{\the\subsecno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \appendixnoderef % \penalty 10000 % }} \outer\def\unnumberedsubsec{\parsearg\unnumberedsubsecyyy} \def\unnumberedsubsecyyy #1{\unnmhead2{#1}} %normally calls unnumberedsubseczzz \def\unnumberedsubseczzz #1{\seccheck{unnumberedsubsec}% \plainsecheading {#1}\gdef\thissection{#1}% {\chapternofonts% \edef\temp{{\realbackslash unnumbsubsecentry{#1}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \unnumbnoderef % \penalty 10000 % }} \outer\def\numberedsubsubsec{\parsearg\numberedsubsubsecyyy} \def\numberedsubsubsecyyy #1{\numhead3{#1}} % normally numberedsubsubseczzz \def\numberedsubsubseczzz #1{\seccheck{subsubsection}% \gdef\thissection{#1}\global\advance \subsubsecno by 1 % \subsubsecheading {#1} {\the\chapno}{\the\secno}{\the\subsecno}{\the\subsubsecno}% {\chapternofonts% \edef\temp{{\realbackslash subsubsecentry % {#1} {\the\chapno}{\the\secno}{\the\subsecno}{\the\subsubsecno} {\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \donoderef % \penalty 10000 % }} \outer\def\appendixsubsubsec{\parsearg\appendixsubsubsecyyy} \def\appendixsubsubsecyyy #1{\apphead3{#1}} % normally appendixsubsubseczzz \def\appendixsubsubseczzz #1{\seccheck{appendixsubsubsec}% \gdef\thissection{#1}\global\advance \subsubsecno by 1 % \subsubsecheading {#1} {\appendixletter}{\the\secno}{\the\subsecno}{\the\subsubsecno}% {\chapternofonts% \edef\temp{{\realbackslash subsubsecentry{#1}% {\appendixletter} {\the\secno}{\the\subsecno}{\the\subsubsecno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \appendixnoderef % \penalty 10000 % }} \outer\def\unnumberedsubsubsec{\parsearg\unnumberedsubsubsecyyy} \def\unnumberedsubsubsecyyy #1{\unnmhead3{#1}} %normally unnumberedsubsubseczzz \def\unnumberedsubsubseczzz #1{\seccheck{unnumberedsubsubsec}% \plainsecheading {#1}\gdef\thissection{#1}% {\chapternofonts% \edef\temp{{\realbackslash unnumbsubsubsecentry{#1}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \unnumbnoderef % \penalty 10000 % }} % These are variants which are not "outer", so they can appear in @ifinfo. % Actually, they should now be obsolete; ordinary section commands should work. \def\infotop{\parsearg\unnumberedzzz} \def\infounnumbered{\parsearg\unnumberedzzz} \def\infounnumberedsec{\parsearg\unnumberedseczzz} \def\infounnumberedsubsec{\parsearg\unnumberedsubseczzz} \def\infounnumberedsubsubsec{\parsearg\unnumberedsubsubseczzz} \def\infoappendix{\parsearg\appendixzzz} \def\infoappendixsec{\parsearg\appendixseczzz} \def\infoappendixsubsec{\parsearg\appendixsubseczzz} \def\infoappendixsubsubsec{\parsearg\appendixsubsubseczzz} \def\infochapter{\parsearg\chapterzzz} \def\infosection{\parsearg\sectionzzz} \def\infosubsection{\parsearg\subsectionzzz} \def\infosubsubsection{\parsearg\subsubsectionzzz} % These macros control what the section commands do, according % to what kind of chapter we are in (ordinary, appendix, or unnumbered). % Define them by default for a numbered chapter. \global\let\section = \numberedsec \global\let\subsection = \numberedsubsec \global\let\subsubsection = \numberedsubsubsec % Define @majorheading, @heading and @subheading % NOTE on use of \vbox for chapter headings, section headings, and % such: % 1) We use \vbox rather than the earlier \line to permit % overlong headings to fold. % 2) \hyphenpenalty is set to 10000 because hyphenation in a % heading is obnoxious; this forbids it. % 3) Likewise, headings look best if no \parindent is used, and % if justification is not attempted. Hence \raggedright. \def\majorheading{\parsearg\majorheadingzzz} \def\majorheadingzzz #1{% {\advance\chapheadingskip by 10pt \chapbreak }% {\chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}\bigskip \par\penalty 200} \def\chapheading{\parsearg\chapheadingzzz} \def\chapheadingzzz #1{\chapbreak % {\chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}\bigskip \par\penalty 200} \def\heading{\parsearg\secheadingi} \def\subheading{\parsearg\subsecheadingi} \def\subsubheading{\parsearg\subsubsecheadingi} % These macros generate a chapter, section, etc. heading only % (including whitespace, linebreaking, etc. around it), % given all the information in convenient, parsed form. %%% Args are the skip and penalty (usually negative) \def\dobreak#1#2{\par\ifdim\lastskip<#1\removelastskip\penalty#2\vskip#1\fi} \def\setchapterstyle #1 {\csname CHAPF#1\endcsname} %%% Define plain chapter starts, and page on/off switching for it % Parameter controlling skip before chapter headings (if needed) \newskip \chapheadingskip \chapheadingskip = 30pt plus 8pt minus 4pt \def\chapbreak{\dobreak \chapheadingskip {-4000}} \def\chappager{\par\vfill\supereject} \def\chapoddpage{\chappager \ifodd\pageno \else \hbox to 0pt{} \chappager\fi} \def\setchapternewpage #1 {\csname CHAPPAG#1\endcsname} \def\CHAPPAGoff{ \global\let\pchapsepmacro=\chapbreak \global\let\pagealignmacro=\chappager} \def\CHAPPAGon{ \global\let\pchapsepmacro=\chappager \global\let\pagealignmacro=\chappager \global\def\HEADINGSon{\HEADINGSsingle}} \def\CHAPPAGodd{ \global\let\pchapsepmacro=\chapoddpage \global\let\pagealignmacro=\chapoddpage \global\def\HEADINGSon{\HEADINGSdouble}} \CHAPPAGon \def\CHAPFplain{ \global\let\chapmacro=\chfplain \global\let\unnumbchapmacro=\unnchfplain} \def\chfplain #1#2{% \pchapsepmacro {% \chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #2\enspace #1}% }% \bigskip \penalty5000 } \def\unnchfplain #1{% \pchapsepmacro % {\chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}\bigskip \par\penalty 10000 % } \CHAPFplain % The default \def\unnchfopen #1{% \chapoddpage {\chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}\bigskip \par\penalty 10000 % } \def\chfopen #1#2{\chapoddpage {\chapfonts \vbox to 3in{\vfil \hbox to\hsize{\hfil #2} \hbox to\hsize{\hfil #1} \vfil}}% \par\penalty 5000 % } \def\CHAPFopen{ \global\let\chapmacro=\chfopen \global\let\unnumbchapmacro=\unnchfopen} % Parameter controlling skip before section headings. \newskip \subsecheadingskip \subsecheadingskip = 17pt plus 8pt minus 4pt \def\subsecheadingbreak{\dobreak \subsecheadingskip {-500}} \newskip \secheadingskip \secheadingskip = 21pt plus 8pt minus 4pt \def\secheadingbreak{\dobreak \secheadingskip {-1000}} % @paragraphindent is defined for the Info formatting commands only. \let\paragraphindent=\comment % Section fonts are the base font at magstep2, which produces % a size a bit more than 14 points in the default situation. \def\secheading #1#2#3{\secheadingi {#2.#3\enspace #1}} \def\plainsecheading #1{\secheadingi {#1}} \def\secheadingi #1{{\advance \secheadingskip by \parskip % \secheadingbreak}% {\secfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}% \ifdim \parskip<10pt \kern 10pt\kern -\parskip\fi \penalty 10000 } % Subsection fonts are the base font at magstep1, % which produces a size of 12 points. \def\subsecheading #1#2#3#4{\subsecheadingi {#2.#3.#4\enspace #1}} \def\subsecheadingi #1{{\advance \subsecheadingskip by \parskip % \subsecheadingbreak}% {\subsecfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}% \ifdim \parskip<10pt \kern 10pt\kern -\parskip\fi \penalty 10000 } \def\subsubsecfonts{\subsecfonts} % Maybe this should change: % Perhaps make sssec fonts scaled % magstep half \def\subsubsecheading #1#2#3#4#5{\subsubsecheadingi {#2.#3.#4.#5\enspace #1}} \def\subsubsecheadingi #1{{\advance \subsecheadingskip by \parskip % \subsecheadingbreak}% {\subsubsecfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}% \ifdim \parskip<10pt \kern 10pt\kern -\parskip\fi \penalty 10000} \message{toc printing,} % Finish up the main text and prepare to read what we've written % to \contentsfile. \newskip\contentsrightmargin \contentsrightmargin=1in \def\startcontents#1{% \pagealignmacro \immediate\closeout \contentsfile \ifnum \pageno>0 \pageno = -1 % Request roman numbered pages. \fi % Don't need to put `Contents' or `Short Contents' in the headline. % It is abundantly clear what they are. \unnumbchapmacro{#1}\def\thischapter{}% \begingroup % Set up to handle contents files properly. \catcode`\\=0 \catcode`\{=1 \catcode`\}=2 \catcode`\@=11 \catcode`\^=7 % to see ^^e4 as \"a etc. juha@piuha.ydi.vtt.fi \raggedbottom % Worry more about breakpoints than the bottom. \advance\hsize by -\contentsrightmargin % Don't use the full line length. } % Normal (long) toc. \outer\def\contents{% \startcontents{\putwordTableofContents}% \input \jobname.toc \endgroup \vfill \eject } % And just the chapters. \outer\def\summarycontents{% \startcontents{\putwordShortContents}% % \let\chapentry = \shortchapentry \let\unnumbchapentry = \shortunnumberedentry % We want a true roman here for the page numbers. \secfonts \let\rm=\shortcontrm \let\bf=\shortcontbf \let\sl=\shortcontsl \rm \advance\baselineskip by 1pt % Open it up a little. \def\secentry ##1##2##3##4{} \def\unnumbsecentry ##1##2{} \def\subsecentry ##1##2##3##4##5{} \def\unnumbsubsecentry ##1##2{} \def\subsubsecentry ##1##2##3##4##5##6{} \def\unnumbsubsubsecentry ##1##2{} \input \jobname.toc \endgroup \vfill \eject } \let\shortcontents = \summarycontents % These macros generate individual entries in the table of contents. % The first argument is the chapter or section name. % The last argument is the page number. % The arguments in between are the chapter number, section number, ... % Chapter-level things, for both the long and short contents. \def\chapentry#1#2#3{\dochapentry{#2\labelspace#1}{#3}} % See comments in \dochapentry re vbox and related settings \def\shortchapentry#1#2#3{% \tocentry{\shortchaplabel{#2}\labelspace #1}{\doshortpageno{#3}}% } % Typeset the label for a chapter or appendix for the short contents. % The arg is, e.g. `Appendix A' for an appendix, or `3' for a chapter. % We could simplify the code here by writing out an \appendixentry % command in the toc file for appendices, instead of using \chapentry % for both, but it doesn't seem worth it. \setbox0 = \hbox{\shortcontrm \putwordAppendix } \newdimen\shortappendixwidth \shortappendixwidth = \wd0 \def\shortchaplabel#1{% % We typeset #1 in a box of constant width, regardless of the text of % #1, so the chapter titles will come out aligned. \setbox0 = \hbox{#1}% \dimen0 = \ifdim\wd0 > \shortappendixwidth \shortappendixwidth \else 0pt \fi % % This space should be plenty, since a single number is .5em, and the % widest letter (M) is 1em, at least in the Computer Modern fonts. % (This space doesn't include the extra space that gets added after % the label; that gets put in in \shortchapentry above.) \advance\dimen0 by 1.1em \hbox to \dimen0{#1\hfil}% } \def\unnumbchapentry#1#2{\dochapentry{#1}{#2}} \def\shortunnumberedentry#1#2{\tocentry{#1}{\doshortpageno{#2}}} % Sections. \def\secentry#1#2#3#4{\dosecentry{#2.#3\labelspace#1}{#4}} \def\unnumbsecentry#1#2{\dosecentry{#1}{#2}} % Subsections. \def\subsecentry#1#2#3#4#5{\dosubsecentry{#2.#3.#4\labelspace#1}{#5}} \def\unnumbsubsecentry#1#2{\dosubsecentry{#1}{#2}} % And subsubsections. \def\subsubsecentry#1#2#3#4#5#6{% \dosubsubsecentry{#2.#3.#4.#5\labelspace#1}{#6}} \def\unnumbsubsubsecentry#1#2{\dosubsubsecentry{#1}{#2}} % This parameter controls the indentation of the various levels. \newdimen\tocindent \tocindent = 3pc % Now for the actual typesetting. In all these, #1 is the text and #2 is the % page number. % % If the toc has to be broken over pages, we would want to be at chapters % if at all possible; hence the \penalty. \def\dochapentry#1#2{% \penalty-300 \vskip\baselineskip \begingroup \chapentryfonts \tocentry{#1}{\dopageno{#2}}% \endgroup \nobreak\vskip .25\baselineskip } \def\dosecentry#1#2{\begingroup \secentryfonts \leftskip=\tocindent \tocentry{#1}{\dopageno{#2}}% \endgroup} \def\dosubsecentry#1#2{\begingroup \subsecentryfonts \leftskip=2\tocindent \tocentry{#1}{\dopageno{#2}}% \endgroup} \def\dosubsubsecentry#1#2{\begingroup \subsubsecentryfonts \leftskip=3\tocindent \tocentry{#1}{\dopageno{#2}}% \endgroup} % Final typesetting of a toc entry; we use the same \entry macro as for % the index entries, but we want to suppress hyphenation here. (We % can't do that in the \entry macro, since index entries might consist % of hyphenated-identifiers-that-do-not-fit-on-a-line-and-nothing-else.) % \def\tocentry#1#2{\begingroup \hyphenpenalty = 10000 \entry{#1}{#2}% \endgroup} % Space between chapter (or whatever) number and the title. \def\labelspace{\hskip1em \relax} \def\dopageno#1{{\rm #1}} \def\doshortpageno#1{{\rm #1}} \def\chapentryfonts{\secfonts \rm} \def\secentryfonts{\textfonts} \let\subsecentryfonts = \textfonts \let\subsubsecentryfonts = \textfonts \message{environments,} % Since these characters are used in examples, it should be an even number of % \tt widths. Each \tt character is 1en, so two makes it 1em. % Furthermore, these definitions must come after we define our fonts. \newbox\dblarrowbox \newbox\longdblarrowbox \newbox\pushcharbox \newbox\bullbox \newbox\equivbox \newbox\errorbox \let\ptexequiv = \equiv %{\tentt %\global\setbox\dblarrowbox = \hbox to 1em{\hfil$\Rightarrow$\hfil} %\global\setbox\longdblarrowbox = \hbox to 1em{\hfil$\mapsto$\hfil} %\global\setbox\pushcharbox = \hbox to 1em{\hfil$\dashv$\hfil} %\global\setbox\equivbox = \hbox to 1em{\hfil$\ptexequiv$\hfil} % Adapted from the manmac format (p.420 of TeXbook) %\global\setbox\bullbox = \hbox to 1em{\kern.15em\vrule height .75ex width .85ex % depth .1ex\hfil} %} \def\point{$\star$} \def\result{\leavevmode\raise.15ex\hbox to 1em{\hfil$\Rightarrow$\hfil}} \def\expansion{\leavevmode\raise.1ex\hbox to 1em{\hfil$\mapsto$\hfil}} \def\print{\leavevmode\lower.1ex\hbox to 1em{\hfil$\dashv$\hfil}} \def\equiv{\leavevmode\lower.1ex\hbox to 1em{\hfil$\ptexequiv$\hfil}} % Adapted from the TeXbook's \boxit. {\tentt \global\dimen0 = 3em}% Width of the box. \dimen2 = .55pt % Thickness of rules % The text. (`r' is open on the right, `e' somewhat less so on the left.) \setbox0 = \hbox{\kern-.75pt \tensf error\kern-1.5pt} \global\setbox\errorbox=\hbox to \dimen0{\hfil \hsize = \dimen0 \advance\hsize by -5.8pt % Space to left+right. \advance\hsize by -2\dimen2 % Rules. \vbox{ \hrule height\dimen2 \hbox{\vrule width\dimen2 \kern3pt % Space to left of text. \vtop{\kern2.4pt \box0 \kern2.4pt}% Space above/below. \kern3pt\vrule width\dimen2}% Space to right. \hrule height\dimen2} \hfil} % The @error{} command. \def\error{\leavevmode\lower.7ex\copy\errorbox} % @tex ... @end tex escapes into raw Tex temporarily. % One exception: @ is still an escape character, so that @end tex works. % But \@ or @@ will get a plain tex @ character. \def\tex{\begingroup \catcode `\\=0 \catcode `\{=1 \catcode `\}=2 \catcode `\$=3 \catcode `\&=4 \catcode `\#=6 \catcode `\^=7 \catcode `\_=8 \catcode `\~=13 \let~=\tie \catcode `\%=14 \catcode 43=12 \catcode`\"=12 \catcode`\==12 \catcode`\|=12 \catcode`\<=12 \catcode`\>=12 \escapechar=`\\ % \let\~=\ptextilde \let\{=\ptexlbrace \let\}=\ptexrbrace \let\.=\ptexdot \let\*=\ptexstar \let\dots=\ptexdots \def\@{@}% \let\bullet=\ptexbullet \let\b=\ptexb \let\c=\ptexc \let\i=\ptexi \let\t=\ptext \let\l=\ptexl \let\L=\ptexL % \let\Etex=\endgroup} % Define @lisp ... @endlisp. % @lisp does a \begingroup so it can rebind things, % including the definition of @endlisp (which normally is erroneous). % Amount to narrow the margins by for @lisp. \newskip\lispnarrowing \lispnarrowing=0.4in % This is the definition that ^^M gets inside @lisp, @example, and other % such environments. \null is better than a space, since it doesn't % have any width. \def\lisppar{\null\endgraf} % Make each space character in the input produce a normal interword % space in the output. Don't allow a line break at this space, as this % is used only in environments like @example, where each line of input % should produce a line of output anyway. % {\obeyspaces % \gdef\sepspaces{\obeyspaces\let =\tie}} % Define \obeyedspace to be our active space, whatever it is. This is % for use in \parsearg. {\sepspaces% \global\let\obeyedspace= } % This space is always present above and below environments. \newskip\envskipamount \envskipamount = 0pt % Make spacing and below environment symmetrical. We use \parskip here % to help in doing that, since in @example-like environments \parskip % is reset to zero; thus the \afterenvbreak inserts no space -- but the % start of the next paragraph will insert \parskip % \def\aboveenvbreak{{\advance\envskipamount by \parskip \endgraf \ifdim\lastskip<\envskipamount \removelastskip \penalty-50 \vskip\envskipamount \fi}} \let\afterenvbreak = \aboveenvbreak % \nonarrowing is a flag. If "set", @lisp etc don't narrow margins. \let\nonarrowing=\relax %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % \cartouche: draw rectangle w/rounded corners around argument \font\circle=lcircle10 \newdimen\circthick \newdimen\cartouter\newdimen\cartinner \newskip\normbskip\newskip\normpskip\newskip\normlskip \circthick=\fontdimen8\circle % \def\ctl{{\circle\char'013\hskip -6pt}}% 6pt from pl file: 1/2charwidth \def\ctr{{\hskip 6pt\circle\char'010}} \def\cbl{{\circle\char'012\hskip -6pt}} \def\cbr{{\hskip 6pt\circle\char'011}} \def\carttop{\hbox to \cartouter{\hskip\lskip \ctl\leaders\hrule height\circthick\hfil\ctr \hskip\rskip}} \def\cartbot{\hbox to \cartouter{\hskip\lskip \cbl\leaders\hrule height\circthick\hfil\cbr \hskip\rskip}} % \newskip\lskip\newskip\rskip \long\def\cartouche{% \begingroup \lskip=\leftskip \rskip=\rightskip \leftskip=0pt\rightskip=0pt %we want these *outside*. \cartinner=\hsize \advance\cartinner by-\lskip \advance\cartinner by-\rskip \cartouter=\hsize \advance\cartouter by 18pt % allow for 3pt kerns on either % side, and for 6pt waste from % each corner char \normbskip=\baselineskip \normpskip=\parskip \normlskip=\lineskip % Flag to tell @lisp, etc., not to narrow margin. \let\nonarrowing=\comment \vbox\bgroup \baselineskip=0pt\parskip=0pt\lineskip=0pt \carttop \hbox\bgroup \hskip\lskip \vrule\kern3pt \vbox\bgroup \hsize=\cartinner \kern3pt \begingroup \baselineskip=\normbskip \lineskip=\normlskip \parskip=\normpskip \vskip -\parskip \def\Ecartouche{% \endgroup \kern3pt \egroup \kern3pt\vrule \hskip\rskip \egroup \cartbot \egroup \endgroup }} % This macro is called at the beginning of all the @example variants, % inside a group. \def\nonfillstart{% \aboveenvbreak \inENV % This group ends at the end of the body \hfuzz = 12pt % Don't be fussy \sepspaces % Make spaces be word-separators rather than space tokens. \singlespace \let\par = \lisppar % don't ignore blank lines \obeylines % each line of input is a line of output \parskip = 0pt \parindent = 0pt \emergencystretch = 0pt % don't try to avoid overfull boxes % @cartouche defines \nonarrowing to inhibit narrowing % at next level down. \ifx\nonarrowing\relax \advance \leftskip by \lispnarrowing \exdentamount=\lispnarrowing \let\exdent=\nofillexdent \let\nonarrowing=\relax \fi } % To ending an @example-like environment, we first end the paragraph % (via \afterenvbreak's vertical glue), and then the group. That way we % keep the zero \parskip that the environments set -- \parskip glue % will be inserted at the beginning of the next paragraph in the % document, after the environment. % \def\nonfillfinish{\afterenvbreak\endgroup}% % This macro is \def\lisp{\begingroup \nonfillstart \let\Elisp = \nonfillfinish \tt \rawbackslash % have \ input char produce \ char from current font \gobble } % Define the \E... control sequence only if we are inside the % environment, so the error checking in \end will work. % % We must call \lisp last in the definition, since it reads the % return following the @example (or whatever) command. % \def\example{\begingroup \def\Eexample{\nonfillfinish\endgroup}\lisp} \def\smallexample{\begingroup \def\Esmallexample{\nonfillfinish\endgroup}\lisp} \def\smalllisp{\begingroup \def\Esmalllisp{\nonfillfinish\endgroup}\lisp} % @smallexample and @smalllisp. This is not used unless the @smallbook % command is given. Originally contributed by Pavel@xerox. % \def\smalllispx{\begingroup \nonfillstart \let\Esmalllisp = \nonfillfinish \let\Esmallexample = \nonfillfinish % % Smaller interline space and fonts for small examples. \setleading{10pt}% \indexfonts \tt \rawbackslash % make \ output the \ character from the current font (tt) \gobble } % This is @display; same as @lisp except use roman font. % \def\display{\begingroup \nonfillstart \let\Edisplay = \nonfillfinish \gobble } % This is @format; same as @display except don't narrow margins. % \def\format{\begingroup \let\nonarrowing = t \nonfillstart \let\Eformat = \nonfillfinish \gobble } % @flushleft (same as @format) and @flushright. % \def\flushleft{\begingroup \let\nonarrowing = t \nonfillstart \let\Eflushleft = \nonfillfinish \gobble } \def\flushright{\begingroup \let\nonarrowing = t \nonfillstart \let\Eflushright = \nonfillfinish \advance\leftskip by 0pt plus 1fill \gobble} % @quotation does normal linebreaking (hence we can't use \nonfillstart) % and narrows the margins. % \def\quotation{% \begingroup\inENV %This group ends at the end of the @quotation body {\parskip=0pt \aboveenvbreak}% because \aboveenvbreak inserts \parskip \singlespace \parindent=0pt % We have retained a nonzero parskip for the environment, since we're % doing normal filling. So to avoid extra space below the environment... \def\Equotation{\parskip = 0pt \nonfillfinish}% % % @cartouche defines \nonarrowing to inhibit narrowing at next level down. \ifx\nonarrowing\relax \advance\leftskip by \lispnarrowing \advance\rightskip by \lispnarrowing \exdentamount = \lispnarrowing \let\nonarrowing = \relax \fi } \message{defuns,} % Define formatter for defuns % First, allow user to change definition object font (\df) internally \def\setdeffont #1 {\csname DEF#1\endcsname} \newskip\defbodyindent \defbodyindent=.4in \newskip\defargsindent \defargsindent=50pt \newskip\deftypemargin \deftypemargin=12pt \newskip\deflastargmargin \deflastargmargin=18pt \newcount\parencount % define \functionparens, which makes ( and ) and & do special things. % \functionparens affects the group it is contained in. \def\activeparens{% \catcode`\(=\active \catcode`\)=\active \catcode`\&=\active \catcode`\[=\active \catcode`\]=\active} % Make control sequences which act like normal parenthesis chars. \let\lparen = ( \let\rparen = ) {\activeparens % Now, smart parens don't turn on until &foo (see \amprm) % Be sure that we always have a definition for `(', etc. For example, % if the fn name has parens in it, \boldbrax will not be in effect yet, % so TeX would otherwise complain about undefined control sequence. \global\let(=\lparen \global\let)=\rparen \global\let[=\lbrack \global\let]=\rbrack \gdef\functionparens{\boldbrax\let&=\amprm\parencount=0 } \gdef\boldbrax{\let(=\opnr\let)=\clnr\let[=\lbrb\let]=\rbrb} % This is used to turn on special parens % but make & act ordinary (given that it's active). \gdef\boldbraxnoamp{\let(=\opnr\let)=\clnr\let[=\lbrb\let]=\rbrb\let&=\ampnr} % Definitions of (, ) and & used in args for functions. % This is the definition of ( outside of all parentheses. \gdef\oprm#1 {{\rm\char`\(}#1 \bf \let(=\opnested % \global\advance\parencount by 1 } % % This is the definition of ( when already inside a level of parens. \gdef\opnested{\char`\(\global\advance\parencount by 1 } % \gdef\clrm{% Print a paren in roman if it is taking us back to depth of 0. % also in that case restore the outer-level definition of (. \ifnum \parencount=1 {\rm \char `\)}\sl \let(=\oprm \else \char `\) \fi \global\advance \parencount by -1 } % If we encounter &foo, then turn on ()-hacking afterwards \gdef\amprm#1 {{\rm\}\let(=\oprm \let)=\clrm\ } % \gdef\normalparens{\boldbrax\let&=\ampnr} } % End of definition inside \activeparens %% These parens (in \boldbrax) actually are a little bolder than the %% contained text. This is especially needed for [ and ] \def\opnr{{\sf\char`\(}} \def\clnr{{\sf\char`\)}} \def\ampnr{\&} \def\lbrb{{\bf\char`\[}} \def\rbrb{{\bf\char`\]}} % First, defname, which formats the header line itself. % #1 should be the function name. % #2 should be the type of definition, such as "Function". \def\defname #1#2{% % Get the values of \leftskip and \rightskip as they were % outside the @def... \dimen2=\leftskip \advance\dimen2 by -\defbodyindent \dimen3=\rightskip \advance\dimen3 by -\defbodyindent \noindent % \setbox0=\hbox{\hskip \deflastargmargin{\rm #2}\hskip \deftypemargin}% \dimen0=\hsize \advance \dimen0 by -\wd0 % compute size for first line \dimen1=\hsize \advance \dimen1 by -\defargsindent %size for continuations \parshape 2 0in \dimen0 \defargsindent \dimen1 % % Now output arg 2 ("Function" or some such) % ending at \deftypemargin from the right margin, % but stuck inside a box of width 0 so it does not interfere with linebreaking {% Adjust \hsize to exclude the ambient margins, % so that \rightline will obey them. \advance \hsize by -\dimen2 \advance \hsize by -\dimen3 \rlap{\rightline{{\rm #2}\hskip \deftypemargin}}}% % Make all lines underfull and no complaints: \tolerance=10000 \hbadness=10000 \advance\leftskip by -\defbodyindent \exdentamount=\defbodyindent {\df #1}\enskip % Generate function name } % Actually process the body of a definition % #1 should be the terminating control sequence, such as \Edefun. % #2 should be the "another name" control sequence, such as \defunx. % #3 should be the control sequence that actually processes the header, % such as \defunheader. \def\defparsebody #1#2#3{\begingroup\inENV% Environment for definitionbody \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2{\begingroup\obeylines\activeparens\spacesplit#3}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup % \catcode 61=\active % 61 is `=' \obeylines\activeparens\spacesplit#3} \def\defmethparsebody #1#2#3#4 {\begingroup\inENV % \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2##1 {\begingroup\obeylines\activeparens\spacesplit{#3{##1}}}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup\obeylines\activeparens\spacesplit{#3{#4}}} \def\defopparsebody #1#2#3#4#5 {\begingroup\inENV % \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2##1 ##2 {\def#4{##1}% \begingroup\obeylines\activeparens\spacesplit{#3{##2}}}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup\obeylines\activeparens\spacesplit{#3{#5}}} % These parsing functions are similar to the preceding ones % except that they do not make parens into active characters. % These are used for "variables" since they have no arguments. \def\defvarparsebody #1#2#3{\begingroup\inENV% Environment for definitionbody \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2{\begingroup\obeylines\spacesplit#3}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup % \catcode 61=\active % \obeylines\spacesplit#3} % This is used for \def{tp,vr}parsebody. It could probably be used for % some of the others, too, with some judicious conditionals. % \def\parsebodycommon#1#2#3{% \begingroup\inENV % \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2##1 {\begingroup\obeylines\spacesplit{#3{##1}}}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup\obeylines } \def\defvrparsebody#1#2#3#4 {% \parsebodycommon{#1}{#2}{#3}% \spacesplit{#3{#4}}% } % This loses on `@deftp {Data Type} {struct termios}' -- it thinks the % type is just `struct', because we lose the braces in `{struct % termios}' when \spacesplit reads its undelimited argument. Sigh. % \let\deftpparsebody=\defvrparsebody % % So, to get around this, we put \empty in with the type name. That % way, TeX won't find exactly `{...}' as an undelimited argument, and % won't strip off the braces. % \def\deftpparsebody #1#2#3#4 {% \parsebodycommon{#1}{#2}{#3}% \spacesplit{\parsetpheaderline{#3{#4}}}\empty } % Fine, but then we have to eventually remove the \empty *and* the % braces (if any). That's what this does, putting the result in \tptemp. % \def\removeemptybraces\empty#1\relax{\def\tptemp{#1}}% % After \spacesplit has done its work, this is called -- #1 is the final % thing to call, #2 the type name (which starts with \empty), and #3 % (which might be empty) the arguments. % \def\parsetpheaderline#1#2#3{% \removeemptybraces#2\relax #1{\tptemp}{#3}% }% \def\defopvarparsebody #1#2#3#4#5 {\begingroup\inENV % \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2##1 ##2 {\def#4{##1}% \begingroup\obeylines\spacesplit{#3{##2}}}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup\obeylines\spacesplit{#3{#5}}} % Split up #2 at the first space token. % call #1 with two arguments: % the first is all of #2 before the space token, % the second is all of #2 after that space token. % If #2 contains no space token, all of it is passed as the first arg % and the second is passed as empty. {\obeylines \gdef\spacesplit#1#2^^M{\endgroup\spacesplitfoo{#1}#2 \relax\spacesplitfoo}% \long\gdef\spacesplitfoo#1#2 #3#4\spacesplitfoo{% \ifx\relax #3% #1{#2}{}\else #1{#2}{#3#4}\fi}} % So much for the things common to all kinds of definitions. % Define @defun. % First, define the processing that is wanted for arguments of \defun % Use this to expand the args and terminate the paragraph they make up \def\defunargs #1{\functionparens \sl % Expand, preventing hyphenation at `-' chars. % Note that groups don't affect changes in \hyphenchar. \hyphenchar\tensl=0 #1% \hyphenchar\tensl=45 \ifnum\parencount=0 \else \errmessage{unbalanced parens in @def arguments}\fi% \interlinepenalty=10000 \advance\rightskip by 0pt plus 1fil \endgraf\penalty 10000\vskip -\parskip\penalty 10000% } \def\deftypefunargs #1{% % Expand, preventing hyphenation at `-' chars. % Note that groups don't affect changes in \hyphenchar. % Use \boldbraxnoamp, not \functionparens, so that & is not special. \boldbraxnoamp \tclose{#1}% avoid \code because of side effects on active chars \interlinepenalty=10000 \advance\rightskip by 0pt plus 1fil \endgraf\penalty 10000\vskip -\parskip\penalty 10000% } % Do complete processing of one @defun or @defunx line already parsed. % @deffn Command forward-char nchars \def\deffn{\defmethparsebody\Edeffn\deffnx\deffnheader} \def\deffnheader #1#2#3{\doind {fn}{\code{#2}}% \begingroup\defname {#2}{#1}\defunargs{#3}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @defun == @deffn Function \def\defun{\defparsebody\Edefun\defunx\defunheader} \def\defunheader #1#2{\doind {fn}{\code{#1}}% Make entry in function index \begingroup\defname {#1}{Function}% \defunargs {#2}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @deftypefun int foobar (int @var{foo}, float @var{bar}) \def\deftypefun{\defparsebody\Edeftypefun\deftypefunx\deftypefunheader} % #1 is the data type. #2 is the name and args. \def\deftypefunheader #1#2{\deftypefunheaderx{#1}#2 \relax} % #1 is the data type, #2 the name, #3 the args. \def\deftypefunheaderx #1#2 #3\relax{% \doind {fn}{\code{#2}}% Make entry in function index \begingroup\defname {\defheaderxcond#1\relax$$$#2}{Function}% \deftypefunargs {#3}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @deftypefn {Library Function} int foobar (int @var{foo}, float @var{bar}) \def\deftypefn{\defmethparsebody\Edeftypefn\deftypefnx\deftypefnheader} % \defheaderxcond#1\relax$$$ % puts #1 in @code, followed by a space, but does nothing if #1 is null. \def\defheaderxcond#1#2$$${\ifx#1\relax\else\code{#1#2} \fi} % #1 is the classification. #2 is the data type. #3 is the name and args. \def\deftypefnheader #1#2#3{\deftypefnheaderx{#1}{#2}#3 \relax} % #1 is the classification, #2 the data type, #3 the name, #4 the args. \def\deftypefnheaderx #1#2#3 #4\relax{% \doind {fn}{\code{#3}}% Make entry in function index \begingroup \normalparens % notably, turn off `&' magic, which prevents % at least some C++ text from working \defname {\defheaderxcond#2\relax$$$#3}{#1}% \deftypefunargs {#4}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @defmac == @deffn Macro \def\defmac{\defparsebody\Edefmac\defmacx\defmacheader} \def\defmacheader #1#2{\doind {fn}{\code{#1}}% Make entry in function index \begingroup\defname {#1}{Macro}% \defunargs {#2}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @defspec == @deffn Special Form \def\defspec{\defparsebody\Edefspec\defspecx\defspecheader} \def\defspecheader #1#2{\doind {fn}{\code{#1}}% Make entry in function index \begingroup\defname {#1}{Special Form}% \defunargs {#2}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % This definition is run if you use @defunx % anywhere other than immediately after a @defun or @defunx. \def\deffnx #1 {\errmessage{@deffnx in invalid context}} \def\defunx #1 {\errmessage{@defunx in invalid context}} \def\defmacx #1 {\errmessage{@defmacx in invalid context}} \def\defspecx #1 {\errmessage{@defspecx in invalid context}} \def\deftypefnx #1 {\errmessage{@deftypefnx in invalid context}} \def\deftypeunx #1 {\errmessage{@deftypeunx in invalid context}} % @defmethod, and so on % @defop {Funny Method} foo-class frobnicate argument \def\defop #1 {\def\defoptype{#1}% \defopparsebody\Edefop\defopx\defopheader\defoptype} \def\defopheader #1#2#3{% \dosubind {fn}{\code{#2}}{on #1}% Make entry in function index \begingroup\defname {#2}{\defoptype{} on #1}% \defunargs {#3}\endgroup % } % @defmethod == @defop Method \def\defmethod{\defmethparsebody\Edefmethod\defmethodx\defmethodheader} \def\defmethodheader #1#2#3{% \dosubind {fn}{\code{#2}}{on #1}% entry in function index \begingroup\defname {#2}{Method on #1}% \defunargs {#3}\endgroup % } % @defcv {Class Option} foo-class foo-flag \def\defcv #1 {\def\defcvtype{#1}% \defopvarparsebody\Edefcv\defcvx\defcvarheader\defcvtype} \def\defcvarheader #1#2#3{% \dosubind {vr}{\code{#2}}{of #1}% Make entry in var index \begingroup\defname {#2}{\defcvtype{} of #1}% \defvarargs {#3}\endgroup % } % @defivar == @defcv {Instance Variable} \def\defivar{\defvrparsebody\Edefivar\defivarx\defivarheader} \def\defivarheader #1#2#3{% \dosubind {vr}{\code{#2}}{of #1}% Make entry in var index \begingroup\defname {#2}{Instance Variable of #1}% \defvarargs {#3}\endgroup % } % These definitions are run if you use @defmethodx, etc., % anywhere other than immediately after a @defmethod, etc. \def\defopx #1 {\errmessage{@defopx in invalid context}} \def\defmethodx #1 {\errmessage{@defmethodx in invalid context}} \def\defcvx #1 {\errmessage{@defcvx in invalid context}} \def\defivarx #1 {\errmessage{@defivarx in invalid context}} % Now @defvar % First, define the processing that is wanted for arguments of @defvar. % This is actually simple: just print them in roman. % This must expand the args and terminate the paragraph they make up \def\defvarargs #1{\normalparens #1% \interlinepenalty=10000 \endgraf\penalty 10000\vskip -\parskip\penalty 10000} % @defvr Counter foo-count \def\defvr{\defvrparsebody\Edefvr\defvrx\defvrheader} \def\defvrheader #1#2#3{\doind {vr}{\code{#2}}% \begingroup\defname {#2}{#1}\defvarargs{#3}\endgroup} % @defvar == @defvr Variable \def\defvar{\defvarparsebody\Edefvar\defvarx\defvarheader} \def\defvarheader #1#2{\doind {vr}{\code{#1}}% Make entry in var index \begingroup\defname {#1}{Variable}% \defvarargs {#2}\endgroup % } % @defopt == @defvr {User Option} \def\defopt{\defvarparsebody\Edefopt\defoptx\defoptheader} \def\defoptheader #1#2{\doind {vr}{\code{#1}}% Make entry in var index \begingroup\defname {#1}{User Option}% \defvarargs {#2}\endgroup % } % @deftypevar int foobar \def\deftypevar{\defvarparsebody\Edeftypevar\deftypevarx\deftypevarheader} % #1 is the data type. #2 is the name. \def\deftypevarheader #1#2{% \doind {vr}{\code{#2}}% Make entry in variables index \begingroup\defname {\defheaderxcond#1\relax$$$#2}{Variable}% \interlinepenalty=10000 \endgraf\penalty 10000\vskip -\parskip\penalty 10000 \endgroup} % @deftypevr {Global Flag} int enable \def\deftypevr{\defvrparsebody\Edeftypevr\deftypevrx\deftypevrheader} \def\deftypevrheader #1#2#3{\doind {vr}{\code{#3}}% \begingroup\defname {\defheaderxcond#2\relax$$$#3}{#1} \interlinepenalty=10000 \endgraf\penalty 10000\vskip -\parskip\penalty 10000 \endgroup} % This definition is run if you use @defvarx % anywhere other than immediately after a @defvar or @defvarx. \def\defvrx #1 {\errmessage{@defvrx in invalid context}} \def\defvarx #1 {\errmessage{@defvarx in invalid context}} \def\defoptx #1 {\errmessage{@defoptx in invalid context}} \def\deftypevarx #1 {\errmessage{@deftypevarx in invalid context}} \def\deftypevrx #1 {\errmessage{@deftypevrx in invalid context}} % Now define @deftp % Args are printed in bold, a slight difference from @defvar. \def\deftpargs #1{\bf \defvarargs{#1}} % @deftp Class window height width ... \def\deftp{\deftpparsebody\Edeftp\deftpx\deftpheader} \def\deftpheader #1#2#3{\doind {tp}{\code{#2}}% \begingroup\defname {#2}{#1}\deftpargs{#3}\endgroup} % This definition is run if you use @deftpx, etc % anywhere other than immediately after a @deftp, etc. \def\deftpx #1 {\errmessage{@deftpx in invalid context}} \message{cross reference,} % Define cross-reference macros \newwrite \auxfile \newif\ifhavexrefs % True if xref values are known. \newif\ifwarnedxrefs % True if we warned once that they aren't known. % \setref{foo} defines a cross-reference point named foo. \def\setref#1{% \dosetq{#1-title}{Ytitle}% \dosetq{#1-pg}{Ypagenumber}% \dosetq{#1-snt}{Ysectionnumberandtype}} \def\unnumbsetref#1{% \dosetq{#1-title}{Ytitle}% \dosetq{#1-pg}{Ypagenumber}% \dosetq{#1-snt}{Ynothing}} \def\appendixsetref#1{% \dosetq{#1-title}{Ytitle}% \dosetq{#1-pg}{Ypagenumber}% \dosetq{#1-snt}{Yappendixletterandtype}} % \xref, \pxref, and \ref generate cross-references to specified points. % For \xrefX, #1 is the node name, #2 the name of the Info % cross-reference, #3 the printed node name, #4 the name of the Info % file, #5 the name of the printed manual. All but the node name can be % omitted. % \def\pxref#1{\putwordsee{} \xrefX[#1,,,,,,,]} \def\xref#1{\putwordSee{} \xrefX[#1,,,,,,,]} \def\ref#1{\xrefX[#1,,,,,,,]} \def\xrefX[#1,#2,#3,#4,#5,#6]{\begingroup \def\printedmanual{\ignorespaces #5}% \def\printednodename{\ignorespaces #3}% \setbox1=\hbox{\printedmanual}% \setbox0=\hbox{\printednodename}% \ifdim \wd0 = 0pt % No printed node name was explicitly given. \ifx\SETxref-automatic-section-title\relax % % Use the actual chapter/section title appear inside % the square brackets. Use the real section title if we have it. \ifdim \wd1>0pt% % It is in another manual, so we don't have it. \def\printednodename{\ignorespaces #1}% \else \ifhavexrefs % We know the real title if we have the xref values. \def\printednodename{\refx{#1-title}}% \else % Otherwise just copy the Info node name. \def\printednodename{\ignorespaces #1}% \fi% \fi \def\printednodename{#1-title}% \else % Use the node name inside the square brackets. \def\printednodename{\ignorespaces #1}% \fi \fi % % If we use \unhbox0 and \unhbox1 to print the node names, TeX does not % insert empty discretionaries after hyphens, which means that it will % not find a line break at a hyphen in a node names. Since some manuals % are best written with fairly long node names, containing hyphens, this % is a loss. Therefore, we give the text of the node name again, so it % is as if TeX is seeing it for the first time. \ifdim \wd1 > 0pt \putwordsection{} ``\printednodename'' in \cite{\printedmanual}% \else % _ (for example) has to be the character _ for the purposes of the % control sequence corresponding to the node, but it has to expand % into the usual \leavevmode...\vrule stuff for purposes of % printing. So we \turnoffactive for the \refx-snt, back on for the % printing, back off for the \refx-pg. {\turnoffactive \refx{#1-snt}{}}% \space [\printednodename],\space \turnoffactive \putwordpage\tie\refx{#1-pg}{}% \fi \endgroup} % \dosetq is the interface for calls from other macros % Use \turnoffactive so that punctuation chars such as underscore % work in node names. \def\dosetq #1#2{{\let\folio=0 \turnoffactive \auxhat% \edef\next{\write\auxfile{\internalsetq {#1}{#2}}}% \next}} % \internalsetq {foo}{page} expands into % CHARACTERS 'xrdef {foo}{...expansion of \Ypage...} % When the aux file is read, ' is the escape character \def\internalsetq #1#2{'xrdef {#1}{\csname #2\endcsname}} % Things to be expanded by \internalsetq \def\Ypagenumber{\folio} \def\Ytitle{\thissection} \def\Ynothing{} \def\Ysectionnumberandtype{% \ifnum\secno=0 \putwordChapter\xreftie\the\chapno % \else \ifnum \subsecno=0 \putwordSection\xreftie\the\chapno.\the\secno % \else \ifnum \subsubsecno=0 % \putwordSection\xreftie\the\chapno.\the\secno.\the\subsecno % \else % \putwordSection\xreftie\the\chapno.\the\secno.\the\subsecno.\the\subsubsecno % \fi \fi \fi } \def\Yappendixletterandtype{% \ifnum\secno=0 \putwordAppendix\xreftie'char\the\appendixno{}% \else \ifnum \subsecno=0 \putwordSection\xreftie'char\the\appendixno.\the\secno % \else \ifnum \subsubsecno=0 % \putwordSection\xreftie'char\the\appendixno.\the\secno.\the\subsecno % \else % \putwordSection\xreftie'char\the\appendixno.\the\secno.\the\subsecno.\the\subsubsecno % \fi \fi \fi } \gdef\xreftie{'tie} % Use TeX 3.0's \inputlineno to get the line number, for better error % messages, but if we're using an old version of TeX, don't do anything. % \ifx\inputlineno\thisisundefined \let\linenumber = \empty % Non-3.0. \else \def\linenumber{\the\inputlineno:\space} \fi % Define \refx{NAME}{SUFFIX} to reference a cross-reference string named NAME. % If its value is nonempty, SUFFIX is output afterward. \def\refx#1#2{% \expandafter\ifx\csname X#1\endcsname\relax % If not defined, say something at least. $\langle$un\-de\-fined$\rangle$% \ifhavexrefs \message{\linenumber Undefined cross reference `#1'.}% \else \ifwarnedxrefs\else \global\warnedxrefstrue \message{Cross reference values unknown; you must run TeX again.}% \fi \fi \else % It's defined, so just use it. \csname X#1\endcsname \fi #2% Output the suffix in any case. } % Read the last existing aux file, if any. No error if none exists. % This is the macro invoked by entries in the aux file. \def\xrdef #1#2{ {\catcode`\'=\other\expandafter \gdef \csname X#1\endcsname {#2}}} \def\readauxfile{% \begingroup \catcode `\^^@=\other \catcode `\=\other \catcode `\=\other \catcode `\^^C=\other \catcode `\^^D=\other \catcode `\^^E=\other \catcode `\^^F=\other \catcode `\^^G=\other \catcode `\^^H=\other \catcode `\ =\other \catcode `\^^L=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode 26=\other \catcode `\^^[=\other \catcode `\^^\=\other \catcode `\^^]=\other \catcode `\^^^=\other \catcode `\^^_=\other \catcode `\@=\other \catcode `\^=\other \catcode `\~=\other \catcode `\[=\other \catcode `\]=\other \catcode`\"=\other \catcode`\_=\other \catcode`\|=\other \catcode`\<=\other \catcode`\>=\other \catcode `\$=\other \catcode `\#=\other \catcode `\&=\other % `\+ does not work, so use 43. \catcode 43=\other % Make the characters 128-255 be printing characters {% \count 1=128 \def\loop{% \catcode\count 1=\other \advance\count 1 by 1 \ifnum \count 1<256 \loop \fi }% }% % the aux file uses ' as the escape. % Turn off \ as an escape so we do not lose on % entries which were dumped with control sequences in their names. % For example, 'xrdef {$\leq $-fun}{page ...} made by @defun ^^ % Reference to such entries still does not work the way one would wish, % but at least they do not bomb out when the aux file is read in. \catcode `\{=1 \catcode `\}=2 \catcode `\%=\other \catcode `\'=0 \catcode`\^=7 % to make ^^e4 etc usable in xref tags \catcode `\\=\other \openin 1 \jobname.aux \ifeof 1 \else \closein 1 \input \jobname.aux \global\havexrefstrue \global\warnedobstrue \fi % Open the new aux file. Tex will close it automatically at exit. \openout \auxfile=\jobname.aux \endgroup} % Footnotes. \newcount \footnoteno % The trailing space in the following definition for supereject is % vital for proper filling; pages come out unaligned when you do a % pagealignmacro call if that space before the closing brace is % removed. \def\supereject{\par\penalty -20000\footnoteno =0 } % @footnotestyle is meaningful for info output only.. \let\footnotestyle=\comment \let\ptexfootnote=\footnote {\catcode `\@=11 % % Auto-number footnotes. Otherwise like plain. \gdef\footnote{% \global\advance\footnoteno by \@ne \edef\thisfootno{$^{\the\footnoteno}$}% % % In case the footnote comes at the end of a sentence, preserve the % extra spacing after we do the footnote number. \let\@sf\empty \ifhmode\edef\@sf{\spacefactor\the\spacefactor}\/\fi % % Remove inadvertent blank space before typesetting the footnote number. \unskip \thisfootno\@sf \footnotezzz }% % Don't bother with the trickery in plain.tex to not require the % footnote text as a parameter. Our footnotes don't need to be so general. % \long\gdef\footnotezzz#1{\insert\footins{% % We want to typeset this text as a normal paragraph, even if the % footnote reference occurs in (for example) a display environment. % So reset some parameters. \interlinepenalty\interfootnotelinepenalty \splittopskip\ht\strutbox % top baseline for broken footnotes \splitmaxdepth\dp\strutbox \floatingpenalty\@MM \leftskip\z@skip \rightskip\z@skip \spaceskip\z@skip \xspaceskip\z@skip \parindent\defaultparindent % % Hang the footnote text off the number. \hang \textindent{\thisfootno}% % % Don't crash into the line above the footnote text. Since this % expands into a box, it must come within the paragraph, lest it % provide a place where TeX can split the footnote. \footstrut #1\strut}% } }%end \catcode `\@=11 % Set the baselineskip to #1, and the lineskip and strut size % correspondingly. There is no deep meaning behind these magic numbers % used as factors; they just match (closely enough) what Knuth defined. % \def\lineskipfactor{.08333} \def\strutheightpercent{.70833} \def\strutdepthpercent {.29167} % \def\setleading#1{% \normalbaselineskip = #1\relax \normallineskip = \lineskipfactor\normalbaselineskip \normalbaselines \setbox\strutbox =\hbox{% \vrule width0pt height\strutheightpercent\baselineskip depth \strutdepthpercent \baselineskip }% } % @| inserts a changebar to the left of the current line. It should % surround any changed text. This approach does *not* work if the % change spans more than two lines of output. To handle that, we would % have adopt a much more difficult approach (putting marks into the main % vertical list for the beginning and end of each change). % \def\|{% % \vadjust can only be used in horizontal mode. \leavevmode % % Append this vertical mode material after the current line in the output. \vadjust{% % We want to insert a rule with the height and depth of the current % leading; that is exactly what \strutbox is supposed to record. \vskip-\baselineskip % % \vadjust-items are inserted at the left edge of the type. So % the \llap here moves out into the left-hand margin. \llap{% % % For a thicker or thinner bar, change the `1pt'. \vrule height\baselineskip width1pt % % This is the space between the bar and the text. \hskip 12pt }% }% } % For a final copy, take out the rectangles % that mark overfull boxes (in case you have decided % that the text looks ok even though it passes the margin). % \def\finalout{\overfullrule=0pt} % End of control word definitions. \message{and turning on texinfo input format.} \def\openindices{% \newindex{cp}% \newcodeindex{fn}% \newcodeindex{vr}% \newcodeindex{tp}% \newcodeindex{ky}% \newcodeindex{pg}% } % Set some numeric style parameters, for 8.5 x 11 format. %\hsize = 6.5in \newdimen\defaultparindent \defaultparindent = 15pt \parindent = \defaultparindent \parskip 18pt plus 1pt \setleading{15pt} \advance\topskip by 1.2cm % Prevent underfull vbox error messages. \vbadness=10000 % Following George Bush, just get rid of widows and orphans. \widowpenalty=10000 \clubpenalty=10000 % Use TeX 3.0's \emergencystretch to help line breaking, but if we're % using an old version of TeX, don't do anything. We want the amount of % stretch added to depend on the line length, hence the dependence on % \hsize. This makes it come to about 9pt for the 8.5x11 format. % \ifx\emergencystretch\thisisundefined % Allow us to assign to \emergencystretch anyway. \def\emergencystretch{\dimen0}% \else \emergencystretch = \hsize \divide\emergencystretch by 45 \fi % Use @smallbook to reset parameters for 7x9.5 format (or else 7x9.25) \def\smallbook{ % These values for secheadingskip and subsecheadingskip are % experiments. RJC 7 Aug 1992 \global\secheadingskip = 17pt plus 6pt minus 3pt \global\subsecheadingskip = 14pt plus 6pt minus 3pt \global\lispnarrowing = 0.3in \setleading{12pt} \advance\topskip by -1cm \global\parskip 3pt plus 1pt \global\hsize = 5in \global\vsize=7.5in \global\tolerance=700 \global\hfuzz=1pt \global\contentsrightmargin=0pt \global\deftypemargin=0pt \global\defbodyindent=.5cm \global\pagewidth=\hsize \global\pageheight=\vsize \global\let\smalllisp=\smalllispx \global\let\smallexample=\smalllispx \global\def\Esmallexample{\Esmalllisp} } % Use @afourpaper to print on European A4 paper. \def\afourpaper{ \global\tolerance=700 \global\hfuzz=1pt \setleading{12pt} \global\parskip 15pt plus 1pt \global\vsize= 53\baselineskip \advance\vsize by \topskip %\global\hsize= 5.85in % A4 wide 10pt \global\hsize= 6.5in \global\outerhsize=\hsize \global\advance\outerhsize by 0.5in \global\outervsize=\vsize \global\advance\outervsize by 0.6in \global\pagewidth=\hsize \global\pageheight=\vsize } % Allow control of the text dimensions. Parameters in order: textheight; % textwidth; \voffset; \hoffset (!); binding offset. All require a dimension; % header is additional; added length extends the bottom of the page. \def\changepagesizes#1#2#3#4#5{ \global\vsize= #1 \advance\vsize by \topskip \global\voffset= #3 \global\hsize= #2 \global\outerhsize=\hsize \global\advance\outerhsize by 0.5in \global\outervsize=\vsize \global\advance\outervsize by 0.6in \global\pagewidth=\hsize \global\pageheight=\vsize \global\normaloffset= #4 \global\bindingoffset= #5} % This layout is compatible with Latex on A4 paper. \def\afourlatex{\changepagesizes{22cm}{15cm}{7mm}{4.6mm}{5mm}} % Use @afourwide to print on European A4 paper in wide format. \def\afourwide{\afourpaper \changepagesizes{9.5in}{6.5in}{\hoffset}{\normaloffset}{\bindingoffset}} % Define macros to output various characters with catcode for normal text. \catcode`\"=\other \catcode`\~=\other \catcode`\^=\other \catcode`\_=\other \catcode`\|=\other \catcode`\<=\other \catcode`\>=\other \catcode`\+=\other \def\normaldoublequote{"} \def\normaltilde{~} \def\normalcaret{^} \def\normalunderscore{_} \def\normalverticalbar{|} \def\normalless{<} \def\normalgreater{>} \def\normalplus{+} % This macro is used to make a character print one way in ttfont % where it can probably just be output, and another way in other fonts, % where something hairier probably needs to be done. % % #1 is what to print if we are indeed using \tt; #2 is what to print % otherwise. Since all the Computer Modern typewriter fonts have zero % interword stretch (and shrink), and it is reasonable to expect all % typewriter fonts to have this, we can check that font parameter. % \def\ifusingtt#1#2{\ifdim \fontdimen3\the\font=0pt #1\else #2\fi} % Turn off all special characters except @ % (and those which the user can use as if they were ordinary). % Most of these we simply print from the \tt font, but for some, we can % use math or other variants that look better in normal text. \catcode`\"=\active \def\activedoublequote{{\tt \char '042}} \let"=\activedoublequote \catcode`\~=\active \def~{{\tt \char '176}} \chardef\hat=`\^ \catcode`\^=\active \def\auxhat{\def^{'hat}} \def^{{\tt \hat}} \catcode`\_=\active \def_{\ifusingtt\normalunderscore\_} % Subroutine for the previous macro. \def\_{\lvvmode \kern.06em \vbox{\hrule width.3em height.1ex}} % \lvvmode is equivalent in function to \leavevmode. % Using \leavevmode runs into trouble when written out to % an index file due to the expansion of \leavevmode into ``\unhbox % \voidb@x'' ---which looks to TeX like ``\unhbox \voidb\x'' due to our % magic tricks with @. \def\lvvmode{\vbox to 0pt{}} \catcode`\|=\active \def|{{\tt \char '174}} \chardef \less=`\< \catcode`\<=\active \def<{{\tt \less}} \chardef \gtr=`\> \catcode`\>=\active \def>{{\tt \gtr}} \catcode`\+=\active \def+{{\tt \char 43}} %\catcode 27=\active %\def^^[{$\diamondsuit$} % Set up an active definition for =, but don't enable it most of the time. {\catcode`\==\active \global\def={{\tt \char 61}}} \catcode`+=\active \catcode`\_=\active % If a .fmt file is being used, characters that might appear in a file % name cannot be active until we have parsed the command line. % So turn them off again, and have \everyjob (or @setfilename) turn them on. % \otherifyactive is called near the end of this file. \def\otherifyactive{\catcode`+=\other \catcode`\_=\other} \catcode`\@=0 % \rawbackslashxx output one backslash character in current font \global\chardef\rawbackslashxx=`\\ %{\catcode`\\=\other %@gdef@rawbackslashxx{\}} % \rawbackslash redefines \ as input to do \rawbackslashxx. {\catcode`\\=\active @gdef@rawbackslash{@let\=@rawbackslashxx }} % \normalbackslash outputs one backslash in fixed width font. \def\normalbackslash{{\tt\rawbackslashxx}} % Say @foo, not \foo, in error messages. \escapechar=`\@ % \catcode 17=0 % Define control-q \catcode`\\=\active % Used sometimes to turn off (effectively) the active characters % even after parsing them. @def@turnoffactive{@let"=@normaldoublequote @let\=@realbackslash @let~=@normaltilde @let^=@normalcaret @let_=@normalunderscore @let|=@normalverticalbar @let<=@normalless @let>=@normalgreater @let+=@normalplus} @def@normalturnoffactive{@let"=@normaldoublequote @let\=@normalbackslash @let~=@normaltilde @let^=@normalcaret @let_=@normalunderscore @let|=@normalverticalbar @let<=@normalless @let>=@normalgreater @let+=@normalplus} % Make _ and + \other characters, temporarily. % This is canceled by @fixbackslash. @otherifyactive % If a .fmt file is being used, we don't want the `\input texinfo' to show up. % That is what \eatinput is for; after that, the `\' should revert to printing % a backslash. % @gdef@eatinput input texinfo{@fixbackslash} @global@let\ = @eatinput % On the other hand, perhaps the file did not have a `\input texinfo'. Then % the first `\{ in the file would cause an error. This macro tries to fix % that, assuming it is called before the first `\' could plausibly occur. % Also back turn on active characters that might appear in the input % file name, in case not using a pre-dumped format. % @gdef@fixbackslash{@ifx\@eatinput @let\ = @normalbackslash @fi @catcode`+=@active @catcode`@_=@active} %% These look ok in all fonts, so just make them not special. The @rm below %% makes sure that the current font starts out as the newly loaded cmr10 @catcode`@$=@other @catcode`@%=@other @catcode`@&=@other @catcode`@#=@other @textfonts @rm @c Local variables: @c page-delimiter: "^\\\\message" @c End: tar-1.11.8/doc/stamp-vti 644 625 1 12 5770625005 7750 timestamp tar-1.11.8/doc/version.texi 644 625 1 77 5764327176 10507 @set EDITION 1.11.8 @set UPDATED June 1995 @set VERSION 1.11.8 tar-1.11.8/doc/tar.info 644 625 1 12063 5770625053 7640 This is Info file tar.info, produced by Makeinfo-1.61 from the input file tar.texinfo. START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY This file documents GNU `tar', a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation.  Indirect: tar.info-1: 992 tar.info-2: 48684 tar.info-3: 95900 tar.info-4: 144403 tar.info-5: 193787 tar.info-6: 242731 tar.info-7: 292157  Tag Table: (Indirect) Node: Top992 Node: Introduction5316 Node: What tar Does5729 Node: Authors10987 Node: Bug reports12688 Node: Support13560 Node: Stability13869 Node: Rewriting15798 Node: Why maintaining17570 Node: MSDOS19535 Node: Tutorial20956 Node: How to Create Archives22888 Node: Creating Archives of Files bis27283 Node: Using tar in Verbose Mode bis31644 Node: How to Archive Directories32895 Node: Creating an Archive of a Subdirectory bis35211 Node: Compare bis38272 Node: Using Compare from the Superior Directory bis44909 Node: How to List Archives46883 Node: Listing files in an archive bis48684 Node: Getting Additional File Information bis51742 Node: List A Specific File in an Archive bis53811 Node: Listing the Contents of a Stored Directory ter56588 Node: How to Extract Members from an Archive57724 Node: Extracting Files bis59576 Node: Extracting Files from an Archive ter63800 Node: Extracting Specific Files ter64874 Node: Extracting Directories ter66102 Node: How to Add Files to Existing Archives68019 Node: Append bis70284 Node: Update bis75964 Node: Concatenate bis80634 Node: How to Delete Members from Archives84404 Node: Invoking tar88280 Node: Synopsis88530 Node: Option Styles92277 Node: Mnemonic Options92501 Node: Short Options93986 Node: Old Options95900 Node: Mixing Styles99563 Node: Options102093 Node: Device Options110649 Node: Blocking Options111663 Node: Classification Options112302 Node: Basic tar Operations114597 Node: Creating a New Archive128549 Node: Adding to an Existing Archive131574 Node: Updating an Archive134261 Node: Combining Archives135167 Node: Removing Archive Members137513 Node: Listing Archive Members138898 Node: Extracting Archive Members141349 Node: Archive Reading Options144403 Node: File Writing Options148208 Node: Scarce Disk Space151015 Node: Comparing Archives Members with Files152076 Node: Matching Format Parameters152691 Node: Specifying Names to tar153931 Node: Changing the Archive Name154240 Node: Characteristics158706 Node: Reading Names from a File162687 Node: Excluding Some Files164587 Node: Operating Only on New Files165567 Node: Crossing Filesystem Boundaries166498 Node: Selection Options167334 Node: Changing Directory173309 Node: Absolute File Names176471 Node: Being Careful178673 Node: Documentation178977 Node: Checking Progress181550 Node: Interactive Operation185442 Node: Write Verification186827 Node: Comparing187985 Node: Portability189388 Node: Portable Names190353 Node: Symbolic Links191048 Node: Old V7 and POSIX192448 Node: Checksumming Problems193787 Node: Write Protection195273 Node: Format Control196061 Node: Attributes Options196355 Node: Type Options198293 Node: Compression201860 Node: Compressed Archives202141 Node: Dealing with Compressed Archives204578 Node: Sparse Files205522 Node: Special Options for Archiving207222 Node: Archive Structure209685 Node: Modifiers Options211229 Node: Media214659 Node: Device216317 Node: Blocking225068 Node: Format Variations227913 Node: Blocking Factor228884 Node: Many237064 Node: Tape Positioning240829 Node: mt242731 Node: Using Multiple Tapes245032 Node: Multi-Volume Archives249227 Node: Tape Files252004 Node: Archive Label252628 Node: Backups and Restoration254812 Node: Full Dumps256484 Node: Inc Dumps261710 Node: incremental and listed-incremental263817 Node: Backup Levels267363 Node: Backup Parameters270127 Node: backup-specs example272925 Node: Script Syntax273844 Node: Scripted Backups274604 Node: Scripted Restoration276678 Node: Date input formats278194 Node: General date syntax279040 Node: Calendar date item280512 Node: Time of day item282397 Node: Timezone item283999 Node: Day of week item287284 Node: Relative item in date strings288262 Node: Pure numbers in date strings290186 Node: Authors of getdate291173 Node: Archive Format291904 Node: Standard292157 Node: Extensions308151 Node: cpio310684 Node: Index315722  End Tag Table tar-1.11.8/doc/tar.info-1 644 625 1 137054 5770625052 10025 This is Info file tar.info, produced by Makeinfo-1.61 from the input file tar.texinfo. START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY This file documents GNU `tar', a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation.  File: tar.info, Node: Top, Next: Introduction, Prev: (dir), Up: (dir) GNU tar ******* This file documents `tar', a utility used to store, backup, and transport files. It is a rudimentary documentation for the GNU tape (or disk) archiver. It covers the release 1.11.8. This document has been quickly assembled from random notes and sources. I will of course accept documentation bug reports, but please do not torture yourself into systematically reporting all inadequacies for unrevised nodes. * Menu: * Introduction:: * Tutorial:: * Invoking tar:: * Basic tar Operations:: * Specifying Names to tar:: * Being Careful:: * Format Control:: * Media:: * Backups and Restoration:: * Date input formats:: * Archive Format:: * Index:: -- The Detailed Node Listing -- Introduction * What tar Does:: * Authors:: * Bug reports:: * Support:: Support considerations * Stability:: * Rewriting:: * Why maintaining:: * MSDOS:: Tutorial Introduction to `tar' * How to Create Archives:: * How to List Archives:: * How to Extract Members from an Archive:: * How to Add Files to Existing Archives:: * How to Delete Members from Archives:: How to Create Archives * Creating Archives of Files bis:: * Using tar in Verbose Mode bis:: * How to Archive Directories:: * Creating an Archive of a Subdirectory bis:: * Compare bis:: * Using Compare from the Superior Directory bis:: How to Archive Directories * Creating an Archive of a Subdirectory bis:: How to List Archives * Listing files in an archive bis:: * Getting Additional File Information bis:: * List A Specific File in an Archive bis:: * Listing the Contents of a Stored Directory ter:: How to Extract Members from an Archive * Extracting Files bis:: * Extracting Files from an Archive ter:: * Extracting Specific Files ter:: * Extracting Directories ter:: How to Add Files to Existing Archives * Append bis:: * Update bis:: * Concatenate bis:: Invoking GNU `tar' * Synopsis:: * Option Styles:: * Options:: Many Styles for Options * Mnemonic Options:: * Short Options:: * Old Options:: * Mixing Styles:: All Available Options * Device Options:: * Blocking Options:: * Classification Options:: Basic `tar' Operations * Creating a New Archive:: * Adding to an Existing Archive:: * Updating an Archive:: * Combining Archives:: * Removing Archive Members:: * Listing Archive Members:: * Extracting Archive Members:: * Comparing Archives Members with Files:: * Matching Format Parameters:: Extracting Archive Members * Archive Reading Options:: * File Writing Options:: * Scarce Disk Space:: Specifying Names to `tar' * Changing the Archive Name:: * Characteristics:: * Selection Options:: Selecting Files by Characteristic * Reading Names from a File:: * Excluding Some Files:: * Operating Only on New Files:: * Crossing Filesystem Boundaries:: Local file selection * Changing Directory:: * Absolute File Names:: Being Even More Careful * Documentation:: * Checking Progress:: * Interactive Operation:: * Write Verification:: * Comparing:: * Portability:: * Write Protection:: Making `tar' Archives More Portable * Portable Names:: * Symbolic Links:: * Old V7 and POSIX:: * Checksumming Problems:: Controlling the Archive Format * Attributes Options:: * Type Options:: * Compression:: * Special Options for Archiving:: * Archive Structure:: * Modifiers Options:: Using Less Space through Compression * Compressed Archives:: * Dealing with Compressed Archives:: * Sparse Files:: Tapes and Other Archive Media * Device:: * Blocking:: * Many:: * Using Multiple Tapes:: * Archive Label:: Blocking * Format Variations:: * Blocking Factor:: Many archives on one tape * Tape Positioning:: * mt:: Using Multiple Tapes * Multi-Volume Archives:: * Tape Files:: Performing Backups and Restoring Files * Full Dumps:: * Inc Dumps:: * incremental and listed-incremental:: * Backup Levels:: * Backup Parameters:: * Scripted Backups:: * Scripted Restoration:: Setting Parameters for Backups and Restoration * backup-specs example:: * Script Syntax:: Date input formats * General date syntax:: * Calendar date item:: * Time of day item:: * Timezone item:: * Day of week item:: * Relative item in date strings:: * Pure numbers in date strings:: * Authors of getdate:: Format of `tar' archives * Standard:: * Extensions:: * cpio::  File: tar.info, Node: Introduction, Next: Tutorial, Prev: Top, Up: Top Introduction ************ This chapter introduces of a few words which will recur all over this manual, like "archive", "member", "name", "unpack", etc. It then explains who wrote GNU `tar' and its documentation, and says where to send bug reports or comments. * Menu: * What tar Does:: * Authors:: * Bug reports:: * Support::  File: tar.info, Node: What tar Does, Next: Authors, Prev: Introduction, Up: Introduction What `tar' Does =============== The `tar' program is used to create and manipulate `tar' archives. An "archive" is a single file which contains within it the contents of many files. In addition, the archive identifies the names of the files, their owner, and so forth. (Archives record access permissions, user and group, size in bytes, and last modification time. Some archives also record the file names in each archived directory, as well as other file and directory information.) The files inside an archive are called "members". Within this manual, we use the term "file" to refer only to files accessible in the normal ways (by `ls', `cat', and so forth), and the term "members" to refer only to the members of an archive. Similarly, a "file name" is the name of a file, as it resides in the filesystem, and a "member name" is the name of an archive member within the archive. Initially, `tar' archives were used to store files conveniently on magnetic tape. The name `tar' comes from this use; it stands for: `t'ape `ar'chiver. Despite the utility's name, `tar' can direct its output to any available device, as well as store it in a file or direct it to another program via a pipe. `tar' may even access, as archives, remote devices or files. You can use `tar' archives in many ways. We want to stress a few of them: storage, backup or transportation. Storage Often, `tar' archives are used to store related files for convenient file transfer over a network. For example, the GNU Project distributes its software bundled into `tar' archives, so that all the files relating to a particular program (or set of related programs) can be transferred as a single unit. A magnetic tape can store several files in sequence, but has no names for them, just relative position on the tape. A `tar' archive or something like it is one way to store several files on one tape and retain their names. Even when the basic transfer mechanism can keep track of names, as FTP can, the nuisance of handling multiple files, directories, and multiple links, makes `tar' archives an attractive method. Archive files are also used for long-term storage, which you can think of as transportation from one time to another. Backup Because the archive created by `tar' is capable of preserving file information and directory structure, `tar' is commonly used for performing full and incremental backups of disks, putting all together bunch of files possibly pertaining to many users and different projects, to secure against accidental destruction of those disks. The GNU version of `tar' has special features that allow it to be used to make incremental and full dumps of all the files in a filesystem. Transportation Archive files can be used for transporting a group of files from one system to another: put all relevant files into an archive on one computer system, transfer the archive to another, and extract the contents there. The basic transfer medium might be magnetic tape, Internet FTP, or even electronic mail (though you must encode the archive with `uuencode' or some functional equivalent in order to transport it properly by mail). Both machines do not have to use the same operating system, as long as they both support the `tar' program. Piping one `tar' to another is an easy way to copy a directory's contents from one disk to another, while preserving the dates, modes, owners and link structure of all the files therein. `tar' is also ideal for transferring directories over networks. We sometimes see a copy of `tar' packing many files into one archive on one machine, and sending the produced archive over a pipe over the network to another copy of `tar' on another machine, reading its archive from the pipe and unpacking all files there. The `tar' program provides the ability to create `tar' archives, as well as for various other kinds of manipulation. For example, you can use `tar' on previously created archives to extract files, to store additional files, or to update or list files already stored. The term "extraction" is used to refer to the process of copying an archive member into a file in the filesystem. One might speak of extracting a single member. Extracting all the members of an archive is often called extracting the archive. Also, the term "unpack" is used to refer to the extraction of many or all the members of an archive. Conventionally, `tar' archives are given names ending with `.tar'. This is not necessary for `tar' to operate properly, but this manual follows the convention in order to get the reader used to seeing it. Occasionally, `tar' archives are referred to as `tar' files, archive members are referred to as files, or entries. For people familiar with the operation of `tar', this causes no difficulty. However, this manual consistently uses the terminology above in referring to archives and archive members, to make it easier to learn how to use `tar'.  File: tar.info, Node: Authors, Next: Bug reports, Prev: What tar Does, Up: Introduction GNU `tar' Authors ================= GNU `tar' was originally written by John Gilmore, and modified by many people. The GNU enhancements were written by Jay Fenlason, and the whole package has been further maintained by Michael Bushnell, then Franc,ois Pinard, with the help of numerous and kind users. I wish to stress that `tar' is somewhat a collective work, and owe much to all those people who reported problems, offerred solutions and other insights, or shared their thoughts and suggestions. Even if we lost track of many of those contributors, a partial list can be found in the `THANKS' file from the GNU `tar' distribution. Jay Fenlason put together a draft of a GNU `tar' manual, also borrowing notes from the original man page from John Gilmore, this draft has been distributed in `tar' versions 1.04 (or even before?) through 1.10, then withdrawn in version 1.11. Michael Bushnell and Amy Gorin worked at a tutorial and manual for GNU `tar', and left a few unpublished versions of each. For version 1.11.8, Franc,ois Pinard put together a new manual by grabbing from all these sources and merging them in a single manual. I heard that there is another manual in the works, by another team, which should say everything about archives and related utilities, and which will surely be nicer than this one. In the meantime, please consider this manual is a placeholder for `tar' option list and a few random notes the maintainer wants to save somewhere, so users can read them. I wish GNU `tar' users will be happier with this imperfect manual than with no documentation at all.  File: tar.info, Node: Bug reports, Next: Support, Prev: Authors, Up: Introduction Reporting bugs or suggestions ============================= Please report problems or suggestions about this program to `bug-gnu-utils@prep.ai.mit.edu'. You may also write directly, and less officially, to `pinard@iro.umontreal.ca'. There is a lot of mail flowing about `tar', and some accumulated in the past years. You might expect a quick acknowledgement of your invoices, but the proper handling of your reports may be delayed for a long while. Many nodes of this document have not been revised much, these all start with a little comment telling so. I accept documentation bug reports, of course. But please do not torture yourself into systematically reporting all inadequacies for the unrevised nodes of this document, unless you really feel like revising them.  File: tar.info, Node: Support, Prev: Bug reports, Up: Introduction Support considerations ====================== This informal appendix is for the maintainer to share a few words and thoughts, while considering GNU `tar' support. * Menu: * Stability:: * Rewriting:: * Why maintaining:: * MSDOS::  File: tar.info, Node: Stability, Next: Rewriting, Prev: Support, Up: Support Stability of GNU `tar' ---------------------- User reports mainly fall in three categories: portability problems, execution bugs, and requests for enhancements. For 1.11.X, the emphasis has been on solving portability problems, then trying to make GNU `tar' more solid. Enhancements have fairly low priority, yet I sometime slip one in just for taking a kind of rest :-). Many bugs have been corrected since 1.11.2. If you are curious, glance through ChangeLog. I had only very few reports for things that *might* be new bugs not present in 1.11.2. If you are really curious, and have access to the FSF machines, see `/gd/gnu/tar/rmail/' hierarchy for all reports. Subdirectories `0', `1', `2' and `3' represent decreasing levels in priority. Most problems in there were reported against 1.10, 1.11 or 1.11.2 and still exist. The only thing I have consciously broken between 1.11.2 and 1.11.5 is `--record-number' (`-R'), because I wanted some modification to be done to `gnulib/error.c', which is outside my control. This modification is now done, but I did not revisit this area yet. Here is my candid opinion. GNU `tar' has many areas of unreliability. See `BACKLOG' for the horrorful picture of the situation. Yet, for most users and usages, GNU `tar' looks very dependable. For me as a mere user, GNU `tar' did not give problems in years. And I think it offers a lot of functionality. Many problems have been solved since 1.11.2, even if true that many more remain to be solved. I'm not discouraged myself and feel positive about maintaining it, simply because when I bite, that usually lasts for quite long. I might not have all the time I would want, but I surely have good will and am happily surrounded by many collaborating pretesters. So, I still think GNU `tar' is on the winning side in the long run.  File: tar.info, Node: Rewriting, Next: Why maintaining, Prev: Stability, Up: Support Should we rewrite the thing? ---------------------------- Working in `tar' sources is not always pleasurable. The problem is that `tar' sources are very fragile. Just cleaning around breaks things. The current sequence of prereleases is for slowly trying to solidify it, so `tar' becomes more maintainable. I think that the ugliness of sources could be corrected to a certain extent, too. A few efforts to replace GNU `tar' have been done already and it seems that all failed so far. A toy program, for me, is another kind of failure. I think people underestimate the number of portability problems such a program can raise. This is not only a matter of programming style, there is really a wide variability in systems out there. GNU `tar' has a long history, met a rich variety of porting problems, machine peculiarities, system idiosyncrasies, which are unrelated to programming style. My own opinion is that we cannot dismiss all the experience gleaned along the years, and saved (if not hidden) in GNU `tar' sources, pretending to start anew, from scratch. Even if a new program replacing GNU `tar' would be marvelous, GNU `tar' stalled for a few years waiting for such a program, and we are now faced to nothing, with hundreds of user reports to catch on. We need a working archiver *now*, and cannot live on promises. Any new program will take hundreds of user reports, and many years, to stabilize enough to become a plausible `tar' replacement. I rather plan to clean up GNU `tar'. This alone is a big task for me, because GNU `tar' coding is not ideal, and I have to find ways to transform it slowly, while having it fully working at all times.  File: tar.info, Node: Why maintaining, Next: MSDOS, Prev: Rewriting, Up: Support Why maintaining it? ------------------- I confess that I am a little afraid of `tar' maintainance. It is difficult for many reasons, the first tree being more evident than the others: * the algorithmic design was initially oriented for machines having very small memory, it was later much adapted for new features without doing everything necessary for the whole to stay clean; * the wide visibility of `tar' forces many stunts at portability; * GNU `tar' has to be sensitive to file systems and device variance. * GNU central has been seduced by some users promising to write wonderful `tar' replacements, which never came, so development has been put aside for years, while bug reports accumulated; * the `tar' manual has been withdrawn, promising users a fine replacement for it, so raising their expectations; * maintenance was once split between four maintainers (one for `tar', one for `mt', another for scripts, and a team for documentation), and also, `rtapelib.[ch]' from `tar' is used in `cpio', and synchronisation has not always been easy. However, even if difficult, I do feel like doing a careful cleanup, so `tar' would become less painful to maintain after a while (and less subject to criticism). And besides, I'm surrounded by a marvelous team of pretesters and by many other collaborating users, which I should learn to serve better. Getting more experience with maintainance in GNU, I hope being careful enough modifying `tar' so not hurting users too much, being aware that `tar' is a sensitive product in GNU. Once cleaned up, I might be happy to return `tar' maintainance to someone else... `tar' requires more work alone that all my other things together, and I have to resist being swallowed whole in it. This resistance makes `tar' development somewhat slower. Sorry!  File: tar.info, Node: MSDOS, Prev: Why maintaining, Up: Support MSDOS and other systems? ------------------------ GNU does not necessarily support non-UNIX systems, that is to say, MSDOS is not supported. It is very true that ports can sometimes be very intrusive in the sources, cluttering them significantly with conditionals and extra code, and distract GNU maintainers from the main development line. However, a special argument might be made for `tar'. Both `tar' and `gzip' are the required tools for getting something out of the GNU archives, `tar' should be more opened to ports than the GNU rule states. Jean-loup did a tremendous job at porting `gzip' on smaller systems. It would be comfortable that a few other GNU tools be available on MSDOS and others, among which `tar'. These ports for `tar' have theoretically no priority at all. Nevertheless, a port is interesting, because `tar' is so central in GNU distributions, and `gzip' is already ported. Some porting efforts have been done in the past. There are traces of a few exchanges on this subject in `BACKLOG'. GNU `tar' sources have been modified a lot recently at a cosmetic level, and I would certainly have a hard time integrating diffs provided by someone else. If people want porting `tar' to MSDOS or other non-UNIX systems, they should be committed in supporting their ports after the fact, as I cannot do it myself.  File: tar.info, Node: Tutorial, Next: Invoking tar, Prev: Introduction, Up: Top Tutorial Introduction to `tar' ****************************** This chapter guides you through some basic examples of `tar' operations. If you already know how to use some other version of `tar', then you probably don't need to read this chapter. This chapter omits complicated details about many of the ways `tar' works. See later chapters for full information. Before proceeding further with this tutorial chapter, be sure you understand already and clearly what is meant by "archive" and "archive member". FIXME: xref What tar Does . This chapter guides you through some basic examples of `tar' operations. In the examples, the lines you should type are preceded by a `%', which is a typical shell prompt. We use mnemonic forms of operations and options in the examples, and in discussions in the text, but short forms produce the same result. Most of the options to `tar' come in both long forms and short forms. The options described in this tutorial have the following abbreviations (except `--delete', which has no shorthand form): `--create' `-c' `--list' `-t' `--extract' `-x' `--append' `-r' `--verbose' `-v' `--file=ARCHIVE-NAME' `-f ARCHIVE-NAME' These options make typing long `tar' commands easier. For example, instead of typing tar --create --file=/tmp/afiles.tar --verbose apple angst asparagus you can type tar -c -f /tmp/afiles.tar -v apple angst asparagus For more information on option syntax, FIXME: ref Invoking tar . In discussions in the text, when we present some mnemonic option, we also give the corresponding short option within parentheses. * Menu: * How to Create Archives:: * How to List Archives:: * How to Extract Members from an Archive:: * How to Add Files to Existing Archives:: * How to Delete Members from Archives::  File: tar.info, Node: How to Create Archives, Next: How to List Archives, Prev: Tutorial, Up: Tutorial How to Create Archives ====================== *(This message will disappear, once this node revised.)* To create a new archive, use the `--create' (`-c') option to `tar'. You can use options to specify the name and format of the archive (as well as other characteristics), and you can use file name arguments to specify which files and directories are to be put in the archive. FIXME: xref Creating , for more information about the `--create' (`-c') operation. To create a new archive, use the `--create' (`-c') option to `tar'. You should generally use the `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') option to specify the name the `tar' archive will have. Then specify the names of the files you wish to place in the new archive. For example, to place the files `apple', `angst', and `asparagus' into an archive named `afiles.tar', use the following command: tar --create --file=afiles.tar apple angst asparagus The order of the arguments is not important when using mnemonic option style. You could also say: tar apple --create angst --file=afiles.tar asparagus This order is harder to understand however. In this manual, we will list the arguments in a reasonable order to make the commands easier to understand, but you can type them in any order you wish. If you don't specify the names of any files to put in the archive, then `tar' will create an empty archive. So, the following command will create an archive with nothing in it: tar --create --file=empty-archive.tar Whenever you use `--create' (`-c'), `tar' will erase the current contents of the file named by `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') if it exists. To add files to an existing archive, you need to use a different option. FIXME: xref Adding to Archives, for information on how to do this. When an archive is created through `--create' (`-c'), the member names of the members of the archive are exactly the same as the file names as you typed them in the `tar' command. So, the member names of `afiles' (as created by the first example above) are `apple', `angst', and `asparagus'. However, suppose an archive were created with this command: tar --create --file=bfiles.tar ./balloons baboon ./bodacious Then, the three files `balloons', `baboon', and `bodacious' would get placed in the archive (because `./' is a synonym for the current directory), but their member names would be `./balloons', `baboon', and `./bodacious'. If you want to see the progress of `tar' as it writes files into the archive, you can use the `--verbose' (`-v') option. If one of the files named with `--create' (`-c') is a directory, then the operation of `tar' is more complicated. FIXME: xref Tar and Directories, FIXME: the last section of this tutorial, for more information. If you don't specify the `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') option, then `tar' will use a default. Usually this default is some physical tape drive attached to your machine. If there is no tape drive attached, or the default is not meaningful, then `tar' will print an error message. This error message might look roughly like one of the following: tar: can't open /dev/rmt8 : No such device or address tar: can't open /dev/rsmt0 : I/O error If you get an error like this, mentioning a file you didn't specify (`/dev/rmt8' or `/dev/rsmt0' in the examples above), then `tar' is using a default value for `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). You should generally specify a `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') argument whenever you use `tar', rather than relying on a default. To create a new archive, use the `--create' (`-c') option to `tar'. You can use options to specify the name and format of the archive (as well as other characteristics), and you can use file name arguments to specify which files to put in the archive. If you don't use any options or file name arguments, `tar' will use default values. FIXME: xref Creating Example , for more information about the `--create' (`-c') option. * Menu: * Creating Archives of Files bis:: * Using tar in Verbose Mode bis:: * How to Archive Directories:: * Creating an Archive of a Subdirectory bis:: * Compare bis:: * Using Compare from the Superior Directory bis::  File: tar.info, Node: Creating Archives of Files bis, Next: Using tar in Verbose Mode bis, Prev: How to Create Archives, Up: How to Create Archives Creating Archives of Files -------------------------- *(This message will disappear, once this node revised.)* This example shows you how to create an archive file in your working directory containing other files in the same directory. The three files you archive in this example are called `blues', `folk', and `jazz'. The archive file is called `records'. While the archive in this example is written to the file system, it could also be written to tape. (If you want to follow along with this and future examples, create a practice subdirectory containing files with these names. To create the directory, type `mkdir practice' at the system prompt. You can create the files using a text editor, such as `emacs'). While in the directory containing the files you want to archive, list the directory's contents. Type: % cd practice % ls The system responds: blues folk jazz % This is to check that the files to be archived do in fact exist in the working directory, and to check that the archive name you have chosen isn't already in use. If it is, `tar' will overwrite the old archive and its contents will be lost. Then, * Create a new archive by giving `--create' (`-c') to `tar'. * Explicitly name the archive file being created--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). If you don't use this option `tar' will write the archive to the default storage device, which varies from system to system. * Specify which files to put into the archive. If you don't specify any FILE NAME arguments, `tar' will archive everything in the working directory. Type: % tar --create --file=records blues folk jazz If you now list the contents of the working directory (`ls'), you will find the archive file listed as well as the files you saw previously. % ls blues folk jazz records % This example shows you how to create an archive file in the working directory containing other files in the working directory. The three files you archive in this example are called `blues', `folk', and `jazz'. The archive file is called `records'. While the archive in this example is written to the file system, it could also be written to any other device. (If you want to follow along with this and future examples, create a directory called `practice' containing files called `blues', `folk' and `jazz'. To create the directory, type `mkdir practice' at the system prompt. It will probably be easiest to create the files using a text editor, such as Emacs.) First, change into the directory containing the files you want to archive: % cd practice `~/practice' is now your working directory. Then, check that the files to be archived do in fact exist in the working directory, and make sure there isn't already a file in the working directory with the archive name you intend to use. If you specify an archive file name that is already in use, `tar' will overwrite the old file and its contents will be lost. To list the names of files in the working directory, type: % ls The system responds: blues folk jazz % Then, * Create a new archive by giving the `--create' (`-c') option to `tar'. * Explicitly name the archive file being created--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). If you don't use this option `tar' will write the archive to the default storage device, which varies from system to system. FIXME: this syntax may change. OK now--check before printing `tar' interprets archive file names relative to the working directory. Make sure you have write access to the working directory before using `tar'. * Specify which files to put into the archive (`tar' interprets file names relative to the working directory). If you don't use any NAME arguments, `tar' will archive everything in the working directory. Type: % tar --create --file=records blues folk jazz If you now list the contents of the working directory (`ls'), you will find the archive file listed as well as the files you saw previously. % ls blues folk jazz records %  File: tar.info, Node: Using tar in Verbose Mode bis, Next: How to Archive Directories, Prev: Creating Archives of Files bis, Up: How to Create Archives Using `tar' in Verbose Mode --------------------------- *(This message will disappear, once this node revised.)* If you include the `--verbose' (`-v') option on the command line, `tar' will list the files it is acting on as it is working. The example above in verbose mode would be: % tar --create --file=records --verbose blues folk jazz blues folk jazz The first line, which is preceeded by a `%', is the command line. The lines after the first line are generated by `tar' as it works. In the following examples we usually use verbose mode, though it is almost never required. If you include the `--verbose' (`-v') option on the command line, `tar' will list the files it is acting on as it is working. In verbose mode, the creation example above would appear as: % tar --create --file=records --verbose blues folk jazz blues folk jazz The first line is the command typed in by the user. The remaining lines are generated by `tar'. In the following examples we usually use verbose mode, though it is almost never required.  File: tar.info, Node: How to Archive Directories, Next: Creating an Archive of a Subdirectory bis, Prev: Using tar in Verbose Mode bis, Up: How to Create Archives How to Archive Directories -------------------------- *(This message will disappear, once this node revised.)* When the names of files or members specify directories, the operation of `tar' is more complex. Generally, when a directory is named, `tar' also operates on all the contents of the directory, recursively. Thus, to `tar', the file name `/' names the entire file system. To archive the entire contents of a directory, use `--create' (`-c') or `--append' (`-r') as usual, and specify the name of the directory. For example, to archive all the contents of the current directory, use `tar --create --file=ARCHIVE-NAME .'. Doing this will give the archive members names starting with `./'. To archive the contents of a directory named `foodir', use `tar --create --file=ARCHIVE-NAME foodir'. In this case, the member names will all start with `foodir/'. If you give `tar' a command such as `tar --create --file=foo.tar .', it will report `tar: foo.tar is the archive; not dumped'. This happens because the archive `foo.tar' is created before putting any files into it. Then, when `tar' attempts to add all the files in the directory `.' to the archive, it notices that the file `foo.tar' is the same as the archive, and skips it. (It makes no sense to put an archive into itself.) GNU `tar' will continue in this case, and create the archive as normal, except for the exclusion of that one file. Other versions of `tar', however, are not so clever, and will enter an infinite loop when this happens, so you should not depend on this behavior. In general, make sure that the archive is not inside a directory being dumped. When extracting files, you can also name directory archive members on the command line. In this case, `tar' extracts all the archive members whose names begin with the name of the directory. As usual, `tar' is not particularly clever about interpreting member names. The command `tar --extract --file=ARCHIVE-NAME .' will not extract all the contents of the archive, but only those members whose member names begin with `./'. * Menu: * Creating an Archive of a Subdirectory bis::  File: tar.info, Node: Creating an Archive of a Subdirectory bis, Next: Compare bis, Prev: How to Archive Directories, Up: How to Create Archives Creating an Archive from the Superior Directory ----------------------------------------------- *(This message will disappear, once this node revised.)* You can archive a directory by specifying its directory name as a file name argument to `tar'. The files in the directory will be archived relative to the working directory, and the directory will be re-created along with its contents when the archive is extracted. To archive a directory, first move to its superior directory. If you have been following the tutorial, you should type: % cd .. % Once in the superior directory, you can specify the subdirectory as a file name argument. To store the directory `practice' in the archive file `music', type: % tar --create --verbose --file=music practice `tar' should output: practice/ practice/blues practice/folk practice/jazz practice/records Note that the archive thus created is not in the subdirectory `practice', but rather in the working directory--the directory from which `tar' was invoked. Before trying to archive a directory from its superior directory, you should make sure you have write access to the superior directory itself, not only the directory you are trying archive with `tar'. Trying to store your home directory in an archive by invoking `tar' from the root directory will probably not work. FIXME: xref absolute-names (Note also that `records', the original archive file, has itself been archived. `tar' will accept any file as a file to be archived, regardless of its content. When `music' is extracted, the archive file `records' will be re-written into the file system). You can store a directory in an archive by using the directory name as a file name argument to `tar'. When you specify a directory file, `tar' archives the directory file and all the files it contains. The names of the directory and the files it contains are stored in the archive relative to the current working directory-when the directory is extracted they will be written into the file system relative to the working directory at that time. FIXME: add an xref to --absolute-names To archive a directory, first move to its superior directory. If you have been following the tutorial, you should type: % cd .. % Once in the superior directory, specify the subdirectory using a file name argument. To store the directory file `~/practice' in the archive file `music', type: % tar --create --verbose --file=music practice `tar' should respond: practice/ practice/blues practice/folk practice/jazz practice/records Note that `~/practice/records', another archive file, has itself been archived. `tar' will accept any file as a file to be archived, even an archive file. FIXME: symbolic links and changing directories are now in main body, FIXME: not in tutorial.  File: tar.info, Node: Compare bis, Next: Using Compare from the Superior Directory bis, Prev: Creating an Archive of a Subdirectory bis, Up: How to Create Archives Comparing Files in an Archive with Files in the File System ----------------------------------------------------------- *(This message will disappear, once this node revised.)* While the `--list' (`-t') operation with the `--verbose' (`-v') option specified is useful in keeping files in the archive current with files in the file system (by allowing the user to compare size and modification dates), it is simpler to have `tar' itself compare file attributes and report back on file differences. To do so, use the `--compare' (`-d') or `--diff' operation. The `--compare' (`-d') operation, as its name implies, causes `tar' to compare files and directories in the archive with their counterparts (files of the same name) in the file system, and report back differences in file size, mode, owner and modification date. When performing the `--compare' (`-d') operation, `tar' acts only on files actually in the archive--it will ignore files in the active file system that do not exist in the archive. If `tar' with `--compare' (`-d') specified is given, as a file name argument, the name of a file that does not exist in the archive, it will return an error message. To compare the files in the practice directory with their counterparts in the archive file `records', in the same directory, you would, while in the `practice' directory: * Invoke `tar' and specify the operation to compare files in the archive with their counterparts in the file system--`--compare' (`-d') or `--diff'. * Specify the name of the archive where the files to be compared are stored--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the names of the files or directories to be compared, as file name arguments (in this case, you are comparing all the files in the archive, so nothing need be specified). % tar --compare --file=records % While it looks like nothing has happened, `tar' has, in fact, done the comparison--and found nothing to report. The same example with the `--verbose' (`-v') option specified would list the files in the archive as they are being compared with their counterparts of the same name: % tar --compare --verbose --file=records blues folk jazz % If `tar' had had anything to report, it would have done so as it was comparing each file. If you remove the file `jazz' from the file system (`rm jazz'), and modify the file `blues' (for instance, by adding text to it with a text editor), the above example would look like: % tar --compare --verbose --file=records blues blues: mod time differs blues: size differs folk jazz jazz: does not exist % You should note again that while `--compare' (`-d') does cause `tar' to report back on files in the archive that do not exist in the file system, `tar' will ignore files in the active file system that do not exist in the archive. To demonstrate this, create a file in the `practice' directory called `rock' (using any text editor). If you generate a directory listing the new file will appear. % ls blues folk records rock If you run the `--compare' (`-d') example again you will obtain the following: % tar --compare --verbose --file=records blues blues: mod time differs blues: size differs folk jazz jazz: does not exist % `tar' ignores the file `rock' because `tar' is comparing files in the archive to files in the file system, not vice versa. If `rock' had been passed to `tar' explicitly (as a file name argument), `tar' would have returned an error message, as follows: % tar --compare --verbose --file=records rock tar: rock not found in archive % To compare the attributes of archive members with the attributes of their counterparts in the file system, use the `--compare' (`-d') or `--diff'operation. While you could use `--list --verbose' (`-tv') to manually compare some file attributes, it is simpler to have `tar' itself compare file attributes and report back on file differences. FIXME: "manually"? suggestions? The `--compare' (`-d') operation, as its name implies, compares archive members with files of the same name in the file system, and reports back differences in file size, mode, owner and modification date. `tar +compare' acts only on archive members-it ignores files in the file system that are not stored in the archive. If you give with `--compare' (`-d') a NAME argument that does not correspond to the name of an archive member, `tar' responds with an error message. To compare archive members in the archive file `records' with files in the `~/practice' directory, first change into the `practice' directory. Then: * Invoke `tar' and specify the `--compare' (`-d') operation--`--compare' (`-d') or `--diff'. * Specify the archive where the files to be compared are stored--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the archive members to be compared. (In this example you are comparing all the archive members in the archive. Since this is the default, you don't need to use any file name arguments). % tar --compare --file=records % While it looks like nothing has happened, `tar' has, in fact, done the comparison--and found nothing to report. Use the `--verbose' (`-v') option to list the names of archive members as they are being compared with their counterparts of the same name in the file system: % tar --compare --verbose --file=records blues folk jazz % If `tar' had had anything to report, it would have done so as it was comparing each file. If you remove the file `jazz' from the file system (`rm jazz'), and modify the file `blues' (for instance, by adding text to it with an editor such as Emacs), the above example would look like: % tar --compare --verbose --file=records blues blues: mod time differs blues: size differs folk jazz jazz: does not exist % Note again that while `--compare' (`-d') reports the names of archive members that do not have counterparts in the file system, `--compare' (`-d') ignores files in the file system that do not have counterparts in the archive. To demonstrate this, create a file in the `practice' directory called `rock' (using any text editor). The new file appears when you list the directory's contents: FIXME: Given an example  File: tar.info, Node: Using Compare from the Superior Directory bis, Prev: Compare bis, Up: How to Create Archives Using Compare from the Superior Directory ----------------------------------------- *(This message will disappear, once this node revised.)* In addition to using `--compare' (`-d') to compare individual files in an archive with their counterparts in the file system, you can use `--compare' (`-d') to compare archived directories with their counterparts in the active file system. You could re-create the examples above using your home directory as the working directory, and using the archive file `music' (in which is stored the `practice' directory) instead of the archive file `records'. First, change into the home directory (`cd ..'). Then, try the above example using `music' as the specified archive file, and the `practice' subdirectory as a file name argument. % tar --compare --verbose --file=music practice practice practice/blues practice/blues: mod time differs practice/blues: size differs practice/folk practice/jazz practice/jazz: does not exist practice/records In addition to using `--compare' (`-d') to compare text files, you can use `--compare' (`-d') to compare directories. To illustrate this, re-create the examples above using your home directory as the working directory, and using the archive file `~/music' instead of the archive file `~/practice/records'. First, change into your home directory (`cd ~'). Then, try the above example using `music' as the specified archive file, and `practice' as a file name argument. % tar --compare --verbose --file=music practice If you have been following along with the tutorial, `tar' will respond: practice practice/blues practice/blues: mod time differs practice/blues: size differs practice/folk practice/jazz practice/jazz: does not exist practice/records  File: tar.info, Node: How to List Archives, Next: How to Extract Members from an Archive, Prev: How to Create Archives, Up: Tutorial How to List Archives ==================== *(This message will disappear, once this node revised.)* Use `--list' (`-t') to print the names of members stored in an archive. Use a `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') option just as with `--create' (`-c') to specify the name of the archive. For example, the archive `afiles.tar' created in the last section could be examined with the command `tar --list --file=afiles.tar'. The output of `tar' would then be: apple angst asparagus The archive `bfiles.tar' would list as follows: ./baloons baboon ./bodacious (Of course, `tar --list --file=empty-archive.tar' would produce no output.) If you use the `--verbose' (`-v') option with `--list' (`-t'), then `tar' will print out a listing reminiscent of `ls -l', showing owner, file size, and so forth. You can also specify member names when using `--list' (`-t'). In this case, `tar' will only list the names of members you identify. For example, `tar --list --file=afiles.tar apple' would only print `apple'. It is essential when specifying member names to `tar' that you give the exact member names. For example, `tar --list --file=bfiles baloons' would produce no output, because there is no member named `baloons', only one named `./baloons'. While the file names `baloons' and `./baloons' name the same file, member names are compared using a simplistic name comparison, in which an exact match is necessary. * Menu: * Listing files in an archive bis:: * Getting Additional File Information bis:: * List A Specific File in an Archive bis:: * Listing the Contents of a Stored Directory ter:: tar-1.11.8/doc/tar.info-2 644 625 1 136120 5770625052 10017 This is Info file tar.info, produced by Makeinfo-1.61 from the input file tar.texinfo. START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY This file documents GNU `tar', a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation.  File: tar.info, Node: Listing files in an archive bis, Next: Getting Additional File Information bis, Prev: How to List Archives, Up: How to List Archives Listing the Contents of an Archive ---------------------------------- *(This message will disappear, once this node revised.)* You can list the contents of the archive you just created with another option of `tar': `--list' (`-t'). To list the contents of an archive, type: % tar --list --file=records `tar' will respond: blues folk jazz FIXME: xref Listing Archive Contents , for a more detailed tutorial of the `--list' (`-t') operation. FIXME: xref Listing Contents for more information about the `--list' (`-t') operation. FIXME: You can use `--list' (`-t') to output a list of the files in an archive. If you use file name arguments with this operation, `tar' will look in the archive for the files specified and display their names only if they are, in fact, stored. You can use `--list' (`-t') with the `--verbose' (`-v') option to find out the attributes (owner, size, etc.) of stored files. You can list the contents of an archive with another operation of `tar': `--list' (`-t'). To list the contents of the archive you just created, type: % tar --list --file=records `tar' will respond: blues folk jazz FIXME: xref Listing Archive Contents , for a more detailed tutorial of the `--list' (`-t') operation. FIXME: xref Listing Contents , for more information about the `--list' (`-t') operation. In a previous example, you created the archive `music' in the home directory. To list the contents of `music': * List the contents of an archive by using `--list' (`-t') with `tar'. * Specify the name of the archive to be listed--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). Thus: % tar --list --file=music practice/ practice/blues practice/folk practice/jazz practice/records Use `--list' (`-t') to print the names of files stored in an archive. If you use file name arguments with this operation, `tar' prints the names of the specified files if they are stored in the archive. If you use a directory name as a file name argument, `tar' also prints the names of all underlying files, including sub-directories. If you use no file name arguments, `tar' prints the names of all the archive members. You can use `--list' (`-t') with the `--verbose' (`-v') option to print archive members' attributes (owner, size, etc.). To list the names of files stored in an archive, use the `--list' (`-t') operation of `tar'. In a previous example, you created the archive `~/music'. To list the contents of `music', while in your home directory: * List the contents of an archive by using {No Value For "-list"} with `tar'. * Specify the archive to be listed--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). Thus: % tar --list --file=music practice/ practice/blues practice/folk practice/jazz practice/records  File: tar.info, Node: Getting Additional File Information bis, Next: List A Specific File in an Archive bis, Prev: Listing files in an archive bis, Up: How to List Archives Getting Additional File Information ----------------------------------- *(This message will disappear, once this node revised.)* When you specify the `--verbose' (`-v') option in conjunction with `--list' (`-t'), `tar' will print additional information about the files being listed (file protection, owner and group ID, size, and date and time of creation). The example above, in verbose mode, would be: % tar --list --verbose --file=music drwxrwxrwx myself/user 0 May 31 21:49 1990 practice/ -rw-rw-rw- myself/user 42 May 21 13:29 1990 practice/blues -rw-rw-rw- myself/user 62 May 23 10:55 1990 practice/folk -rw-rw-rw- myself/user 40 May 21 13:30 1990 practice/jazz -rw-rw-rw- myself/user 10240 May 31 21:49 1990 practice/records % Note that using `--verbose' (`-v') with `--list' (`-t') does not cause `tar' to print the names of files as they are being acted on, though the `--verbose' (`-v') option will have this effect with all other operations. To get more information when you list the names of files stored in an archive, specify the `--verbose' (`-v') option in conjunction with `--list' (`-t'). `tar' will print archive member's file protection, owner and group ID, size, and date and time of creation. For example: % tar --list --verbose --file=music drwxrwxrwx myself/user 0 May 31 21:49 1990 practice/ -rw-rw-rw- myself/user 42 May 21 13:29 1990 practice/blues -rw-rw-rw- myself/user 62 May 23 10:55 1990 practice/folk -rw-rw-rw- myself/user 40 May 21 13:30 1990 practice/jazz -rw-rw-rw- myself/user 10240 May 31 21:49 1990 practice/records % Note that when you use `--verbose' (`-v') with `--list' (`-t'), `tar' doesn't print the names of files as they are being acted on, though the `--verbose' (`-v') option will have this effect when used with all other operations.  File: tar.info, Node: List A Specific File in an Archive bis, Next: Listing the Contents of a Stored Directory ter, Prev: Getting Additional File Information bis, Up: How to List Archives List A Specific File in an Archive ---------------------------------- *(This message will disappear, once this node revised.)* FIXME: To to see if a particular file is in an archive, specify the name of the file in question as a file name argument while specifying the `--list' (`-t') operation. For example, if you wanted to see if the file `folk' were in the archive file `music', you would: * Invoke `tar', and specify the operation to list the contents of an archive--`--list' (`-t'). * Specify the name of the archive file to be acted on--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the name of the file `tar' is to look for, as a file name argument. Because `tar' preserves paths, file names must be specified as they appear in the archive (ie.. as they are relative to the directory from which the archive was created). FIXME: xref -P Type: % tar --list --file=music practice/folk `tar' responds: practice/folk If the file were not in the archive (for example, the file `practice/rock'), the example above would look like: % tar --list --file=music practice/rock tar: practice/rock not found in archive The `--verbose' (`-v') option does not have any effect on execution of the `--list' (`-t') operation when you have specified file name arguments. FIXME: this is a bug (?) To to see if a particular file is in an archive, use the name of the file in question as a file name argument while specifying the `--list' (`-t') operation. For example, to see whether the file `folk' is in the archive file `music', do the following: * Invoke `tar', and specify the `--list' (`-t') operation. * Specify the archive file to be acted on--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the files to look for, by typing their names as file name arguments. You have to type the file name as it appears in the archive (normally, as it is relative to the relative to the directory from which the archive was created). FIXME: xref absolute-names Type: % tar --list --file=music practice/folk `tar' responds: practice/folk If the file were not stored in the archive (for example, the file `practice/rock'), the example above would look like: % tar --list --file=music practice/rock tar: practice/rock not found in archive If you had used `--verbose' (`-v') mode, the example above would look like: % tar --list --file=music practice/folk -rw-rw-rw- myself/user 62 May 23 10:55 1990 practice/folk  File: tar.info, Node: Listing the Contents of a Stored Directory ter, Prev: List A Specific File in an Archive bis, Up: How to List Archives Listing the Contents of a Stored Directory ------------------------------------------ *(This message will disappear, once this node revised.)* To get information about the contents of an archived directory, use the directory name as a file name argument in conjunction with `--list' (`-t'). To find out file attributes, include the `--verbose' (`-v') option. For example, to find out about files in the directory `practice', in the archive file `music', type: % tar --list --file=music practice `tar' responds: drwxrwxrwx myself/user 0 May 31 21:49 1990 practice/ -rw-rw-rw- myself/user 42 May 21 13:29 1990 practice/blues -rw-rw-rw- myself/user 62 May 23 10:55 1990 practice/folk -rw-rw-rw- myself/user 40 May 21 13:30 1990 practice/jazz -rw-rw-rw- myself/user 10240 May 31 21:49 1990 practice/records When you use a directory name as a file name argument, `tar' acts on all the files (including sub-directories) in that directory.  File: tar.info, Node: How to Extract Members from an Archive, Next: How to Add Files to Existing Archives, Prev: How to List Archives, Up: Tutorial How to Extract Members from an Archive ====================================== *(This message will disappear, once this node revised.)* In order to extract members from an archive, use the `--extract' (`-x') option. Specify the name of the archive with `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). To extract specific archive members, give their member names as arguments. It essential to give their exact member name, as printed by `--list' (`-t'). This will create a copy of the archive member, with a file name the same as its name in the archive. Keeping the example of the two archives created at the beginning of this tutorial, `tar --extract --file=afiles.tar apple' would create a file `apple' in the current directory with the contents of the archive member `apple'. It would remove any file named `apple' already present in the directory, but it would not change the archive in any way. Remember that specifying the exact member name is important. `tar --extract --file=bfiles.tar baloons' will fail, because there is no member named `baloons'. To extract the member named `./baloons' you would need to specify `tar --extract --file=bfiles.tar ./baloons'. To find the exact member names of the members of an archive, use `--list' (`-t'). FIXME: xref Listing Archives. If you do not list any archive member names, then `--extract' (`-x') will extract all the members of the archive. If you give the `--verbose' (`-v') option, then `--extract' (`-x') will print the names of the archive members as it extracts them. * Menu: * Extracting Files bis:: * Extracting Files from an Archive ter:: * Extracting Specific Files ter:: * Extracting Directories ter::  File: tar.info, Node: Extracting Files bis, Next: Extracting Files from an Archive ter, Prev: How to Extract Members from an Archive, Up: How to Extract Members from an Archive Extract Files from an Archive into Your Current Directory --------------------------------------------------------- *(This message will disappear, once this node revised.)* Obviously, the ultimate goal of `tar' users is to eventually get their files back. To do this, use the `--extract' (`-x') or `--get' operation. `--extract' (`-x') can be used to retrieve individual files from an archive, or can be used to write all the files in the archive back into the file system. In the previous example you concatenated two archives, `music', and `practice/records'. To now retrieve the complete contents of `music' (the target file in the concatenation process), you would, from the home directory: * Invoke `tar' and specify the operation to extract files from an archive (`--extract' (`-x') or `--get'. * Specify the name of the archive the files will be extracted from--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the names of the files you wish to extract, as file name arguments (in this case you want to extract the entire archive, so you don't need to specify anything). % tar --extract --file=music tar: Could not make directory practice : File exists Because the files stored originally in `music' were stored as files in a subdirectory (not as files in the working directory), they are stored in the archive with a leading directory name--`tar', in restoring them, has tried to recreate that directory and failed: the directory already exists. The extraction has not been aborted, however. If you now change into the `practice' directory and generate a directory listing, you will find that `jazz', which we removed in an earlier example, has been resurrected. % cd practice % ls blues classical folk jazz records rock If you look more closely at the files in the directory, however, you will find that `blues' and `folk' are, in fact, the original versions of the file, which were stored in `music' at the beginning of the tutorial. `tar', in extracting the original files from `music', has overwritten the existing files in the file system. While the newer versions of the files were stored in `records' above, they can no longer be extracted from it. `records' too was archived by `tar' when the `practice' directory was stored in the archive file `music', and was restored to its older incarnation when the files in `practice' were overwritten. However, the newer version of `records' was concatenated with `music'. The contents of the newer version of `records', therefore, should have been extracted when all the contents of `music' were extracted. They were. `tar' has restored them into the working directory using the names with which they were originally stored. Because they were originally stored as part of `records', in the `practice' directory, they had no preceeding directory stored as part of their file names. To find the latest versions of `blues', `folk', `jazz', `rock' and `classical', look in your home directory. You may wish to restore the files in your `practice' directory to their last state before we extracted the files from `music'. Rather than moving the files from your home directory to the `practice' subdirectory, you can run the same extraction procedure as above using the `practice' subdirectory as your working directory: % cd practice % tar --extract --verbose --file=~/music practice/ practice/blues practice/folk practice/jazz practice/records blues folk jazz blues rock blues classical % If you now examine the files in the practice directory, you will find that the files have been restored to their previous, newer, states. The old versions of the files, which were stored in `music' with a preceeding directory name, have been written into a newly created subdirectory under the working directory (which is your `practice' subdirectory). The new subdirectory is also called `practice'.  File: tar.info, Node: Extracting Files from an Archive ter, Next: Extracting Specific Files ter, Prev: Extracting Files bis, Up: How to Extract Members from an Archive Extracting Files from an Archive -------------------------------- *(This message will disappear, once this node revised.)* Creating an archive is only half the job--there would be no point in storing files in an archive if you couldn't retrieve them. To extract files from an archive, use the `--extract' (`-x') operation. To extract specific files, use their names as file name arguments. If you use a directory name as a file name argument, `tar' extracts all the files (including subdirectories) in that directory. If you don't use any file name arguments, `tar' extracts all the files in the archive. Note: `tar' will extract an archive member into the file system without checking to see if there is already a file with the archive member's file name. If there is a file with that name, `tar' will *overwrite* that file and its contents will be lost. FIXME: xref keep-old  File: tar.info, Node: Extracting Specific Files ter, Next: Extracting Directories ter, Prev: Extracting Files from an Archive ter, Up: How to Extract Members from an Archive Extracting Specific Files ------------------------- *(This message will disappear, once this node revised.)* To extract specific files, specify them using file name arguments. In an example above, you created the archive file `~/practice/records', which contained the files `blues', `folk' and `jazz' in the `practice' directory. If, for some reason, you were to lose one of those text files (`rm ~/practice/blues'), you could extract it from the archive file. First, change into the `practice' directory. Then, * Invoke `tar' and specify the `--extract' (`-x') or `--get' operation. * Specify the archive that the files will be extracted from--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the files to extract, using file name arguments (if you don't specify any files, `tar' extracts all the archive members) % tar --extract --file=records blues If you list the contents of the directory, you will see that `blues' is back: % ls folk jazz records blues  File: tar.info, Node: Extracting Directories ter, Prev: Extracting Specific Files ter, Up: How to Extract Members from an Archive Extracting Directories ---------------------- *(This message will disappear, once this node revised.)* To extract a directory and all the files it contains, use the directory's name as a file name argument in conjunction with `tar +extract'. Remember-`tar' stores and extracts file names relative to the working directory. In a previous example you stored the directory `~/practice' in the archive file `~/music'. If you delete the contents of `practice', you can restore them using `tar'. First, change into the `practice' subdirectory (`cd ~/practice'). Then, remove all the files in `~/practice' (`rm *'). If you list the contents of the directory, you should now see that it is empty: %ls % Let's try to restore the contents of `practice' by extracting them from the archive file `~/music': tar --extract --file=~/music practice Now, list the contents of `practice' again: %ls practice What happened to the files? When you created `~/music', your working directory was your home directory. When you extracted `~/music', your working directory was `~/practice'. `tar' stored the files in `practice' relative to your home directory, and then extracted them relative to `~/practice'. The files are now in a new subdirectory, called `~/practice/practice'. To restore your files to their old positions, delete the new directory and its contents, and then redo the example above with your home directory as the working directory: % rm ~/practice/practice/* % rmdir practice % cd .. % tar --extract --file=music practice (`tar' will report that it is unable to create the directory `~/practice' because it already exists. This will not effect the extraction of the other archive members.)  File: tar.info, Node: How to Add Files to Existing Archives, Next: How to Delete Members from Archives, Prev: How to Extract Members from an Archive, Up: Tutorial How to Add Files to Existing Archives ===================================== *(This message will disappear, once this node revised.)* If you want to add files to an existing archive, then don't use `--create' (`-c'). That will erase the archive and create a new one in its place. Instead, use `--append' (`-r'). The command `tar --append --file=afiles.tar arbalest' would add the file `arbalest' to the existing archive `afiles.tar'. The archive must already exist in order to use `--append' (`-r'). As with `--create' (`-c'), the member names of the newly added files will be the exact same as their names given on the command line. The `--verbose' (`-v') option will print out the names of the files as they are written into the archive. If you add a file to an archive using `--append' (`-r') with the same name as an archive member already present in the archive, then the old member is not deleted. What does happen, however, is somewhat complex. FIXME: xref Multiple Members with the Same Name. If you want to replace an archive member, use `--delete' first, and then use `--append' (`-r'). FIXME: we want people to use the script for backups, so I an not going FIXME: to use backups as an explanation in the tutorial. (people can still FIXME: do it if they really want to) While you can use `tar' to create a new archive every time you want to store a file, it is more sometimes efficient to add files to an existing archive. To add new files to an existing archive, use the `--append' (`-r') operation. To add newer versions of archive members to an archive, use the `--update' (`-u') operation. While you can use `tar' to create an archive of an entire directory or directory tree, it is more efficient when performing backups to only archive those files which have been newly created or changed since the last backup. To add new files to an existing archive, or to add newer versions of old files, you can use the `--append' (`-r') operation, or the `--update' (`-u') operation. * Menu: * Append bis:: * Update bis:: * Concatenate bis::  File: tar.info, Node: Append bis, Next: Update bis, Prev: How to Add Files to Existing Archives, Up: How to Add Files to Existing Archives Appending Files to an Archive ----------------------------- *(This message will disappear, once this node revised.)* The simplest method of adding a file to an already existing archive is the `--append' (`-r') operation, which writes the files specified into the archive without regard to whether or not they are already among the archived files. When you use `--append' (`-r') you must specify file name arguments, there is no default. If you specify a file that already exists in the archive another copy of the file will be added to the end of the archive anyway. In the previous examples you created a file called `rock' in the practice directory which did not exist in either the archive file `records', in the practice directory, or the archive file `music', in the home directory. To add `rock' to `records', you would, while in the practice directory: * Invoke `tar' and specify the operation to add a file--`--append' (`-r'). * Specify the name of the archive to which the file will be added--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the name(s) of the file(s) to be added to the archive as the file name argument(s) % tar --append --file=records rock If you now use the `--list' (`-t') operation, you will see that `rock' has been added to the archive: % tar --list --file=records blues folk jazz rock While all newly created files have now been added to `records', it is still not current with respect to the contents of the practice directory. If you recall from the examples using `--compare' (`-d') above, `blues' was changed after the archive `records' was created. It is simple, however, to use `--append' (`-r') to correct the problem: % tar --append --verbose --file=records blues blues Because you specified the `--verbose' (`-v') option, `tar' has printed the name of the file being appended as it was acted on. If you now use `tar' with the `--list' (`-t') option specified to get the contents of the archive, you will optain the following: % tar --list -f records blues folk jazz rock blues The newest version of `blues' is now at the end of the archive. Because files are extracted from archives in the order in which they appear in the archive, and because extracted files are given the same names in the file system as they are stored under in the archive, when the files in `records' are extracted the newer version of `blues' (which has the same name as the older) will overwrite the version stored first. FIXME: xref Keep Old Files FIXME: --update wont take a directory argument if files that have been FIXME: archived from that directory are now no longer in it. (I assume FIXME: because it looks in the archive first for the directory listing.) FIXME: this is a bug The simplest method of adding a file to an existing archive is the `--append' (`-r') operation, which writes files into the archive without regard to whether or not they are already archive members. When you use `--append' (`-r') you must use file name arguments; there is no default. If you specify a file that is already stored in the archive, `tar' adds another copy of the file to the archive. If you have been following the previous examples, you should have a text file called `~/practice/rock' which has not been stored in either the archive file `~/practice/records', or the archive file `~/music'. To add `rock' to `records', first make `practice' the working directory (`cd practice'). Then: * Invoke `tar' and specify the `--append' (`-r') operation. * Specify the archive to which the file will be added--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the files to be added to the archive, using file name arguments For example: % tar --append --file=records rock If you list the archive members in `records', you will see that `rock' has been added to the archive: % tar --list --file=records blues folk jazz rock FIXME: this should be some kind of node. You can use `--append' (`-r') to keep archive members current with active files. Because `--append' (`-r') stores a file whether or not there is already an archive member with the same file name, you can use `--append' (`-r') to add newer versions of archive members to an archive. When you extract the file, only the version stored last will wind up in the file system. Because `--extract' (`-x') extracts files from an archive in sequence, and overwrites files with the same name in the file system, if a file name appears more than once in an archive the last version of the file will overwrite the previous versions which have just been extracted. If you recall from the examples using `--compare' (`-d') above, `blues' was changed after the archive `records' was created. It is simple, however, to use `--append' (`-r') to add the new version of `blues' to `records': % tar --append --verbose --file=records blues blues If you now list the contents of the archive, you will obtain the following: % tar --list -f records blues folk jazz rock blues The newest version of `blues' is at the end of the archive. When the files in `records' are extracted, the newer version of `blues' (which has the same name as the older) will overwrite the version stored first. When `--extract' (`-x') is finished, only the newer version of `blues' is in the file system. FIXME: xref keep-old-files  File: tar.info, Node: Update bis, Next: Concatenate bis, Prev: Append bis, Up: How to Add Files to Existing Archives Updating Files in an Archive ---------------------------- *(This message will disappear, once this node revised.)* While the `--append' (`-r') option is useful for updating files in an archive, to keep an archive current with `--append' (`-r') you must first use the `--compare' (`-d') or `--list' (`-t') options to determine what files have been changed (or be willing to waste space by adding identical copies of archived files to the ends of archives). It is simpler to use the `--update' (`-u') operation, and let `tar' do the work for you. The `--update' (`-u') option causes `tar' to add files to the end of an archive, just like the `--append' (`-r') option. When you invoke `tar' with the `--update' (`-u') option specified you must specify file name arguments. Unlike `--append' (`-r'), the `--update' (`-u') option causes `tar' to check the archive to be updated to see if the specified file is already stored. If the file (or one with the same name) is already in the archive, `tar' checks the modification date of the file in the archive and compares it to the file of the same name in the file system. The file is only appended to the archive if it is new or if its modification date has changed to a later one. FIXME: xref After-Date To see the `--update' (`-u') option at work, create a new file, `classical', in your practice directory, and add a line to the file `blues', using any text editor. Then invoke `tar' with the `--update' (`-u') operation and the `--verbose' (`-v') option specified, using the names of all the files in the practice directory as file name arguments: % tar --update --verbose --file=records blues folk rock classical blues classical % Because we have specified verbose mode, `tar' prints out the names of the files it is working on, which in this case are the names of the files that needed to be updated. If you now invoke `tar' with the `--list' (`-t') operation specified, to generate a listing of the files in the archive, you will see that `blues' and `classical' have been added to its end. [The reason `tar' does not overwrite the older file when updating it is because writing to the middle of a section of tape is a difficult process. Tapes are not designed to go backward. Even if they were, imagine what would happen if the newer version were longer than the older one.] To keep archive members up to date with their counterparts of the same name in the file system, use the `--update' (`-u') option. This adds a specified file to an archive if no file of that name is already stored in the archive. If there is already an archive member with the same name, `tar' checks the modification date of the archive member, and adds the file only if its modification date is later. If a file is stored in the archive but no longer exists under the same name in the active file system, `tar' reports an error. You could use the `--append' (`-r') option to keep an archive current, but do so you would either have to use the `--compare' (`-d') and `--list' (`-t') options to determine what files needed to be re-archived (which could waste a lot of time), or you would have to be willing to add identical copies of already archived files to the archive (which could waste a lot of space). You must use file name arguments with the `--update' (`-u') operation-if you don't specify any files, `tar' won't act on any files. To see the `--update' (`-u') option at work, create a new file, `~/practice/classical', and modify the file `~/practice/blues' (you can use a text editor, such as Emacs, to do both these things). Then, with `practice' as your working directory, invoke `tar' with the `--update' (`-u') option, using the names of all the files in the practice directory as file name arguments, and specifying the `--verbose' (`-v') option: % tar --update --verbose --file=records blues folk rock classical blues classical % Because you specified verbose mode, `tar' printed out the names of the files it acted on. If you now list the archive members of the archive, (`tar --list --file=records'), you will see that the file `classical' and another version of the file `blues' have been added to `records'. Note: When you update an archive, `tar' does not overwrite old archive members when it stores newer versions of a file. This is because archive members appear in an archive in the order in which they are stored, and some archive devices do not allow writing in the middle of an archive.  File: tar.info, Node: Concatenate bis, Prev: Update bis, Up: How to Add Files to Existing Archives Concatenating Archives ---------------------- *(This message will disappear, once this node revised.)* Rather than adding individual files onto the end of an archive, it may be more convenient to add archives themselves onto the end of an archive. While it may seem intuitive to use `cat', the utility for adding files together, for this purpose, archives created by `tar' incorporate an end of file marker which must be removed if the concatenated archives are to be read properly as one archive FIXME: xref Ignore zeros. To add archives to the end of another archive, therefore, you should use the `--concatenate' (`-A') operation. In earlier examples you created an archive file, `music', in your home directory. You have, however, since changed the contents of the `practice' directory which was stored in that archive. `records', the archive file in the `practice' directory, has recently been updated, and contains a current version of the files in `practice'. Rather than update the contents of `music', let's add `records' to it. * Change into the home directory (`cd ..') * Invoke `tar', and specify the operation to add archives to the end of another archive--`--concatenate' (`-A'). * Specify the name of the archive file to be added to--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the file name arguments, which are, unusually, the names of archive files. Remember to include the directory name in the file name, if the archive file is not in your working directory. % cd .. % tar --concatenate --file=music practice/records Rather than list the new contents of `music', let's extract all the files and see what happens. To concatenate archive files, use the `--concatenate' (`-A') option. This operation adds other archives to the end of an archive. While it may seem intuitive to concatenate archives using `cat', the utility for adding files together, archive files which have been "catted" together cannot be read properly by `tar'. Archive files incorporate an end of file marker-if archives are concatenated using `cat', this marker will appear before the end of the new archive. This will interfere with operations on that archive. FIXME: xref ignore-zeros In earlier examples, you stored the `~/practice' directory in an archive file, `~/music'. If you have been following the examples, you have since changed the contents of the `~/practice' directory. There is a current version of the files in the `practice' directory, however, stored in the archive file `~/practice/records'. To store current versions of the files in `practice' in the archive file `music', you can use `--concatenate' (`-A') to add the archive file `~/practice/records' to `music'. First, make sure you are in your home directory (`cd ~'). Then: * Invoke `tar', and specify the `--concatenate' (`-A') operation. * Specify the archive file to be added to--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the archives to be added, using file name arguments. In this case, the file name arguments are, unusually, the names of archive files. (Remember to include the path in the archive name, if the archive file is not in your working directory.) % cd ~ % tar --concatenate --file=music practice/records If you now list the contents of the `music', you see it now contains the archive members of `practice/records': %tar --list --file=music blues folk jazz rock blues practice/blues practice/folk practice/jazz practice/rock practice/blues practice/classical  File: tar.info, Node: How to Delete Members from Archives, Prev: How to Add Files to Existing Archives, Up: Tutorial How to Delete Members from Archives =================================== *(This message will disappear, once this node revised.)* You can delete members from an archive using `--delete'. Specify the name of the archive with `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). List the member names of the members to be deleted. (If you list no member names, then nothing will be deleted.) The `--verbose' (`-v') option will cause `tar' to print the names of the members as they are deleted. As with `--extract' (`-x'), it is important that you give the exact member names when using `tar --delete'. Use `--list' (`-t') to find out the exact member names in an archive. FIXME: xref Listing Archives. The `--delete' option only works with archives stored on disk. You cannot delete members from an archive stored on a tape. In some instances, it may be advantageous to remove some files from an archive stored on disk (it is never advantageous to delete files from an archive stored on tape--the linear nature of tape storage makes this action likely to scramble the archive). You can use the `--delete' operation to remove files from an archive. The names of files to be removed must be specified to `tar' as file name arguments. All versions of the named file are removed from the archive. Execution of the `--delete' operation can be very slow. To delete all versions of the file `blues' from the archive `records' in the `practice' directory, make sure you are in that directory, and then, * List the contents of the archive file `records' (see above for the steps involved) to insure that the file(s) you wish to delete are stored in the archive. (This step is optional) * Invoke `tar' and specify the operation to delete files from an archive (`--delete') * Specify the name of the archive file that the file(s) will be deleted--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the name(s) of the file(s) to be deleted, as file name arguments * List the contents of the archive file again--note that the files have been removed. (this step is also optional) % tar --list --file=records blues folk jazz % tar --delete --file=records blues % tar --list --file=records folk jazz % In some instances, you may want to remove some files from an archive stored on disk *Caution:* you should never delete files from an archive stored on tape-because of the linear nature of tape storage, doing this is likely to scramble the archive. To remove archive members from an archive, use the `--delete' operation. You must specify the names of files to be removed as file name arguments. All versions of the named file are removed from the archive. Execution of the `--delete' operation can be very slow. To delete all versions of the file `blues' from the archive `records' in the `practice' directory, make sure you are in that directory, and then: * List the contents of the archive file `records' (see above for the steps involved) to insure that the file(s) you wish to delete are stored in the archive. (This step is optional) * Invoke `tar' and specify the `--delete' operation (`--delete'). * Specify the name of the archive file that the file(s) will be deleted from--`--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME'). * Specify the files to be deleted, using file name arguments. * List the contents of the archive file again--note that the files have been removed. (this step is also optional) % tar --list --file=records blues folk jazz % tar --delete --file=records blues % tar --list --file=records folk jazz %  File: tar.info, Node: Invoking tar, Next: Basic tar Operations, Prev: Tutorial, Up: Top Invoking GNU `tar' ****************** *(This message will disappear, once this node revised.)* * Menu: * Synopsis:: * Option Styles:: * Options::  File: tar.info, Node: Synopsis, Next: Option Styles, Prev: Invoking tar, Up: Invoking tar General Synopsis of `tar' ========================= The usual way to invoke `tar' is: tar OPTION... [NAME]... You can actually type in arguments in any order, but in this manual the options always precede the other arguments, to make examples easier to understand. Further, the option stating the main operation mode (the `tar' "main command") is usually given first. There are surely many options to `tar', and three different style for writing them: mnemonic options, short options, and old options. These styles are discussed below. Some options make sense with any main command, while others are meaningful only with particular main commands. One option should state the main command, all others are truly optional. Beware that `tar' options are case sensitive. For example, {No Value For "List"} or {No Value For "List"} options are not equivalent to `--list' (`-t'), in fact, they do not even exist. Options `-T' and `-t' are different options, the first requires an argument for stating the name of a file providing a list of NAMEs, the second does not require an argument and is another way to write `--list' (`-t'). Each NAME in the synopsis above is interpreted as an archive member name when the main command is one of `--compare' (`-d'), `--delete', `--extract' (`-x'), `--list' (`-t') or `--update' (`-u'). For all other main commands, NAMEs are interpreted as the names of files (including directories) in the file system. `tar' interprets relative file names as being relative to the working directory. `tar' will make all file names relative (by removing leading `/'s when archiving or restoring files), unless you specify otherwise (using the `--absolute-names' (`-P') option). FIXME: xref File Name Interpretation , for more information about `--absolute-names' (`-P'). FIXME: yet another node name that is probably wrong. The distinction between file names and archive member names is especially important when shell globbing is used, and sometimes a source of confusion for newcomers. "Globbing" is the operation by which "wildcard" characters, `*' or `?' for example, are replaced and expanded into all existing files matching the given pattern. The problem is that shells may only glob using existing files in the file system. Only `tar' may glob on archive members, so when needed, you must ensure that wildcard characters reach `tar' without being interpreted by the shell first. Using a backslash before `*' or `?', or putting the whole argument between quotes, is usually sufficient for this. Even if NAMEs are often specified on the command line, they can also be read from a text file in the file system, using the `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') option. Each of the following subsection groups some options under a common functionality. You can use `tar' to store files in an archive, to extract them from an archive, and to do other types of archive manipulation. The primary argument to `tar', which is called the "operation", specifies which action to take. The other arguments to `tar' are either "options", which change the way `tar' performs an operation, or "file names", which specify the files `tar' is to act on. The typical `tar' command line syntax is: GNU `tar' returns only a few exit statuses. I'm really aiming simplicity in that area, for now. If you are not using the `--compare' (`-d') option, zero means that everything went well, besides maybe innocuous warnings. Nonzero means that something went wrong. Right now, as of today, "nonzero" is almost always 2, except for remote operations, where it may be 128.  File: tar.info, Node: Option Styles, Next: Options, Prev: Synopsis, Up: Invoking tar Many Styles for Options ======================= * Menu: * Mnemonic Options:: * Short Options:: * Old Options:: * Mixing Styles::  File: tar.info, Node: Mnemonic Options, Next: Short Options, Prev: Option Styles, Up: Option Styles Mnemonic Option Style --------------------- Each OPTION has at least one mnemonic option name starting with two dashes in a row, v.g. `--list' (`-t'). The mnemonic option names are more legible than the corresponding short or old option names, you may prefer them if you highly praise clarity. It sometimes happens that a single mnemonic option has many different different names, which are then synonymous. In addition, mnemonic option names can be given unique abbreviations. For example, `--cre' can be used in place of `--create' because there is no other mnemonic option which begins with `cre'. Some options require an argument. This is the case of the `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') option, which tells the name of the `tar' archive. The argument of a mnemonic option is usually given right after the option itself, and introduced by an equal sign. For example, the `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') option is given the `archive.tar' file as argument by using the notation `--file=archive.tar' for the mnemonic option. Mnemonic options are meant to be obvious and easy to remember, possibly more so than their corresponding short options, below. For example: tar --create --verbose --block-size=20 --file=/dev/rmt0 gives a fairly good set of hints about what the command does, even for those not fully acquainted with `tar'.  File: tar.info, Node: Short Options, Next: Old Options, Prev: Mnemonic Options, Up: Option Styles Short Option Style ------------------ Most options, but not all of them, also have a short option name starting with a single dash, and followed by a single character, v.g. `-t'. In fact, `-t' is exactly the short option name for the mnemonic option `--list' (`-t'), both having exactly the same meaning. The forms are absolutely identical in function. The short option names are faster to type than mnemonic option names. All along this manual, whenever a mnemonic option name is given, its equivalent short option name follows between parentheses, if such a short option name exists. Short options which require arguments use the immediately following argument, so it may be thought as being merely introduced right after it, usually separate by white space. It is also possible to stick the argument right after the short option name, using no intervening space. So one might write `-f archive.tar' or `-farchive.tar' instead of using `--file=archive.tar'. Both `--file=ARCHIVE-NAME' and `-f ARCHIVE-NAME' denote the option to give the archive a non-default name, which in the example is `archive.tar'. When the option is given separately, its argument follows it, as is usual for Unix programs. For example: tar -c -v -b 20 -f /dev/rmt0 Short options letters may be lumped together, but contrary to old options, they do not necessarily have to. When short options are nevertheless coalesced, use a single dash for them all. Only the last one in such a set is allowed to have an argument. (Clustering many options, the last of which taking an argument, seems to be fairly opaque writing to me. I would even like that GNU `getopt' be helpful enough to make this illegal.) If you move short options in the command, be sure to move their arguments along with them, if any. tar-1.11.8/doc/tar.info-3 644 625 1 140527 5770625052 10026 This is Info file tar.info, produced by Makeinfo-1.61 from the input file tar.texinfo. START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY This file documents GNU `tar', a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation.  File: tar.info, Node: Old Options, Next: Mixing Styles, Prev: Short Options, Up: Option Styles Old Option Style ---------------- *(This message will disappear, once this node revised.)* Old options are single letters not preceeded by any dash at all, and appearing *only* in the position immediately following the `tar' keyword in the command, after some white space. The letter of an old option is exactly the same letter as the corresponding short option. For example, the old option `t' is the same as the short option `-t', and consequently, the same as long option `--list' (`-t'). As far as we know, all `tar' programs, GNU and non-GNU, support old options. GNU `tar' supports them not only for historical reasons, but also because many people are used to them. All old options should be written as a single argument, without separating spaces, by lumping together all letters specifying these options. This set of letters should be the first to appear on the command line, after the `tar' program name; old options cannot appear anywhere else. Then, for any old option required an argument, the argument should follow on the command line. Arguments to the options should appear in the same order as the letters to which they correspond. The `tar' command synopsis might be rewritten: tar LETTER... [ARGUMENT]... [OPTION]... [NAME]... when old options are being used. This command syntax is useful because it lets you type the single letter forms of the operation and options as a single argument to `tar', without writing preceding `-'s or inserting spaces between letters. `tar cv' or `tar -cv' are equivalent to `tar -c -v'. For compatibility with Unix `tar', the first argument can contain an option letter (or a cluster of option letters) *not* introduced by a dash; for example, `tar cv' specifies the option `-v' in addition to the command `-c'. When options that need arguments are given together with the command, all the associated arguments follow, in the same order as the options. Thus, the example above could also be written in the old style as follows: tar cvbf 20 /dev/rmt0 Here `20' is the argument of `-b' and `/dev/rmt0' is the argument of `-f'. On the other hand, this old style syntax makes it difficult to match option letters with their corresponding arguments, and is often confusing. In the command `tar cvbf 20 /dev/rmt0', for example, `20' is the argument for `-b', `/dev/rmt0' is the argument for `-f', and `-v' does not have a corresponding argument. Even using short options like in `tar -c -v -b 20 -f /dev/rmt0' is clearer, putting all arguments next to the option they pertain to. If you want to reorder the letters in the old option argument, be sure to appropriately reorder any corresponding argument. This old way of writing `tar' options can surprise even experienced users. For example, the two commands: tar cfz archive.tar.gz file tar -cfz archive.tar.gz file are quite different. The first example uses `archive.tar.gz' as the value for option `f' and recognizes the option `z'. The second example, however, uses `z' as the value for option `f'--probably not what was intended. (I find it quite inelegant that `getopt' batches the remaining `z' as the value for `f'. I think that clarity dictates that clustering of option letters, when some require arguments, should be diagnosed and disallowed. But compatibility with traditional systems dictates it.) This second example could be corrected in many ways, among which: tar -czf archive.tar.gz file tar -cf archive.tar.gz -z file tar cf archive.tar.gz -z file  File: tar.info, Node: Mixing Styles, Prev: Old Options, Up: Option Styles Mixing Option Styles -------------------- All three styles may be intermixed in a single `tar' command, as long as the rules for each style are fully respected. In GNU `tar' up to 1.11.6, using old style options was cutting out the possibility of using many options not having short forms. Many users rightly expressed their frustration at fighting with the current `tar' option decoder, so I changed it. However, GNU `tar' needs to be compatible with other `tar's, in the things that other `tar's can do. Short options should provide upward compatibility. So, if the current option decoding raises incompatibilities, please let me know. Old style options and modern options may be mixed on a single call to the `tar' program. However, old style options should be introduced in the first argument only; modern options may be given only after all arguments to old style options have been collected. If this rule is not respected, a modern option might be falsely interpreted as the value of the argument to one of the old style options. For example, currently, all the following commands are wholly equivalent, and illustrate many combinations and orderings of option styles. tar --create --file=archive.tar tar --create -f archive.tar tar --create -farchive.tar tar --file=archive.tar --create tar --file=archive.tar -c tar -c --file=archive.tar tar -c -f archive.tar tar -c -farchive.tar tar -cf archive.tar tar -cfarchive.tar tar -f archive.tar --create tar -f archive.tar -c tar -farchive.tar --create tar -farchive.tar -c tar c --file=archive.tar tar c -f archive.tar tar c -farchive.tar tar cf archive.tar tar f archive.tar --create tar f archive.tar -c tar fc archive.tar On the other hand, the following commands are *not* equivalent to the previous set: tar -f -c archive.tar tar -fc archive.tar tar -fcarchive.tar tar -farchive.tarc tar cfarchive.tar These last examples mean something completely different of what the user might have intended. The first four specify that the `tar' archive would be a file named `-c', `c', `carchive.tar' or `archive.tarc', respectively. The first two examples also specify a single non-option, NAME argument having value `archive.tar'. The last example contains only old style option letters (repeating option `c' twice) and no argument value.  File: tar.info, Node: Options, Prev: Option Styles, Up: Invoking tar All Available Options ===================== *(This message will disappear, once this node revised.)* Options change the way `tar' performs an operation. `--absolute-names' `--after-date=DATE' Limit the operation to files changed after the given date. FIXME: xref File Exclusion . `--block-size=NUMBER' Specify the blocking factor of an archive. FIXME: xref Blocking Factor . `--compress' Specify a compressed archive. FIXME: xref Compressed Archives . `--compress-block.' Create a whole block sized compressed archive. FIXME: xref Compressed Archives . `--confirmation' Solicit confirmation for each file. FIXME: xref Interactive Operation FIXME: --selective should be a synonym. `--dereference' Treat a symbolic link as an alternate name for the file the link points to. FIXME: xref Symbolic Links . `--directory=`directory'' Change the working directory. FIXME: xref Changing Working Directory . `--exclude=PATTERN' Exclude files which match the regular expression PATTERN. FIXME: xref File Exclusion . `--exclude-from=`file'' Exclude files which match any of the regular expressions listed in the file `file'. FIXME: xref File Exclusion . `--file=ARCHIVE-NAME' Name the archive. FIXME: xref Archive Name ). `--files-from=`file'' Read file name arguments from a file on the file system. FIXME: xref File Name Lists . `--ignore-umask' Set modes of extracted files to those recorded in the archive. FIXME: xref File Writing Options . `--ignore-zeros' Ignore end-of-archive entries. FIXME: xref Archive Reading Options . FIXME: this should be changed to --ignore-end `--tape-length=N (-L)' FIXME: alternate way of doing multi archive, will go to that length and FIXME: prompts for new tape, automatically turns on multi-volume. this FIXME: needs to be written into main body as well `--info-script=PROGRAM-FILE' Create a multi-volume archive via a script. FIXME: xref Multi-Volume Archives . `--interactive' Ask for confirmation before performing any operation on a file or archive member. `--keep-old-files' Prevent overwriting during extraction. FIXME: xref File Writing Options . `--label=ARCHIVE-LABEL' Include an archive-label in the archive being created. FIXME: xref Archive Label . `--modification-time' Set the modification time of extracted files to the time they were extracted. FIXME: xref File Writing Options . `--multi-volume' Specify a multi-volume archive. FIXME: xref Multi-Volume Archives . `--newer=DATE' Limit the operation to files changed after the given date. FIXME: xref File Exclusion . `--newer-mtime=DATE' Limit the operation to files modified after the given date. FIXME: xref File Exclusion . `--old' Create an old format archive. FIXME: xref Old Style File Information . FIXME: did we agree this should go away as a synonym? `--old-archive' Create an old format archive. FIXME: xref Old Style File Information . `--one-file-system' Prevent `tar' from crossing file system boundaries when archiving. FIXME: xref File Exclusion . `--portability' Create an old format archive. FIXME: xref Old Style File Information . FIXME: was portability, may still need to be changed `--preserve-order' Help process large lists of file names on machines with small amounts of memory. FIXME: xref Archive Reading Options . `--preserve-permission' Set modes of extracted files to those recorded in the archive. FIXME: xref File Writing Options . `--read-full-blocks' Read an archive with a smaller than specified block size or which contains incomplete blocks. FIXME: xref Archive Reading Options ). FIXME: should be --partial-blocks (!) `--record-number' Print the record number where a message is generated. FIXME: xref Additional Information . `--same-order' Help process large lists of file names on machines with small amounts of memory. FIXME: xref Archive Reading Options . `--same-permission' Set the modes of extracted files to those recorded in the archive. FIXME: xref File Writing Options . `--sparse' Archive sparse files sparsely. FIXME: xref Sparse Files . `--starting-file=FILE NAME' Begin reading in the middle of an archive. FIXME: xref Scarce Disk Space . `--to-stdout' Write files to the standard output. FIXME: xref File Writing Options . `--uncompress' Specifdo a compressed archive. FIXME: xref Compressed Archives . `-V ARCHIVE-LABEL' Include an archive-label in the archive being created. FIXME: xref Archive Label . FIXME: was --volume `--verbose' Print the names of files or archive members as they are being operated on. FIXME: xref Additional Information . `--verify' Check for discrepancies in the archive immediately after it is written. FIXME: xref Write Verification . `-B' Read an archive with a smaller than specified block size or which contains incomplete blocks. FIXME: xref Archive Reading Options ). `-K FILE NAME' Begin reading in the middle of an archive. FIXME: xref Scarce Disk Space . `-M' Specify a multi-volume archive. FIXME: xref Multi-Volume Archives . `-N DATE' Limit operation to files changed after the given date. FIXME: xref File Exclusion . `-O' Write files to the standard output. FIXME: xref File Writing Options . FIXME: - P is absolute names, add when resolved. `-R' Print the record number where a message is generated. FIXME: xref Additional Information . `-S' Archive sparse files sparsely. FIXME: xref Sparse Files . `-T FILE' Read file name arguments from a file on the file system. FIXME: xref File Name Lists . `-W' Check for discrepancies in the archive immediately after it is written. FIXME: xref Write Verification . `-Z' Specify a compressed archive. FIXME: xref Compressed Archives . `-b NUMBER' Specify the blocking factor of an archive. FIXME: xref Blocking Factor . `-f ARCHIVE-NAME' Name the archive. FIXME: xref Archive Name ). `-h' Treat a symbolic link as an alternate name for the file the link points to. FIXME: xref Symbolic Links . `-i' Ignore end-of-archive entries. FIXME: xref Archive Reading Options . `-k' Prevent overwriting during extraction. FIXME: xref File Writing Options . `-l' Prevent `tar' from crossing file system boundaries when archiving. FIXME: xref File Exclusion . `-m' Set the modification time of extracted files to the time they were extracted. FIXME: xref File Writing Options . `-o' Create an old format archive. FIXME: xref Old Style File Information . `-p' Set the modes of extracted files to those recorded in the archive. FIXME: xref File Writing Options . `-s' Help process large lists of file names on machines with small amounts of memory. FIXME: xref Archive Reading Options . `-v' Print the names of files or archive members they are being operated on. FIXME: xref Additional Information . `-w' FIXME: see --interactive. `-z' Specify a compressed archive. FIXME: xref Compressed Archives . `-z -z' Create a whole block sized compressed archive. FIXME: xref Compressed Archives . FIXME: I would rather this were -Z. it is the only double letter short FIXME: form. `-C `directory'' Change the working directory. FIXME: xref Changing Working Directory . `-F PROGRAM-FILE' Create a multi-volume archive via a script. FIXME: xref Multi-Volume Archives . `-X `file'' Exclude files which match any of the regular expressions listed in the file `file'. FIXME: xref File Exclusion . * Menu: * Device Options:: * Blocking Options:: * Classification Options::  File: tar.info, Node: Device Options, Next: Blocking Options, Prev: Options, Up: Options Device selection and switching ------------------------------ *(This message will disappear, once this node revised.)* `-f [HOSTNAME:]FILE' `--file=[HOSTNAME:]FILE' Use archive file or device FILE on HOSTNAME. FIXME: xref Device . `--force-local' Archive file is local even if it contains a colon. FIXME: xref Device . `--rsh-command=COMMAND' Use remote COMMAND instead of `rsh'. FIXME: xref Device . `-[0-7][lmh]' Specify drive and density. FIXME: xref Device . `-M' `--multi-volume' Create/list/extract multi-volume archive. FIXME: xref Multi . `-L NUM' `--tape-length=NUM' Change tape after writing NUM x 1024 bytes. FIXME: xref Multi . `-F FILE' `--info-script=FILE' `--new-volume-script=FILE' Execute `file' at end of each tape. This implies `--multi-volume' (`-M')). FIXME: xref Multi .  File: tar.info, Node: Blocking Options, Next: Classification Options, Prev: Device Options, Up: Options Device blocking --------------- *(This message will disappear, once this node revised.)* `-b BLOCKS' `--block-size=BLOCKS' Set block size to BLOCKS * 512 bytes. FIXME: xref Blocking . `--block-compress' Block the output of compression for tapes. FIXME: xref Blocking . `-i' `--ignore-zeros' Ignore blocks of zeros in archive (means EOF). FIXME: xref Blocking . `-B' `--read-full-blocks' Reblock as we read (for reading 4.2BSD pipes). FIXME: xref Blocking .  File: tar.info, Node: Classification Options, Prev: Blocking Options, Up: Options Old classification of options ----------------------------- *(This message will disappear, once this node revised.)* The information here is to be revised and merged into the remainder of this document, possibly altering its structure. Options could be regrouped in three categories: General Options Options that are always meaningful. Creation Options Options for creating or updating an archive. Extraction Options Options for listing or extracting files. Here are the options that are always meaningful. `-B NUMBER', `--block-size NUMBER' `-f FILENAME', `--file FILENAME' `-C DIR', `--directory DIR' `-M', `--multi-volume' `-N DATE', `--after-date DATE' `-R', `--record-number' (`-R') `-T FILENAME', `--files-from FILENAME' `-v', `--verbose' (`-v') `-w', `--interactive' `-X FILE', `--exclude FILE' `-z', `-Z', `--compress', `--uncompress' Here are the options for creating or updating an archive. These options are used to control which files `tar' puts in an archive, or to control the format the archive is written in FIXME: ref Format . Except as noted elsewhere, these options are useful with the `--create' (`-c'), `--append' (`-r'), `--update' (`-u'), `--concatenate' (`-A'), and `--delete' commands. Also note that the {No Value For "read-full-block"} option FIXME: (pxref Extraction Options), is also useful with the `--append' (`-r'), `--update' (`-u'), `--concatenate' (`-A'), and `--delete' commands. `-G', `--incremental' `-h', `--dereference' (`-h') `-l', `--one-file-system' `-o', `--old-archive' (`-o') `--old', `--portability' `-S', `--sparse' `-V NAME', `--volume NAME' `-W', `--verify' Here are the options for listing or extracting files. The options in this section are meaningful with the `--extract' (`-x') command. Unless otherwise stated, they are also meaningful with the `--list' (`-t') command. `-B', `--read-full-blocks' `-G', `--incremental' `-i', `--ignore-zeros' `-k', `--keep-old-files' `-K FILENAME', `--starting-file FILENAME' `-m', `--modification-time' `-O', `--to-stdout' `-p', `--same-permissions', `--preserve-permissions' `-P', `--absolute-names' (`-P') `-s', `--same-order', `--preserve-order' `--preserve'  File: tar.info, Node: Basic tar Operations, Next: Specifying Names to tar, Prev: Invoking tar, Up: Top Basic `tar' Operations ********************** *(This message will disappear, once this node revised.)* This chapter describes the basic operations supported by the `tar' program. A given invocation of `tar' will do exactly one of these operations. An archive member in normally extracted into a file with the same name as the archive member. However, you can use the `--to-stdout' (`-O') to cause `tar' to write extracted archive members to standard output. If you extract multiple members, they appear on standard output concatenated, in the order they are found in the archive. The `--create' (`-c') operation writes a new archive, and the `--extract' (`-x') operation reads files from an archive and writes them into the file system. You can use other `tar' operations to write new information into an existing archive (adding files to it, adding another archive to it, or deleting files from it), and you can read a list of the files in an archive without extracting it using the `--list' (`-t') operation. The primary argument to `tar' is the "operation", which specifies what `tar' does. `tar' can be used to: * Add files to an existing archive--`--append' (`-r'). * Compare files in an archive with files in the file system--`--compare' (`-d') or `--diff'. * Add archives to another archive--`--concatenate' (`-A'). * Create an archive--`--create' (`-c'). * Delete files from an archive--`--delete'. * Extract files from an archive--`--extract' (`-x') or `--get'. * List the files in an archive--`--list' (`-t'). * Update an archive by appending newer versions of already stored files--`--update' (`-u'). FIXME: xref Reading and Writing , for more information about these operations. "Option" arguments to `tar' change details of the operation, such as archive format, archive name, or level of user interaction. You can specify more than one option. All options are optional. "File Name" arguments specify which files (including directory files) to archive, extract, delete or otherwise operate on. If you don't use any file name arguments, `--append' (`-r'), `--update' (`-u') and `--delete' will do nothing. The other operations of `tar' will act on defaults. When you use a file name argument to specify a directory file, `tar' acts on all the files in that directory, including sub-directories. You must give exactly one option from the following list to `tar'. This option specifies the basic operation for `tar' to perform. `--create' `-c' Create a new archive `--catenate' `--concatenate' `-A' Add the contents of one or more archives to another archive `--append' `-a' Add files to an existing archive `--list' `-t' List the members in an archive `--delete' Delete members from an archive `--extract' `--get' `-x' Extract members from an archive `--compare' `--diff' `-d' Compare members in an archive with files in the file system `--update' `-u' Update an archive by appending newer versions of already stored files The remaining options to `tar' change details of the operation, such as archive format, archive name, or level of user interaction. You can specify more than one option. The remaining arguments are interpreted either as file names or as member names, depending on the basic operation `tar' is performing. For `--append' (`-r') and `--create' (`-c') these arguments specify the names of files (which must already exist) to place in the archive. For the remaining operation types, the additional arguments specify archive members to compare, delete, extract, list, or update. When naming archive members, you must give the exact name of the member in the archive, as it is printed by `--list' (`-t'). When naming files, the normal file name rules apply. If you don't use any additional arguments, `--append' (`-r'), `--concatenate' (`-A'), and `--delete' will do nothing. Naturally, `--create' (`-c') will make an empty archive if given no files to add. The other operations of `tar' (`--list' (`-t'), `--extract' (`-x'), `--compare' (`-d'), and `--update' (`-u')) will act on the entire contents of the archive. If you give the name of a directory as either a file name or a member name, then `tar' acts recursively on all the files and directories beneath that directory. For example, the name `/' identifies all the files in the filesystem to `tar'. The operation argument to `tar' specifies which action you want to take. `-A' Adds copies of an archive or archives to the end of another archive. `-c' Creates a new archive. `-d' Compares files in the archive with their counterparts in the file system, and reports differences in file size, mode, owner, modification date and contents. `-r' Adds files to the end of the archive. `-t' Prints a list of the contents of the archive. `-x' Reads files from the archive and writes them into the active file system. `-u' Adds files to the end of the archive, but only if they are newer than their counterparts already in the archive, or if they do not already exist in the archive. `--catenate' Adds copies of an archive or archives to the end of another archive. `--append' Adds files to the end of the archive. `--append' Adds files to the end of the archive. `--catenate' Adds copies of an archive or archives to the end of another archive. `--compare' Compares files in the archive with their counterparts in the file system, and reports differences in file size, mode, owner, modification date and contents. `--concatenate' Adds copies of an archive or archives to the end of another archive. `--create' Creates a new archive. `--delete' Deletes files from the archive. All versions of the files are deleted. `--diff' Compares files in the archive with their counterparts in the file system, and reports differences in file size, mode, owner, modification date and contents. `--extract' Reads files from the archive and writes them into the active file system. `--get' Reads files from the archive and writes them into the active file system. `--list' Prints a list of the contents of the archive. `--update' Adds files to the end of the archive, but only if they are newer than their counterparts already in the archive, or if they do not already exist in the archive. `--version' Prints the version number of the `tar' program to the standard error. The program `tar' can create an archive, extract files from an archive, modify an archive, or list an archive's contents. Each time you run `tar', you must give a "command" to specify which one of these things you want to do. The command must always be in the first argument to `tar'. This argument can also contain options ( FIXME: pxref Invoking tar ). For compatibility with Unix `tar', the first argument is always treated as containing command and option letters even if it doesn't start with `-'. Thus, `tar c' is equivalent to `tar -c': both of them specify the `--create' (`-c') command to create an archive. In addition, a set of long-named options are provided which can be used instead of or intermixed with the single-letter flags. The long-named options are meant to be easy to remember and logical, while the single letter flags may not always be. Long-named options begin with `--'. Arguments after the first are either options, if they start with `-' or `--', or files to operate on. The file names that you give as arguments are the files that `tar' will act on--for example, they are the files to put in the archive, or the files to extract from it. If you don't give any file name arguments, the default depends on which command you used. Some commands use all relevant files; some commands have no default and will report an error if you don't specify files. If a file name argument actually names a directory, then that directory and all files and subdirectories (recursively) in it are used. Here is a list of the `tar' commands: `-c' `--create' Create a new archive. This command tells `tar' to create a new archive that contains the file(s) specified on the command line. If you don't specify files, all the files in the current directory are used. If the archive file already exists, it is overwritten; the old contents are lost. `-x' `--extract' `--get' Extract files from an archive. This command causes `tar' to extract the specified files from the archive. If no file names are given, all the files in the archive will be extracted. `-t' `--list' List the contents of an archive. This command causes `tar' to display a list of the files in the archive. If you specify file names, only the files that you specify will be mentioned (but each of them is mentioned only if it appears in the archive). `-d' `--diff' `--compare' Find differences between an archive and the corresponding online files. This command causes `tar' to compare the archive with the files in the file system. It will report differences in file size, mode, owner, and contents. If a file exists in the archive, but not in the file system, `tar' will report this. If you specify file names, those files are compared with the tape and they must all exist in the archive. If you don't specify files, all the files in the archive are compared. `-r' `--append' Append files to the end of an archive. This command causes `tar' to add the specified file(s) to the end of the archive. This assumes that the archive file already exists and is in the proper format (which probably means it was created previously with the `tar' program). If the archive is not in a format that `tar' understands, the results will be unpredictable. You must specify the files to be used; there is no default. `-u' `--update' Only append files newer than the version in an archive. This command causes `tar' to add the specified files to the end of the archive, like `--append' (`-r'), but only when a file doesn't already exist in the archive or is newer than the version in the archive (the last-modification time is compared). Adding files to the end of an archive can be very slow. You must specify the files to be used; there is no default. `-A' `--catenate' `--concatenate' Append existing archives to another archive. This command is used for concatenating several archive files into one big archive file. The files to operate on should all be archive files. They are all appended to the end of the archive file which `tar' works on. (The other files are not changed). You might be tempted to use `cat' for this, but it won't ordinarily work. A `tar' archive contains data which indicates the end of the archive, so appended material is ignored. This command works because it removes the end-of-archive markers from the middle of the result. `--delete' Delete from the archive (not on tapes!). This command causes `tar' to delete the specified files from the archive. This command is extremely slow. Warning: Use of this command on archives stored on magnetic tape may result in a scrambled archive. There is no safe way (except for completely re-writing the archive) to delete files from a magnetic tape. The program `tar' can create an archive, extract files from an archive, modify an archive, or list an archive's contents. Each time you run `tar', you must give a "command" to specify which one of these things you want to do. The command must always be in the first argument to `tar'. This argument can also contain options ( FIXME: pxref Invoking tar ). For compatibility with Unix `tar', the first argument is always treated as containing command and option letters even if it doesn't start with `-'. Thus, `tar c' is equivalent to `tar -c': both of them specify the `--create' (`-c') command to create an archive. In addition, a set of long-named options are provided which can be used instead of or intermixed with the single-letter flags. The long-named options are meant to be easy to remember and logical, while the single letter flags may not always be. Long-named options begin with `--'. Arguments after the first are either options, if they start with `-' or `--', or files to operate on. The file names that you give as arguments are the files that `tar' will act on--for example, they are the files to put in the archive, or the files to extract from it. If you don't give any file name arguments, the default depends on which command you used. Some commands use all relevant files; some commands have no default and will report an error if you don't specify files. If a file name argument actually names a directory, then that directory and all files and subdirectories (recursively) in it are used. Modifying Archives Once an archive is created, you can add new archive members to it, add the contents of another archive, add newer versions of members already stored, or delete archive members already stored. To find out what files are already stored in an archive, use `tar --list --file=ARCHIVE-NAME'. FIXME: xref Listing Contents . * Menu: * Creating a New Archive:: * Adding to an Existing Archive:: * Updating an Archive:: * Combining Archives:: * Removing Archive Members:: * Listing Archive Members:: * Extracting Archive Members:: * Comparing Archives Members with Files:: * Matching Format Parameters::  File: tar.info, Node: Creating a New Archive, Next: Adding to an Existing Archive, Prev: Basic tar Operations, Up: Basic tar Operations Creating a New Archive ====================== *(This message will disappear, once this node revised.)* The `--create' (`-c') option causes `tar' to create a new archive. The files to be archived are then named on the command line. Each file will be added to the archive with a member name exactly the same as the name given on the command line. (When you give an absolute file name `tar' actually modifies it slightly, FIXME: ref Absolute Names .) If you list no files to be archived, then an empty archive is created. If there are two many files to conveniently list on the command line, you can list the names in a file, and `tar' will read that file. FIXME: xref Reading Names from a File . If you name a directory, then `tar' will archive not only the directory, but all its contents, recursively. For example, if you name `/', then `tar' will archive the entire filesystem. Do not use the option to add files to an existing archive; it will delete the archive and write a new one. Use `--append' (`-r') instead. ( FIXME: xref Adding to an Existing Archive .) There are various ways of causing `tar' to skip over some files, and not archive them. FIXME: xref Specifying Names to tar . FIXME: operations should probably have examples, not tables. To create an archive, use `--create' (`-c'). To name the archive, use `--file=ARCHIVE-NAME' in conjunction with the `--create' (`-c') operation ( FIXME: pxref Archive Name ). If you do not name the archive, `tar' uses the value of the environment variable `TAPE' as the file name for the archive, or, if that is not available, `tar' uses a default archive name, usually that for tape unit zero. FIXME: xref Archive Name , for more information about specifying an archive name. The following example creates an archive named `stooges', containing the files `larry', `moe' and `curley': tar --create --file=stooges larry moe curley If you specify a directory name as a file name argument, `tar' will archive all the files in that directory. The following example creates an archive named `hail/hail/fredonia', containing the contents of the directory `marx': tar --create --file=hail/hail/fredonia marx If you don't specify files to put in the archive, `tar' archives all the files in the working directory. The following example creates an archive named `home' containing all the files in the working directory: tar --create --file=home FIXME: xref File Name Lists , for other ways to specify files to archive. Note: In the example above, an archive containing all the files in the working directory is being written to the working directory. GNU `tar' stores files in the working directory in an archive which is itself in the working directory without falling into an infinite loop. Other versions of `tar' may fall into this trap.  File: tar.info, Node: Adding to an Existing Archive, Next: Updating an Archive, Prev: Creating a New Archive, Up: Basic tar Operations Adding to an Existing Archive ============================= *(This message will disappear, once this node revised.)* The `--append' (`-r') option will case `tar' to add new files to an existing archive. It interprets file names and member names in exactly the same manner as `--create' (`-c'). Nothing happens if you don't list any names. This option never deletes members. If a new member is added under the same name as an existing member, then both will be in the archive, with the new member after the old one. For information on how this affects reading the archive, FIXME: ref Multiple Members with the Same Name . This operation cannot be performed on some tape drives, unfortunately, due to deficiencies in the formats thoes tape drives use. To add files to an archive, use `--append' (`-r'). The archive to be added to must already exist and be in proper archive format (which normally means it was created previously using `tar'). If the archive was created with a different block size than now specified, `tar' will report an error ( FIXME: pxref Blocking Factor ). If the archive is not a valid `tar' archive, the results will be unpredictable. You cannot add files to a compressed archive, however you can add files to the last volume of a multi-volume archive. FIXME: xref Matching Format Parameters . The following example adds the file `shemp' to the archive `stooges' created above: tar --append --file=stooges shemp You must specify the files to be added; there is no default. `--update' (`-u') acts like `--append' (`-r'), but does not add files to the archive if there is already a file entry with that name in the archive that has the same modification time. Both `--update' (`-u') and `--append' (`-r') work by adding to the end of the archive. When you extract a file from the archive, only the version stored last will wind up in the file system. Because `--extract' (`-x') extracts files from an archive in sequence, and overwrites files with the same name in the file system, if a file name appears more than once in an archive the last version of the file will overwrite the previous versions which have just been extracted. You should avoid storing older versions of a file later in the archive. Note: `--update' (`-u') is not suitable for performing backups, because it doesn't change directory content entries, and because it lengthens the archive every time it is used. FIXME: xref to scripted backup, listed incremental, for info on backups.  File: tar.info, Node: Updating an Archive, Next: Combining Archives, Prev: Adding to an Existing Archive, Up: Basic tar Operations Updating an Archive =================== *(This message will disappear, once this node revised.)* The `--update' (`-u') option updates a `tar' archive by comparing the date of the specified archive members against the date of the file with the same name. If the file has been modified more recently than the archive member, then the archive member is deleted (as with `--delete') and then the file is added to the archive (as with `--append' (`-r')). On media where the `--delete' option cannot be performed (such as magnetic tapes), the `--update' (`-u') option similarly fails. If no archive members are named (either on the command line or via `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES')), then the entire archive is processed in this manner.  File: tar.info, Node: Combining Archives, Next: Removing Archive Members, Prev: Updating an Archive, Up: Basic tar Operations Combining Archives ================== *(This message will disappear, once this node revised.)* The `--concatenate' (`-A') or {No Value For "catenate"} option causes `tar' to add the contents of several archives to an existing archive. Name the archives to be catenated on the command line. (Nothing happens if you don't list any.) The members, and their member names, will be copied verbatim from those archives. If this causes multiple members to have the same name, it does not delete either; all the members with the same name coexist. For information on how this affects reading the archive, FIXME: ref Multiple Members with the Same Name . You must use this option to concatenate archives. If you just combine them with `cat', the result will not be a valid `tar' format archive. This operation cannot be performed on some tape drives, unfortunately, due to deficiencies in the formats thoes tape drives use. To append copies of an archive or archives to the end of another archive, use `--concatenate' (`-A'). The source and target archives must already exist and have been created using compatable format parameters ( FIXME: pxref Matching Format Parameters ). `tar' will stop reading an archive if it encounters an end-of-archive marker. The `cat' utility does not remove end-of-archive markers, and is therefore unsuitable for concatenating archives. `--concatenate' (`-A') removes the end-of-archive marker from the target archive before each new archive is appended. FIXME: xref ignore-zeros You must specify the source archives using `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') ( FIXME: pxref Archive Name ). If you do not specify the target archive , `tar' uses the value of the environment variable `TAPE', or, if this has not been set, the default archive name. The following example adds the contents of the archive `hail/hail/fredonia' to the archive `stooges' (both archives were created in examples above): tar --catenate --file=stooges hail/hail/fredonia If you need to retrieve files from an archive that was added to using the `cat' utility, use the `--ignore-zeros' (`-i') option ( FIXME: pxref Archive Reading Options ).  File: tar.info, Node: Removing Archive Members, Next: Listing Archive Members, Prev: Combining Archives, Up: Basic tar Operations Removing Archive Members ======================== *(This message will disappear, once this node revised.)* You can use the `--delete' option to remove members from an archive. Name the members on the command line to be deleted. This option will rewrite the archive; because of this, it does not work on tape drives. If you list no members to be deleted, nothing happens. To delete archive members from an archive, use `--delete'. You must specify the file names of the members to be deleted. All archive members with the specified file names will be removed from the archive. The following example removes the file `curley' from the archive `stooges': tar --delete --file=stooges curley You can only use `--delete' on an archive if the archive device allows you to write to any point on the media. *Warning:* Don't try to delete an archive member from a magnetic tape, lest you scramble the archive. There is no safe way (except by completely re-writing the archive) to delete files from most kinds of magnetic tape. FIXME: how about automatic detection of archive media? give error FIXME: unless the archive device is either an ordinary file or different FIXME: input and output (--file=-).  File: tar.info, Node: Listing Archive Members, Next: Extracting Archive Members, Prev: Removing Archive Members, Up: Basic tar Operations Listing Archive Members ======================= *(This message will disappear, once this node revised.)* The `--list' (`-t') option will list the names of members of the archive. Name the members to be listed on the command line (to modify the way these names are interpreted, FIXME: pxref Specifying Names to tar ). If you name no members, then `--list' (`-t') will list the names of all the members of the archive. To see more than just the names of the members, use the `--verbose' (`-v') option to cause `tar' to print out a listing similar to that of `ls -l'. Listing the Contents of an Archive `--list' (`-t') prints a list of the file names of the archive members on the standard output. If you specify FILE NAME arguments on the command line (or using the `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') option, FIXME: pxref File Name Lists ), only the files you specify will be listed, and only if they exist in the archive. Files not specified will be ignored, unless they are under a specific directory. If you include the `--verbose' (`-v') option, `tar' prints an `ls -l' type listing for the archive. FIXME: pxref Additional Information , for a description of the `--verbose' (`-v') option. If the blocking factor of the archive differs from the default, `tar' reports this. FIXME: xref Blocking Factor . FIXME: xref Archive Reading Options for a list of options which can be used to modify `--list' (`-t')'s operation. This example prints a list of the archive members of the archive `stooges': tar --list --file=stooges `tar' responds: larry moe shemp marx/julius marx/alexander marx/karl This example generates a verbose list of the archive members of the archive file `dwarves', which has a blocking factor of two: tar --list -v --file=blocks `tar' responds: tar: Blocksize = 2 records -rw------- ringo/user 42 May 1 13:29 1990 .bashful -rw-rw-rw- ringo/user 42 Oct 4 13:29 1990 doc -rw-rw-rw- ringo/user 42 Jul 20 18:01 1969 dopey -rw-rw---- ringo/user 42 Nov 26 13:42 1963 grumpy -rw-rw-rw- ringo/user 42 May 5 13:29 1990 happy -rw-rw-rw- ringo/user 42 May 1 12:00 1868 sleepy -rw-rw-rw- ringo/user 42 Jul 4 17:29 1776 sneezy  File: tar.info, Node: Extracting Archive Members, Next: Comparing Archives Members with Files, Prev: Listing Archive Members, Up: Basic tar Operations Extracting Archive Members ========================== *(This message will disappear, once this node revised.)* Use `--extract' (`-x') or `--get' to extract members from an archive. For each member named (or for the entire archive if no members are named) on the command line--or with `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES')--the a file is created with the contents of the archive member. The name of the file is the same as the member name. Various options cause `tar' to extract more than just file contents, such as the owner, the permissions, the modification date, and so forth. FIXME: begin The `--same-permissions' (`-p') or `--preserve-permissions' options cause `tar' to cause the new file to have the same permissions as the original file did when it was placed in the archive. Without this option, the current `umask' is used to affect the permissions. When extrating, `tar' normally sets the modification time of the file to the value recorded in the archive. The `--modification-time' (`-m') option causes `tar' to omit doing this. FIXME: end To read archive members from the archive and write them into the file system, use `--extract' (`-x'). The archive itself is left unchanged. If you do not specify the files to extract, `tar' extracts all the files in the archive. If you specify the name of a directory as a file name argument, `tar' will extract all files which have been stored as part of that directory. If a file was stored with a directory name as part of its file name, and that directory does not exist under the working directory when the file is extracted, `tar' will create the directory. FIXME: xref Selecting Archive Members , for information on specifying files to extract. The following example shows the extraction of the archive `stooges' into an empty directory: tar --extract --file=stooges Generating a listing of the directory (`ls') produces: larry moe shemp marx The subdirectory `marx' contains the files `julius', `alexander' and `karl'. If you wanted to just extract the files in the subdirectory `marx', you could specify that directory as a file name argument in conjunction with the `--extract' (`-x') operation: tar --extract --file=stooges marx *Warning:* Extraction can overwrite files in the file system. To avoid losing files in the file system when extracting files from the archive with the same name, use the `--keep-old-files' (`-k') option ( FIXME: pxref File Writing Options ). If the archive was created using `--block-size=512-SIZE' (`-b 512-SIZE'), `--compress' (`-Z') or `--multi-volume' (`-M'), you must specify those format options again when extracting files from the archive ( FIXME: pxref Format Variations ). * Menu: * Archive Reading Options:: * File Writing Options:: * Scarce Disk Space:: tar-1.11.8/doc/tar.info-4 644 625 1 142310 5770625053 10020 This is Info file tar.info, produced by Makeinfo-1.61 from the input file tar.texinfo. START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY This file documents GNU `tar', a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation.  File: tar.info, Node: Archive Reading Options, Next: File Writing Options, Prev: Extracting Archive Members, Up: Extracting Archive Members Options to Help Read Archives ----------------------------- *(This message will disappear, once this node revised.)* FIXME: each option wants its own node. summary after menu Normally, `tar' will request data in full block increments from an archive storage device. If the device cannot return a full block, `tar' will report an error. However, some devices do not always return full blocks, or do not require the last block of an archive to be padded out to the next block boundary. To keep reading until you obtain a full block, or to accept an incomplete block if it contains an end-of-archive marker, specify the `--read-full-blocks' (`-B') option in conjunction with the `--extract' (`-x') or `--list' (`-t') operations. FIXME: xref Listing Contents . The `--read-full-blocks' (`-B') option is turned on by default when `tar' reads an archive from standard input, or from a remote machine. This is because on BSD Unix systems, attempting to read a pipe returns however much happens to be in the pipe, even if it is less than was requested. If this option were not enabled, `tar' would fail as soon as it read an incomplete block from the pipe. If you're not sure of the blocking factor of an archive, you can read the archive by specifying `--read-full-blocks' (`-B') and `--block-size=512-SIZE' (`-b 512-SIZE'), using a blocking factor larger than what the archive uses. This lets you avoid having to determine the blocking factor of an archive. FIXME: xref Blocking Factor . `--read-full-blocks' `-B' Use in conjunction with `--extract' (`-x') to read an archive which contains incomplete blocks, or one which has a blocking factor less than the one specified. Normally `tar' stops reading when it encounters a block of zeros between file entries (which usually indicates the end of the archive). `--ignore-zeros' (`-i') allows `tar' to completely read an archive which contains a block of zeros before the end (i.e. a damaged archive, or one which was created by `cat'-ing several archives together). The `--ignore-zeros' (`-i') option is turned off by default because many versions of `tar' write garbage after the end-of-archive entry, since that part of the media is never supposed to be read. GNU `tar' does not write after the end of an archive, but seeks to maintain compatablity among archiving utilities. `--ignore-zeros' `-i' To ignore blocks of zeros (ie. end-of-archive entries) which may be encountered while reading an archive. Use in conjunction with `--extract' (`-x') or `--list' (`-t'). If you are using a machine with a small amount of memory, and you need to process large list of file names, you can reduce the amount of space `tar' needs to process the list. To do so, specify the `--same-order' (`-s') option and provide an ordered list of file names. This option tells `tar' that the NAME arguments provided on the command line, or read from a file using the `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') option, are listed in the same order as the files in the archive. You can create a file containing an ordered list of files in the archive by storing the output produced by `tar --list --file=ARCHIVE-NAME'. FIXME: xref Listing Contents , for information on the `--list' (`-t') operation. This option is probably never needed on modern computer systems. `--same-order' `--preserve-order' `-s' To process large lists of file names on machines with small amounts of memory. Use in conjunction with `--compare' (`-d'), `--list' (`-t') or `--extract' (`-x'). FIXME: we don't need/want --preserve to exist any more  File: tar.info, Node: File Writing Options, Next: Scarce Disk Space, Prev: Archive Reading Options, Up: Extracting Archive Members Changing How `tar' Writes Files ------------------------------- FIXME: find a better title *(This message will disappear, once this node revised.)* Normally, `tar' writes extracted files into the file system without regard to the files already on the system--files with the same name as archive members are overwritten. To prevent `tar' from extracting an archive member from an archive, if doing so will overwrite a file in the file system, use `--keep-old-files' (`-k') in conjunction with the `--extract' (`-x') operation. When this option is specified, `tar' reports an error stating the name of the files in conflict, instead of writing the file from the archive. `--keep-old files' `-k' Prevents `tar' from overwriting files in the file system during extraction. Normally, `tar' sets the modification times of extracted files to the modification times recorded for the files in the archive, but limits the permissions of extracted files by the current `umask' setting. To set the modification times of extracted files to the time when the files were extracted, use the `--modification-time' (`-m') option in conjunction with `--extract' (`-x'). `--modification-time' `-m' Sets the modification time of extracted archive members to the time they were extracted, not the time recorded for them in the archive. Use in conjunction with `--extract' (`-x'). To set the modes (access permissions) of extracted files to those recorded for those files in the archive, use the {No Value For "same-persmissions"} option in conjunction with the `--extract' (`-x') operation. FIXME: mib --- should be aliased to ignore-umask. `--preserve-permission' `--same-permission' `--ignore-umask' `-p' Set modes of extracted archive members to those recorded in the archive, instead of current umask settings. Use in conjunction with `--extract' (`-x'). FIXME: following paragraph needs to be rewritten: why doesnt' this cat FIXME: files together, why is this useful. is it really useful with FIXME: more than one file? To write the files extracted to the standard output, instead of creating the files on the file system, use `--to-stdout' (`-O') in conjunction with `--extract' (`-x'). This option is useful if you are extracting files to send them through a pipe, and do not need to preserve them in the file system. `--to-stdout' `-O' Writes files to the standard output. Used in conjunction with `--extract' (`-x'). FIXME: why would you want to do such a thing, how are files separated on FIXME: the standard output? is this useful with more that one file? are FIXME: pipes the real reason?  File: tar.info, Node: Scarce Disk Space, Prev: File Writing Options, Up: Extracting Archive Members Recovering From Scarce Disk Space --------------------------------- *(This message will disappear, once this node revised.)* If a previous attempt to extract files failed due to lack of disk space, you can use `--starting-file=NAME' (`-K NAME') to start extracting only after file NAME when extracting files from the archive. This assumes, of course, that there is now free space, or that you are now extracting into a different file system. `--starting-file=FILE NAME' `-K FILE NAME' Starts an operation in the middle of an archive. Use in conjunction with `--extract' (`-x') or `--list' (`-t'). If you notice you are running out of disk space during an extraction operation, you can also suspend `tar', remove unnecessary files from the file system, and then restart the same `tar' operation. In this case, `--starting-file=NAME' (`-K NAME') is not necessary. FIXME: xref --incremental, xref --interactive, xref --exclude  File: tar.info, Node: Comparing Archives Members with Files, Next: Matching Format Parameters, Prev: Extracting Archive Members, Up: Basic tar Operations Comparing Archives Members with Files ===================================== *(This message will disappear, once this node revised.)* The `--compare' (`-d') or `--diff' option compares the contents of the specified archive members against the files with the same names, and reports its findings. If no members are named on the command line, or through `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES'), then the entire archive is so compared.  File: tar.info, Node: Matching Format Parameters, Prev: Comparing Archives Members with Files, Up: Basic tar Operations Matching the Format Parameters ============================== *(This message will disappear, once this node revised.)* Some format parameters must be taken into consideration when modifying an archive: Compressed archives cannot be modified. You have to specify the block size of the archive when modifying an archive with a non-default block size. Multi-volume archives can be modified like any other archive. To add files to a multi-volume archive, you need to only mount the last volume of the archive media (and new volumes, if needed). For all other operations, you need to use the entire archive. If a multi-volume archive was labeled using `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') ( FIXME: pxref Archive Label ) when it was created, `tar' will not automatically label volumes which are added later. To label subsequent volumes, specify `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') again in conjunction with the `--append' (`-r'), `--update' (`-u') or `--concatenate' (`-A') operation. FIXME: example FIXME: xref somewhere, for more information about format parameters.  File: tar.info, Node: Specifying Names to tar, Next: Being Careful, Prev: Basic tar Operations, Up: Top Specifying Names to `tar' ************************* *(This message will disappear, once this node revised.)* * Menu: * Changing the Archive Name:: * Characteristics:: * Selection Options::  File: tar.info, Node: Changing the Archive Name, Next: Characteristics, Prev: Specifying Names to tar, Up: Specifying Names to tar Changing the Archive Name ========================= *(This message will disappear, once this node revised.)* By default, `tar' uses an archive file name compiled in when `tar' was built. Usually this refers to some physical tape drive on the machine. Often, the installer of `tar' didn't set the default to anything meaningful at all. As a result, most uses of `tar' need to tell `tar' where to find (or create) the archive. The `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') option selects another file to use as the archive. If the archive file name includes a colon (`:'), then it is assumed to be a file on another machine. If the archive file is `USER@HOST:FILE', then FILE is used on the host HOST. The remote host is accessed using the `rsh' program, with a username of USER. If the username is omitted (along with the `@' sign), then your user name will be used. (This is the normal `rsh' behavior.) It is necessary for the remote machine, in addition to permitting your `rsh' access, to have the `/usr/ucb/rmt' program installed. If you need to use a file whose name includes a colon, then the remote tape drive behavior can be inhibited by using the `--force-local' option. If the file name you give to `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') is a single dash (`-'), then `tar' will read the archive from (or write it to) standard input (or standard output). The Name of an Archive An archive can be saved as a file in the file system, sent through a pipe or over a network, or written to an I/O device such as a tape or disk drive. To specify the name of the archive, use the `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') option. An archive name can be the name of an ordinary file or the name of an I/O device. `tar' always needs an archive name--if you do not specify an archive name, the archive name comes from the environment variable `TAPE' or, if that variable is not specified, a default archive name, which is usually the name of tape unit zero (ie. /dev/tu00). If you use `-' as an ARCHIVE-NAME, `tar' reads the archive from standard input (when listing or extracting files), or writes it to standard output (when creating an archive). If you use `-' as an ARCHIVE-NAME when modifying an archive, `tar' reads the original archive from its standard input and writes the entire new archive to its standard output. FIXME: does standard input and output redirection work with all FIXME: operations? FIXME: need example for standard input and output (screen and keyboard?) To specify an archive file on a device attached to a remote machine, use the following: --file=HOSTNAME:/DEV/FILE NAME `tar' will complete the remote connection, if possible, and prompt you for a username and password. If you use `--file=@HOSTNAME:/DEV/FILE NAME', `tar' will complete the remote connection, if possible, using your username as the username on the remote machine. FIXME: is this clear? `--file=ARCHIVE-NAME' `-f ARCHIVE-NAME' Names the archive to create or operate on. Use in conjunction with any operation. Selecting Archive Members "File Name arguments" specify which files in the file system `tar' operates on, when creating or adding to an archive, or which archive members `tar' operates on, when reading or deleting from an archive. ( FIXME: pxref Reading and Writing .) To specify file names, you can include them as the last arguments on the command line, as follows: tar OPERATION [OPTION1 OPTION2 ..] [FILE NAME-1 FILE NAME-2 ...] If you specify a directory name as a file name argument, all the files in that directory are operated on by `tar'. If you do not specify files when `tar' is invoked, `tar' operates on all the non-directory files in the working directory (if the operation is `--create' (`-c')), all the archive members in the archive (if a read operation is specified), or does nothing (if any other operation is specified). When specifying the names of files or members to `tar', it by default takes the names of the files from the command line. There are other ways, however, to specify file or member names, or to modify the manner in which `tar' selects the files or members upon which to operate. In general, these methods work both for specifying the names of files and archive members.  File: tar.info, Node: Characteristics, Next: Selection Options, Prev: Changing the Archive Name, Up: Specifying Names to tar Selecting Files by Characteristic ================================= To avoid crossing file system boundaries when archiving parts of a directory tree, use `--one-file-system' (`-l'). This option only affects files that are archived because they are in a directory that is being archived; files explicitly named on the command line are archived regardless of where they reside. This option is useful for making full or incremental archival backups of a file system. If this option is used in conjunction with `--verbose' (`-v'), files that are excluded are mentioned by name on the standard error. `--one-file-system' `-l' Prevents `tar' from crossing file system boundaries when archiving. Use in conjunction with any write operation. To avoid operating on files whose names match a particular pattern, use the `--exclude=PATTERN' or `--exclude-from=FILE-OF-PATTERNS' (`-X FILE-OF-PATTERNS') options. When you specify the `--exclude=PATTERN' option, `tar' ignores files which match the PATTERN, which can be a single file name or a more complex expression. Thus, if you invoke `tar' with `tar --create --exclude=*.o', no files whose names end in `.o' are included in the archive. FIXME: what other things can you use besides "*"? `--exclude-from=FILE-OF-PATTERNS' (`-X FILE-OF-PATTERNS') acts like `--exclude=PATTERN', but specifies a file FILE containing a list of patterns. `tar' ignores files with names that fit any of these patterns. You can use either option more than once in a single command. `--exclude=PATTERN' Causes `tar' to ignore files that match the PATTERN. `--exclude-from=FILE' Causes `tar' to ignore files that match the patterns listed in FILE. FIXME: --exclude-from used to be "--exclude", --exclude didn't used to FIXME: exist. To operate only on files with modification or status-change times after a particular date, use `--after-date=DATE' (`-N DATE'). You can use this option with `--create' (`-c') or `--append' (`-r') to insure only new files are archived, or with `--extract' (`-x') to insure only recent files are resurrected. FIXME: or --newer DATE `--newer-mtime=DATE' acts like `--after-date=DATE' (`-N DATE') but tests just the modification times of the files, ignoring status-change times. FIXME: need example of --newer-mtime with quoted argument Remember that the entire date argument should be quoted if it contains any spaces. *Please Note:* `--after-date=DATE' (`-N DATE') and `--newer-mtime=DATE' should not be used for incremental backups. Some files (such as those in renamed directories) are not selected up properly by these options. FIXME: xref to incremental backup chapter when node name is decided. `--after-date=DATE' `--newer=DATE' `-N DATE' Acts on files only if their modification or inode-changed times are later than DATE. Use in conjunction with any operation. `--newer-mtime=DATE' Acts like `--after-date=DATE' (`-N DATE'), but only looks at modification times. FIXME: following is the getdate date format --- needs to be re-written, FIXME: made a sub-node: Time/Date Formats Accepted by getdate (omitting obscure constructions) The input consists of one or more of: time zone day date year in any order. Those in turn consist of (`|' and `/' mean `or', `[]' means `optional'): time: H am/pm | H:M [am/pm] | H:M:S [am/pm] zone: timezone-name | timezone-name dst day: day-name | day-name, | N day-name date: M/D | M/D/Y | month-name D | month-name D, Y | D month-name | D month-name Y year: Y am can also be a.m., pm can also be p.m. case and spaces around punctuation are not significant. FIXME: month and day names can be abbreviated. * Menu: * Reading Names from a File:: * Excluding Some Files:: * Operating Only on New Files:: * Crossing Filesystem Boundaries::  File: tar.info, Node: Reading Names from a File, Next: Excluding Some Files, Prev: Characteristics, Up: Characteristics Reading Names from a File ------------------------- *(This message will disappear, once this node revised.)* Instead of giving the names of files or archive members on the command line, you can put the names into a file, and then use the `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') option to `tar'. Give the name of the file which contains the list as the argument to `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES'). The file names should be separated by newlines in the list. If you give a single dash as a file name for `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES'), that is, you specify `--files-from=-' (`-T -'), then the file names are read from standard input. If you want to specify names that might contain newlines, use the `--null' option. Then, the file names should be separated by NUL characters (ASCII 000) instead of newlines. In addition, the `--null' option turns off the `--directory=DIRECTORY' (`-C DIRECTORY') option ( FIXME: pxref Changing Directory ). Reading a List of File Names from a File *(This message will disappear, once this node revised.)* To read file names from a file on the file system, instead of from the command line, use the `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') option. If you specify `-' as FILE, the file names are read from standard input. Note that using both `--files-from=-' (`-T -') and `--file=-' (`-f -') in the same command will not work unless the operation is `--create' (`-c'). FIXME: xref Archive Name , for an explanation of the `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') option. `--files-from=FILE' `-T FILE' Reads file name arguments from a file on the file system, instead of from the command line. Use in conjunction with any operation.  File: tar.info, Node: Excluding Some Files, Next: Operating Only on New Files, Prev: Reading Names from a File, Up: Characteristics Excluding Some Files -------------------- *(This message will disappear, once this node revised.)* The `--exclude=PATTERN' option will prevent any file or member which matches the regular expression PATTERN from being operated on. For example, if you want to create an archive with all the contents of `/tmp' except the file `/tmp/foo', you can use the command `tar --create --file=arch.tar --exclude=foo'. If there are many files you want to exclude, you can use the `--exclude-from=FILE-OF-PATTERNS' (`-X FILE-OF-PATTERNS') option. This works just like the `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') option: specify the name of a file as EXCLUDE-LIST which contains the list of patterns you want to exclude. FIXME: xref Regular Expressions for more information on the syntax and meaning of regular expressions.  File: tar.info, Node: Operating Only on New Files, Next: Crossing Filesystem Boundaries, Prev: Excluding Some Files, Up: Characteristics Operating Only on New Files --------------------------- *(This message will disappear, once this node revised.)* The `--after-date=DATE' (`-N DATE') or `--newer=DATE' limits `tar' to only operating on files which have been modified after the date specified. (For more information on how to specify a date, FIXME: xref Date Formats .) A file is considered to have changed if the contents have been modified, or if the owner, permissions, and so forth, have been changed. If you only want `tar' make the date comparison on the basis of the actual contents of the file's modification, then use the `--newer-mtime=DATE' option. You should never use this option for making incremental dumps. To learn how to use `tar' to make backups, FIXME: ref Making Backups .  File: tar.info, Node: Crossing Filesystem Boundaries, Prev: Operating Only on New Files, Up: Characteristics Crossing Filesystem Boundaries ------------------------------ *(This message will disappear, once this node revised.)* The `--one-file-system' (`-l') option causes `tar' to modify its normal behavior in archiving the contents of directories. If a file in a directory is not on the same filesystem as the directory itself (because it is a mounted filesystem in its own right), then `tar' will not archive that file, or (if it is a directory itself) anything beneath it. This does not necessarily limit `tar' to only archiving the contents of a single filesystem, because all files named on the command line, or through the `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') option, will always be archived.  File: tar.info, Node: Selection Options, Prev: Characteristics, Up: Specifying Names to tar Local file selection ==================== *(This message will disappear, once this node revised.)* Local file selection `-C DIR' `--directory DIR' Change to directory DIR. This option causes `tar' to change into the directory DIR before continuing. This option can be interspersed with the files `tar' is to work on. For example, tar -c iggy ziggy -C baz melvin will place the files `iggy' and `ziggy' from the current directory on the tape, followed by the file `melvin' from the directory `baz'. This option is especially useful when you have several widely separated files that you want to store in the same directory in the archive. Here, the file `melvin' is recorded in the archive under the precise name `melvin', *not* `baz/melvin'. Thus, the archive will contain three files that all appear to have come from the same directory; if the archive is extracted with plain `tar -x', all three files will be created in the current directory. Contrast this with the command: tar -c iggy ziggy bar/melvin which records the third file in the archive under the name `bar/melvin' so that, if plain `tar -x' is used, the third file will be created in a subdirectory named `bar'. Suppose that, without changing your current directory, you want to call `tar' to dump files from `/users/ctd/dipp' say. Then `--directory=DIRECTORY' (`-C DIRECTORY') is for you. You could do things like: tar cfC archive.tar /users/ctd/dipp . (the `.' means the current directory, once the `--directory=DIRECTORY' (`-C DIRECTORY') obeyed). Some people might want some option to extract everything from an archive in the current directory, ignore directory structure in the archive. This is so rarely proper that I doubt such an option would be really useful. It would only help getting around improper `tar' usage, it might even encourage improper usage. In general, `--directory=DIRECTORY' (`-C DIRECTORY') might be used to produce archives with a cleaner structure in the first place. `-T FILENAME' `--files-from=FILENAME' Get names to extract or create from file FILENAME. Instead of taking the list of files to work on from the command line, the list of files to work on is read from the file FILENAME. If FILENAME is given as `-', the list is read from standard input. Note that using both `-T -' and `-f -' will not work unless you are using the `--create' (`-c') command. This is typically useful when you have generated the list of files to archive with `find'. `--null' This option causes `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') to read file names terminated by a NUL instead of a newline, so files whose names contain newlines can be archived using `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES'). The `--null' option is just like the one in GNU `xargs' and `cpio', and is useful with the `-print0' predicate of GNU `find'. In `tar', `--null' also causes `--directory=DIRECTORY' (`-C DIRECTORY') options to be treated as file names to archive, in case there are any files out there called `-C'. `--exclude=FILE' Exclude file FILE. `-X FILE' `--exclude-from=FILE' Exclude files listed in FILE. This option causes `tar' to read a list of regular expressions (in shell wildcard syntax), one per line, from FILE; `tar' will ignore files matching those regular expressions. Thus if `tar' is called as `tar -c -X foo .' and the file `foo' contains a single line `*.o', no files whose names end in `.o' will be added to the archive. Multiple `--exclude=PATTERN' options may be given. `-P' `--absolute-names' Do not strip leading `/'s from file names. By default, GNU `tar' drops a leading `/' on input or output. This option turns off this behavior; it's equivalent to changing to the root directory before running `tar' (except it also turns off the usual warning message). `-l' `--one-file-system' Stay in local filesystem when creating archive. This option causes `tar' to not cross filesystem boundaries when archiving parts of a directory tree. This option only affects files that are archived because they are in a directory that is archived; files named on the command line are archived regardless, and they can be from various file systems. This option is useful for making full or incremental archival backups of a filesystem, as with the Unix `dump' command. Files skipped due to this option are mentioned on standard error. `-K NAME' `--starting-file=NAME' Begin at file NAME in the archive. The `--starting-file=NAME' (`-K NAME') option causes `tar' to begin extracting or listing the archive with the file FILENAME, and to consider only the files starting at that point in the archive. This is useful if a previous attempt to extract files failed when it reached FILENAME due to lack of free space. (Assuming, of course, that there is now free space, or that you are now extracting into a different file system.) `-N DATE' `--newer=DATE' `--after-date=DATE' Only store files newer than DATE. This option causes `tar' to only work on files whose modification or inode-changed times are newer than the DATE given. The main use is for creating an archive; then only new files are written. If extracting, only newer files are extracted. Remember that the entire date argument must be quoted if it contains any spaces. The date is parsed using `getdate'. Changing the Names of Members when Archiving * Menu: * Changing Directory:: * Absolute File Names::  File: tar.info, Node: Changing Directory, Next: Absolute File Names, Prev: Selection Options, Up: Selection Options Changing Directory ------------------ *(This message will disappear, once this node revised.)* The `--directory=DIRECTORY' (`-C DIRECTORY') option causes `tar' to change its current working directory to DIRECTORY. Unlike most options, this one is processed at the point it occurs within the list of files to be processed. Consider the following command: tar --create --file=foo.tar -C /etc passwd hosts -C /lib libc.a This command will place the files `/etc/passwd', `/etc/hosts', and `/lib/libc.a' into the archive. However, the names of the archive members will be exactly what they were on the command line: `passwd', `hosts', and `libc.a'. The `--directory=DIRECTORY' (`-C DIRECTORY') option is frequently used to make the archive independent of the original name of the directory holding the files. Note that `--directory=DIRECTORY' (`-C DIRECTORY') options are interpreted consecutively. If `--directory=DIRECTORY' (`-C DIRECTORY') option specifies a relative file name, it is interpreted relative to the then current directory, which might not be the same as the original current working directory of `tar', due to a previous `--directory=DIRECTORY' (`-C DIRECTORY') option. When using `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES') ( FIXME: pxref Reading Names from a File ), you can put `-C' options in the file list. Unfortunately, you cannot put `--directory' options in the file list. (This interpretation can be disabled by using the `--null' option.) Changing the Working Directory Within a List of File Names *(This message will disappear, once this node revised.)* To change working directory in the middle of a list of file names, either on the command line or in a file specified using `--files-from=FILE-OF-NAMES' (`-T FILE-OF-NAMES'), use `--directory=DIRECTORY' (`-C DIRECTORY'). This will change the working directory to the directory DIRECTORY after that point in the list. For example, tar --create iggy ziggy --directory=baz melvin will place the files `iggy' and `ziggy' from the current directory into the archive, followed by the file `melvin' from the directory `baz'. This option is especially useful when you have several widely separated files that you want to store in the same directory in the archive. Note that the file `melvin' is recorded in the archive under the precise name `melvin', *not* `baz/melvin'. Thus, the archive will contain three files that all appear to have come from the same directory; if the archive is extracted with plain `tar --extract', all three files will be written in the current directory. Contrast this with the command tar -c iggy ziggy bar/melvin which records the third file in the archive under the name `bar/melvin' so that, if the archive is extracted using `tar --extract', the third file will be written in a subdirectory named `bar'. `--directory=`directory'' `-C `directory'' Changes the working directory. FIXME: need to test how extract deals with this, and add an example  File: tar.info, Node: Absolute File Names, Prev: Changing Directory, Up: Selection Options Absolute File Names ------------------- *(This message will disappear, once this node revised.)* When `tar' extracts archive members from an archive, it strips any leading slashes (`/') from the member name. This causes absolute member names in the archive to be treated as relative file names. This allows you to have such members extracted wherever you want, instead of being restricted to extracting the member in the exact directory named in the archive. For example, if the archive member has the name `/etc/passwd', `tar' will extract it as if the name were really `etc/passwd'. Other `tar' programs do not do this. As a result, if you create an archive whose member names start with a slash, they will be difficult for other people with an inferior `tar' program to use. Therefore, GNU `tar' also strips leading slashes from member names when putting members into the archive. For example, if you ask `tar' to add the file `/bin/ls' to an archive, it will do so, but the member name will be `bin/ls'. If you use the `--absolute-names' (`-P') option, `tar' will do neither of these transformations. FIXME: is this what this does, or does it just preserve the slash? To archive or extract files relative to the root directory, specify the `--absolute-names' (`-P') option. Normally, `tar' acts on files relative to the working directory--ignoring superior directory names when archiving, and ignoring leading slashes when extracting. When you specify `--absolute-names' (`-P'), `tar' stores file names including all superior directory names, and preserves leading slashes. If you only invoked `tar' from the root directory you would never need the `--absolute-names' (`-P') option, but using this option may be more convenient than switching to root. FIXME: should be an example in the tutorial/wizardry section using this FIXME: to transfer files between systems. FIXME: is write access an issue? `--absolute-names' Preserves full file names (inclusing superior dirctory names) when archiving files. Preserves leading slash when extracting files.  File: tar.info, Node: Being Careful, Next: Format Control, Prev: Specifying Names to tar, Up: Top Being Even More Careful *********************** * Menu: * Documentation:: * Checking Progress:: * Interactive Operation:: * Write Verification:: * Comparing:: * Portability:: * Write Protection::  File: tar.info, Node: Documentation, Next: Checking Progress, Prev: Being Careful, Up: Being Careful GNU `tar' documentation ======================= Being careful, the first thing is really checking that you are using GNU `tar', indeed. The `--version' option will generate a message giving confirmation that you are using GNU `tar', with the precise version of GNU `tar' you are using. `tar' identifies itself and prints the version number to the standard output, then immediately exits successfully, without doing anything else, ignoring all other options. For example, `tar --version' might return: GNU tar version 1.11.8 Another thing you might want to do is checking the spelling or meaning of some particular `tar' option, without resorting to this manual, for once you have carefully read it. GNU `tar' has a short help feature, triggerable through the `--help' option. By using this option, `tar' will print a usage message listing all available options on standard output, then exit successfully, without doing anything else and ignoring all other options. Even if this is only a brief summary, it may be several screens long. So, if you are not using some kind of scrollable window, you might prefer to use something like: tar --help | less presuming, here, that you like using `less' for a pager. Other popular pagers are `more' and `pg'. The perceptive reader would have noticed some contradiction in the previous paragraphs. It is written that both `--version' and `--help' print something, and have all other options ignored. In fact, they cannot ignore each other, and one of them has to win. We do not specify which is stronger, here; experiment if you really wonder! The short help output is quite succint, and you might have to get back to the full documentation for precise points. If you are reading this paragraph, you already have the `tar' manual in some form. This manual is available in printed form, as a kind of small book. It may printed out of the GNU `tar' distribution, provided you have TeX already installed somewhere, and a laser printer around. Just configure the distribution, execute the command `make dvi', then print `doc/tar.dvi' the usual way (contact your local guru to know how). If GNU `tar' has been conveniently installed at your place, this manual is also available in interactive, hypertextual form as an Info file. Just call `info tar' or, if you do not have the `info' program handy, use the Info reader provided within GNU Emacs, calling `tar' from the main Info menu.  File: tar.info, Node: Checking Progress, Next: Interactive Operation, Prev: Documentation, Up: Being Careful Checking `tar' progress ======================= Typically, `tar' performs most operations without reporting any information to the user except error messages. When using `tar' with many options, particularly ones with complicated or difficult-to-predict behavior, it is possible to make serious mistakes. `tar' provides several options that make observing `tar' easier. These options cause `tar' to print information as it progresses in its job, and you might want to use them just for being more careful about what is going on, or merely for entertaining yourself. If you have encountered a problem when operating on an archive, however, you may need more information than just an error message in order to solve the problem. The following options can be helpful diagnostic tools. Normally, the `--list' (`-t') command to list an archive prints just the file names (one per line) and the other commands are silent. When used with most operations, the `--verbose' (`-v') option causes `tar' to print the name of each file or archive member as it is processed. This and the other options which make `tar' print status information can be useful in monitoring `tar'. With `--create' (`-c') or `--extract' (`-x'), `--verbose' (`-v') used once just prints the names of the files or members as they are processed. Using it twice causes `tar' to print a longer listing (reminiscent of `ls -l') for each member. Since `--list' (`-t') already prints the names of the members, `--verbose' (`-v') used once with `--list' (`-t') causes `tar' to print an `ls -l' type listing of the files in the archive. The following examples both extract members with long list output: tar --extract --file=archive.tar --verbose --verbose tar xvv archive.tar Verbose output appears on the standard output except when an archive is being written to the standard output, as with `tar --create --file=- --verbose' (`tar cfv -', or even `tar cv'--if the installer let standard output be the default archive). In that case `tar' writes verbose output to the standard error stream. The `--totals' option--which is only meaningful when used with `--create' (`-c')--causes `tar' to print the total amount written to the archive, after it has been fully created. The `--checkpoint' option prints an occasional message as `tar' reads or writes the archive. In fact, it print directory names while reading the archive. It is designed for those who don't need the more detailed (and voluminous) output of `--record-number' (`-R'), but do want visual confirmation that `tar' is actually making forward progress. FIXME: There is some confusion here. It seems that -R once wrote a FIXME: message at `every' block read or written. The `--show-omitted-dirs' option, when reading an archive--with `--list' (`-t') or `--extract' (`-x'), for example--causes a message to be printed for each directory in the archive which is skipped. This happens regardless of the reason for skipping: the directory might not have been named on the command line (implicitly or explicitly), it might be excluded by the use of the `--exclude=PATTERN' option, or some other reason. If `--record-number' (`-R') is used, `tar' prints, along with every message it would normally produce, the record number within the archive where the message was triggered. This option is especially useful when reading damaged archives, since it helps pinpoint the damaged sections. It can also be used with `--list' (`-t') when listing a file-system backup tape, allowing you to choose among several backup tapes when retrieving a file later, in favor of the tape where the file appears earliest (closest to the front of the tape). FIXME: xref when the node name is set and the backup section written  File: tar.info, Node: Interactive Operation, Next: Write Verification, Prev: Checking Progress, Up: Being Careful Asking for Confirmation During Operations ========================================= Typically, `tar' carries out a command without stopping for further instructions. In some situations however, you may want to exclude some files and archive members from the operation (for instance if disk or storage space is tight). You can do this by excluding certain files automatically ( FIXME: pxref File Exclusion ), or by performing an operation interactively, using the `--interactive' (`-w') option. `tar' also accepts `--confirmation' for this option. When the `--interactive' (`-w') option is specified, before reading, writing, or deleting files, `tar' first prints a message for each such file, telling what operation it intends to take, then asks for confirmation on the terminal. The actions which require confirmation include adding a file to the archive, extracting a file from the archive, deleting a file from the archive, and deleting a file from disk. To confirm the action, you must type a line of input beginning with `y'. If your input line begins with anything other than `y', `tar' skips that file. If `tar' is reading the archive from the standard input, `tar' opens the file `/dev/tty' to support the interactive communications.  File: tar.info, Node: Write Verification, Next: Comparing, Prev: Interactive Operation, Up: Being Careful Verifying Data as It is Stored ============================== You can insure the accuracy of an archive by comparing files in the system with archive members. `tar' can compare an archive to the file system as the archive is being written, to verify a write operation, or can compare a previously written archive, to insure that it is up to date. To check for discrepancies in an archive immediately after it is written, use the `--verify' (`-W') option in conjunction with the `--create' (`-c') operation. When this option is specified, `tar' checks archive members against their counterparts in the file system, and reports discrepancies on the standard error. In multi-volume archives, each volume is verified after it is written, before the next volume is written. To verify an archive, you must be able to read it from before the end of the last written entry. This option is useful for detecting data errors on some tapes. Archives written to pipes, some cartridge tape drives, and some other devices cannot be verified.  File: tar.info, Node: Comparing, Next: Portability, Prev: Write Verification, Up: Being Careful Comparing an Archive with the File System ========================================= *(This message will disappear, once this node revised.)* `--compare' (`-d') compares archive members in an existing archive with their counterparts in the file system, and reports differences in file size, mode, owner, modification date and contents. If a file is represented in the archive but does not exist in the file system, `tar' reports a difference. If you use FILE NAME arguments in conjunction with `tar --compare', `tar' compares the archived versions of the files specified with their counterparts in the file system. If you specify a file that is not in the archive, `tar' will report an error. If you don't specify any files, `tar' compares all the files in the archive. Because `tar' only checks files in the archive against files in the file system, and not vice versa, it ignores files in the file system that do not exist in the archive. The following example compares the archive members `larry', `moe' and `curly' in the archive `stooges' with files of the same name in the file system. tar --compare --file=stooges larry moe curly If a file, for example `curly', did not exist in the archive, `tar' would report an error, as follows: curly: does not exist  File: tar.info, Node: Portability, Next: Write Protection, Prev: Comparing, Up: Being Careful Making `tar' Archives More Portable =================================== Creating a `tar' archive on a particular system, meant to be later useful on many other machines and with other versions of `tar', is more a challenge than you might think. `tar' archive formats evolved since the first versions of Unix, many such formats are flying around, not always comptabile between them. This section wants to discuss a few problems, and give some advice, for making `tar' archives more portable. One golden rule is simplicity. For example, limit your `tar' archives to contain only regular files and directories, avoiding other kind of special files. Do not attempt to save sparse files or contiguous files as such. Let's discuss a few more problems, in turn. * Menu: * Portable Names:: * Symbolic Links:: * Old V7 and POSIX:: * Checksumming Problems::  File: tar.info, Node: Portable Names, Next: Symbolic Links, Prev: Portability, Up: Portability Portable Names -------------- Use *straight* file and directory names, made up of printable ASCII characters, avoiding colons, slashes, backslashes, and other *dangerous* characters. Avoid deep directory nesting. Accounting for oldish System V machines, limit your file and directory names to 14 characters or less. If you intend to have your `tar' archives to be read under MSDOS, you should not rely on case distinction for file names, and you might use the GNU `doschk' program for helping you further diagnosing illegal MSDOS names, which are even more limited than System V's.  File: tar.info, Node: Symbolic Links, Next: Old V7 and POSIX, Prev: Portable Names, Up: Portability Symbolic Links -------------- Normally, when `tar' archives a symbolic link, it writes a record to the archive naming the target of the link. In that way, the `tar' archive is a faithful record of the filesystem contents. `--dereference' (`-h') is used with `--create' (`-c'), and causes `tar' to archive the files symbolic links point to, instead of the links themselves. When this option is used, when `tar' encounters a symbolic link, it will archive the linked-to file, instead of simply recording the presence of a symbolic link. The name under which the file is stored in the file system is not recorded in the archive. To record both the symbolic link name and the file name in the system, archive the file under both names. If all links were recorded automatically by `tar', an extracted file might be linked to a file name that no longer exists in the file system. If a linked-to file is encountered again by `tar' while creating the same archive, an entire second copy of it will be stored. (This *might* be considered a bug.) So, for portable archives, do not archive symbolic links as such, and use `--dereference' (`-h'): many systems do not support symbolic links, and moreover, your distribution might be unusable if it contains unresolved symbolic links.  File: tar.info, Node: Old V7 and POSIX, Next: Checksumming Problems, Prev: Symbolic Links, Up: Portability Old V7 and POSIX Archives ------------------------- GNU `tar' implements an early draft of the POSIX 1003.1 `ustar' standard which is different from the final standard. Adding support for the new changes in a backward-compatible fashion is not trivial. Certain old versions of `tar' cannot handle additional information recorded by newer `tar' programs. To create an archive in V7 format (not ANSI), which can be read by these old versions, specify the `--old-archive' (`-o') option in conjunction with the `--create' (`-c'). `tar' also accepts `--portability' for this option. When you specify it, `tar' leaves out information about directories, pipes, fifos, contiguous files, and device files, and specifies file ownership by group and user IDs instead of group and user names. When updating an archive, do not use `--old-archive' (`-o') unless the archive was created with using this option. In most cases, a *new* format archive can be read by an *old* `tar' program without serious trouble, so this option should seldom be needed. On the other hand, most modern `tar's are able to read old format archives, so it might be safer for you to always use `--old-archive' (`-o') for your distributions. tar-1.11.8/doc/tar.info-5 644 625 1 141420 5770625053 10022 This is Info file tar.info, produced by Makeinfo-1.61 from the input file tar.texinfo. START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY This file documents GNU `tar', a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation.  File: tar.info, Node: Checksumming Problems, Prev: Old V7 and POSIX, Up: Portability Checksumming Problems --------------------- SunOS and HP-UX `tar' fail to accept archives created using GNU `tar' and containing non-ASCII file names, because they use signed checksums, while GNU `tar' uses unsigned checksums while creating archives, as per POSIX standards. On reading, GNU `tar' computes both checksums and accept any. It is somewhat worrying that a lot of people may go around doing backup of their files using faulty (or at least non-standard) software, not learning about it until it's time to restore their missing files with an incompatible file extractor, or vice versa. GNU `tar' is supposed to compute both checksums, signed and unsigned, and accept any. However, 1.11.2 has a bug by which signed checksums are incorrectly initialized, so they do not work. This is corrected in the subsequent GNU `tar' versions. However, GNU `tar' has not been modified to *produce* incorrect archives to be read by buggy `tar''s. I've been told that when Sun first imported `tar' on their system, they recompiled it without realizing that the checksums were computed differently, because of a change in the default signing of `char''s in their compiler. So they started computing checksums wrongly, and stayed compatible with themselves afterwards. It now falls on the shoulders of SunOS and HP-UX users to get a `tar' able to read the good archives they receive.  File: tar.info, Node: Write Protection, Prev: Portability, Up: Being Careful Write Protection ================ All tapes and disks can be "write protected", to protect data on them from being changed. Once an archive is written, you should write protect the media to prevent the archive from being accidently overwritten or deleted. (This will protect the archive from being changed with a tape or floppy drive--it will not protect it from magnet fields or other physical hazards). The write protection device itself is usually an integral part of the physical media, and can be a two position (write enabled/write disabled) switch, a notch which can be popped out or covered, a ring which can be removed from the center of a tape reel, or some other changeable feature.  File: tar.info, Node: Format Control, Next: Media, Prev: Being Careful, Up: Top Controlling the Archive Format ****************************** * Menu: * Attributes Options:: * Type Options:: * Compression:: * Special Options for Archiving:: * Archive Structure:: * Modifiers Options::  File: tar.info, Node: Attributes Options, Next: Type Options, Prev: Format Control, Up: Format Control Handling of file attributes =========================== *(This message will disappear, once this node revised.)* Handling of file attributes `--atime-preserve' Do not change access times on dumped files. `-m' `--modification-time' Do not extract file modified time. When this option is used, `tar' leaves the modification times of the files it extracts as the time when the files were extracted, instead of setting it to the time recorded in the archive. This option is meaningless with `--list' (`-t'). `--same-owner' Create extracted files with the same ownership. `-p' `--same-permissions' `--preserve-permissions' Extract all protection information. This option causes `tar' to set the modes (access permissions) of extracted files exactly as recorded in the archive. If this option is not used, the current `umask' setting limits the permissions on extracted files. This option is meaningless with `--list' (`-t'). `-s' `--same-order' `--preserve-order' Sort names to extract to match archive. This option tells `tar' that the list of file names to be listed or extracted is sorted in the same order as the files in the archive. This allows a large list of names to be used, even on a small machine that would not otherwise be able to hold all the names in memory at the same time. Such a sorted list can easily be created by running `tar -t' on the archive and editing its output. This option is probably never needed on modern computer systems. `--preserve' Same as both `--same-permissions' (`-p') and `--same-order' (`-s'). The `--preserve' option has no equivalent short option name. It is equivalent to `--same-permissions' (`-p') plus `--same-order' (`-s').  File: tar.info, Node: Type Options, Next: Compression, Prev: Attributes Options, Up: Format Control Archive format selection ======================== *(This message will disappear, once this node revised.)* Archive format selection `-V NAME' `--label=NAME' Create archive with volume name NAME. This option causes `tar' to write out a "volume header" at the beginning of the archive. If `--multi-volume' (`-M') is used, each volume of the archive will have a volume header of `NAME Volume N', where N is 1 for the first volume, 2 for the next, and so on. `-z' `--gzip' `--ungzip' Filter the archive through `gzip'. This option works on physical devices (tape drives, etc.) and remote files as well as on normal files; data to or from such devices or remote files is reblocked by another copy of the `tar' program to enforce the specified (or default) block size. The default compression parameters are used; if you need to override them, avoid the `--gzip' (`-z') option and run `gzip' explicitly. (Or set the `GZIP' environment variable.) If the `--gzip' (`-z') option is given twice, or the `--compress-blocks' option is used, `tar' will pad the archive out to the next block boundary ( FIXME: pxref Blocking ). This may be useful with some devices that require that all write operations be a multiple of a certain size. The `--gzip' (`-z') option does not work with the `--multi-volume' (`-M') option, or with the `--update' (`-u'), `--append' (`-r'), `--concatenate' (`-A'), or `--delete' commands. It is not exact to say that GNU `tar' is to work in concert with `gzip' in a way similar to `zip', say. Surely, it is possible that `tar' and `gzip' be done with a single call, like in: tar cfz archive.tar.gz subdir to save all of `subdir' into a `gzip''ed archive. Later you can do: tar xfz archive.tar.gz to explode and unpack. The difference is that the whole archive is compressed. With `zip', archive members are archived individually. `tar''s method yields better compression. On the other hand, one can view the contents of a `zip' archive without having to decompress it. As for the `tar' and `gzip' tandem, you need to decompress the archive to see its contents. However, this may be done without needing disk space, by using pipes internally: tar tfz archive.tar.gz About corrupted compressed archives: `gzip''ed files have no redundancy, for maximum compression. The adaptive nature of the compression scheme means that the compression tables are implicitly spread all over the archive. If you lose a few blocks, the dynamic construction of the compression tables becomes unsychronized, and there is little chance that you could recover later in the archive. There are pending suggestions for having a per-volume or per-file compression in GNU `tar'. This would allow for viewing the contents without decompression, and for resynchronizing decompression at every volume or file, in case of corrupted archives. Doing so, we might loose some compressibility. But this would have make recovering easier. So, there are pros and cons. We'll see! `-Z' `--compress' `--uncompress' Filter the archive through `compress'. Otherwise like `--gzip' (`-z'). `--use-compress-program=PROG' Filter through PROG (must accept `-d').  File: tar.info, Node: Compression, Next: Special Options for Archiving, Prev: Type Options, Up: Format Control Using Less Space through Compression ==================================== * Menu: * Compressed Archives:: * Dealing with Compressed Archives:: * Sparse Files::  File: tar.info, Node: Compressed Archives, Next: Dealing with Compressed Archives, Prev: Compression, Up: Compression Creating and Reading Compressed Archives ---------------------------------------- *(This message will disappear, once this node revised.)* `--compress' (`-Z') indicates an archive stored in compressed format. The `--compress' (`-Z') option is useful in saving time over networks and space in pipes, and when storage space is at a premium. `--compress' (`-Z') causes `tar' to compress when writing the archive, or to uncompress when reading the archive. To perform compression and uncompression on the archive, `tar' runs the `compress' utility. `tar' uses the default compression parameters; if you need to override them, avoid the `--compress' (`-Z') option and run the `compress' utility explicitly. It is useful to be able to call the `compress' utility from within `tar' because the `compress' utility by itself cannot access remote tape drives. The `--compress' (`-Z') option will not work in conjunction with the `--multi-volume' (`-M') option or the `--append' (`-r'), `--update' (`-u'), `--append' (`-r') and `--delete' operations. FIXME: xref Modifying , for more information on these operations. If there is no compress utility available, `tar' will report an error. `--compress-blocks' is like `--compress' (`-Z'), but when used in conjunction with `--create' (`-c') also causes `tar' to pad the last block of the archive out to the next block boundary as it is written. This is useful with certain devices which require all write operations be a multiple of a specific size. *Please Note:* The `compress' program may be covered by a patent, and therefore we recommend you stop using it. We hope to have a different compress program in the future. We may change the name of this option at that time. `--compress' `--uncompress' `-z' `-Z' When this option is specified, `tar' will compress (when writing an archive), or uncompress (when reading an archive). Used in conjunction with the `--create' (`-c'), `--extract' (`-x'), `--list' (`-t') and `--compare' (`-d') operations. `--compress-block' `-z -z' Acts like `--compress' (`-Z'), but pads the archive out to the next block boundary as it is written when used in conjunction with the `--create' (`-c') operation. FIXME: why not use -Z instead of -z -z ?  File: tar.info, Node: Dealing with Compressed Archives, Next: Sparse Files, Prev: Compressed Archives, Up: Compression Dealing with Compressed Archives -------------------------------- *(This message will disappear, once this node revised.)* You can have archives be compressed by using the `--gzip' (`-z') option. This will arrange for `tar' to use the `gzip' program to be used to compress or uncompress the archive wren writing or reading it. To use the older, obsolete, `compress' program, use the `--compress' (`-Z') option. The GNU Project recommends you not use `compress', because there is a patent covering the algorithm it uses. Merely by running `compress' you could be sued for patent infringment. When using either `--gzip' (`-z') or `--compress' (`-Z'), `tar' does not do blocking ( FIXME: pxref Blocking ) correctly. Use `--gzip-block' or `--compress-blocks' instead when using real tape drives.  File: tar.info, Node: Sparse Files, Prev: Dealing with Compressed Archives, Up: Compression Archiving Sparse Files ---------------------- *(This message will disappear, once this node revised.)* A file is sparse if it contains blocks of zeros whose existance is recorded, but that have no space allocated on disk. When you specify the `--sparse' (`-S') option in conjunction with the `--create' (`-c') operation, `tar' tests all files for sparseness while archiving. If `tar' finds a file to be sparse, it uses a sparse representation of the file in the archive. FIXME: xref Creating Archives , for more information about creating archives. `--sparse' (`-S') is useful when archiving files, such as dbm files, likely to contain many nulls. This option dramatically decreases the amount of space needed to store such an archive. *Please Note:* Always use `--sparse' (`-S') when performing file system backups, to avoid archiving the expanded forms of files stored sparsely in the system. Even if your system has no no sparse files currently, some may be created in the future. If you use `--sparse' (`-S') while making file system backups as a matter of course, you can be assured the archive will always take no more space on the media than the files take on disk (otherwise, archiving a disk filled with sparse files might take hundreds of tapes). FIXME: xref incremental when node name is set. `tar' ignores the `--sparse' (`-S') option when reading an archive. `--sparse' `-S' Files stored sparsely in the file system are represented sparsely in the archive. Use in conjunction with write operations.  File: tar.info, Node: Special Options for Archiving, Next: Archive Structure, Prev: Compression, Up: Format Control Special Options for Archiving ============================= *(This message will disappear, once this node revised.)* To give the archive a name which will be recorded in it, use the `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') option. This will write a special record identifying VOLUME-LABEL as the name of the archive to the front of the archive which will be displayed when the archive is listed with `--list' (`-t'). If you are creating a multi-volume archive with `--multi-volume' (`-M') ( FIXME: pxref Using Multiple Tapes ), then the volume label will have `Volume NNN' appended to the name you give, where NNN is the number of the volume of the archive. (If you use the `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') option when reading an archive, it checks to make sure the label on the tape matches the one you give. FIXME: xref Special Options for Archiving .) Files in the filesystem occasionally have "holes." A hole in a file is a section of the file's contents which was never written. The contents of a hole read as all zeros. On many operating systems, actualdisk storage is not allocated for holes, but they are counted in the length of the file. If you archive such a file, `tar' could create an archive longer than the original. To have `tar' attempt to recognize the holes in a file, use `--sparse' (`-S'). When you use the `--sparse' (`-S') option, then, for any file using less disk space than would be expected from its length, `tar' searches the file for consecutive stretches of zeros. It then records in the archive for the file where the consecutive stretches of zeros are, and only archives the "real contents" of the file. On extraction (using `--sparse' (`-S') is not needed on extraction) any such files have hols created wherever the continuous stretches of zeros were found. Thus, if you use `--sparse' (`-S'), `tar' archives won't take more space than the original. When `tar' reads files, this causes them to have the access times updated. To have `tar' attempt to set the access times back to what they were before they were read, use the `--atime-preserve' option. This doesn't work for files that you don't own, unless you're root, and it doesn't interact with incremental dumps nicely ( FIXME: pxref Making Backups ), but it is good enough for some purposes.  File: tar.info, Node: Archive Structure, Next: Modifiers Options, Prev: Special Options for Archiving, Up: Format Control The Structure of an Archive =========================== *(This message will disappear, once this node revised.)* While an archive may contain many files, the archive itself is a single ordinary file. Like any other file, an archive file can be written to a storage device such as a tape or disk, sent through a pipe or over a network, saved on the active file system, or even stored in another archive. An archive file is not easy to read or manipulate without using the `tar' utility or Tar mode in Emacs. Physically, an archive consists of a series of file entries terminated by an end-of-archive entry, which consists of 512 zero bytes. A file entry usually describes one of the files in the archive (an "archive member"), and consists of a file header and the contents of the file. File headers contain file names and statistics, checksum information which `tar' uses to detect file corruption, and information about file types. More than archive member can have the same file name. One way this situation can occur is if more than one version of a file has been stored in the archive. For information about adding new versions of a file to an archive, FIXME: pxref Modifying . In addition to entries describing archive members, an archive may contain entries which `tar' itself uses to store information. FIXME: xref Archive Label , for an example of such an archive entry.  File: tar.info, Node: Modifiers Options, Prev: Archive Structure, Up: Format Control Operation mode modifiers ======================== *(This message will disappear, once this node revised.)* Operation mode modifiers `-W' `--verify' Attempt to verify the archive after writing. This option causes `tar' to verify the archive after writing it. Each volume is checked after it is written, and any discrepancies are recorded on the standard error output. Verification requires that the archive be on a back-space-able medium. This means pipes, some cartridge tape drives, and some other devices cannot be verified. `--remove-files' Remove files after adding them to the archive. `-k' `--keep-old-files' Do not overwrite existing files from archive. The `--keep-old-files' (`-k') option prevents `tar' from over-writing existing files with files with the same name from the archive. The `--keep-old-files' (`-k') option is meaningless with `--list' (`-t'). `-S' `--sparse' Handle sparse files efficiently. This option causes all files to be put in the archive to be tested for sparseness, and handled specially if they are. The `--sparse' (`-S') option is useful when many `dbm' files, for example, are being backed up. Using this option dramatically decreases the amount of space needed to store such a file. In later versions, this option may be removed, and the testing and treatment of sparse files may be done automatically with any special GNU options. For now, it is an option needing to be specified on the command line with the creation or updating of an archive. `-O' `--to-stdout' Extract files to standard output. When this option is used, instead of creating the files specified, `tar' writes the contents of the files extracted to its standard output. This may be useful if you are only extracting the files in order to send them through a pipe. This option is meaningless with `--list' (`-t'). `--ignore-failed-read' Do not exit with non-zero on unreadable files. FIXME: This section needs to be written *To come:* using Unix file linking capability to recreate directory structures--linking files into one subdirectory and then `tar'ring that directory. *to come:* nice hairy example using absolute-names, newer, etc. Piping one `tar' to another is an easy way to copy a directory's contents from one disk to another, while preserving the dates, modes, owners and link-structure of all the files therein. cd sourcedirectory; tar cf - . | (cd targetdir; tar xf -) or FIXME: the following using standard input/output correct?? cd sourcedirectory; tar --create --file=- . | (cd targetdir; tar --extract --file=-) Archive files can be used for transporting a group of files from one system to another: put all relevant files into an archive on one computer system, transfer the archive to another, and extract the contents there. The basic transfer medium might be magnetic tape, Internet FTP, or even electronic mail (though you must encode the archive with `uuencode' in order to transport it properly by mail). Both machines do not have to use the same operating system, as long as they both support the `tar' program. FIXME: mention uuencode on a paragraph of its own FIXME: end construction  File: tar.info, Node: Media, Next: Backups and Restoration, Prev: Format Control, Up: Top Tapes and Other Archive Media ***************************** *(This message will disappear, once this node revised.)* A few special cases about tape handling warrant more detailed description. These special cases are discussed below. Many complexities surround the use of `tar' on tape drives. Since the creation and manipulation of archives located on magnetic tape was the original purpose of `tar', it contains many features making such manipulation easier. Archives are usually written on dismountable media--tape cartridges, mag tapes, or floppy disks. The amount of data a tape or disk holds depends not only on its size, but also on how it is formatted. A 2400 foot long reel of mag tape holds 40 megabytes of data when formated at 1600 bits per inch. The physically smaller EXABYTE tape cartridge holds 2.3 gigabytes. Magnetic media are re-usable--once the archive on a tape is no longer needed, the archive can be erased and the tape or disk used over. Media quality does deteriorate with use, however. Most tapes or disks should be disgarded when they begin to produce data errors. EXABYTE tape cartridges should be disgarded when they generate an "error count" (number of non-usable bits) of more than 10k. Magnetic media are written and erased using magnetic fields, and should be protected from such fields to avoid damage to stored data. Sticking a floppy disk to a filing cabinet using a magnet is probably not a good idea. * Menu: * Device:: * Blocking:: * Many:: * Using Multiple Tapes:: * Archive Label::  File: tar.info, Node: Device, Next: Blocking, Prev: Media, Up: Media Device selection and switching ============================== *(This message will disappear, once this node revised.)* `-f [HOSTNAME:]FILE' `--file=[HOSTNAME:]FILE' Use archive file or device FILE on HOSTNAME. This option is used to specify the file name of the archive `tar' works on. If the file name is `-', `tar' reads the archive from standard input (when listing or extracting), or writes it to standard output (when creating). If the `-' file name is given when updating an archive, `tar' will read the original archive from its standard input, and will write the entire new archive to its standard output. If the file name contains a `:', it is interpreted as `hostname:filename'. If the HOSTNAME contains an "at" sign (`@'), it is treated as `user@hostname:filename'. In either case, `tar' will invoke the command `rsh' (or `remsh') to start up an `/etc/rmt' on the remote machine. If you give an alternate login name, it will be given to the `rsh'. Naturally, the remote machine must have an executable `/etc/rmt'. This program is free software from the University of California, and a copy of the source code can be found with the sources for `tar'; it's compiled and installed by default. If this option is not given, but the environment variable `TAPE' is set, its value is used; otherwise, old versions of `tar' used a default archive name (which was picked when `tar' was compiled). The default is normally set up to be the "first" tape drive or other transportable I/O medium on the system. Starting with version 1.11.5, GNU `tar' uses standard input and standard output as the default device, and I will not try anymore supporting automatic device detection at installation time. This was failing really in too many cases, it was hopeless. This is now completely left to the installer to override standard input and standard output for default device, if this seems preferrable to him/her. Further, I think *most* actual usages of `tar' are done with pipes or disks, not really tapes, cartridges or diskettes. Some users think that using standard input and output is running after trouble. This could lead to a nasty surprise on your screen if you forget to specify an output file name--especially if you are going through a network or terminal server capable of buffering large amounts of output. We had so many bug reports in that area of configuring default tapes automatically, and so many contradicting requests, that we finally consider the problem to be portably intractable. We could of course use something like `/dev/tape' as a default, but this is *also* running after various kind of trouble, going from hung processes to accidental destruction of real tapes. After having seen all this mess, using standard input and output as a default really sounds like the only clean choice left, and a very useful one too. GNU `tar' reads and writes archive in blocks, I suspect this is the main reason why block devices are preferred over character devices. Most probably, block devices are more efficient too. The installer could also check for `DEFTAPE' in `'. `--force-local' Archive file is local even if it contains a colon. `--rsh-command=COMMAND' Use remote COMMAND instead of `rsh'. This option exists so that people who use something other than the standard `rsh' (e.g., a Kerberized `rsh') can access a remote device. When this command is not used, the shell command found when the `tar' program was installed is used instead. This is the first found of `/usr/ucb/rsh', `/usr/bin/remsh', `/usr/bin/rsh', `/usr/bsd/rsh' or `/usr/bin/nsh'. The installer may have overriden this by defining the environment variable `RSH' *at installation time*. `-[0-7][lmh]' Specify drive and density. `-M' `--multi-volume' Create/list/extract multi-volume archive. This option causes `tar' to write a "multi-volume" archive--one that may be larger than will fit on the medium used to hold it. FIXME: xref Multi . `-L NUM' `--tape-length=NUM' Change tape after writing NUM x 1024 bytes. This option might be useful when your tape drivers do not properly detect end of physical tapes. By being slightly conservative on the maximum tape length, you might avoid the problem entirely. `-F FILE' `--info-script=FILE' `--new-volume-script=FILE' Execute `file' at end of each tape. This implies `--multi-volume' (`-M'). The Remote Tape Server In order to access the tape drive on a remote machine, `tar' uses the remote tape server written at the University of California at Berkeley. The remote tape server must be installed as `/etc/rmt' on any machine whose tape drive you want to use. `tar' calls `/etc/rmt' by running an `rsh' or `remsh' to the remote machine, optionally using a different login name if one is supplied. A copy of the source for the remote tape server is provided. It is Copyright (C) 1983 by the Regents of the University of California, but can be freely distributed. Instructions for compiling and installing it are included in the `Makefile'. Unless you use the {No Value For "absolue-names"} option, GNU `tar' will not allow you to create an archive that contains absolute file names (a file name beginning with `/'.) If you try, `tar' will automatically remove the leading `/' from the file names it stores in the archive. It will also type a warning message telling you what it is doing. When reading an archive that was created with a different `tar' program, GNU `tar' automatically extracts entries in the archive which have absolute file names as if the file names were not absolute. This is an important feature. A visitor here once gave a `tar' tape to an operator to restore; the operator used Sun `tar' instead of GNU `tar', and the result was that it replaced large portions of our `/bin' and friends with versions from the tape; needless to say, we were unhappy about having to recover the file system from backup tapes. For example, if the archive contained a file `/usr/bin/computoy', GNU `tar' would extract the file to `usr/bin/computoy', relative to the current directory. If you want to extract the files in an archive to the same absolute names that they had when the archive was created, you should do a `cd /' before extracting the files from the archive, or you should either use the `--absolute-names' (`-P') option, or use the command `tar -C / ...'. Some versions of Unix (Ultrix 3.1 is know to have this problem), can claim that a short write near the end of a tape succeeded, when it actually failed. This will result in the -M option not working correctly. The best workaround at the moment is to use a significantly larger blocksize than the default 20. In order to update an archive, `tar' must be able to backspace the archive in order to reread or rewrite a block that was just read (or written). This is currently possible only on two kinds of files: normal disk files (or any other file that can be backspaced with `lseek'), and industry-standard 9-track magnetic tape (or any other kind of tape that can be backspaced with the `MTIOCTOP' `ioctl'. This means that the `--append' (`-r'), `--update' (`-u'), `--concatenate' (`-A'), and `--delete' commands will not work on any other kind of file. Some media simply cannot be backspaced, which means these commands and options will never be able to work on them. These non-backspacing media include pipes and cartridge tape drives. Some other media can be backspaced, and `tar' will work on them once `tar' is modified to do so. Archives created with the `--multi-volume' (`-M'), `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL'), and `--incremental' (`-G') options may not be readable by other version of `tar'. In particular, restoring a file that was split over a volume boundary will require some careful work with `dd', if it can be done at all. Other versions of `tar' may also create an empty file whose name is that of the volume header. Some versions of `tar' may create normal files instead of directories archived with the `--incremental' (`-G') option. Some Common Problems and their Solutions: errors from system: permission denied no such file or directory not owner errors from `tar': directory checksum error header format error errors from media/system: i/o error device busy  File: tar.info, Node: Blocking, Next: Many, Prev: Device, Up: Media Blocking ======== *(This message will disappear, once this node revised.)* When writing to tapes, `tar' writes the contents of the archive in chunks known as "blocks". To change the default blocksize, use the `--block-size=512-SIZE' (`-b 512-SIZE') option. Each block will then be composed of SIZE records. (Each `tar' record is 512 bytes. FIXME: xref Archive Format .) Each file written to the archive uses at least one full block. As a result, using a larger block size can result in more wasted space for small files. On the other hand, a larger block size can ofter be read and written much more efficiently. Further complicating the problem is that some tape drives ignore the blocking entirely. For these, a larger block size can still improve performance (because the software layers above the tape drive still honor the blocking), but not as dramatically as on tape drives that honor blocking. Wher reading an archive, `tar' can usually figure out the block size on itself. When this is the case, and a non-standard block size was used when the archive was created, `tar' will print a message about a non-standard blocking factor, and then operate normally. On some tape devices, however, `tar' cannot figure out the block size itself. On most of those, you can specify a blocking factor (with `--block-size=512-SIZE' (`-b 512-SIZE')) larger than the actual blocking factor, and then use the `--read-full-blocks' (`-B') option. (If you specify a blocking factor with `--block-size=512-SIZE' (`-b 512-SIZE') and don't use the `--read-full-blocks' (`-B') option, then `tar' will not attempt to figure out the blocking size itself.) On some devices, you must always specify the block size exactly with `--block-size=512-SIZE' (`-b 512-SIZE') when reading, because `tar' cannot figure it out. In any case, use `--list' (`-t') before doing any extractions to see whether `tar' is reading the archive correctly. If you use a blocking factor larger than 20, older `tar' programs might not be able to read the archive, so we recommend this as a limit to use in practice. GNU `tar', however, will support arbitrarily large block sizes, limited only by the amount of virtual memory or the physical characteristics of the tape device. If you are writing a compressed archive to tape with `--compress' (`-Z') or `--gzip' (`-z') ( FIXME: pxref Input and Output ), `tar' will not block the archive correctly. This doesn't matter if you are writing the archive to a normal file or through a pipe, but if you are writing it to a tape drive, then this causes problems. Use `--compress-blocks' or `--gzip-block' instead, to cause `tar' to arrange to have blocking work correctly. * Menu: * Format Variations:: * Blocking Factor::  File: tar.info, Node: Format Variations, Next: Blocking Factor, Prev: Blocking, Up: Blocking Format Variations ----------------- *(This message will disappear, once this node revised.)* Format parameters specify how an archive is written on the archive media. The best choice of format parameters will vary depending on the type and number of files being archived, and on the media used to store the archive. To specify format parameters when accessing or creating an archive, you can use the options described in the following sections. If you do not specify any format parameters, `tar' uses default parameters. You cannot modify a compressed archive. If you create an archive with the `--block-size=512-SIZE' (`-b 512-SIZE') option specified ( FIXME: pxref Blocking Factor ), you must specify that block-size when operating on the archive. FIXME: xref Matching Format Parameters , for other examples of format parameter considerations.  File: tar.info, Node: Blocking Factor, Prev: Format Variations, Up: Blocking The Blocking Factor of an Archive --------------------------------- *(This message will disappear, once this node revised.)* The data in an archive is grouped into records, which are 512 bytes. Records are read and written in whole number multiples called "blocks". The number of records in a block (ie. the size of a block in units of 512 bytes) is called the "blocking factor". The `--block-size=512-SIZE' (`-b 512-SIZE') option specifies the blocking factor of an archive. The default blocking factor is typically 20 (ie. 10240 bytes), but can be specified at installation. To find out the blocking factor of an existing archive, use `tar --list --file=ARCHIVE-NAME'. This may not work on some devices. Blocks are seperated by gaps, which waste space on the archive media. If you are archiving on magnetic tape, using a larger blocking factor (and therefore larger blocks) provides faster throughput and allows you to fit more data on a tape (because there are fewer gaps). If you are archiving on cartridge, a very large blocking factor (say 126 or more) greatly increases performance. A smaller blocking factor, on the other hand, may be usefull when archiving small files, to avoid archiving lots of nulls as `tar' fills out the archive to the end of the block. In general, the ideal block size depends on the size of the inter-block gaps on the tape you are using, and the average size of the files you are archiving. FIXME: xref Creating Archives , for information on writing archives. FIXME: need example of using a cartridge with blocksize=126 or more Archives with blocking factors larger than 20 cannot be read by very old versions of `tar', or by some newer versions of `tar' running on old machines with small address spaces. With GNU `tar', the blocking factor of an archive is limited only by the maximum block size of the device containing the archive, or by the amount of available virtual memory. If you use a non-default blocking factor when you create an archive, you must specify the same blocking factor when you modify that archive. Some archive devices will also require you to specify the blocking factor when reading that archive, however this is not typically the case. Usually, you can use `--list' (`-t') without specifying a blocking factor--`tar' reports a non-default block size and then lists the archive members as it would normally. To extract files from an archive with a non-standard blocking factor (particularly if you're not sure what the blocking factor is), you can usually use the `--read-full-blocks' (`-B') option while specifying a blocking factor larger then the blocking factor of the archive (ie. `tar --extract --read-full-blocks --block-size=300'. FIXME: xref Listing Contents for more information on the `--list' (`-t') operation. FIXME: xref read-full-blocks for a more detailed explanation of that option. `--block-size=NUMBER' `-b NUMBER' Specifies the blocking factor of an archive. Can be used with any operation, but is usually not necessary with `--list' (`-t'). Device blocking `-b BLOCKS' `--block-size=BLOCKS' Set block size to BLOCKS * 512 bytes. This option is used to specify a "blocking factor" for the archive. When reading or writing the archive, `tar', will do reads and writes of the archive in blocks of BLOCK*512 bytes. The default blocking factor is set when `tar' is compiled, and is typically 20. Blocking factors larger than 20 cannot be read by very old versions of `tar', or by some newer versions of `tar' running on old machines with small address spaces. With a magnetic tape, larger blocks give faster throughput and fit more data on a tape (because there are fewer inter-record gaps). If the archive is in a disk file or a pipe, you may want to specify a smaller blocking factor, since a large one will result in a large number of null bytes at the end of the archive. When writing cartridge or other streaming tapes, a much larger blocking factor (say 126 or more) will greatly increase performance. However, you must specify the same blocking factor when reading or updating the archive. With GNU `tar' the blocking factor is limited only by the maximum block size of the device containing the archive, or by the amount of available virtual memory. `--block-compress' Block the output of compression for tapes. `-i' `--ignore-zeros' Ignore blocks of zeros in archive (means EOF). The `--ignore-zeros' (`-i') option causes `tar' to ignore blocks of zeros in the archive. Normally a block of zeros indicates the end of the archive, but when reading a damaged archive, or one which was created by `cat'-ing several archives together, this option allows `tar' to read the entire archive. This option is not on by default because many versions of `tar' write garbage after the zeroed blocks. Note that this option causes `tar' to read to the end of the archive file, which may sometimes avoid problems when multiple files are stored on a single physical tape. `-B' `--read-full-blocks' Reblock as we read (for reading 4.2BSD pipes). If `--read-full-blocks' (`-B') is used, `tar' will not panic if an attempt to read a block from the archive does not return a full block. Instead, `tar' will keep reading until it has obtained a full block. This option is turned on by default when `tar' is reading an archive from standard input, or from a remote machine. This is because on BSD Unix systems, a read of a pipe will return however much happens to be in the pipe, even if it is less than `tar' requested. If this option was not used, `tar' would fail as soon as it read an incomplete block from the pipe. This option is also useful with the commands for updating an archive. Tape blocking FIXME: Appropriate options should be moved here from elsewhere. When handling various tapes or cartridges, you have to take care of selecting a proper blocking, that is, the number of disk blocks you put together as a single tape block on the tape, without intervening tape gaps. A "tape gap" is a small landing area on the tape with no information on it, used for decelerating the tape to a full stop, and for later regaining the reading or writing speed. When the driver starts reading a tape block, the tape block has to be read whole without stopping, as a tape gap is needed to stop the tape motion without loosing information. Using higher blocking (putting more disk blocks per tape block) will use the tape more efficiently as there will be less tape gaps. But reading such tapes may be more difficult for the system, as more memory will be required to receive at once the whole block. Further, if there is a reading error on a huge tape block, this is less likely that the system will succeed in recovering the information. So, blocking should not be too low, nor it should be too high. `tar' uses by default a blocking of 20 for historical reasons, and it does not really matter when reading or writing to disk. Current tape technology would easily accomodate higher blockings. Sun recommends a blocking of 126 for Exabytes and 96 for DATs. Other manufacturers may use different recommendations for the same tapes. This might also depends of the buffering techniques used inside modern tape controllers. Some imposes a minimum blocking, or a maximum blocking. Others request blocking to be some exponent of two. So, there is no fixed rule for blocking. But blocking at read time should ideally be the same as blocking used at write time. At one place I know, with a wide variety of equipment, they found it best to use a blocking of 32 to guarantee that their tapes are fully interchangeable. I was also told that, for recycled tapes, prior erasure (by the same drive unit that will be used to create the archives) sometimes lowers the error rates observed at rewriting time.  File: tar.info, Node: Many, Next: Using Multiple Tapes, Prev: Blocking, Up: Media Many archives on one tape ========================= FIXME: Appropriate options should be moved here from elsewhere. Most tape devices have two entries in the `/dev' directory, or entries that come in pairs, which differ only in the minor number for this device. Let's take for example `/dev/tape', which often points to the only or usual tape device of a given system. There might be a corresponding `/dev/nrtape' or `/dev/ntape'. The simpler name is the *rewinding* version of the device, while the name having `nr' in it is the *no rewinding* version of the same device. A rewinding tape device will bring back the tape to its beginning point automatically when this device is opened or closed. Since `tar' opens the archive file before using it and closes it afterwards, this means that a simple: tar cf /dev/tape DIRECTORY will reposition the tape to its beginning both prior and after saving DIRECTORY contents to it, thus erasing prior tape contents and making it so that any subsequent write operation will destroy what has just been saved. So, a rewinding device is normally meant to hold one and only one file. If you want to put more than one `tar' archive on a given tape, you will need to avoid using the rewinding version of the tape device. You will also have to pay special attention to tape positioning. Errors in positionning may overwrite the valuable data already on your tape. Many people, burnt by past experiences, will only use rewinding devices and limit themselves to one file per tape, precisely to avoid the risk of such errors. Be fully aware that writing at the wrong position on a tape loses all information past this point and most probably until the end of the tape, and this destroyed information *cannot* be recovered. To save DIRECTORY-1 as a first archive at the beginning of a tape, and leave that tape ready for a second archive, you should use: mt -f /dev/nrtape rewind tar cf /dev/nrtape DIRECTORY-1 "Tape marks" are special magnetic patterns written on the tape media, which are later recognizable by the reading hardware. These marks are used after each file, when there are many on a single tape. An empty file (that is to say, two tape marks in a row) signal the logical end of the tape, after which no file exist. Usually, non-rewinding tape device drivers will react to the close request issued by `tar' by first writing two tape marks after your archive, and by backspacing over one of these. So, if you remove the tape at that time from the tape drive, it is properly terminated. But if you write another file at the current position, the second tape mark will be erased by the new information, leaving only one tape mark between files. So, you may now save DIRECTORY-2 as a second archive after the first on the same tape by issuing the command: tar cf /dev/nrtape DIRECTORY-2 and so on for all the archives you want to put on the same tape. Another usual case is that you do not write all the archives the same day, and you need to remove and store the tape between two archive sessions. In general, you must remember how many files are already saved on your tape. Suppose your tape already has 16 files on it, and that you are ready to write the 17th. You have to take care of skipping the first 16 tape marks before saving DIRECTORY-17, say, by using these commands: mt -f /dev/nrtape rewind mt -f /dev/nrtape fsf 16 tar cf /dev/nrtape DIRECTORY-17 In all the previous examples, we put aside blocking considerations, but you should do the proper things for that as well. FIXME: xref Blocking . * Menu: * Tape Positioning:: * mt::  File: tar.info, Node: Tape Positioning, Next: mt, Prev: Many, Up: Many Tape Positions and Tape Marks ----------------------------- *(This message will disappear, once this node revised.)* Just as archives can store more than one file from the file system, tapes can store more than one archive file. To keep track of where archive files (or any other type of file stored on tape) begin and end, tape archive devices write magnetic "tape marks" on the archive media. Tape drives write one tape mark between files, two at the end of all the file entries. If you think of data as a series of "0000"'s, and tape marks as "x"'s, a tape might look like the following: 0000x000000x00000x00x00000xx------------------------- Tape devices read and write tapes using a read/write "tape head"--a physical part of the device which can only access one point on the tape at a time. When you use `tar' to read or write archive data from a tape device, the device will begin reading or writing from wherever on the tape the tape head happens to be, regardless of which archive or what part of the archive the tape head is on. Before writing an archive, you should make sure that no data on the tape will be overwritten (unless it is no longer needed). Before reading an archive, you should make sure the tape head is at the beginning of the archive you want to read. (The `restore' script will find the archive automatically. FIXME: xref Scripted Restoration ). FIXME: xref mt , for an explanation of the tape moving utility. If you want to add new archive file entries to a tape, you should advance the tape to the end of the existing file entries, backspace over the last tape mark, and write the new archive file. If you were to add two archives to the example above, the tape might look like the following: 0000x000000x00000x00x00000x000x0000xx---------------- tar-1.11.8/doc/tar.info-6 644 625 1 142362 5770625053 10031 This is Info file tar.info, produced by Makeinfo-1.61 from the input file tar.texinfo. START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY This file documents GNU `tar', a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation.  File: tar.info, Node: mt, Prev: Tape Positioning, Up: Many The `mt' Utility ---------------- *(This message will disappear, once this node revised.)* FIXME: is it true that this only works on non-block devices? should FIXME: explain the difference, xref to block-size (fixed or variable). You can use the `mt' utility to advance or rewind a tape past a specified number of archive files on the tape. This will allow you to move to the beginning of an archive before extracting or reading it, or to the end of all the archives before writing a new one. FIXME: why isn't there an "advance 'til you find two tape marks together"? The syntax of the `mt' command is: mt [-f TAPENAME] OPERATION [NUMBER] where TAPENAME is the name of the tape device, NUMBER is the number of times an operation is performed (with a default of one), and OPERATION is one of the following: FIXME: is there any use for record operations? `eof' `weof' Writes NUMBER tape marks at the current position on the tape. `fsf' Moves tape position forward NUMBER files. `bsf' Moves tape position back NUMBER files. `rewind' Rewinds the tape. (Ignores NUMBER). `offline' `rewoff1' Rewinds the tape and takes the tape device off-line. (Ignores NUMBER). `status' Prints status information about the tape unit. FIXME: is there a better way to frob the spacing on the list? If you don't specify a TAPENAME, `mt' uses the environment variable TAPE; if TAPE does not exist, `mt' uses the device `/dev/rmt12'. `mt' returns a 0 exit status when the operation(s) were successful, 1 if the command was unrecognized, and 2 if an operation failed. FIXME: new node on how to find an archive? If you use `--extract' (`-x') with the `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') option specified, `tar' will read an archive label (the tape head has to be positioned on it) and print an error if the archive label doesn't match the ARCHIVE-NAME specified. ARCHIVE-NAME can be any regular expression. If the labels match, `tar' extracts the archive. FIXME: xref Archive Label . FIXME: xref Matching Format Parameters . FIXME: fix cross references `tar --list --label' will cause `tar' to print the label. FIXME: program to list all the labels on a tape?  File: tar.info, Node: Using Multiple Tapes, Next: Archive Label, Prev: Many, Up: Media Using Multiple Tapes ==================== *(This message will disappear, once this node revised.)* Often you might want to write a large archive, one larger than will fit on the actual tape you are using. In such a case, you can run multiple `tar' commands, but this can be inconvenient, particularly if you are using options like `--exclude=PATTERN' or dumping entire filesystems. Therefore, `tar' supports multiple tapes automatically. Use `--multi-volume' (`-M') on the command line, and then `tar' will, when it reaches the end of the tape, prompt for another tape, and continue the archive. Each tape will have an independent archive, and can be read without needing the other. (As an exception to this, the file that `tar' was archiving when it ran out of tape will usually be split between the two archives; in this case you need to extract from the first archive, using `--multi-volume' (`-M'), and then put in the second tape when prompted, so `tar' can restore both halves of the file.) When prompting for a new tape, `tar' accepts any of the following responses: `?' Request `tar' to explain possible responses `q' Request `tar' to exit immediately. `n FILE NAME' Request `tar' to write the next volume on the file FILE NAME. `!' Request `tar' to run a subshell. `y' Request `tar' to begin writing the next volume. (You should only type `y' after you have changed the tape; otherwise `tar' will write over the volume it just finished.) If you want more elaborate behavior than this, give `tar' the `--info-script=SCRIPT-NAME' (`-F SCRIPT-NAME') option. The file SCRIPT-NAME is expected to be a program (or shell script) to be run instead of the normal prompting procedure. When the program finishes, `tar' will immediately begin writing the next volume. The behavior of the `n' response to the normal tape-change prompt is not available if you use `--info-script=SCRIPT-NAME' (`-F SCRIPT-NAME'). The method `tar' uses to detect end of tape is not perfect, and fails on some operating systems or on some devices. You can use the `--tape-length=1024-SIZE' (`-L 1024-SIZE') option if `tar' can't detect the end of the tape itself. The SIZE argument should be the size of the tape. The volume number used by `tar' in its tape-change prompt can be changed; if you give the `--volno-file=FILE-OF-NUMBER' option, then FILE-OF-NUMBER should contain a decimal number. That number will be used as the volume number of the first volume written. When `tar' is finished, it will rewrite the file with the now-current volume number. (This does not change the volume number written on a tape label ( FIXME: pxref Special Options for Archiving ; it *only* affects the number used in the prompt.) If you want `tar' to cycle through a series of tape drives, then you can use the `n' response to the tape-change prompt. This is error prone, however, and doesn't work at all with `--info-script=SCRIPT-NAME' (`-F SCRIPT-NAME'). Therefore, if you give `tar' multiple `--file=ARCHIVE-NAME' (`-f ARCHIVE-NAME') options, then the specified files will be used, in sequence, as the successive volumes of the archive. Only when the first one in the sequence needs to be used again will `tar' prompt for a tape change (or run the info script). Multi-volume archives With `--multi-volume' (`-M'), `tar' will not abort when it cannot read or write any more data. Instead, it will ask you to prepare a new volume. If the archive is on a magnetic tape, you should change tapes now; if the archive is on a floppy disk, you should change disks, etc. Each volume of a multi-volume archive is an independent `tar' archive, complete in itself. For example, you can list or extract any volume alone; just don't specify `--multi-volume' (`-M'). However, if one file in the archive is split across volumes, the only way to extract it successfully is with a multi-volume extract command `--extract --multi-volume' (`-xM') starting on or before the volume where the file begins. * Menu: * Multi-Volume Archives:: * Tape Files::  File: tar.info, Node: Multi-Volume Archives, Next: Tape Files, Prev: Using Multiple Tapes, Up: Using Multiple Tapes Archives Longer than One Tape or Disk ------------------------------------- *(This message will disappear, once this node revised.)* To create an archive that is larger than will fit on a single unit of the media, use the `--multi-volume' (`-M') option in conjunction with the `--create' (`-c') option ( FIXME: pxref Creating Archives ). A "multi-volume" archive can be manipulated like any other archive (provided the `--multi-volume' (`-M') option is specified), but is stored on more than one tape or disk. When you specify `--multi-volume' (`-M'), `tar' does not report an error when it comes to the end of an archive volume (when reading), or the end of the media (when writing). Instead, it prompts you to load a new storage volume. If the archive is on a magnetic tape, you should change tapes when you see the prompt; if the archive is on a floppy disk, you should change disks; etc. You can read each individual volume of a multi-volume archive as if it were an archive by itself. For example, to list the contents of one volume, use `--list' (`-t'), without `--multi-volume' (`-M') specified. To extract an archive member from one volume (assuming it is described that volume), use `--extract' (`-x'), again without `--multi-volume' (`-M'). If an archive member is split across volumes (ie. its entry begins on one volume of the media and ends on another), you need to specify `--multi-volume' (`-M') to extract it successfully. In this case, you should load the volume where the archive member starts, and use `tar --extract --multi-volume'--`tar' will prompt for later volumes as it needs them. FIXME: xref Extracting From Archives for more information about extracting archives. `--info-script=SCRIPT-NAME' (`-F SCRIPT-NAME') is like `--multi-volume' (`-M'), except that `tar' does not prompt you directly to change media volumes when a volume is full--instead, `tar' runs commands you have stored in SCRIPT-NAME. This option can be used to broadcast messages such as `Someone please come change my tape' when performing unattended backups. When SCRIPT-NAME is done, `tar' will assume that the media has been changed. FIXME: There should be a sample program here, including an exit before FIXME: end. `--multi-volume' `-M' Creates a multi-volume archive, when used in conjunction with `--create' (`-c'). To perform any other operation on a multi-volume archive, specify `--multi-volume' (`-M') in conjunction with that operation. `--info-script=PROGRAM-FILE' `-F PROGRAM-FILE' Creates a multi-volume archive via a script. Used in conjunction with `--create' (`-c').  File: tar.info, Node: Tape Files, Prev: Multi-Volume Archives, Up: Using Multiple Tapes Tape Files ---------- *(This message will disappear, once this node revised.)* When `tar' writes an archive to tape, it creates a single tape file. If multiple archives are written to the same tape, one after the other, they each get written as separate tape files. When extracting, it is necessary to position the tape at the right place before running `tar'. To do this, use the `mt' command. For more information on the `mt' command and on the organization of tapes into a sequence of tape files. FIXME: see ***.  File: tar.info, Node: Archive Label, Prev: Using Multiple Tapes, Up: Media Including a Label in the Archive ================================ *(This message will disappear, once this node revised.)* FIXME: Should the arg to --label be a quoted string?? no - ringo To avoid problems caused by misplaced paper labels on the archive media, you can include a "label" entry--an archive member which contains the name of the archive--in the archive itself. Use the `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') option in conjunction with the `--create' (`-c') operation to include a label entry in the archive as it is being created. If you create an archive using both `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') and `--multi-volume' (`-M'), each volume of the archive will have an archive label of the form `ARCHIVE-LABEL Volume N', where N is 1 for the first volume, 2 for the next, and so on. FIXME: xref Multi-Volume Archives , for information on creating multiple volume archives. If you extract an archive using `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL'), `tar' will print an error if the archive label doesn't match the ARCHIVE-LABEL specified, and will then not extract the archive. You can include a regular expression in ARCHIVE-LABEL, in this case only. FIXME: why is a reg. exp. useful here? (to limit extraction to a FIXME: specific group? ie for multi-volume??? To find out an archive's label entry (or to find out if an archive has a label at all), use `tar --list --verbose'. `tar' will print the label first, and then print archive member information, as in the example below: % tar --verbose --list --file=iamanarchive V--------- 0/0 0 Mar 7 12:01 1992 iamalabel--Volume Header-- -rw-rw-rw- ringo/user 40 May 21 13:30 1990 iamafilename `--label=ARCHIVE-LABEL' `-V ARCHIVE-LABEL' Includes an "archive-label" at the beginning of the archive when the archive is being created, when used in conjunction with the `--create' (`-c') option. Checks to make sure the archive label matches the one specified (when used in conjunction with the `--extract' (`-x') option. FIXME: was --volume  File: tar.info, Node: Backups and Restoration, Next: Date input formats, Prev: Media, Up: Top Performing Backups and Restoring Files ************************************** *(This message will disappear, once this node revised.)* .* dumps . + what are dumps . + different levels of dumps . - full dump = dump everything . - level 1, level 2 dumps etc, - A level n dump dumps everything changed since the last level n-1 dump (?) . + how to use scripts for dumps (ie, the concept) . - scripts to run after editing backup specs (details) . + Backup Specs, what is it. . - how to customize . - actual text of script [/sp/dump/backup-specs] . + Problems . - rsh doesn't work . - rtape isn't installed . - (others?) . + the --incremental option of tar . + tapes . - write protection . - types of media . : different sizes and types, useful for different things . - files and tape marks one tape mark between files, two at end. . - positioning the tape MT writes two at end of write, backspaces over one when writing again. To "back up" a file system means to create archives that contain all the files in that file system. Those archives can then be used to restore any or all of those files (for instance if a disk crashes or a file is accidently deleted). File system "backups" are also called "dumps". * Menu: * Full Dumps:: * Inc Dumps:: * incremental and listed-incremental:: * Backup Levels:: * Backup Parameters:: * Scripted Backups:: * Scripted Restoration::  File: tar.info, Node: Full Dumps, Next: Inc Dumps, Prev: Backups and Restoration, Up: Backups and Restoration Using `tar' to Perform Full Dumps ================================= *(This message will disappear, once this node revised.)* Full dumps should only be made when no other people or programs are modifying files in the filesystem. If files are modified while `tar' is making the backup, they may not be stored properly in the archive, in which case you won't be able to restore them if you have to. (Files not being modified are written with no trouble, and do not corrupt the entire archive.) You will want to use the `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') option to give the archive a volume label, so you can tell what this archive is even if the label falls off the tape, or anything like that. Unless the filesystem you are dumping is guaranteed to fit on one volume, you will need to use the `--multi-volume' (`-M') option. Make sure you have enough tapes on hand to complete the backup. If you want to dump each filesystem separately you will need to use the `--one-file-system' (`-l') option to prevent `tar' from crossing filesystem boundaries when storing (sub)directories. The `--incremental' (`-G') option is not needed, since this is a complete copy of everything in the filesystem, and a full restore from this backup would only be done onto a completely empty disk. Unless you are in a hurry, and trust the `tar' program (and your tapes), it is a good idea to use the `--verify' (`-W') option, to make sure your files really made it onto the dump properly. This will also detect cases where the file was modified while (or just after) it was being archived. Not all media (notably cartridge tapes) are capable of being verified, unfortunately. `--listed-incremental=SNAPSHOT-FILE' (`-g SNAPSHOT-FILE') take a file name argument always. If the file doesn't exist, run a level zero dump, creating the file. If the file exists, uses that file to see what has changed. `--incremental' (`-G') FIXME: look it up `--incremental' (`-G') handle old GNU-format incremental backup. This option should only be used when creating an incremental backup of a filesystem. When the `--incremental' (`-G') option is used, `tar' writes, at the beginning of the archive, an entry for each of the directories that will be operated on. The entry for a directory includes a list of all the files in the directory at the time the dump was done, and a flag for each file indicating whether the file is going to be put in the archive. This information is used when doing a complete incremental restore. Note that this option causes `tar' to create a non-standard archive that may not be readable by non-GNU versions of the `tar' program. The `--incremental' (`-G') option means the archive is an incremental backup. Its meaning depends on the command that it modifies. If the `--incremental' (`-G') option is used with `--list' (`-t'), `tar' will list, for each directory in the archive, the list of files in that directory at the time the archive was created. This information is put out in a format that is not easy for humans to read, but which is unambiguous for a program: each file name is preceded by either a `Y' if the file is present in the archive, an `N' if the file is not included in the archive, or a `D' if the file is a directory (and is included in the archive). Each file name is terminated by a null character. The last file is followed by an additional null and a newline to indicate the end of the data. If the `--incremental' (`-G') option is used with `--extract' (`-x'), then when the entry for a directory is found, all files that currently exist in that directory but are not listed in the archive *are deleted from the directory*. This behavior is convenient when you are restoring a damaged file system from a succession of incremental backups: it restores the entire state of the file system to that which obtained when the backup was made. If you don't use `--incremental' (`-G'), the file system will probably fill up with files that shouldn't exist any more. `--listed-incremental=SNAPSHOT-FILE' (`-g SNAPSHOT-FILE') handle new GNU-format incremental backup. `--listed-incremental=SNAPSHOT-FILE' (`-g SNAPSHOT-FILE') acts like `--incremental' (`-G'), but when used in conjunction with `--create' (`-c') will also cause `tar' to use the file FILE, which contains information about the state of the filesystem at the time of the last backup, to decide which files to include in the archive being created. That file will then be updated by `tar'. If the file FILE does not exist when this option is specified, `tar' will create it, and include all appropriate files in the archive. The file, which is archive independent, contains the date it was last modified and a list of devices, inode numbers and directory names. `tar' will archive files with newer mod dates or inode change times, and directories with an unchanged inode number and device but a changed directory name. The file is updated after the files to be archived are determined, but before the new archive is actually created.  File: tar.info, Node: Inc Dumps, Next: incremental and listed-incremental, Prev: Full Dumps, Up: Backups and Restoration Using `tar' to Perform Incremental Dumps ======================================== *(This message will disappear, once this node revised.)* Performing incremental dumps is similar to performing full dumps, although a few more options will usually be needed. You will need to use the `-N DATE' option to tell `tar' to only store files that have been modified since DATE. DATE should be the date and time of the last full/incremental dump. A standard scheme is to do a *monthly* (full) dump once a month, a *weekly* dump once a week of everything since the last monthly and a *daily* every day of everything since the last (weekly or monthly) dump. Here is a copy of the script used to dump the filesystems of the machines here at the Free Software Foundation. This script is run via `cron' late at night when people are least likely to be using the machines. This script dumps several filesystems from several machines at once (via NFS). The operator is responsible for ensuring that all the machines will be up at the time the dump happens. If a machine is not running, its files will not be dumped, and the next day's incremental dump will *not* store files that would have gone onto that dump. #!/bin/csh # Dump thingie set now = `date` set then = `cat date.nfs.dump` /u/hack/bin/tar -c -G -v\ -f /dev/rtu20\ -b 126\ -N "$then"\ -V "Dump from $then to $now"\ /alpha-bits/gp\ /gnu/hack\ /hobbes/u\ /spiff/u\ /sugar-bombs/u echo $now > date.nfs.dump mt -f /dev/rtu20 rew Output from this script is stored in a file, for the operator to read later. This script uses the file `date.nfs.dump' to store the date/time of the last dump. Since this is a streaming tape drive, no attempt to verify the archive is done. This is also why the high blocking factor (126) is used. The tape drive must also be rewound by the `mt' command after the dump is made.  File: tar.info, Node: incremental and listed-incremental, Next: Backup Levels, Prev: Inc Dumps, Up: Backups and Restoration The Incremental Options ======================= *(This message will disappear, once this node revised.)* `--incremental' (`-G') is used in conjunction with `--create' (`-c'), `--extract' (`-x') or `--list' (`-t') when backing up and restoring file systems. An archive cannot be extracted or listed with the `--incremental' (`-G') option specified unless it was created with the option specified. This option should only be used by a script, not by the user, and is usually disregarded in favor of `--listed-incremental=SNAPSHOT-FILE' (`-g SNAPSHOT-FILE'), which is described below. `--incremental' (`-G') in conjunction with `--create' (`-c') causes `tar' to write, at the beginning of the archive, an entry for each of the directories that will be archived. The entry for a directory includes a list of all the files in the directory at the time the archive was created and a flag for each file indicating whether or not the file is going to be put in the archive. Note that this option causes `tar' to create a non-standard archive that may not be readable by non-GNU versions of the `tar' program. `--incremental' (`-G') in conjunction with `--extract' (`-x') causes `tar' to read the lists of directory contents previously stored in the archive, *delete* files in the file system that did not exist in their directories when the archive was created, and then extract the files in the archive. This behavior is convenient when restoring a damaged file system from a succession of incremental backups: it restores the entire state of the file system to that which obtained when the backup was made. If `--incremental' (`-G') isn't specified, the file system will probably fill up with files that shouldn't exist any more. `--incremental' (`-G') in conjunction with `--list' (`-t'), causes `tar' to print, for each directory in the archive, the list of files in that directory at the time the archive was created. This information is put out in a format that is not easy for humans to read, but which is unambiguous for a program: each file name is preceded by either a `Y' if the file is present in the archive, an `N' if the file is not included in the archive, or a `D' if the file is a directory (and is included in the archive). Each file name is terminated by a null character. The last file is followed by an additional null and a newline to indicate the end of the data. `--listed-incremental=SNAPSHOT-FILE' (`-g SNAPSHOT-FILE') acts like `--incremental' (`-G'), but when used in conjunction with `--create' (`-c') will also cause `tar' to use the file SNAPSHOT-FILE, which contains information about the state of the file system at the time of the last backup, to decide which files to include in the archive being created. That file will then be updated by `tar'. If the file FILE does not exist when this option is specified, `tar' will create it, and include all appropriate files in the archive. The file FILE, which is archive independent, contains the date it was last modified and a list of devices, inode numbers and directory names. `tar' will archive files with newer mod dates or inode change times, and directories with an unchanged inode number and device but a changed directory name. The file is updated after the files to be archived are determined, but before the new archive is actually created. FIXME: this section needs to be written  File: tar.info, Node: Backup Levels, Next: Backup Parameters, Prev: incremental and listed-incremental, Up: Backups and Restoration Levels of Backups ================= *(This message will disappear, once this node revised.)* An archive containing all the files in the file system is called a "full backup" or "full dump". You could insure your data by creating a full dump every day. This strategy, however, would waste a substantial amount of archive media and user time, as unchanged files are daily re-archived. It is more efficient to do a full dump only occasionally. To back up files between full dumps, you can a incremental dump. A "level one" dump archives all the files that have changed since the last full dump. A typical dump strategy would be to perform a full dump once a week, and a level one dump once a day. This means some versions of files will in fact be archived more than once, but this dump strategy makes it possible to restore a file system to within one day of accuracy by only extracting two archives--the last weekly (full) dump and the last daily (level one) dump. The only information lost would be in files changed or created since the last daily backup. (Doing dumps more than once a day is usually not worth the trouble). GNU `tar' comes with scripts you can use to do full and level-one dumps. Using scripts (shell programs) to perform backups and restoration is a convenient and reliable alternative to typing out file name lists and `tar' commands by hand. Before you use these scripts, you need to edit the file `backup-specs', which specifies parameters used by the backup scripts and by the restore script. FIXME: xref Script Syntax . Once the backup parameters are set, you can perform backups or restoration by running the appropriate script. The name of the restore script is `restore'. The names of the level one and full backup scripts are, respectively, `level-1' and `level-0'. The `level-0' script also exists under the name `weekly', and the `level-1' under the name `daily'--these additional names can be changed according to your backup schedule. FIXME: xref Scripted Restoration , for more information on running the restoration script. FIXME: xref Scripted Backups , for more information on running the backup scripts. *Please Note:* The backup scripts and the restoration scripts are designed to be used together. While it is possible to restore files by hand from an archive which was created using a backup script, and to create an archive by hand which could then be extracted using the restore script, it is easier to use the scripts. FIXME: xref incremental and listed-incremental , before making such an attempt. FIXME: shorten node names  File: tar.info, Node: Backup Parameters, Next: Scripted Backups, Prev: Backup Levels, Up: Backups and Restoration Setting Parameters for Backups and Restoration ============================================== *(This message will disappear, once this node revised.)* The file `backup-specs' specifies backup parameters for the backup and restoration scripts provided with `tar'. You must edit `backup-specs' to fit your system configuration and schedule before using these scripts. FIXME: This about backup scripts needs to be written: BS is a shell FIXME: script .... thus ... `backup-specs' is in shell script FIXME: syntax. xref Script Syntax, for an explanation of this syntax. FIXME: FIXME: whats a parameter .... looked at by the backup scripts ... which FIXME: will be expecting to find ... now syntax ... value is linked to FIXME: lame ... `backup-specs' specifies the following parameters: `ADMINISTRATOR' The user name of the backup administrator. `BACKUP_HOUR' The hour at which the backups are done. This can be a number from 0 to 23, or the string `now'. `TAPE_FILE' The device `tar' writes the archive to. This device should be attached to the host on which the dump scripts are run. FIXME: examples for all ... `TAPE_STATUS' The command to use to obtain the status of the archive device, including error count. On some tape drives there may not be such a command; in that case, simply use `TAPE_STATUS=false'. `BLOCKING' The blocking factor `tar' will use when writing the dump archive. FIXME: xref Blocking Factor . `BACKUP_DIRS' A list of file systems to be dumped. You can include any directory name in the list--subdirectories on that file system will be included, regardless of how they may look to other networked machines. Subdirectories on other file systems will be ignored. The host name specifies which host to run `tar' on, and should normally be the host that actually contains the file system. However, the host machine must have GNU `tar' installed, and must be able to access the directory containing the backup scripts and their support files using the same file name that is used on the machine where the scripts are run (ie. what `pwd' will print when in that directory on that machine). If the host that contains the file system does not have this capability, you can specify another host as long as it can access the file system through NFS. `BACKUP_FILES' A list of individual files to be dumped. These should be accessible from the machine on which the backup script is run. FIXME: same file name, be specific. through nfs ... * Menu: * backup-specs example:: * Script Syntax::  File: tar.info, Node: backup-specs example, Next: Script Syntax, Prev: Backup Parameters, Up: Backup Parameters An Example Text of `Backup-specs' --------------------------------- *(This message will disappear, once this node revised.)* The following is the text of `backup-specs' as it appears at FSF: # site-specific parameters for file system backup. ADMINISTRATOR=friedman BACKUP_HOUR=1 TAPE_FILE=/dev/nrsmt0 TAPE_STATUS="mts -t $TAPE_FILE" BLOCKING=124 BACKUP_DIRS=" albert:/fs/fsf apple-gunkies:/gd albert:/fs/gd2 albert:/fs/gp geech:/usr/jla churchy:/usr/roland albert:/ albert:/usr apple-gunkies:/ apple-gunkies:/usr gnu:/hack gnu:/u apple-gunkies:/com/mailer/gnu apple-gunkies:/com/archive/gnu" BACKUP_FILES="/com/mailer/aliases /com/mailer/league*[a-z]"  File: tar.info, Node: Script Syntax, Prev: backup-specs example, Up: Backup Parameters Syntax for `Backup-specs' ------------------------- *(This message will disappear, once this node revised.)* `backup-specs' is in shell script syntax. The following conventions should be considered when editing the script: FIXME: "conventions?" A quoted string is considered to be contiguous, even if it is on more than one line. Therefore, you cannot include commented-out lines within a multi-line quoted string. BACKUP_FILES and BACKUP_DIRS are the two most likely parameters to be multi-line. A quoted string typically cannot contain wildcards. In `backup-specs', however, the parameters BACKUP_DIRS and BACKUP_FILES can contain wildcards.  File: tar.info, Node: Scripted Backups, Next: Scripted Restoration, Prev: Backup Parameters, Up: Backups and Restoration Using the Backup Scripts ======================== *(This message will disappear, once this node revised.)* The syntax for running a backup script is: `script-name' [TIME-TO-BE-RUN] where TIME-TO-BE-RUN can be a specific system time, or can be `now'. If you do not specify a time, the script runs at the time specified in `backup-specs' ( FIXME: pxref Script Syntax ). You should start a script with a tape or disk mounted. Once you start a script, it prompts you for new tapes or disks as it needs them. Media volumes don't have to correspond to archive files--a multi-volume archive can be started in the middle of a tape that already contains the end of another multi-volume archive. The `restore' script prompts for media by its archive volume, so to avoid an error message you should keep track of which tape (or disk) contains which volume of the archive. FIXME: xref Scripted Restoration . FIXME: have file names changed? The backup scripts write two files on the file system. The first is a record file in `/etc/tar-backup/', which is used by the scripts to store and retrieve information about which files were dumped. This file is not meant to be read by humans, and should not be deleted by them. FIXME: xref incremental and listed-incremental , for a more detailed explanation of this file. The second file is a log file containing the names of the file systems and files dumped, what time the backup was made, and any error messages that were generated, as well as how much space was left in the media volume after the last volume of the archive was written. You should check this log file after every backup. The file name is `log-MMM-DDD-YYYY-level-1' or `log-MMM-DDD-YYYY-full'. The script also prints the name of each system being dumped to the standard output. FIXME: the section on restore scripts is commented out. FIXME: a section on non-scripted testore mya be a good idea  File: tar.info, Node: Scripted Restoration, Prev: Scripted Backups, Up: Backups and Restoration Using the Restore Script ======================== FIXME: subject to change as things develop *(This message will disappear, once this node revised.)* (This node was @ignore'd--merely listing it for now.) To restore files that were archived using a scripted backup, use the `restore' script. The syntax for the script is: where ***** are the file systems to restore from, and ***** is a regular expression which specifies which files to restore. If you specify -all, the script restores all the files in the file system. You should start the restore script with the media containing the first volume of the archive mounted. The script will prompt for other volumes as they are needed. If the archive is on tape, you don't need to rewind the tape to to its beginning--if the tape head is positioned past the beginning of the archive, the script will rewind the tape as needed. FIXME: xref Media , for a discussion of tape positioning. If you specify `--all' as the FILES argument, the `restore' script extracts all the files in the archived file system into the active file system. *Warning:*The script will delete files from the active file system if they were not in the file system when the archive was made. FIXME: xref incremental and listed-incremental , for an explanation of how the script makes that determination. FIXME: this may be an option, not a given  File: tar.info, Node: Date input formats, Next: Archive Format, Prev: Backups and Restoration, Up: Top Date input formats ****************** This section describes the textual date representations that GNU programs accept. These are the strings you, as a user, can supply as arguments to the various programs. The C interface (via the `getdate' function) is not described here. Although the date syntax here can represent any possible time since zero A.D., computer integers are not big enough for such a (comparatively) long time. The earliest date semantically allowed on Unix systems is midnight, 1 January 1970 UCT. * Menu: * General date syntax:: * Calendar date item:: * Time of day item:: * Timezone item:: * Day of week item:: * Relative item in date strings:: * Pure numbers in date strings:: * Authors of getdate::  File: tar.info, Node: General date syntax, Next: Calendar date item, Prev: Date input formats, Up: Date input formats General date syntax =================== A "date" is a string, possibly empty, containing many items separated by whitespace. The whitespace may be omitted when no ambiguity arises. The empty string means the beginning of today (i.e., midnight). Order of the items is immaterial. A date string may contain many flavors of items: * calendar date items * time of the day items * time zone items * day of the week items * relative items * pure numbers. We describe each of these item types in turn, below. A few numbers may be written out in words in most contexts. This is most useful for specifying day of the week items or relative items (see below). Here is the list: `first' for 1, `next' for 2, `third' for 3, `fourth' for 4, `fifth' for 5, `sixth' for 6, `seventh' for 7, `eighth' for 8, `ninth' for 9, `tenth' for 10, `eleventh' for 11 and `twelfth' for 12. Also, `last' means exactly -1. When a month is written this way, it is still considered to be written numerically, instead of being "spelled in full"; this changes the allowed strings. Alphabetic case is completely ignored in dates. Comments may be introduced between round parentheses, as long as included parentheses are properly nested. Hyphens not followed by a digit are currently ignored. Leading zeros on numbers are ignored.  File: tar.info, Node: Calendar date item, Next: Time of day item, Prev: General date syntax, Up: Date input formats Calendar date item ================== A "calendar date item" specifies a day of the year. It is specified differently, depending on whether the month is specified numerically or literally. All these strings specify the same calendar date: 1970-9-17 # ISO 8601. 70-9-17 # This century assumed by default. 70-09-17 # Leading zeros are ignored. 9/17/72 # Common U.S. writing. 24 September 1972 24 Sept 72 # September has a special abbreviation. 24 Sep 72 # Three-letter abbreviations always allowed. Sep 24, 1972 24-sep-72 24sep72 The year can also be omitted. In this case, the last specified year is used, or the current year if none. For example: 9/17 sep 17 Here are the rules. For numeric months, the ISO 8601 format `YEAR-MONTH-DAY' is allowed, where YEAR is any positive number, MONTH is a number between 1 and 12, and DAY is a number between 1 and 31. If YEAR is less than 100, then 1900 is added to it to force a date in this century. The construct `MONTH/DAY/YEAR', popular in the United States, is accepted. Also `MONTH/DAY', omitting the year. Literal months may be spelled out in full: `January', `February', `March', `April', `May', `June', `July', `August', `September', `October', `November' or `December'. Literal months may be abbreviated to their first three letters, possibly followed by an abbreviating dot. It is also permitted to write `Sept' instead of `September'. When months are written literally, the calendar date may be given as any of the following: DAY MONTH YEAR DAY MONTH MONTH DAY YEAR DAY-MONTH-YEAR Or, omitting the year: MONTH DAY  File: tar.info, Node: Time of day item, Next: Timezone item, Prev: Calendar date item, Up: Date input formats Time of day item ================ A "time of day item" in date strings specifies the time on a given day. Here are some examples, all of which represent the same time: 20:02:0 20:02 8:02pm 20:02-0500 # In EST (Eastern U.S. Standard Time). More generally, the time of the day may be given as `HOUR:MINUTE:SECOND', where HOUR is a number between 0 and 23, MINUTE is a number between 0 and 59, and SECOND is a number between 0 and 59. Alternatively, `:SECOND' can be omitted, in which case it is taken to be zero. If the time is followed by `am' or `pm' (or `a.m.' or `p.m.'), HOUR is restricted to run from 1 to 12, and `:MINUTE' may be omitted (taken to be zero). `am' indicates the first half of the day, `pm' indicates the second half of the day. In this notation, 12 is the predecessor of 1: midnight is `12am' while noon is `12pm'. The time may alternatively be followed by a timezone correction, expressed as `SHHMM', where S is `+' or `-', HH is a number of zone hours and MM is a number of zone minutes. When a timezone correction is given this way, it forces interpretation of the time in UTC, overriding any previous specification for the timezone or the local timezone. The MINUTE part of the time of the day may not be elided when a timezone correction is used. This is the only way to specify a timezone correction by fractional parts of an hour. Either `am'/`pm' or a timezone correction may be specified, but not both.  File: tar.info, Node: Timezone item, Next: Day of week item, Prev: Time of day item, Up: Date input formats Timezone item ============= A "timezone item" specifies an international timezone, indicated by a small set of letters. Any included period is ignored. Military timezone designations use a single letter. Currently, only integral zone hours may be represented in a timezone item. See the previous section for a finer control over the timezone correction. Here are many non-daylight-savings-time timezones, indexed by the zone hour value. +000 `GMT' for Greenwich Mean, `UT' or `UTC' for Universal (Coordinated), `WET' for Western European and `Z' for militaries. +100 `WAT' for West Africa and `A' for militaries. +200 `AT' for Azores and `B' for militaries. +300 `C' for militaries. +400 `AST' for Atlantic Standard and `D' for militaries. +500 `E' for militaries and `EST' for Eastern Standard. +600 `CST' for Central Standard and `F' for militaries. +700 `G' for militaries and `MST' for Mountain Standard. +800 `H' for militaries and `PST' for Pacific Standard. +900 `I' for militaries and `YST' for Yukon Standard. +1000 `AHST' for Alaska-Hawaii Standard, `CAT' for Central Alaska, `HST' for Hawaii Standard and `K' for militaries. +1100 `L' for militaries and `NT' for Nome. +1200 `IDLW' for International Date Line West and `M' for militaries. -100 `CET' for Central European, `FWT' for French Winter, `MET' for Middle European, `MEWT' for Middle European Winter, `N' for militaries and `SWT' for Swedish Winter. -200 `EET' for Eastern European, USSR Zone 1 and `O' for militaries. -300 `BT' for Baghdad, USSR Zone 2 and `P' for militaries. -400 `Q' for militaries and `ZP4' for USSR Zone 3. -500 `R' for militaries and `ZP5' for USSR Zone 4. -600 `S' for militaries and `ZP6' for USSR Zone 5. -700 `T' for militaries and `WAST' for West Australian Standard. -800 `CCT' for China Coast, USSR Zone 7 and `U' for militaries. -900 `JST' for Japan Standard, USSR Zone 8 and `V' for militaries. -1000 `EAST' for East Australian Standard, `GST' for Guam Standard, USSR Zone 9 and `W' for militaries. -1100 `X' for militaries. -1200 `IDLE' for International Date Line East, `NZST' for New Zealand Standard, `NZT' for New Zealand and `Y' for militaries. Here are many DST timezones, indexed by the zone hour value. Also, by following a non-DST timezone by the string `DST' in a separate word (that is, separated by some whitespace), the corresponding DST timezone may be specified. 0 `BST' for British Summer. +400 `ADT' for Atlantic Daylight. +500 `EDT' for Eastern Daylight. +600 `CDT' for Central Daylight. +700 `MDT' for Mountain Daylight. +800 `PDT' for Pacific Daylight. +900 `YDT' for Yukon Daylight. +1000 `HDT' for Hawaii Daylight. -100 `MEST' for Middle European Summer, `MESZ' for Middle European Summer, `SST' for Swedish Summer and `FST' for French Summer. -700 `WADT' for West Australian Daylight. -1000 `EADT' for Eastern Australian Daylight. -1200 `NZDT' for New Zealand Daylight.  File: tar.info, Node: Day of week item, Next: Relative item in date strings, Prev: Timezone item, Up: Date input formats Day of week item ================ The explicit mention of a day of the week will forward the date (only if necessary) to reach that day of the week in the future. Days of the week may be spelled out in full: `Sunday', `Monday', `Tuesday', `Wednesday', `Thursday', `Friday' or `Saturday'. Days may be abbreviated to their first three letters, optionally followed by a period. The special abbreviations `Tues' for `Tuesday', `Wednes' for `Wednesday' and `Thur' or `Thurs' for `Thursday' are also allowed. A number may precede a day of the week item to move forward supplementary weeks. It is best used in expression like `third monday'. In this context, `last DAY' or `next DAY' is also acceptable; they move one week before or after the day that DAY by itself would represent. A comma following a day of the week item is ignored.  File: tar.info, Node: Relative item in date strings, Next: Pure numbers in date strings, Prev: Day of week item, Up: Date input formats Relative item in date strings ============================= "Relative items" adjust a date (or the current date if none) forward or backward. The effect of relative items accumulate. Here are some examples: 1 year 1 year ago 3 years 2 days The unit of time displacement may be selected by the string `year' or `month' for moving by whole years or months. These are fuzzy units, as years and months are not all of equal duration. More precise units are `fortnight' which is worth 14 days, `week' worth 7 days, `day' worth 24 hours, `hour' worth 60 minutes, `minute' or `min' worth 60 seconds, and `second' or `sec' worth one second. An `s' suffix on these units is accepted and ignored. The unit of time may be preceded by a multiplier, given as an optionally signed number. Unsigned numbers are taken as positively signed. No number at all implies 1 for a multiplier. Following a relative item by the string `ago' is equivalent to preceding the unit by a multiplicator with value -1. The string `tomorrow' is worth one day in the future (equivalent to `day'), the string `yesterday' is worth one day in the past (equivalent to `day ago'). The strings `now' or `today' are relative items corresponding to zero-valued time displacement, these strings come from the fact a zero-valued time displacement represents the current time when not otherwise change by previous items. They may be used to stress other items, like in `12:00 today'. The string `this' also has the meaning of a zero-valued time displacement, but is preferred in date strings like `this thursday'. When a relative item makes the resulting date to cross the boundary between DST and non-DST (or vice-versa), the hour is adjusted according to the local time.  File: tar.info, Node: Pure numbers in date strings, Next: Authors of getdate, Prev: Relative item in date strings, Up: Date input formats Pure numbers in date strings ============================ The precise intepretation of a pure decimal number is dependent of the context in the date string. If the decimal number is of the form YYYYMMDD and no other calendar date item ( FIXME: pxref Calendar date item ) appears before it in the date string, then YYYY is read as the year, MM as the month number and DD as the day of the month, for the specified calendar date. If the decimal number is of the form HHMM and no other time of day item appears before it in the date string, then HH is read as the hour of the day and MM as the minute of the hour, for the specified time of the day. MM can also be omitted. If both a calendar date and a time of day appear to the left of a number in the date string, but no relative item, then the number overrides the year.  File: tar.info, Node: Authors of getdate, Prev: Pure numbers in date strings, Up: Date input formats Authors of `getdate' ==================== `getdate' was originally implemented by Steven M. Bellovin (`smb@research.att.com') while at the University of North Carolina at Chapel Hill. The code was later tweaked by a couple of people on Usenet, then completely overhauled by Rich $alz (`rsalz@bbn.com') and Jim Berets (`jberets@bbn.com') in August, 1990. Various revisions for the GNU system were made by David MacKenzie, Jim Meyering, and others. This chapter was originally produced by Franc,ois Pinard (`pinard@iro.umontreal.ca') from the `getdate.y' source code, and then edited by K. Berry (`kb@cs.umb.edu').  File: tar.info, Node: Archive Format, Next: Index, Prev: Date input formats, Up: Top Format of `tar' archives ************************ *(This message will disappear, once this node revised.)* * Menu: * Standard:: * Extensions:: * cpio:: tar-1.11.8/doc/tar.info-7 644 625 1 110373 5770625053 10027 This is Info file tar.info, produced by Makeinfo-1.61 from the input file tar.texinfo. START-INFO-DIR-ENTRY * tar: (tar). Making tape (or disk) archives. END-INFO-DIR-ENTRY This file documents GNU `tar', a utility used to store, backup, and transport files. Copyright (C) 1992, 1994, 1995 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation.  File: tar.info, Node: Standard, Next: Extensions, Prev: Archive Format, Up: Archive Format The Standard Format =================== *(This message will disappear, once this node revised.)* A `tar' archive file contains a series of records. Each record contains `RECORDSIZE' bytes. Although this format may be thought of as being on magnetic tape, other media are often used. Each file archived is represented by a header record which describes the file, followed by zero or more records which give the contents of the file. At the end of the archive file there may be a record filled with binary zeros as an end-of-file marker. A reasonable system should write a record of zeros at the end, but must not assume that such a record exists when reading an archive. The records may be "blocked" for physical I/O operations. Each block of N records (where N is set by the `--block-size=512-SIZE' (`-b 512-SIZE') option to `tar') is written with a single `write ()' operation. On magnetic tapes, the result of such a write is a single tape record. When writing an archive, the last block of records should be written at the full size, with records after the zero record containing all zeroes. When reading an archive, a reasonable system should properly handle an archive whose last block is shorter than the rest, or which contains garbage records after a zero record. The header record is defined in C as follows. In the GNU `tar' distribution, this is part of file `src/tar.h': /* Standard Archive Format - Standard TAR - USTAR. */ /* Header block on tape. We use traditional DP naming conventions here. A "block" is a big chunk of stuff that we do I/O on. A "record" is a piece of info that we care about. Typically many "record"s fit into a "block". */ #define RECORDSIZE 512 #define NAMSIZ 100 #define TUNMLEN 32 #define TGNMLEN 32 #define SPARSE_EXT_HDR 21 #define SPARSE_IN_HDR 4 struct sparse { char offset[12]; char numbytes[12]; }; union record { char charptr[RECORDSIZE]; struct header { char arch_name[NAMSIZ]; char mode[8]; char uid[8]; char gid[8]; char size[12]; char mtime[12]; char chksum[8]; char linkflag; char arch_linkname[NAMSIZ]; char magic[8]; char uname[TUNMLEN]; char gname[TGNMLEN]; char devmajor[8]; char devminor[8]; /* The following fields were added for GNU and are not standard. */ char atime[12]; char ctime[12]; char offset[12]; char longnames[4]; /* Some compilers would insert the pad themselves, so pad was once autoconfigured. It is simpler to always insert it! */ char pad; struct sparse sp[SPARSE_IN_HDR]; char isextended; char realsize[12]; /* true size of the sparse file */ #if 0 char ending_blanks[12]; /* number of nulls at the end of the file, if any */ #endif } header; struct extended_header { struct sparse sp[21]; char isextended; } ext_hdr; }; /* The checksum field is filled with this while the checksum is computed. */ #define CHKBLANKS " " /* 8 blanks, no null */ /* The magic field is filled with this value if uname and gname are valid, marking the archive as being in standard POSIX format (though GNU tar itself is not POSIX conforming). */ #define TMAGIC "ustar " /* 7 chars and a null */ /* The magic field is filled with this if this is a GNU format dump entry. But I suspect this is not true anymore. */ #define GNUMAGIC "GNUtar " /* 7 chars and a null */ /* The linkflag defines the type of file. */ #define LF_OLDNORMAL '\0' /* normal disk file, Unix compat */ #define LF_NORMAL '0' /* normal disk file */ #define LF_LINK '1' /* link to previously dumped file */ #define LF_SYMLINK '2' /* symbolic link */ #define LF_CHR '3' /* character special file */ #define LF_BLK '4' /* block special file */ #define LF_DIR '5' /* directory */ #define LF_FIFO '6' /* FIFO special file */ #define LF_CONTIG '7' /* contiguous file */ /* Further link types may be defined later. */ /* Note that the standards committee allows only capital A through capital Z for user-defined expansion. This means that defining something as, say '8' is a *bad* idea. */ /* This is a dir entry that contains the names of files that were in the dir at the time the dump was made. */ #define LF_DUMPDIR 'D' /* Identifies the NEXT file on the tape as having a long linkname. */ #define LF_LONGLINK 'K' /* Identifies the NEXT file on the tape as having a long name. */ #define LF_LONGNAME 'L' /* This is the continuation of a file that began on another volume. */ #define LF_MULTIVOL 'M' /* For storing filenames that didn't fit in 100 characters. */ #define LF_NAMES 'N' /* This is for sparse files. */ #define LF_SPARSE 'S' /* This file is a tape/volume header. Ignore it on extraction. */ #define LF_VOLHDR 'V' #if 0 /* The following two blocks of #define's are unused in GNU tar. */ /* Bits used in the mode field - values in octal */ #define TSUID 04000 /* set UID on execution */ #define TSGID 02000 /* set GID on execution */ #define TSVTX 01000 /* save text (sticky bit) */ /* File permissions */ #define TUREAD 00400 /* read by owner */ #define TUWRITE 00200 /* write by owner */ #define TUEXEC 00100 /* execute/search by owner */ #define TGREAD 00040 /* read by group */ #define TGWRITE 00020 /* write by group */ #define TGEXEC 00010 /* execute/search by group */ #define TOREAD 00004 /* read by other */ #define TOWRITE 00002 /* write by other */ #define TOEXEC 00001 /* execute/search by other */ #endif /* End of Standard Archive Format description. */ All characters in header records are represented by using 8-bit characters in the local variant of ASCII. Each field within the structure is contiguous; that is, there is no padding used within the structure. Each character on the archive medium is stored contiguously. Bytes representing the contents of files (after the header record of each file) are not translated in any way and are not constrained to represent characters in any character set. The `tar' format does not distinguish text files from binary files, and no translation of file contents is performed. The `name', `linkname', `magic', `uname', and `gname' are null-terminated character strings. All other fileds are zero-filled octal numbers in ASCII. Each numeric field of width W contains W minus 2 digits, a space, and a null, except `size', and `mtime', which do not contain the trailing null. The `name' field is the file name of the file, with directory names (if any) preceding the file name, separated by slashes. FIXME: how big a name before field overflows? The `mode' field provides nine bits specifying file permissions and three bits to specify the Set UID, Set GID, and Save Text ("sticky") modes. Values for these bits are defined above. When special permissions are required to create a file with a given mode, and the user restoring files from the archive does not hold such permissions, the mode bit(s) specifying those special permissions are ignored. Modes which are not supported by the operating system restoring files from the archive will be ignored. Unsupported modes should be faked up when creating or updating an archive; e.g. the group permission could be copied from the *other* permission. The `uid' and `gid' fields are the numeric user and group ID of the file owners, respectively. If the operating system does not support numeric user or group IDs, these fields should be ignored. The `size' field is the size of the file in bytes; linked files are archived with this field specified as zero. FIXME: xref Modifiers , in particular the `--incremental' (`-G') option. The `mtime' field is the modification time of the file at the time it was archived. It is the ASCII representation of the octal value of the last time the file was modified, represented as an integer number of seconds since January 1, 1970, 00:00 Coordinated Universal Time. The `chksum' field is the ASCII representation of the octal value of the simple sum of all bytes in the header record. Each 8-bit byte in the header is added to an unsigned integer, initialized to zero, the precision of which shall be no less than seventeen bits. When calculating the checksum, the `chksum' field is treated as if it were all blanks. The `typeflag' field specifies the type of file archived. If a particular implementation does not recognize or permit the specified type, the file will be extracted as if it were a regular file. As this action occurs, `tar' issues a warning to the standard error. The `atime' and `ctime' fields are used in making incremental backups; they store, respectively, the particular file's access time and last inode-change time. The `offset' is used by the `--multi-volume' (`-M') option, when making a multi-volume archive. The offset is number of bytes into the file that we need to restart at to continue the file on the next tape, i.e., where we store the location that a continued file is continued at. The following fields were added to deal with sparse files. A file is "sparse" if it takes in unallocated blocks which end up being represented as zeros, i.e., no useful data. A test to see if a file is sparse is to look at the number blocks allocated for it versus the number of characters in the file; if there are fewer blocks allocated for the file than would normally be allocated for a file of that size, then the file is sparse. This is the method `tar' uses to detect a sparse file, and once such a file is detected, it is treated differently from non-sparse files. Sparse files are often `dbm' files, or other database-type files which have data at some points and emptiness in the greater part of the file. Such files can appear to be very large when an `ls -l' is done on them, when in truth, there may be a very small amount of important data contained in the file. It is thus undesirable to have `tar' think that it must back up this entire file, as great quantities of room are wasted on empty blocks, which can lead to running out of room on a tape far earlier than is necessary. Thus, sparse files are dealt with so that these empty blocks are not written to the tape. Instead, what is written to the tape is a description, of sorts, of the sparse file: where the holes are, how big the holes are, and how much data is found at the end of the hole. This way, the file takes up potentially far less room on the tape, and when the file is extracted later on, it will look exactly the way it looked beforehand. The following is a description of the fields used to handle a sparse file: The `sp' is an array of `struct sparse'. Each `struct sparse' contains two 12-character strings which represent an offset into the file and a number of bytes to be written at that offset. The offset is absolute, and not relative to the offset in preceding array element. The header can hold four of these `struct sparse' at the moment; if more are needed, they are not stored in the header. The `isextended' flag is set when an `extended_header' is needed to deal with a file. Note that this means that this flag can only be set when dealing with a sparse file, and it is only set in the event that the description of the file will not fit in the alloted room for sparse structures in the header. In other words, an extended_header is needed. The `extended_header' structure is used for sparse files which need more sparse structures than can fit in the header. The header can fit 4 such structures; if more are needed, the flag `isextended' gets set and the next record is an `extended_header'. Each `extended_header' structure contains an array of 21 sparse structures, along with a similar `isextended' flag that the header had. There can be an indeterminate number of such `extended_header's to describe a sparse file. `LF_NORMAL' `LF_OLDNORMAL' These flags represent a regular file. In order to be compatible with older versions of `tar', a `typeflag' value of `LF_OLDNORMAL' should be silently recognized as a regular file. New archives should be created using `LF_NORMAL'. Also, for backward compatibility, `tar' treats a regular file whose name ends with a slash as a directory. `LF_LINK' This flag represents a file linked to another file, of any type, previously archived. Such files are identified in Unix by each file having the same device and inode number. The linked-to name is specified in the `linkname' field with a trailing null. `LF_SYMLINK' This represents a symbolic link to another file. The linked-to name is specified in the `linkname' field with a trailing null. `LF_CHR' `LF_BLK' These represent character special files and block special files respectively. In this case the `devmajor' and `devminor' fields will contain the major and minor device numbers respectively. Operating systems may map the device specifications to their own local specification, or may ignore the entry. `LF_DIR' This flag specifies a directory or sub-directory. The directory name in the `name' field should end with a slash. On systems where disk allocation is performed on a directory basis, the `size' field will contain the maximum number of bytes (which may be rounded to the nearest disk block allocation unit) which the directory may hold. A `size' field of zero indicates no such limiting. Systems which do not support limiting in this manner should ignore the `size' field. `LF_FIFO' This specifies a FIFO special file. Note that the archiving of a FIFO file archives the existence of this file and not its contents. `LF_CONTIG' This specifies a contiguous file, which is the same as a normal file except that, in operating systems which support it, all its space is allocated contiguously on the disk. Operating systems which do not allow contiguous allocation should silently treat this type as a normal file. `A' ... `Z' These are reserved for custom implementations. Some of these are used in the GNU modified format, as described below. Other values are reserved for specification in future revisions of the P1003 standard, and should not be used by any `tar' program. The `magic' field indicates that this archive was output in the P1003 archive format. If this field contains `TMAGIC', the `uname' and `gname' fields will contain the ASCII representation of the owner and group of the file respectively. If found, the user and group IDs are used rather than the values in the `uid' and `gid' fields.  File: tar.info, Node: Extensions, Next: cpio, Prev: Standard, Up: Archive Format GNU Extensions to the Archive Format ==================================== *(This message will disappear, once this node revised.)* The GNU format uses additional file types to describe new types of files in an archive. These are listed below. `LF_DUMPDIR' `'D'' This represents a directory and a list of files created by the `--incremental' (`-G') option. The `size' field gives the total size of the associated list of files. Each file name is preceded by either a `Y' (the file should be in this archive) or an `N'. (The file is a directory, or is not stored in the archive.) Each file name is terminated by a null. There is an additional null after the last file name. `LF_MULTIVOL' `'M'' This represents a file continued from another volume of a multi-volume archive created with the `--multi-volume' (`-M') option. The original type of the file is not given here. The `size' field gives the maximum size of this piece of the file (assuming the volume does not end before the file is written out). The `offset' field gives the offset from the beginning of the file where this part of the file begins. Thus `size' plus `offset' should equal the original size of the file. `LF_SPARSE' `'S'' This flag indicates that we are dealing with a sparse file. Note that archiving a sparse file requires special operations to find holes in the file, which mark the positions of these holes, along with the number of bytes of data to be found after the hole. `LF_VOLHDR' `'V'' This file type is used to mark the volume header that was given with the `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') option when the archive was created. The `name' field contains the `name' given after the `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') option. The `size' field is zero. Only the first file in each volume of an archive should have this type. You may have trouble reading a GNU format archive on a non-GNU system if the options `--incremental' (`-G'), `--multi-volume' (`-M'), `--sparse' (`-S'), or `--label=ARCHIVE-LABEL' (`-V ARCHIVE-LABEL') were used when writing the archive. In general, if `tar' does not use the GNU-added fields of the header, other versions of `tar' should be able to read the archive. Otherwise, the `tar' program will give an error, the most likely one being a checksum error.  File: tar.info, Node: cpio, Prev: Extensions, Up: Archive Format Comparison of `tar' and `cpio' ============================== *(This message will disappear, once this node revised.)* Here is a summary of differences between `tar' and `cpio'. The accuracy of the following information has not been verified. The following people contributed to this section, mainly through a survey conducted in 1991. The remainder of this section does not otherwise try to relate topics to people. Bent Bertelsen dmdata@login.dkuug.dk David Hoopes talgras!david Guy Harris guy@auspex.com Kai Petzke wpp@marie.physik.tu-berlin.de Kristen Nielsen dmdata@login.dkuug.dk Leslie Mikesell les@chinet.chi.il.us FIXME: Reorganize the following material `tar' handles symbolic links in the form in which it comes in BSD; `cpio' doesn't handle symbolic links in the form in which it comes in System V prior to SVR4, and some vendors may have added symlinks to their system without enhancing `cpio' to know about them. Others may have enhanced it in a way other than the way I did it at Sun, and which was adopted by AT&T (and which is, I think, also present in the `cpio' that Berkeley picked up from AT&T and put into a later BSD release--I think I gave them my changes). (SVR4 does some funny stuff with `tar'; basically, its `cpio' can handle `tar' format input, and write it on output, and it probably handles symbolic links. They may not have bothered doing anything to enhance `tar' as a result.) `cpio' handles special files; traditional `tar' doesn't. `tar' comes with V7, System III, System V, and BSD source; `cpio' comes only with System III, System V, and later BSD (4.3-tahoe and later). `tar''s way of handling multiple hard links to a file can handle file systems that support 32-bit inumbers (e.g., the BSD file system); `cpio's way requires you to play some games (in its "binary" format, i-numbers are only 16 bits, and in its "portable ASCII" format, they're 18 bits--it would have to play games with the "file system ID" field of the header to make sure that the file system ID/i-number pairs of different files were always different), and I don't know which `cpio's, if any, play those games. Those that don't might get confused and think two files are the same file when they're not, and make hard links between them. `tar's way of handling multiple hard links to a file places only one copy of the link on the tape, but the name attached to that copy is the *only* one you can use to retrieve the file; `cpio's way puts one copy for every link, but you can retrieve it using any of the names. >What type of check sum (if any) is used, and how is this calculated. See the attached manual pages for `tar' and `cpio' format. `tar' uses a checksum which is the sum of all the bytes in the `tar' header for a file; `cpio' uses no checksum. >If anyone knows why `cpio' was made when `tar' was prasent >at the unix scene, It wasn't. `cpio' first showed up in PWB/UNIX 1.0; no generally-available version of UNIX had `tar' at the time. I don't know whether any version that was generally available *within AT&T* had `tar', or, if so, whether the people within AT&T who did `cpio' knew about it. On restore, if there is a corruption on a tape `tar' will stop at that point, while `cpio' will skip over it and try to restore the rest of the files. The main difference is just in the command syntax and header format. `tar' is a little more tape-oriented in that everything is blocked to start on a block boundary. >Is there any differences between the ability to recover crashed >archives between the two of them. (Is there any chance of recovering >crashed archives at all.) Theoretically it should be easier under `tar' since the blocking lets you find a header with some variation of `dd skip=NN'. However, modern `cpio''s and variations have an option to just search for the next file header after an error with a reasonable chance of re-syncing. However, lots of tape driver software won't allow you to continue past a media error which should be the only reason for getting out of sync unless a file changed sizes while you were writing the archive. >If anyone knows why `cpio' was made when `tar' was prasent >at the unix scene, please tell me about this too. Probably because it is more media efficient (by not blocking everything and using only the space needed for the headers where `tar' always uses 512 bytes per file header) and it knows how to archive special files. You might want to look at the freely available alternatives. The major ones are `afio', GNU `tar', and `pax', each of which have their own extensions with some backwards compatibility. Sparse files were `tar'red as sparse files (which you can easily test, because the resulting archive gets smaller, and GNU `cpio' can no longer read it).  File: tar.info, Node: Index, Prev: Archive Format, Up: Top Index ***** * Menu: * abbreviations for months: Calendar date item. * absolute file names: Device. * Adding archives to an archive: Combining Archives. * Adding files to an archive: Adding to an Existing Archive. * Age, excluding files by: Characteristics. * ago in date strings: Relative item in date strings. * Alaska-Hawaii Time: Timezone item. * am in date strings: Time of day item. * archive: What tar Does. * Archive contents, list of: Listing Archive Members. * Archive creation: Creating a New Archive. * archive member: What tar Does. * Archive members, list of: Listing Archive Members. * Archive Name: Changing the Archive Name. * Atlantic Standard Time: Timezone item. * authors of getdate: Authors of getdate. * Azores Time: Timezone item. * Baghdad Time: Timezone item. * beginning of time, for Unix: Date input formats. * Bellovin, Steven M.: Authors of getdate. * Berets, Jim: Authors of getdate. * Berry, K.: Authors of getdate. * Block Size: Blocking Factor. * Blocking Factor: Blocking Factor. * Blocks, incomplete: Archive Reading Options. * bug reports: Bug reports. * Bytes per block: Blocking Factor. * calendar date item: Calendar date item. * case, ignored in dates: General date syntax. * Central Alaska Time: Timezone item. * Central European Time: Timezone item. * Central Standard Time: Timezone item. * China Coast Time: Timezone item. * comments, in dates: General date syntax. * Compressed archives: Compressed Archives. * Concatenating Archives: Combining Archives. * corrupted archives <1>: Full Dumps. * corrupted archives: Type Options. * DAT blocking: Blocking Factor. * date format, ISO 8601: Calendar date item. * date input formats: Date input formats. * day in date strings: Relative item in date strings. * day of week item: Day of week item. * daylight savings time: Timezone item. * Deleting files from an archive: Removing Archive Members. * Directing output: Changing the Archive Name. * directory arguments: Basic tar Operations. * Directory, changing in mid-stream: Changing Directory. * Disk space, running out of: Scarce Disk Space. * displacement of dates: Relative item in date strings. * Double-checking a write operation: Write Verification. * dumps, full: Full Dumps. * dumps, incremental: Inc Dumps. * East Australian Standard Time: Timezone item. * Eastern European Time: Timezone item. * Eastern Standard Time: Timezone item. * End-of-archive entries, ignoring: Archive Reading Options. * entry: What tar Does. * epoch, for Unix: Date input formats. * Error message, record number of: Checking Progress. * Exabyte blocking: Blocking Factor. * Excluding file by age: Characteristics. * Excluding files by file system: Characteristics. * Excluding files by name and pattern: Characteristics. * exit status: Synopsis. * Extraction: Extracting Archive Members. * extraction: What tar Does. * Feedback from tar: Checking Progress. * file name: What tar Does. * File Name arguments, alternatives: Reading Names from a File. * File names, excluding files by: Characteristics. * File names, using symbolic links: Symbolic Links. * File system boundaries, not crossing: Characteristics. * first in date strings: General date syntax. * Format Options: Format Variations. * Format Parameters: Format Variations. * Format, old style: Old V7 and POSIX. * fortnight in date strings: Relative item in date strings. * French Winter Time: Timezone item. * full dumps: Full Dumps. * general date syntax: General date syntax. * getdate: Date input formats. * Getting more information during the operation: Checking Progress. * Greenwich Mean Time: Timezone item. * Guam Standard Time: Timezone item. * Hawaii Standard Time: Timezone item. * hour in date strings: Relative item in date strings. * Ignoring end-of-archive entries: Archive Reading Options. * incompleteness of this manual: Authors. * incremental dumps: Inc Dumps. * Information during operation: Checking Progress. * Information on progress and status of operations: Checking Progress. * Interactive operation: Interactive Operation. * International Date Line East: Timezone item. * International Date Line West: Timezone item. * ISO 8601 date format: Calendar date item. * items in date strings: General date syntax. * Japan Standard Time: Timezone item. * Labeling an archive: Archive Label. * Labelling multi-volume archives: Matching Format Parameters. * Labels on the archive media: Archive Label. * Large lists of file names on small machines: Archive Reading Options. * last in date strings: General date syntax. * last DAY: Day of week item. * Lists of file names: Reading Names from a File. * MacKenzie, David: Authors of getdate. * member: What tar Does. * member name: What tar Does. * Meyering, Jim: Authors of getdate. * Middle European Time: Timezone item. * Middle European Winter Time: Timezone item. * Middle of the archive, starting in the: Scarce Disk Space. * midnight in date strings: Time of day item. * minute in date strings: Relative item in date strings. * minutes, timezone correction by: Time of day item. * Modes of extracted files: File Writing Options. * Modification time, excluding files by: Characteristics. * Modification times of extracted files: File Writing Options. * Modifying archives: Basic tar Operations. * month in date strings: Relative item in date strings. * month names in date strings: Calendar date item. * months, written-out: General date syntax. * Mountain Standard Time: Timezone item. * Multi-volume archives: Multi-Volume Archives. * Names of the files in an archive: Listing Archive Members. * Naming an archive: Changing the Archive Name. * New Zealand Standard Time: Timezone item. * next in date strings: General date syntax. * next DAY: Day of week item. * Nome Standard Time: Timezone item. * noon in date strings: Time of day item. * now in date strings: Relative item in date strings. * ntape device: Many. * Number of bytes per block: Blocking Factor. * Number of records per block: Blocking Factor. * numbers, written-out: General date syntax. * Old style archives: Old V7 and POSIX. * Old style format: Old V7 and POSIX. * option syntax, traditional: Old Options. * Options to specify archive format.: Format Variations. * Options when reading archives: Archive Reading Options. * ordinal numbers: General date syntax. * Overwriting old files, prevention: File Writing Options. * Pacific Standard Time: Timezone item. * Permissions of extracted files: File Writing Options. * Pinard, F.: Authors of getdate. * pm in date strings: Time of day item. * Progress information: Checking Progress. * Protecting old files: File Writing Options. * pure numbers in date strings: Pure numbers in date strings. * Reading incomplete blocks: Archive Reading Options. * Record number where error occured: Checking Progress. * Records per block: Blocking Factor. * relative items in date strings: Relative item in date strings. * remote tape drive: Device. * Removing files from an archive: Removing Archive Members. * reporting bugs: Bug reports. * Resurrecting files from an archive: Extracting Archive Members. * Retrieving files from an archive: Extracting Archive Members. * return status: Synopsis. * rmt: Device. * Running out of space: Archive Reading Options. * Running out of space during extraction: Scarce Disk Space. * Salz, Rich: Authors of getdate. * Small memory: Archive Reading Options. * Space on the disk, recovering from lack of: Scarce Disk Space. * Sparse Files: Sparse Files. * Specifying archive members: Changing the Archive Name. * Specifying files to act on: Changing the Archive Name. * Standard input and output: Changing the Archive Name. * Standard output, writing extracted files to: File Writing Options. * Status information: Checking Progress. * Storing archives in compressed format: Compressed Archives. * Swedish Winter Time: Timezone item. * Symbolic link as file name: Symbolic Links. * tape blocking: Blocking Factor. * tape marks: Many. * tape positioning: Many. * tar: What tar Does. * tar archive: What tar Does. * tar entry: What tar Does. * tar file: What tar Does. * tar to standard input and output: Changing the Archive Name. * this in date strings: Relative item in date strings. * time of day item: Time of day item. * timezone correction: Time of day item. * timezone item: Timezone item. * today in date strings: Relative item in date strings. * tomorrow in date strings: Relative item in date strings. * Ultrix 3.1 and write failure: Device. * Universal Coordinated Time: Timezone item. * unpacking: What tar Does. * Updating an archive: Adding to an Existing Archive. * USSR Zone: Timezone item. * uuencode: Modifiers Options. * Verbose operation: Checking Progress. * Verifying a write operation: Write Verification. * Verifying the currency of an archive: Comparing. * Version of the tar program: Checking Progress. * week in date strings: Relative item in date strings. * West African Time: Timezone item. * West Australian Standard Time: Timezone item. * Western European Time: Timezone item. * Where is the archive?: Changing the Archive Name. * Working directory, specifying: Changing Directory. * Writing extracted files to standard output: File Writing Options. * Writing new archives: Creating a New Archive. * year in date strings: Relative item in date strings. * yesterday in date strings: Relative item in date strings. tar-1.11.8/lib/Makefile.in 644 625 1 6037 5770654551 10234 # Makefile for GNU tar library. # Copyright (C) 1994 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. PACKAGE = @PACKAGE@ VERSION = @VERSION@ SHELL = /bin/sh srcdir = @srcdir@ subdir = lib VPATH = @srcdir@ AR = ar CC = @CC@ CFLAGS = @CFLAGS@ CPPFLAGS = @CPPFLAGS@ DEFS = @DEFS@ RANLIB = @RANLIB@ YACC = @YACC@ prefix = @prefix@ datadir = $(prefix)/share localedir = $(datadir)/locale COMPILE = $(CC) -c $(DEFS) $(INCLUDES) $(CPPFLAGS) $(CFLAGS) .SUFFIXES: .SUFFIXES: .c .o .c.o: $(COMPILE) $< INCLUDES = -I.. -I$(srcdir) HEADERS = fnmatch.h getopt.h getpagesize.h insremque.h pathmax.h \ regex.h rx.h safe-stat.h SOURCES = alloca.c fileblocks.c fnmatch.c ftruncate.c gmalloc.c insremque.c \ memset.c mkdir.c rename.c regex.c rmdir.c rx.c strstr.c \ error.c getdate.y getopt.c getopt1.c stpcpy.c xgetcwd.c xmalloc.c xstrdup.c OBJECTS = @ALLOCA@ @LIBOBJS@ \ error.o getdate.o getopt.o getopt1.o stpcpy.o xgetcwd.o xmalloc.o xstrdup.o DISTFILES = Makefile.in $(HEADERS) $(SOURCES) \ getdate.c all: libtar.a getdate.c: getdate.y @echo Expect 10 shift/reduce conflicts... cd $(srcdir) && \ $(YACC) $(YFLAGS) getdate.y; \ mv -f y.tab.c getdate.c libtar.a: $(OBJECTS) rm -f libtar.a $(AR) cru libtar.a $(OBJECTS) $(RANLIB) libtar.a $(OBJECTS): ../config.h # Waiting for the unified libintl.[ch] pair... #libintl.o: libintl.c libintl.h # $(COMPILE) -DLOCALEDIR=\"$(localedir)\" $(srcdir)/libintl.c install: all uninstall: id: ID ID: $(HEADERS) $(SOURCES) here=`pwd`; cd $(srcdir) && mkid -f$$here/ID $$here/config.h \ $(HEADERS) $(SOURCES) tags: TAGS TAGS: $(HEADERS) $(SOURCES) here=`pwd`; cd $(srcdir) && etags -o $$here/TAGS $$here/config.h \ $(HEADERS) $(SOURCES) mostlyclean: rm -f *.o rm -f yacc.* y.* clean: mostlyclean rm -f libtar.a distclean: clean rm -f ID TAGS rm -f Makefile maintainer-clean: distclean @echo "This command is intended only for maintainers to use;" @echo "rebuilding the deleted files may require special tools." rm -f getdate.c distdir = ../$(PACKAGE)-$(VERSION)/$(subdir) dist: $(DISTFILES) for file in $(DISTFILES); do \ ln $(srcdir)/$$file $(distdir) 2> /dev/null \ || cp -p $(srcdir)/$$file $(distdir); \ done Makefile: Makefile.in ../config.status cd .. && CONFIG_FILES=$(subdir)/$@ CONFIG_HEADERS= ./config.status # Tell versions [3.59,3.63) of GNU make not to export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: tar-1.11.8/lib/fnmatch.h 644 625 1 4555 5650366625 7762 /* Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. NOTE: The canonical source of this file is maintained with the GNU C Library. Bugs can be reported to bug-glibc@prep.ai.mit.edu. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _FNMATCH_H #define _FNMATCH_H 1 #ifdef __cplusplus extern "C" { #endif #if defined (__cplusplus) || (defined (__STDC__) && __STDC__) #undef __P #define __P(protos) protos #else /* Not C++ or ANSI C. */ #undef __P #define __P(protos) () /* We can get away without defining `const' here only because in this file it is used only inside the prototype for `fnmatch', which is elided in non-ANSI C where `const' is problematical. */ #endif /* C++ or ANSI C. */ /* We #undef these before defining them because some losing systems (HP-UX A.08.07 for example) define these in . */ #undef FNM_PATHNAME #undef FNM_NOESCAPE #undef FNM_PERIOD /* Bits set in the FLAGS argument to `fnmatch'. */ #define FNM_PATHNAME (1 << 0) /* No wildcard can ever match `/'. */ #define FNM_NOESCAPE (1 << 1) /* Backslashes don't quote special chars. */ #define FNM_PERIOD (1 << 2) /* Leading `.' is matched only explicitly. */ #if !defined (_POSIX_C_SOURCE) || _POSIX_C_SOURCE < 2 || defined (_GNU_SOURCE) #define FNM_FILE_NAME FNM_PATHNAME /* Preferred GNU name. */ #define FNM_LEADING_DIR (1 << 3) /* Ignore `/...' after a match. */ #define FNM_CASEFOLD (1 << 4) /* Compare without regard to case. */ #endif /* Value returned by `fnmatch' if STRING does not match PATTERN. */ #define FNM_NOMATCH 1 /* Match STRING against the filename pattern PATTERN, returning zero if it matches, FNM_NOMATCH if not. */ extern int fnmatch __P ((const char *__pattern, const char *__string, int __flags)); #ifdef __cplusplus } #endif #endif /* fnmatch.h */ tar-1.11.8/lib/getopt.h 644 625 1 10526 5655157302 7652 /* Declarations for getopt. Copyright (C) 1989, 90, 91, 92, 93, 94 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _GETOPT_H #define _GETOPT_H 1 #ifdef __cplusplus extern "C" { #endif /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ extern char *optarg; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns EOF, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ extern int optind; /* Callers store zero here to inhibit the error message `getopt' prints for unrecognized options. */ extern int opterr; /* Set to an option character which was unrecognized. */ extern int optopt; /* Describe the long-named options requested by the application. The LONG_OPTIONS argument to getopt_long or getopt_long_only is a vector of `struct option' terminated by an element containing a name which is zero. The field `has_arg' is: no_argument (or 0) if the option does not take an argument, required_argument (or 1) if the option requires an argument, optional_argument (or 2) if the option takes an optional argument. If the field `flag' is not NULL, it points to a variable that is set to the value given in the field `val' when the option is found, but left unchanged if the option is not found. To have a long-named option do something other than set an `int' to a compiled-in constant, such as set a value from `optarg', set the option's `flag' field to zero and its `val' field to a nonzero value (the equivalent single-letter option character, if there is one). For long options that have a zero `flag' field, `getopt' returns the contents of the `val' field. */ struct option { #if defined (__STDC__) && __STDC__ const char *name; #else char *name; #endif /* has_arg can't be an enum because some compilers complain about type mismatches in all the code that assumes it is an int. */ int has_arg; int *flag; int val; }; /* Names for the values of the `has_arg' field of `struct option'. */ #define no_argument 0 #define required_argument 1 #define optional_argument 2 #if defined (__STDC__) && __STDC__ #ifdef __GNU_LIBRARY__ /* Many other libraries have conflicting prototypes for getopt, with differences in the consts, in stdlib.h. To avoid compilation errors, only prototype getopt for the GNU C library. */ extern int getopt (int argc, char *const *argv, const char *shortopts); #else /* not __GNU_LIBRARY__ */ extern int getopt (); #endif /* __GNU_LIBRARY__ */ extern int getopt_long (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind); extern int getopt_long_only (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind); /* Internal only. Users should not call this directly. */ extern int _getopt_internal (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind, int long_only); #else /* not __STDC__ */ extern int getopt (); extern int getopt_long (); extern int getopt_long_only (); extern int _getopt_internal (); #endif /* __STDC__ */ #ifdef __cplusplus } #endif #endif /* _GETOPT_H */ tar-1.11.8/lib/getpagesize.h 644 625 1 1162 5426320432 10623 /* Emulate getpagesize on systems that lack it. */ #ifndef HAVE_GETPAGESIZE #ifdef VMS #define getpagesize() 512 #endif #ifdef HAVE_UNISTD_H #include #endif #ifdef _SC_PAGESIZE #define getpagesize() sysconf(_SC_PAGESIZE) #else #include #ifdef EXEC_PAGESIZE #define getpagesize() EXEC_PAGESIZE #else #ifdef NBPG #define getpagesize() NBPG * CLSIZE #ifndef CLSIZE #define CLSIZE 1 #endif /* no CLSIZE */ #else /* no NBPG */ #ifdef NBPC #define getpagesize() NBPC #endif /* NBPC */ #endif /* no NBPG */ #endif /* no EXEC_PAGESIZE */ #endif /* no _SC_PAGESIZE */ #endif /* not HAVE_GETPAGESIZE */ tar-1.11.8/lib/insremque.h 644 625 1 1611 5756461520 10335 /* dqueue.h -- definitions for double linked list handling Copyright (C) 1992 Free Software Foundation. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _DQUEUE_H #define _DQUEUE_H 1 struct qelem { struct qelem *q_forw; struct qelem *q_back; char q_data[1]; }; #endif /* dqueue.h */ tar-1.11.8/lib/pathmax.h 644 625 1 3247 5645120651 7770 /* Define PATH_MAX somehow. Requires sys/types.h. Copyright (C) 1992 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _PATHMAX_H #define _PATHMAX_H #ifdef HAVE_UNISTD_H #include #endif /* Non-POSIX BSD systems might have gcc's limits.h, which doesn't define PATH_MAX but might cause redefinition warnings when sys/param.h is later included (as on MORE/BSD 4.3). */ #if defined(_POSIX_VERSION) || (defined(HAVE_LIMITS_H) && !defined(__GNUC__)) #include #endif #ifndef _POSIX_PATH_MAX #define _POSIX_PATH_MAX 255 #endif #if !defined(PATH_MAX) && defined(_PC_PATH_MAX) #define PATH_MAX (pathconf ("/", _PC_PATH_MAX) < 1 ? 1024 : pathconf ("/", _PC_PATH_MAX)) #endif /* Don't include sys/param.h if it already has been. */ #if defined(HAVE_SYS_PARAM_H) && !defined(PATH_MAX) && !defined(MAXPATHLEN) #include #endif #if !defined(PATH_MAX) && defined(MAXPATHLEN) #define PATH_MAX MAXPATHLEN #endif #ifndef PATH_MAX #define PATH_MAX _POSIX_PATH_MAX #endif #endif /* _PATHMAX_H */ tar-1.11.8/lib/regex.h 444 625 1 44607 5757633403 7473 /* Definitions for data structures and routines for the regular expression library, version 0.12. Copyright (C) 1985, 89, 90, 91, 92, 93, 95 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __REGEXP_LIBRARY_H__ #define __REGEXP_LIBRARY_H__ /* POSIX says that must be included (by the caller) before . */ #if !defined (_POSIX_C_SOURCE) && !defined (_POSIX_SOURCE) && defined (VMS) /* VMS doesn't have `size_t' in , even though POSIX says it should be there. */ #include #endif /* The following bits are used to determine the regexp syntax we recognize. The set/not-set meanings are chosen so that Emacs syntax remains the value 0. The bits are given in alphabetical order, and the definitions shifted by one from the previous bit; thus, when we add or remove a bit, only one other definition need change. */ typedef unsigned reg_syntax_t; /* If this bit is not set, then \ inside a bracket expression is literal. If set, then such a \ quotes the following character. */ #define RE_BACKSLASH_ESCAPE_IN_LISTS (1) /* If this bit is not set, then + and ? are operators, and \+ and \? are literals. If set, then \+ and \? are operators and + and ? are literals. */ #define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1) /* If this bit is set, then character classes are supported. They are: [:alpha:], [:upper:], [:lower:], [:digit:], [:alnum:], [:xdigit:], [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:]. If not set, then character classes are not supported. */ #define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1) /* If this bit is set, then ^ and $ are always anchors (outside bracket expressions, of course). If this bit is not set, then it depends: ^ is an anchor if it is at the beginning of a regular expression or after an open-group or an alternation operator; $ is an anchor if it is at the end of a regular expression, or before a close-group or an alternation operator. This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because POSIX draft 11.2 says that * etc. in leading positions is undefined. We already implemented a previous draft which made those constructs invalid, though, so we haven't changed the code back. */ #define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1) /* If this bit is set, then special characters are always special regardless of where they are in the pattern. If this bit is not set, then special characters are special only in some contexts; otherwise they are ordinary. Specifically, * + ? and intervals are only special when not after the beginning, open-group, or alternation operator. */ #define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1) /* If this bit is set, then *, +, ?, and { cannot be first in an re or immediately after an alternation or begin-group operator. */ #define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1) /* If this bit is set, then . matches newline. If not set, then it doesn't. */ #define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1) /* If this bit is set, then . doesn't match NUL. If not set, then it does. */ #define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1) /* If this bit is set, nonmatching lists [^...] do not match newline. If not set, they do. */ #define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1) /* If this bit is set, either \{...\} or {...} defines an interval, depending on RE_NO_BK_BRACES. If not set, \{, \}, {, and } are literals. */ #define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1) /* If this bit is set, +, ? and | aren't recognized as operators. If not set, they are. */ #define RE_LIMITED_OPS (RE_INTERVALS << 1) /* If this bit is set, newline is an alternation operator. If not set, newline is literal. */ #define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1) /* If this bit is set, then `{...}' defines an interval, and \{ and \} are literals. If not set, then `\{...\}' defines an interval. */ #define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1) /* If this bit is set, (...) defines a group, and \( and \) are literals. If not set, \(...\) defines a group, and ( and ) are literals. */ #define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1) /* If this bit is set, then \ matches . If not set, then \ is a back-reference. */ #define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1) /* If this bit is set, then | is an alternation operator, and \| is literal. If not set, then \| is an alternation operator, and | is literal. */ #define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1) /* If this bit is set, then an ending range point collating higher than the starting range point, as in [z-a], is invalid. If not set, then when ending range point collates higher than the starting range point, the range is ignored. */ #define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1) /* If this bit is set, then an unmatched ) is ordinary. If not set, then an unmatched ) is invalid. */ #define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1) /* If this bit is set, succeed as soon as we match the whole pattern, without further backtracking. */ #define RE_NO_POSIX_BACKTRACKING (RE_UNMATCHED_RIGHT_PAREN_ORD << 1) /* This global variable defines the particular regexp syntax to use (for some interfaces). When a regexp is compiled, the syntax used is stored in the pattern buffer, so changing this does not affect already-compiled regexps. */ extern reg_syntax_t re_syntax_options; /* Define combinations of the above bits for the standard possibilities. (The [[[ comments delimit what gets put into the Texinfo file, so don't delete them!) */ /* [[[begin syntaxes]]] */ #define RE_SYNTAX_EMACS 0 #define RE_SYNTAX_AWK \ (RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL \ | RE_NO_BK_PARENS | RE_NO_BK_REFS \ | RE_NO_BK_VBAR | RE_NO_EMPTY_RANGES \ | RE_UNMATCHED_RIGHT_PAREN_ORD) #define RE_SYNTAX_POSIX_AWK \ (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS) #define RE_SYNTAX_GREP \ (RE_BK_PLUS_QM | RE_CHAR_CLASSES \ | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS \ | RE_NEWLINE_ALT) #define RE_SYNTAX_EGREP \ (RE_CHAR_CLASSES | RE_CONTEXT_INDEP_ANCHORS \ | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE \ | RE_NEWLINE_ALT | RE_NO_BK_PARENS \ | RE_NO_BK_VBAR) #define RE_SYNTAX_POSIX_EGREP \ (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES) /* P1003.2/D11.2, section 4.20.7.1, lines 5078ff. */ #define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC #define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC /* Syntax bits common to both basic and extended POSIX regex syntax. */ #define _RE_SYNTAX_POSIX_COMMON \ (RE_CHAR_CLASSES | RE_DOT_NEWLINE | RE_DOT_NOT_NULL \ | RE_INTERVALS | RE_NO_EMPTY_RANGES) #define RE_SYNTAX_POSIX_BASIC \ (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM) /* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes RE_LIMITED_OPS, i.e., \? \+ \| are not recognized. Actually, this isn't minimal, since other operators, such as \`, aren't disabled. */ #define RE_SYNTAX_POSIX_MINIMAL_BASIC \ (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS) #define RE_SYNTAX_POSIX_EXTENDED \ (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ | RE_CONTEXT_INDEP_OPS | RE_NO_BK_BRACES \ | RE_NO_BK_PARENS | RE_NO_BK_VBAR \ | RE_UNMATCHED_RIGHT_PAREN_ORD) /* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INVALID_OPS replaces RE_CONTEXT_INDEP_OPS and RE_NO_BK_REFS is added. */ #define RE_SYNTAX_POSIX_MINIMAL_EXTENDED \ (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES \ | RE_NO_BK_PARENS | RE_NO_BK_REFS \ | RE_NO_BK_VBAR | RE_UNMATCHED_RIGHT_PAREN_ORD) /* [[[end syntaxes]]] */ /* Maximum number of duplicates an interval can allow. Some systems (erroneously) define this in other header files, but we want our value, so remove any previous define. */ #ifdef RE_DUP_MAX #undef RE_DUP_MAX #endif #define RE_DUP_MAX ((1 << 15) - 1) /* POSIX `cflags' bits (i.e., information for `regcomp'). */ /* If this bit is set, then use extended regular expression syntax. If not set, then use basic regular expression syntax. */ #define REG_EXTENDED 1 /* If this bit is set, then ignore case when matching. If not set, then case is significant. */ #define REG_ICASE (REG_EXTENDED << 1) /* If this bit is set, then anchors do not match at newline characters in the string. If not set, then anchors do match at newlines. */ #define REG_NEWLINE (REG_ICASE << 1) /* If this bit is set, then report only success or fail in regexec. If not set, then returns differ between not matching and errors. */ #define REG_NOSUB (REG_NEWLINE << 1) /* POSIX `eflags' bits (i.e., information for regexec). */ /* If this bit is set, then the beginning-of-line operator doesn't match the beginning of the string (presumably because it's not the beginning of a line). If not set, then the beginning-of-line operator does match the beginning of the string. */ #define REG_NOTBOL 1 /* Like REG_NOTBOL, except for the end-of-line. */ #define REG_NOTEOL (1 << 1) /* If any error codes are removed, changed, or added, update the `re_error_msg' table in regex.c. */ typedef enum { REG_NOERROR = 0, /* Success. */ REG_NOMATCH, /* Didn't find a match (for regexec). */ /* POSIX regcomp return error codes. (In the order listed in the standard.) */ REG_BADPAT, /* Invalid pattern. */ REG_ECOLLATE, /* Not implemented. */ REG_ECTYPE, /* Invalid character class name. */ REG_EESCAPE, /* Trailing backslash. */ REG_ESUBREG, /* Invalid back reference. */ REG_EBRACK, /* Unmatched left bracket. */ REG_EPAREN, /* Parenthesis imbalance. */ REG_EBRACE, /* Unmatched \{. */ REG_BADBR, /* Invalid contents of \{\}. */ REG_ERANGE, /* Invalid range end. */ REG_ESPACE, /* Ran out of memory. */ REG_BADRPT, /* No preceding re for repetition op. */ /* Error codes we've added. */ REG_EEND, /* Premature end. */ REG_ESIZE, /* Compiled pattern bigger than 2^16 bytes. */ REG_ERPAREN /* Unmatched ) or \); not returned from regcomp. */ } reg_errcode_t; /* This data structure represents a compiled pattern. Before calling the pattern compiler, the fields `buffer', `allocated', `fastmap', `translate', and `no_sub' can be set. After the pattern has been compiled, the `re_nsub' field is available. All other fields are private to the regex routines. */ struct re_pattern_buffer { /* [[[begin pattern_buffer]]] */ /* Space that holds the compiled pattern. It is declared as `unsigned char *' because its elements are sometimes used as array indexes. */ unsigned char *buffer; /* Number of bytes to which `buffer' points. */ unsigned long allocated; /* Number of bytes actually used in `buffer'. */ unsigned long used; /* Syntax setting with which the pattern was compiled. */ reg_syntax_t syntax; /* Pointer to a fastmap, if any, otherwise zero. re_search uses the fastmap, if there is one, to skip over impossible starting points for matches. */ char *fastmap; /* Either a translate table to apply to all characters before comparing them, or zero for no translation. The translation is applied to a pattern when it is compiled and to a string when it is matched. */ char *translate; /* Number of subexpressions found by the compiler. */ size_t re_nsub; /* Zero if this pattern cannot match the empty string, one else. Well, in truth it's used only in `re_search_2', to see whether or not we should use the fastmap, so we don't set this absolutely perfectly; see `re_compile_fastmap' (the `duplicate' case). */ unsigned can_be_null : 1; /* If REGS_UNALLOCATED, allocate space in the `regs' structure for `max (RE_NREGS, re_nsub + 1)' groups. If REGS_REALLOCATE, reallocate space if necessary. If REGS_FIXED, use what's there. */ #define REGS_UNALLOCATED 0 #define REGS_REALLOCATE 1 #define REGS_FIXED 2 unsigned regs_allocated : 2; /* Set to zero when `regex_compile' compiles a pattern; set to one by `re_compile_fastmap' if it updates the fastmap. */ unsigned fastmap_accurate : 1; /* If set, `re_match_2' does not return information about subexpressions. */ unsigned no_sub : 1; /* If set, a beginning-of-line anchor doesn't match at the beginning of the string. */ unsigned not_bol : 1; /* Similarly for an end-of-line anchor. */ unsigned not_eol : 1; /* If true, an anchor at a newline matches. */ unsigned newline_anchor : 1; /* [[[end pattern_buffer]]] */ }; typedef struct re_pattern_buffer regex_t; /* Type for byte offsets within the string. POSIX mandates this. */ typedef int regoff_t; /* This is the structure we store register match data in. See regex.texinfo for a full description of what registers match. */ struct re_registers { unsigned num_regs; regoff_t *start; regoff_t *end; }; /* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer, `re_match_2' returns information about at least this many registers the first time a `regs' structure is passed. */ #ifndef RE_NREGS #define RE_NREGS 30 #endif /* POSIX specification for registers. Aside from the different names than `re_registers', POSIX uses an array of structures, instead of a structure of arrays. */ typedef struct { regoff_t rm_so; /* Byte offset from string's start to substring's start. */ regoff_t rm_eo; /* Byte offset from string's start to substring's end. */ } regmatch_t; /* Declarations for routines. */ /* To avoid duplicating every routine declaration -- once with a prototype (if we are ANSI), and once without (if we aren't) -- we use the following macro to declare argument types. This unfortunately clutters up the declarations a bit, but I think it's worth it. */ #if __STDC__ #define _RE_ARGS(args) args #else /* not __STDC__ */ #define _RE_ARGS(args) () #endif /* not __STDC__ */ /* Sets the current default syntax to SYNTAX, and return the old syntax. You can also simply assign to the `re_syntax_options' variable. */ extern reg_syntax_t re_set_syntax _RE_ARGS ((reg_syntax_t syntax)); /* Compile the regular expression PATTERN, with length LENGTH and syntax given by the global `re_syntax_options', into the buffer BUFFER. Return NULL if successful, and an error string if not. */ extern const char *re_compile_pattern _RE_ARGS ((const char *pattern, int length, struct re_pattern_buffer *buffer)); /* Compile a fastmap for the compiled pattern in BUFFER; used to accelerate searches. Return 0 if successful and -2 if was an internal error. */ extern int re_compile_fastmap _RE_ARGS ((struct re_pattern_buffer *buffer)); /* Search in the string STRING (with length LENGTH) for the pattern compiled into BUFFER. Start searching at position START, for RANGE characters. Return the starting position of the match, -1 for no match, or -2 for an internal error. Also return register information in REGS (if REGS and BUFFER->no_sub are nonzero). */ extern int re_search _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string, int length, int start, int range, struct re_registers *regs)); /* Like `re_search', but search in the concatenation of STRING1 and STRING2. Also, stop searching at index START + STOP. */ extern int re_search_2 _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1, int length1, const char *string2, int length2, int start, int range, struct re_registers *regs, int stop)); /* Like `re_search', but return how many characters in STRING the regexp in BUFFER matched, starting at position START. */ extern int re_match _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string, int length, int start, struct re_registers *regs)); /* Relates to `re_match' as `re_search_2' relates to `re_search'. */ extern int re_match_2 _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1, int length1, const char *string2, int length2, int start, struct re_registers *regs, int stop)); /* Set REGS to hold NUM_REGS registers, storing them in STARTS and ENDS. Subsequent matches using BUFFER and REGS will use this memory for recording register information. STARTS and ENDS must be allocated with malloc, and must each be at least `NUM_REGS * sizeof (regoff_t)' bytes long. If NUM_REGS == 0, then subsequent matches should allocate their own register data. Unless this function is called, the first search or match using PATTERN_BUFFER will allocate its own register data, without freeing the old data. */ extern void re_set_registers _RE_ARGS ((struct re_pattern_buffer *buffer, struct re_registers *regs, unsigned num_regs, regoff_t *starts, regoff_t *ends)); #ifdef _REGEX_RE_COMP /* 4.2 bsd compatibility. */ extern char *re_comp _RE_ARGS ((const char *)); extern int re_exec _RE_ARGS ((const char *)); #endif /* POSIX compatibility. */ extern int regcomp _RE_ARGS ((regex_t *preg, const char *pattern, int cflags)); extern int regexec _RE_ARGS ((const regex_t *preg, const char *string, size_t nmatch, regmatch_t pmatch[], int eflags)); extern size_t regerror _RE_ARGS ((int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)); extern void regfree _RE_ARGS ((regex_t *preg)); #endif /* not __REGEXP_LIBRARY_H__ */ /* Local variables: make-backup-files: t version-control: t trim-versions-without-asking: nil End: */ tar-1.11.8/lib/rx.h 644 625 1 342667 5752413506 7036 #if !defined(RXH) || defined(RX_WANT_SE_DEFS) #define RXH /* Copyright (C) 1992, 1993 Free Software Foundation, Inc. This file is part of the librx library. Librx is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. Librx is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU Library General Public License along with this software; see the file COPYING.LIB. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* t. lord Wed Sep 23 18:20:57 1992 */ #ifndef RX_WANT_SE_DEFS /* This page: Bitsets */ #ifndef RX_subset typedef unsigned int RX_subset; #define RX_subset_bits (32) #define RX_subset_mask (RX_subset_bits - 1) #endif typedef RX_subset * rx_Bitset; #ifdef __STDC__ typedef void (*rx_bitset_iterator) (void *, int member_index); #else typedef void (*rx_bitset_iterator) (); #endif #define rx_bitset_subset(N) ((N) / RX_subset_bits) #define rx_bitset_subset_val(B,N) ((B)[rx_bitset_subset(N)]) #define RX_bitset_access(B,N,OP) \ ((B)[rx_bitset_subset(N)] OP rx_subset_singletons[(N) & RX_subset_mask]) #define RX_bitset_member(B,N) RX_bitset_access(B, N, &) #define RX_bitset_enjoin(B,N) RX_bitset_access(B, N, |=) #define RX_bitset_remove(B,N) RX_bitset_access(B, N, &= ~) #define RX_bitset_toggle(B,N) RX_bitset_access(B, N, ^= ) #define rx_bitset_numb_subsets(N) (((N) + RX_subset_bits - 1) / RX_subset_bits) #define rx_sizeof_bitset(N) (rx_bitset_numb_subsets(N) * sizeof(RX_subset)) /* This page: Splay trees. */ #ifdef __STDC__ typedef int (*rx_sp_comparer) (void * a, void * b); #else typedef int (*rx_sp_comparer) (); #endif struct rx_sp_node { void * key; void * data; struct rx_sp_node * kids[2]; }; #ifdef __STDC__ typedef void (*rx_sp_key_data_freer) (struct rx_sp_node *); #else typedef void (*rx_sp_key_data_freer) (); #endif /* giant inflatable hash trees */ struct rx_hash_item { struct rx_hash_item * next_same_hash; struct rx_hash * table; unsigned long hash; void * data; void * binding; }; struct rx_hash { struct rx_hash * parent; int refs; struct rx_hash * children[13]; struct rx_hash_item * buckets [13]; int bucket_size [13]; }; struct rx_hash_rules; #ifdef __STDC__ /* should return like == */ typedef int (*rx_hash_eq)(void *, void *); typedef struct rx_hash * (*rx_alloc_hash)(struct rx_hash_rules *); typedef void (*rx_free_hash)(struct rx_hash *, struct rx_hash_rules *); typedef struct rx_hash_item * (*rx_alloc_hash_item)(struct rx_hash_rules *, void *); typedef void (*rx_free_hash_item)(struct rx_hash_item *, struct rx_hash_rules *); #else typedef int (*rx_hash_eq)(); typedef struct rx_hash * (*rx_alloc_hash)(); typedef void (*rx_free_hash)(); typedef struct rx_hash_item * (*rx_alloc_hash_item)(); typedef void (*rx_free_hash_item)(); #endif struct rx_hash_rules { rx_hash_eq eq; rx_alloc_hash hash_alloc; rx_free_hash free_hash; rx_alloc_hash_item hash_item_alloc; rx_free_hash_item free_hash_item; }; /* Forward declarations */ struct rx_cache; struct rx_superset; struct rx; struct rx_se_list; /* * GLOSSARY * * regexp * regular expression * expression * pattern - a `regular' expression. The expression * need not be formally regular -- it can contain * constructs that don't correspond to purely regular * expressions. * * buffer * string - the string (or strings) being searched or matched. * * pattern buffer - a structure of type `struct re_pattern_buffer' * This in turn contains a `struct rx', which holds the * NFA compiled from a pattern, as well as some of the state * of a matcher using the pattern. * * NFA - nondeterministic finite automata. Some people * use this term to a member of the class of * regular automata (those corresponding to a regular * language). However, in this code, the meaning is * more general. The automata used by Rx are comperable * in power to what are usually called `push down automata'. * * Two NFA are built by rx for every pattern. One is built * by the compiler. The other is built from the first, on * the fly, by the matcher. The latter is called the `superstate * NFA' because its states correspond to sets of states from * the first NFA. (Joe Keane gets credit for the name * `superstate NFA'). * * NFA edges * epsilon edges * side-effect edges - The NFA compiled from a pattern can have three * kinds of edges. Epsilon edges can be taken freely anytime * their source state is reached. Character set edges can be * taken when their source state is reached and when the next * character in the buffer is a member of the set. Side effect * edges imply a transition that can only be taken after the * indicated side effect has been successfully accomplished. * Some examples of side effects are: * * Storing the current match position to record the * location of a parentesized subexpression. * * Advancing the matcher over N characters if they * match the N characters previously matched by a * parentesized subexpression. * * Both of those kinds of edges occur in the NFA generated * by the pattern: \(.\)\1 * * Epsilon and side effect edges are similar. Unfortunately, * some of the code uses the name `epsilon edge' to mean * both epsilon and side effect edges. For example, the * function has_non_idempotent_epsilon_path computes the existance * of a non-trivial path containing only a mix of epsilon and * side effect edges. In that case `nonidempotent epsilon' is being * used to mean `side effect'. */ /* LOW LEVEL PATTERN BUFFERS */ /* Suppose that from some NFA state, more than one path through * side-effect edges is possible. In what order should the paths * be tried? A function of type rx_se_list_order answers that * question. It compares two lists of side effects, and says * which list comes first. */ #ifdef __STDC__ typedef int (*rx_se_list_order) (struct rx *, struct rx_se_list *, struct rx_se_list *); #else typedef int (*rx_se_list_order) (); #endif /* Struct RX holds a compiled regular expression - that is, an nfa * ready to be converted on demand to a more efficient superstate nfa. * This is for the low level interface. The high-level interfaces enclose * this in a `struct re_pattern_buffer'. */ struct rx { /* The compiler assigns a unique id to every pattern. * Like sequence numbers in X, there is a subtle bug here * if you use Rx in a system that runs for a long time. * But, because of the way the caches work out, it is almost * impossible to trigger the Rx version of this bug. * * The id is used to validate superstates found in a cache * of superstates. It isn't sufficient to let a superstate * point back to the rx for which it was compiled -- the caller * may be re-using a `struct rx' in which case the superstate * is not really valid. So instead, superstates are validated * by checking the sequence number of the pattern for which * they were built. */ int rx_id; /* This is memory mgt. state for superstates. This may be * shared by more than one struct rx. */ struct rx_cache * cache; /* Every regex defines the size of its own character set. * A superstate has an array of this size, with each element * a `struct rx_inx'. So, don't make this number too large. * In particular, don't make it 2^16. */ int local_cset_size; /* After the NFA is built, it is copied into a contiguous region * of memory (mostly for compatability with GNU regex). * Here is that region, and it's size: */ void * buffer; unsigned long allocated; /* Clients of RX can ask for some extra storage in the space pointed * to by BUFFER. The field RESERVED is an input parameter to the * compiler. After compilation, this much space will be available * at (buffer + allocated - reserved) */ unsigned long reserved; /* --------- The remaining fields are for internal use only. --------- */ /* --------- But! they must be initialized to 0. --------- */ /* NODEC is the number of nodes in the NFA with non-epsilon * transitions. */ int nodec; /* EPSNODEC is the number of nodes with only epsilon transitions. */ int epsnodec; /* The sum (NODEC + EPSNODEC) is the total number of states in the * compiled NFA. */ /* Lists of side effects as stored in the NFA are `hash consed'..meaning * that lists with the same elements are ==. During compilation, * this table facilitates hash-consing. */ struct rx_hash se_list_memo; /* Lists of NFA states are also hashed. */ struct rx_hash set_list_memo; /* The compiler and matcher must build a number of instruction frames. * The format of these frames is fixed (c.f. struct rx_inx). The values * of the instructions is not fixed. * * An enumerated type (enum rx_opcode) defines the set of instructions * that the compiler or matcher might generate. When filling an instruction * frame, the INX field is found by indexing this instruction table * with an opcode: */ void ** instruction_table; /* The list of all states in an NFA. * During compilation, the NEXT field of NFA states links this list. * After compilation, all the states are compacted into an array, * ordered by state id numbers. At that time, this points to the base * of that array. */ struct rx_nfa_state *nfa_states; /* Every nfa begins with one distinguished starting state: */ struct rx_nfa_state *start; /* This orders the search through super-nfa paths. * See the comment near the typedef of rx_se_list_order. */ rx_se_list_order se_list_cmp; struct rx_superset * start_set; }; /* SYNTAX TREES */ /* Compilation is in stages. * * In the first stage, a pattern specified by a string is * translated into a syntax tree. Later stages will convert * the syntax tree into an NFA optimized for conversion to a * superstate-NFA. * * This page is about syntax trees. */ enum rexp_node_type { r_cset, /* Match from a character set. `a' or `[a-z]'*/ r_concat, /* Concat two subexpressions. `ab' */ r_alternate, /* Choose one of two subexpressions. `a\|b' */ r_opt, /* Optional subexpression. `a?' */ r_star, /* Repeated subexpression. `a*' */ /* A 2phase-star is a variation on a repeated subexpression. * In this case, there are two subexpressions. The first, if matched, * begins a repitition (otherwise, the whole expression is matches the * empth string). * * After matching the first subexpression, a 2phase star either finishes, * or matches the second subexpression. If the second subexpression is * matched, then the whole construct repeats. * * 2phase stars are used in two circumstances. First, they * are used as part of the implementation of POSIX intervals (counted * repititions). Second, they are used to implement proper star * semantics when the repeated subexpression contains paths of * only side effects. See rx_compile for more information. */ r_2phase_star, /* c.f. "typedef void * rx_side_effect" */ r_side_effect, /* This is an extension type: It is for transient use in source->source * transformations (implemented over syntax trees). */ r_data }; /* A side effect is a matcher-specific action associated with * transitions in the NFA. The details of side effects are up * to the matcher. To the compiler and superstate constructors * side effects are opaque: */ typedef void * rx_side_effect; /* Nodes in a syntax tree are of this type: */ struct rexp_node { enum rexp_node_type type; union { rx_Bitset cset; rx_side_effect side_effect; struct { struct rexp_node *left; struct rexp_node *right; } pair; void * data; } params; }; /* NFA * * A syntax tree is compiled into an NFA. This page defines the structure * of that NFA. */ struct rx_nfa_state { /* These are kept in a list as the NFA is being built. */ struct rx_nfa_state *next; /* After the NFA is built, states are given integer id's. * States whose outgoing transitions are all either epsilon or * side effect edges are given ids less than 0. Other states * are given successive non-negative ids starting from 0. */ int id; /* The list of NFA edges that go from this state to some other. */ struct rx_nfa_edge *edges; /* If you land in this state, then you implicitly land * in all other states reachable by only epsilon translations. * Call the set of maximal paths to such states the epsilon closure * of this state. * * There may be other states that are reachable by a mixture of * epsilon and side effect edges. Consider the set of maximal paths * of that sort from this state. Call it the epsilon-side-effect * closure of the state. * * The epsilon closure of the state is a subset of the epsilon-side- * effect closure. It consists of all the paths that contain * no side effects -- only epsilon edges. * * The paths in the epsilon-side-effect closure can be partitioned * into equivalance sets. Two paths are equivalant if they have the * same set of side effects, in the same order. The epsilon-closure * is one of these equivalance sets. Let's call these equivalance * sets: observably equivalant path sets. That name is chosen * because equivalance of two paths means they cause the same side * effects -- so they lead to the same subsequent observations other * than that they may wind up in different target states. * * The superstate nfa, which is derived from this nfa, is based on * the observation that all of the paths in an observably equivalant * path set can be explored at the same time, provided that the * matcher keeps track not of a single nfa state, but of a set of * states. In particular, after following all the paths in an * observably equivalant set, you wind up at a set of target states. * That set of target states corresponds to one state in the * superstate NFA. * * Staticly, before matching begins, it is convenient to analyze the * nfa. Each state is labeled with a list of the observably * equivalant path sets who's union covers all the * epsilon-side-effect paths beginning in this state. This list is * called the possible futures of the state. * * A trivial example is this NFA: * s1 * A ---> B * * s2 * ---> C * * epsilon s1 * ---------> D ------> E * * * In this example, A has two possible futures. * One invokes the side effect `s1' and contains two paths, * one ending in state B, the other in state E. * The other invokes the side effect `s2' and contains only * one path, landing in state C. */ struct rx_possible_future *futures; /* There are exactly two distinguished states in every NFA: */ unsigned int is_final:1; unsigned int is_start:1; /* These are used during NFA construction... */ unsigned int eclosure_needed:1; unsigned int mark:1; }; /* An edge in an NFA is typed: */ enum rx_nfa_etype { /* A cset edge is labled with a set of characters one of which * must be matched for the edge to be taken. */ ne_cset, /* An epsilon edge is taken whenever its starting state is * reached. */ ne_epsilon, /* A side effect edge is taken whenever its starting state is * reached. Side effects may cause the match to fail or the * position of the matcher to advance. */ ne_side_effect /* A special kind of epsilon. */ }; struct rx_nfa_edge { struct rx_nfa_edge *next; enum rx_nfa_etype type; struct rx_nfa_state *dest; union { rx_Bitset cset; rx_side_effect side_effect; } params; }; /* A possible future consists of a list of side effects * and a set of destination states. Below are their * representations. These structures are hash-consed which * means that lists with the same elements share a representation * (their addresses are ==). */ struct rx_nfa_state_set { struct rx_nfa_state * car; struct rx_nfa_state_set * cdr; }; struct rx_se_list { rx_side_effect car; struct rx_se_list * cdr; }; struct rx_possible_future { struct rx_possible_future *next; struct rx_se_list * effects; struct rx_nfa_state_set * destset; }; /* This begins the description of the superstate NFA. * * The superstate NFA corresponds to the NFA in these ways: * * Every superstate NFA states SUPER correspond to sets of NFA states, * nfa_states(SUPER). * * Superstate edges correspond to NFA paths. * * The superstate has no epsilon transitions; * every edge has a character label, and a (possibly empty) side * effect label. The side effect label corresponds to a list of * side effects that occur in the NFA. These parts are referred * to as: superedge_character(EDGE) and superedge_sides(EDGE). * * For a superstate edge EDGE starting in some superstate SUPER, * the following is true (in pseudo-notation :-): * * exists DEST in nfa_states s.t. * exists nfaEDGE in nfa_edges s.t. * origin (nfaEDGE) == DEST * && origin (nfaEDGE) is a member of nfa_states(SUPER) * && exists PF in possible_futures(dest(nfaEDGE)) s.t. * sides_of_possible_future (PF) == superedge_sides (EDGE) * * also: * * let SUPER2 := superedge_destination(EDGE) * nfa_states(SUPER2) * == union of all nfa state sets S s.t. * exists PF in possible_futures(dest(nfaEDGE)) s.t. * sides_of_possible_future (PF) == superedge_sides (EDGE) * && S == dests_of_possible_future (PF) } * * Or in english, every superstate is a set of nfa states. A given * character and a superstate implies many transitions in the NFA -- * those that begin with an edge labeled with that character from a * state in the set corresponding to the superstate. * * The destinations of those transitions each have a set of possible * futures. A possible future is a list of side effects and a set of * destination NFA states. Two sets of possible futures can be * `merged' by combining all pairs of possible futures that have the * same side effects. A pair is combined by creating a new future * with the same side effect but the union of the two destination sets. * In this way, all the possible futures suggested by a superstate * and a character can be merged into a set of possible futures where * no two elements of the set have the same set of side effects. * * The destination of a possible future, being a set of NFA states, * corresponds to a supernfa state. So, the merged set of possible * futures we just created can serve as a set of edges in the * supernfa. * * The representation of the superstate nfa and the nfa is critical. * The nfa has to be compact, but has to facilitate the rapid * computation of missing superstates. The superstate nfa has to * be fast to interpret, lazilly constructed, and bounded in space. * * To facilitate interpretation, the superstate data structures are * peppered with `instruction frames'. There is an instruction set * defined below which matchers using the supernfa must be able to * interpret. * * We'd like to make it possible but not mandatory to use code * addresses to represent instructions (c.f. gcc's computed goto). * Therefore, we define an enumerated type of opcodes, and when * writing one of these instructions into a data structure, use * the opcode as an index into a table of instruction values. * * Here are the opcodes that occur in the superstate nfa: */ /* Every superstate contains a table of instruction frames indexed * by characters. A normal `move' in a matcher is to fetch the next * character and use it as an index into a superstates transition * table. * * In the fasted case, only one edge follows from that character. * In other cases there is more work to do. * * The descriptions of the opcodes refer to data structures that are * described further below. */ enum rx_opcode { /* * BACKTRACK_POINT is invoked when a character transition in * a superstate leads to more than one edge. In that case, * the edges have to be explored independently using a backtracking * strategy. * * A BACKTRACK_POINT instruction is stored in a superstate's * transition table for some character when it is known that that * character crosses more than one edge. On encountering this * instruction, the matcher saves enough state to backtrack to this * point in the match later. */ rx_backtrack_point = 0, /* data is (struct transition_class *) */ /* * RX_DO_SIDE_EFFECTS evaluates the side effects of an epsilon path. * There is one occurence of this instruction per rx_distinct_future. * This instruction is skipped if a rx_distinct_future has no side effects. */ rx_do_side_effects = rx_backtrack_point + 1, /* data is (struct rx_distinct_future *) */ /* * RX_CACHE_MISS instructions are stored in rx_distinct_futures whose * destination superstate has been reclaimed (or was never built). * It recomputes the destination superstate. * RX_CACHE_MISS is also stored in a superstate transition table before * any of its edges have been built. */ rx_cache_miss = rx_do_side_effects + 1, /* data is (struct rx_distinct_future *) */ /* * RX_NEXT_CHAR is called to consume the next character and take the * corresponding transition. This is the only instruction that uses * the DATA field of the instruction frame instead of DATA_2. * (see EXPLORE_FUTURE in regex.c). */ rx_next_char = rx_cache_miss + 1, /* data is (struct superstate *) */ /* RX_BACKTRACK indicates that a transition fails. */ rx_backtrack = rx_next_char + 1, /* no data */ /* * RX_ERROR_INX is stored only in places that should never be executed. */ rx_error_inx = rx_backtrack + 1, /* Not supposed to occur. */ rx_num_instructions = rx_error_inx + 1 }; /* An id_instruction_table holds the values stored in instruction * frames. The table is indexed by the enums declared above. */ extern void * rx_id_instruction_table[rx_num_instructions]; /* The heart of the matcher is a `word-code-interpreter' * (like a byte-code interpreter, except that instructions * are a full word wide). * * Instructions are not stored in a vector of code, instead, * they are scattered throughout the data structures built * by the regexp compiler and the matcher. One word-code instruction, * together with the arguments to that instruction, constitute * an instruction frame (struct rx_inx). * * This structure type is padded by hand to a power of 2 because * in one of the dominant cases, we dispatch by indexing a table * of instruction frames. If that indexing can be accomplished * by just a shift of the index, we're happy. * * Instructions take at most one argument, but there are two * slots in an instruction frame that might hold that argument. * These are called data and data_2. The data slot is only * used for one instruction (RX_NEXT_CHAR). For all other * instructions, data should be set to 0. * * RX_NEXT_CHAR is the most important instruction by far. * By reserving the data field for its exclusive use, * instruction dispatch is sped up in that case. There is * no need to fetch both the instruction and the data, * only the data is needed. In other words, a `cycle' begins * by fetching the field data. If that is non-0, then it must * be the destination state of a next_char transition, so * make that value the current state, advance the match position * by one character, and start a new cycle. On the other hand, * if data is 0, fetch the instruction and do a more complicated * dispatch on that. */ struct rx_inx { void * data; void * data_2; void * inx; void * fnord; }; #ifndef RX_TAIL_ARRAY #define RX_TAIL_ARRAY 1 #endif /* A superstate corresponds to a set of nfa states. Those sets are * represented by STRUCT RX_SUPERSET. The constructors * guarantee that only one (shared) structure is created for a given set. */ struct rx_superset { int refs; /* This is a reference counted structure. */ /* We keep these sets in a cache because (in an unpredictable way), * the same set is often created again and again. But that is also * problematic -- compatibility with POSIX and GNU regex requires * that we not be able to tell when a program discards a particular * NFA (thus invalidating the supersets created from it). * * But when a cache hit appears to occur, we will have in hand the * nfa for which it may have happened. That is why every nfa is given * its own sequence number. On a cache hit, the cache is validated * by comparing the nfa sequence number to this field: */ int id; struct rx_nfa_state * car; /* May or may not be a valid addr. */ struct rx_superset * cdr; /* If the corresponding superstate exists: */ struct rx_superstate * superstate; /* There is another bookkeeping problem. It is expensive to * compute the starting nfa state set for an nfa. So, once computed, * it is cached in the `struct rx'. * * But, the state set can be flushed from the superstate cache. * When that happens, we can't know if the corresponding `struct rx' * is still alive or if it has been freed or re-used by the program. * So, the cached pointer to this set in a struct rx might be invalid * and we need a way to validate it. * * Fortunately, even if this set is flushed from the cache, it is * not freed. It just goes on the free-list of supersets. * So we can still examine it. * * So to validate a starting set memo, check to see if the * starts_for field still points back to the struct rx in question, * and if the ID matches the rx sequence number. */ struct rx * starts_for; /* This is used to link into a hash bucket so these objects can * be `hash-consed'. */ struct rx_hash_item hash_item; }; #define rx_protect_superset(RX,CON) (++(CON)->refs) /* The terminology may be confusing (rename this structure?). * Every character occurs in at most one rx_super_edge per super-state. * But, that structure might have more than one option, indicating a point * of non-determinism. * * In other words, this structure holds a list of superstate edges * sharing a common starting state and character label. The edges * are in the field OPTIONS. All superstate edges sharing the same * starting state and character are in this list. */ struct rx_super_edge { struct rx_super_edge *next; struct rx_inx rx_backtrack_frame; int cset_size; rx_Bitset cset; struct rx_distinct_future *options; }; /* A superstate is a set of nfa states (RX_SUPERSET) along * with a transition table. Superstates are built on demand and reclaimed * without warning. To protect a superstate from this ghastly fate, * use LOCK_SUPERSTATE. */ struct rx_superstate { int rx_id; /* c.f. the id field of rx_superset */ int locks; /* protection from reclamation */ /* Within a superstate cache, all the superstates are kept in a big * queue. The tail of the queue is the state most likely to be * reclaimed. The *recyclable fields hold the queue position of * this state. */ struct rx_superstate * next_recyclable; struct rx_superstate * prev_recyclable; /* The supernfa edges that exist in the cache and that have * this state as their destination are kept in this list: */ struct rx_distinct_future * transition_refs; /* The list of nfa states corresponding to this superstate: */ struct rx_superset * contents; /* The list of edges in the cache beginning from this state. */ struct rx_super_edge * edges; /* A tail of the recyclable queue is marked as semifree. A semifree * state has no incoming next_char transitions -- any transition * into a semifree state causes a complex dispatch with the side * effect of rescuing the state from its semifree state. * * An alternative to this might be to make next_char more expensive, * and to move a state to the head of the recyclable queue whenever * it is entered. That way, popular states would never be recycled. * * But unilaterally making next_char more expensive actually loses. * So, incoming transitions are only made expensive for states near * the tail of the recyclable queue. The more cache contention * there is, the more frequently a state will have to prove itself * and be moved back to the front of the queue. If there is less * contention, then popular states just aggregate in the front of * the queue and stay there. */ int is_semifree; /* This keeps track of the size of the transition table for this * state. There is a half-hearted attempt to support variable sized * superstates. */ int trans_size; /* Indexed by characters... */ struct rx_inx transitions[RX_TAIL_ARRAY]; }; /* A list of distinct futures define the edges that leave from a * given superstate on a given character. c.f. rx_super_edge. */ struct rx_distinct_future { struct rx_distinct_future * next_same_super_edge[2]; struct rx_distinct_future * next_same_dest; struct rx_distinct_future * prev_same_dest; struct rx_superstate * present; /* source state */ struct rx_superstate * future; /* destination state */ struct rx_super_edge * edge; /* The future_frame holds the instruction that should be executed * after all the side effects are done, when it is time to complete * the transition to the next state. * * Normally this is a next_char instruction, but it may be a * cache_miss instruction as well, depending on whether or not * the superstate is in the cache and semifree. * * If this is the only future for a given superstate/char, and * if there are no side effects to be performed, this frame is * not used (directly) at all. Instead, its contents are copied * into the transition table of the starting state of this dist. future. */ struct rx_inx future_frame; struct rx_inx side_effects_frame; struct rx_se_list * effects; }; #define rx_lock_superstate(R,S) ((S)->locks++) #define rx_unlock_superstate(R,S) (--(S)->locks) /* This page destined for rx.h */ struct rx_blocklist { struct rx_blocklist * next; int bytes; }; struct rx_freelist { struct rx_freelist * next; }; struct rx_cache; #ifdef __STDC__ typedef void (*rx_morecore_fn)(struct rx_cache *); #else typedef void (*rx_morecore_fn)(); #endif /* You use this to control the allocation of superstate data * during matching. Most of it should be initialized to 0. * * A MORECORE function is necessary. It should allocate * a new block of memory or return 0. * A default that uses malloc is called `rx_morecore'. * * The number of SUPERSTATES_ALLOWED indirectly limits how much memory * the system will try to allocate. The default is 128. Batch style * applications that are very regexp intensive should use as high a number * as possible without thrashing. * * The LOCAL_CSET_SIZE is the number of characters in a character set. * It is therefore the number of entries in a superstate transition table. * Generally, it should be 256. If your character set has 16 bits, * it is better to translate your regexps into equivalent 8 bit patterns. */ struct rx_cache { struct rx_hash_rules superset_hash_rules; /* Objects are allocated by incrementing a pointer that * scans across rx_blocklists. */ struct rx_blocklist * memory; struct rx_blocklist * memory_pos; int bytes_left; char * memory_addr; rx_morecore_fn morecore; /* Freelists. */ struct rx_freelist * free_superstates; struct rx_freelist * free_transition_classes; struct rx_freelist * free_discernable_futures; struct rx_freelist * free_supersets; struct rx_freelist * free_hash; /* Two sets of superstates -- those that are semifreed, and those * that are being used. */ struct rx_superstate * lru_superstate; struct rx_superstate * semifree_superstate; struct rx_superset * empty_superset; int superstates; int semifree_superstates; int hits; int misses; int superstates_allowed; int local_cset_size; void ** instruction_table; struct rx_hash superset_table; }; /* The lowest-level search function supports arbitrarily fragmented * strings and (optionally) suspendable/resumable searches. * * Callers have to provide a few hooks. */ #ifndef __GNUC__ #ifdef __STDC__ #define __const__ const #else #define __const__ #endif #endif /* This holds a matcher position */ struct rx_string_position { __const__ unsigned char * pos; /* The current pos. */ __const__ unsigned char * string; /* The current string burst. */ __const__ unsigned char * end; /* First invalid position >= POS. */ int offset; /* Integer address of the current burst. */ int size; /* Current string's size. */ int search_direction; /* 1 or -1 */ int search_end; /* First position to not try. */ }; enum rx_get_burst_return { rx_get_burst_continuation, rx_get_burst_error, rx_get_burst_ok, rx_get_burst_no_more }; /* A call to get burst should make POS valid. It might be invalid * if the STRING field doesn't point to a burst that actually * contains POS. * * GET_BURST should take a clue from SEARCH_DIRECTION (1 or -1) as to * whether or not to pad to the left. Padding to the right is always * appropriate, but need not go past the point indicated by STOP. * * If a continuation is returned, then the reentering call to * a search function will retry the get_burst. */ #ifdef __STDC__ typedef enum rx_get_burst_return (*rx_get_burst_fn) (struct rx_string_position * pos, void * app_closure, int stop); #else typedef enum rx_get_burst_return (*rx_get_burst_fn) (); #endif enum rx_back_check_return { rx_back_check_continuation, rx_back_check_error, rx_back_check_pass, rx_back_check_fail }; /* Back_check should advance the position it is passed * over rparen - lparen characters and return pass iff * the characters starting at POS match those indexed * by [LPAREN..RPAREN]. * * If a continuation is returned, then the reentering call to * a search function will retry the back_check. */ #ifdef __STDC__ typedef enum rx_back_check_return (*rx_back_check_fn) (struct rx_string_position * pos, int lparen, int rparen, unsigned char * translate, void * app_closure, int stop); #else typedef enum rx_back_check_return (*rx_back_check_fn) (); #endif /* A call to fetch_char should return the character at POS or POS + 1. * Returning continuations here isn't supported. OFFSET is either 0 or 1 * and indicates which characters is desired. */ #ifdef __STDC__ typedef int (*rx_fetch_char_fn) (struct rx_string_position * pos, int offset, void * app_closure, int stop); #else typedef int (*rx_fetch_char_fn) (); #endif enum rx_search_return { rx_search_continuation = -4, rx_search_error = -3, rx_search_soft_fail = -2, /* failed by running out of string */ rx_search_fail = -1 /* failed only by reaching failure states */ /* return values >= 0 indicate the position of a successful match */ }; /* regex.h * * The remaining declarations replace regex.h. */ /* This is an array of error messages corresponding to the error codes. */ extern __const__ char *re_error_msg[]; /* If any error codes are removed, changed, or added, update the `re_error_msg' table in regex.c. */ typedef enum { REG_NOERROR = 0, /* Success. */ REG_NOMATCH, /* Didn't find a match (for regexec). */ /* POSIX regcomp return error codes. (In the order listed in the standard.) */ REG_BADPAT, /* Invalid pattern. */ REG_ECOLLATE, /* Not implemented. */ REG_ECTYPE, /* Invalid character class name. */ REG_EESCAPE, /* Trailing backslash. */ REG_ESUBREG, /* Invalid back reference. */ REG_EBRACK, /* Unmatched left bracket. */ REG_EPAREN, /* Parenthesis imbalance. */ REG_EBRACE, /* Unmatched \{. */ REG_BADBR, /* Invalid contents of \{\}. */ REG_ERANGE, /* Invalid range end. */ REG_ESPACE, /* Ran out of memory. */ REG_BADRPT, /* No preceding re for repetition op. */ /* Error codes we've added. */ REG_EEND, /* Premature end. */ REG_ESIZE, /* Compiled pattern bigger than 2^16 bytes. */ REG_ERPAREN /* Unmatched ) or \); not returned from regcomp. */ } reg_errcode_t; /* The regex.c support, as a client of rx, defines a set of possible * side effects that can be added to the edge lables of nfa edges. * Here is the list of sidef effects in use. */ enum re_side_effects { #define RX_WANT_SE_DEFS 1 #undef RX_DEF_SE #undef RX_DEF_CPLX_SE #define RX_DEF_SE(IDEM, NAME, VALUE) NAME VALUE, #define RX_DEF_CPLX_SE(IDEM, NAME, VALUE) NAME VALUE, #include "rx.h" #undef RX_DEF_SE #undef RX_DEF_CPLX_SE #undef RX_WANT_SE_DEFS re_floogle_flap = 65533 }; /* These hold paramaters for the kinds of side effects that are possible * in the supported pattern languages. These include things like the * numeric bounds of {} operators and the index of paren registers for * subexpression measurement or backreferencing. */ struct re_se_params { enum re_side_effects se; int op1; int op2; }; typedef unsigned reg_syntax_t; struct re_pattern_buffer { struct rx rx; reg_syntax_t syntax; /* See below for syntax bit definitions. */ unsigned int no_sub:1; /* If set, don't return register offsets. */ unsigned int not_bol:1; /* If set, the anchors ('^' and '$') don't */ unsigned int not_eol:1; /* match at the ends of the string. */ unsigned int newline_anchor:1;/* If true, an anchor at a newline matches.*/ unsigned int least_subs:1; /* If set, and returning registers, return * as few values as possible. Only * backreferenced groups and group 0 (the whole * match) will be returned. */ /* If true, this says that the matcher should keep registers on its * backtracking stack. For many patterns, we can easily determine that * this isn't necessary. */ unsigned int match_regs_on_stack:1; unsigned int search_regs_on_stack:1; /* is_anchored and begbuf_only are filled in by rx_compile. */ unsigned int is_anchored:1; /* Anchorded by ^? */ unsigned int begbuf_only:1; /* Anchored to char position 0? */ /* If REGS_UNALLOCATED, allocate space in the `regs' structure * for `max (RE_NREGS, re_nsub + 1)' groups. * If REGS_REALLOCATE, reallocate space if necessary. * If REGS_FIXED, use what's there. */ #define REGS_UNALLOCATED 0 #define REGS_REALLOCATE 1 #define REGS_FIXED 2 unsigned int regs_allocated:2; /* Either a translate table to apply to all characters before * comparing them, or zero for no translation. The translation * is applied to a pattern when it is compiled and to a string * when it is matched. */ unsigned char * translate; /* If this is a valid pointer, it tells rx not to store the extents of * certain subexpressions (those corresponding to non-zero entries). * Passing 0x1 is the same as passing an array of all ones. Passing 0x0 * is the same as passing an array of all zeros. * The array should contain as many entries as their are subexps in the * regexp. * * For POSIX compatability, when using regcomp and regexec this field * is zeroed and ignored. */ char * syntax_parens; /* Number of subexpressions found by the compiler. */ size_t re_nsub; void * buffer; /* Malloced memory for the nfa. */ unsigned long allocated; /* Size of that memory. */ /* Pointer to a fastmap, if any, otherwise zero. re_search uses * the fastmap, if there is one, to skip over impossible * starting points for matches. */ char *fastmap; unsigned int fastmap_accurate:1; /* These three are internal. */ unsigned int can_match_empty:1; struct rx_nfa_state * start; /* The nfa starting state. */ /* This is the list of iterator bounds for {lo,hi} constructs. * The memory pointed to is part of the rx->buffer. */ struct re_se_params *se_params; /* This is a bitset representation of the fastmap. * This is a true fastmap that already takes the translate * table into account. */ rx_Bitset fastset; }; /* Type for byte offsets within the string. POSIX mandates this. */ typedef int regoff_t; /* This is the structure we store register match data in. See regex.texinfo for a full description of what registers match. */ struct re_registers { unsigned num_regs; regoff_t *start; regoff_t *end; }; typedef struct re_pattern_buffer regex_t; /* POSIX specification for registers. Aside from the different names than `re_registers', POSIX uses an array of structures, instead of a structure of arrays. */ typedef struct { regoff_t rm_so; /* Byte offset from string's start to substring's start. */ regoff_t rm_eo; /* Byte offset from string's start to substring's end. */ } regmatch_t; /* The following bits are used to determine the regexp syntax we recognize. The set/not-set meanings are chosen so that Emacs syntax remains the value 0. The bits are given in alphabetical order, and the definitions shifted by one from the previous bit; thus, when we add or remove a bit, only one other definition need change. */ /* If this bit is not set, then \ inside a bracket expression is literal. If set, then such a \ quotes the following character. */ #define RE_BACKSLASH_ESCAPE_IN_LISTS (1) /* If this bit is not set, then + and ? are operators, and \+ and \? are literals. If set, then \+ and \? are operators and + and ? are literals. */ #define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1) /* If this bit is set, then character classes are supported. They are: [:alpha:], [:upper:], [:lower:], [:digit:], [:alnum:], [:xdigit:], [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:]. If not set, then character classes are not supported. */ #define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1) /* If this bit is set, then ^ and $ are always anchors (outside bracket expressions, of course). If this bit is not set, then it depends: ^ is an anchor if it is at the beginning of a regular expression or after an open-group or an alternation operator; $ is an anchor if it is at the end of a regular expression, or before a close-group or an alternation operator. This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because POSIX draft 11.2 says that * etc. in leading positions is undefined. We already implemented a previous draft which made those constructs invalid, though, so we haven't changed the code back. */ #define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1) /* If this bit is set, then special characters are always special regardless of where they are in the pattern. If this bit is not set, then special characters are special only in some contexts; otherwise they are ordinary. Specifically, * + ? and intervals are only special when not after the beginning, open-group, or alternation operator. */ #define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1) /* If this bit is set, then *, +, ?, and { cannot be first in an re or immediately after an alternation or begin-group operator. */ #define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1) /* If this bit is set, then . matches newline. If not set, then it doesn't. */ #define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1) /* If this bit is set, then . doesn't match NUL. If not set, then it does. */ #define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1) /* If this bit is set, nonmatching lists [^...] do not match newline. If not set, they do. */ #define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1) /* If this bit is set, either \{...\} or {...} defines an interval, depending on RE_NO_BK_BRACES. If not set, \{, \}, {, and } are literals. */ #define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1) /* If this bit is set, +, ? and | aren't recognized as operators. If not set, they are. */ #define RE_LIMITED_OPS (RE_INTERVALS << 1) /* If this bit is set, newline is an alternation operator. If not set, newline is literal. */ #define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1) /* If this bit is set, then `{...}' defines an interval, and \{ and \} are literals. If not set, then `\{...\}' defines an interval. */ #define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1) /* If this bit is set, (...) defines a group, and \( and \) are literals. If not set, \(...\) defines a group, and ( and ) are literals. */ #define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1) /* If this bit is set, then \ matches . If not set, then \ is a back-reference. */ #define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1) /* If this bit is set, then | is an alternation operator, and \| is literal. If not set, then \| is an alternation operator, and | is literal. */ #define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1) /* If this bit is set, then an ending range point collating higher than the starting range point, as in [z-a], is invalid. If not set, then when ending range point collates higher than the starting range point, the range is ignored. */ #define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1) /* If this bit is set, then an unmatched ) is ordinary. If not set, then an unmatched ) is invalid. */ #define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1) /* This global variable defines the particular regexp syntax to use (for some interfaces). When a regexp is compiled, the syntax used is stored in the pattern buffer, so changing this does not affect already-compiled regexps. */ extern reg_syntax_t re_syntax_options; /* Define combinations of the above bits for the standard possibilities. (The [[[ comments delimit what gets put into the Texinfo file, so don't delete them!) */ /* [[[begin syntaxes]]] */ #define RE_SYNTAX_EMACS 0 #define RE_SYNTAX_AWK \ (RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL \ | RE_NO_BK_PARENS | RE_NO_BK_REFS \ | RE_NO_BK_VAR | RE_NO_EMPTY_RANGES \ | RE_UNMATCHED_RIGHT_PAREN_ORD) #define RE_SYNTAX_POSIX_AWK \ (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS) #define RE_SYNTAX_GREP \ (RE_BK_PLUS_QM | RE_CHAR_CLASSES \ | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS \ | RE_NEWLINE_ALT) #define RE_SYNTAX_EGREP \ (RE_CHAR_CLASSES | RE_CONTEXT_INDEP_ANCHORS \ | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE \ | RE_NEWLINE_ALT | RE_NO_BK_PARENS \ | RE_NO_BK_VBAR) #define RE_SYNTAX_POSIX_EGREP \ (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES) #define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC /* Syntax bits common to both basic and extended POSIX regex syntax. */ #define _RE_SYNTAX_POSIX_COMMON \ (RE_CHAR_CLASSES | RE_DOT_NEWLINE | RE_DOT_NOT_NULL \ | RE_INTERVALS | RE_NO_EMPTY_RANGES) #define RE_SYNTAX_POSIX_BASIC \ (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM) /* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes RE_LIMITED_OPS, i.e., \? \+ \| are not recognized. Actually, this isn't minimal, since other operators, such as \`, aren't disabled. */ #define RE_SYNTAX_POSIX_MINIMAL_BASIC \ (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS) #define RE_SYNTAX_POSIX_EXTENDED \ (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ | RE_CONTEXT_INDEP_OPS | RE_NO_BK_BRACES \ | RE_NO_BK_PARENS | RE_NO_BK_VBAR \ | RE_UNMATCHED_RIGHT_PAREN_ORD) /* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INVALID_OPS replaces RE_CONTEXT_INDEP_OPS and RE_NO_BK_REFS is added. */ #define RE_SYNTAX_POSIX_MINIMAL_EXTENDED \ (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES \ | RE_NO_BK_PARENS | RE_NO_BK_REFS \ | RE_NO_BK_VBAR | RE_UNMATCHED_RIGHT_PAREN_ORD) /* [[[end syntaxes]]] */ /* Maximum number of duplicates an interval can allow. Some systems (erroneously) define this in other header files, but we want our value, so remove any previous define. */ #ifdef RE_DUP_MAX #undef RE_DUP_MAX #endif #define RE_DUP_MAX ((1 << 15) - 1) /* POSIX `cflags' bits (i.e., information for `regcomp'). */ /* If this bit is set, then use extended regular expression syntax. If not set, then use basic regular expression syntax. */ #define REG_EXTENDED 1 /* If this bit is set, then ignore case when matching. If not set, then case is significant. */ #define REG_ICASE (REG_EXTENDED << 1) /* If this bit is set, then anchors do not match at newline characters in the string. If not set, then anchors do match at newlines. */ #define REG_NEWLINE (REG_ICASE << 1) /* If this bit is set, then report only success or fail in regexec. If not set, then returns differ between not matching and errors. */ #define REG_NOSUB (REG_NEWLINE << 1) /* POSIX `eflags' bits (i.e., information for regexec). */ /* If this bit is set, then the beginning-of-line operator doesn't match the beginning of the string (presumably because it's not the beginning of a line). If not set, then the beginning-of-line operator does match the beginning of the string. */ #define REG_NOTBOL 1 /* Like REG_NOTBOL, except for the end-of-line. */ #define REG_NOTEOL (1 << 1) /* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer, * `re_match_2' returns information about at least this many registers * the first time a `regs' structure is passed. * * Also, this is the greatest number of backreferenced subexpressions * allowed in a pattern being matched without caller-supplied registers. */ #ifndef RE_NREGS #define RE_NREGS 30 #endif extern int rx_cache_bound; extern char rx_version_string[]; #ifdef RX_WANT_RX_DEFS /* This is decls to the interesting subsystems and lower layers * of rx. Everything which doesn't have a public counterpart in * regex.c is declared here. */ #ifdef __STDC__ typedef void (*rx_hash_freefn) (struct rx_hash_item * it); #else /* ndef __STDC__ */ typedef void (*rx_hash_freefn) (); #endif /* ndef __STDC__ */ #ifdef __STDC__ RX_DECL int rx_bitset_is_equal (int size, rx_Bitset a, rx_Bitset b); RX_DECL int rx_bitset_is_subset (int size, rx_Bitset a, rx_Bitset b); RX_DECL int rx_bitset_empty (int size, rx_Bitset set); RX_DECL void rx_bitset_null (int size, rx_Bitset b); RX_DECL void rx_bitset_universe (int size, rx_Bitset b); RX_DECL void rx_bitset_complement (int size, rx_Bitset b); RX_DECL void rx_bitset_assign (int size, rx_Bitset a, rx_Bitset b); RX_DECL void rx_bitset_union (int size, rx_Bitset a, rx_Bitset b); RX_DECL void rx_bitset_intersection (int size, rx_Bitset a, rx_Bitset b); RX_DECL void rx_bitset_difference (int size, rx_Bitset a, rx_Bitset b); RX_DECL void rx_bitset_revdifference (int size, rx_Bitset a, rx_Bitset b); RX_DECL void rx_bitset_xor (int size, rx_Bitset a, rx_Bitset b); RX_DECL unsigned long rx_bitset_hash (int size, rx_Bitset b); RX_DECL struct rx_hash_item * rx_hash_find (struct rx_hash * table, unsigned long hash, void * value, struct rx_hash_rules * rules); RX_DECL struct rx_hash_item * rx_hash_store (struct rx_hash * table, unsigned long hash, void * value, struct rx_hash_rules * rules); RX_DECL void rx_hash_free (struct rx_hash_item * it, struct rx_hash_rules * rules); RX_DECL void rx_free_hash_table (struct rx_hash * tab, rx_hash_freefn freefn, struct rx_hash_rules * rules); RX_DECL rx_Bitset rx_cset (struct rx *rx); RX_DECL rx_Bitset rx_copy_cset (struct rx *rx, rx_Bitset a); RX_DECL void rx_free_cset (struct rx * rx, rx_Bitset c); RX_DECL struct rexp_node * rexp_node (struct rx *rx, enum rexp_node_type type); RX_DECL struct rexp_node * rx_mk_r_cset (struct rx * rx, rx_Bitset b); RX_DECL struct rexp_node * rx_mk_r_concat (struct rx * rx, struct rexp_node * a, struct rexp_node * b); RX_DECL struct rexp_node * rx_mk_r_alternate (struct rx * rx, struct rexp_node * a, struct rexp_node * b); RX_DECL struct rexp_node * rx_mk_r_opt (struct rx * rx, struct rexp_node * a); RX_DECL struct rexp_node * rx_mk_r_star (struct rx * rx, struct rexp_node * a); RX_DECL struct rexp_node * rx_mk_r_2phase_star (struct rx * rx, struct rexp_node * a, struct rexp_node * b); RX_DECL struct rexp_node * rx_mk_r_side_effect (struct rx * rx, rx_side_effect a); RX_DECL struct rexp_node * rx_mk_r_data (struct rx * rx, void * a); RX_DECL void rx_free_rexp (struct rx * rx, struct rexp_node * node); RX_DECL struct rexp_node * rx_copy_rexp (struct rx *rx, struct rexp_node *node); RX_DECL struct rx_nfa_state * rx_nfa_state (struct rx *rx); RX_DECL void rx_free_nfa_state (struct rx_nfa_state * n); RX_DECL struct rx_nfa_state * rx_id_to_nfa_state (struct rx * rx, int id); RX_DECL struct rx_nfa_edge * rx_nfa_edge (struct rx *rx, enum rx_nfa_etype type, struct rx_nfa_state *start, struct rx_nfa_state *dest); RX_DECL void rx_free_nfa_edge (struct rx_nfa_edge * e); RX_DECL void rx_free_nfa (struct rx *rx); RX_DECL int rx_build_nfa (struct rx *rx, struct rexp_node *rexp, struct rx_nfa_state **start, struct rx_nfa_state **end); RX_DECL void rx_name_nfa_states (struct rx *rx); RX_DECL int rx_eclose_nfa (struct rx *rx); RX_DECL void rx_delete_epsilon_transitions (struct rx *rx); RX_DECL int rx_compactify_nfa (struct rx *rx, void **mem, unsigned long *size); RX_DECL void rx_release_superset (struct rx *rx, struct rx_superset *set); RX_DECL struct rx_superset * rx_superset_cons (struct rx * rx, struct rx_nfa_state *car, struct rx_superset *cdr); RX_DECL struct rx_superset * rx_superstate_eclosure_union (struct rx * rx, struct rx_superset *set, struct rx_nfa_state_set *ecl); RX_DECL struct rx_superstate * rx_superstate (struct rx *rx, struct rx_superset *set); RX_DECL struct rx_inx * rx_handle_cache_miss (struct rx *rx, struct rx_superstate *super, unsigned char chr, void *data); RX_DECL reg_errcode_t rx_compile (__const__ char *pattern, int size, reg_syntax_t syntax, struct re_pattern_buffer * rxb); RX_DECL void rx_blow_up_fastmap (struct re_pattern_buffer * rxb); #else /* STDC */ RX_DECL int rx_bitset_is_equal (); RX_DECL int rx_bitset_is_subset (); RX_DECL int rx_bitset_empty (); RX_DECL void rx_bitset_null (); RX_DECL void rx_bitset_universe (); RX_DECL void rx_bitset_complement (); RX_DECL void rx_bitset_assign (); RX_DECL void rx_bitset_union (); RX_DECL void rx_bitset_intersection (); RX_DECL void rx_bitset_difference (); RX_DECL void rx_bitset_revdifference (); RX_DECL void rx_bitset_xor (); RX_DECL unsigned long rx_bitset_hash (); RX_DECL struct rx_hash_item * rx_hash_find (); RX_DECL struct rx_hash_item * rx_hash_store (); RX_DECL void rx_hash_free (); RX_DECL void rx_free_hash_table (); RX_DECL rx_Bitset rx_cset (); RX_DECL rx_Bitset rx_copy_cset (); RX_DECL void rx_free_cset (); RX_DECL struct rexp_node * rexp_node (); RX_DECL struct rexp_node * rx_mk_r_cset (); RX_DECL struct rexp_node * rx_mk_r_concat (); RX_DECL struct rexp_node * rx_mk_r_alternate (); RX_DECL struct rexp_node * rx_mk_r_opt (); RX_DECL struct rexp_node * rx_mk_r_star (); RX_DECL struct rexp_node * rx_mk_r_2phase_star (); RX_DECL struct rexp_node * rx_mk_r_side_effect (); RX_DECL struct rexp_node * rx_mk_r_data (); RX_DECL void rx_free_rexp (); RX_DECL struct rexp_node * rx_copy_rexp (); RX_DECL struct rx_nfa_state * rx_nfa_state (); RX_DECL void rx_free_nfa_state (); RX_DECL struct rx_nfa_state * rx_id_to_nfa_state (); RX_DECL struct rx_nfa_edge * rx_nfa_edge (); RX_DECL void rx_free_nfa_edge (); RX_DECL void rx_free_nfa (); RX_DECL int rx_build_nfa (); RX_DECL void rx_name_nfa_states (); RX_DECL int rx_eclose_nfa (); RX_DECL void rx_delete_epsilon_transitions (); RX_DECL int rx_compactify_nfa (); RX_DECL void rx_release_superset (); RX_DECL struct rx_superset * rx_superset_cons (); RX_DECL struct rx_superset * rx_superstate_eclosure_union (); RX_DECL struct rx_superstate * rx_superstate (); RX_DECL struct rx_inx * rx_handle_cache_miss (); RX_DECL reg_errcode_t rx_compile (); RX_DECL void rx_blow_up_fastmap (); #endif /* STDC */ #endif /* RX_WANT_RX_DEFS */ #ifdef __STDC__ extern int re_search_2 (struct re_pattern_buffer *rxb, __const__ char * string1, int size1, __const__ char * string2, int size2, int startpos, int range, struct re_registers *regs, int stop); extern int re_search (struct re_pattern_buffer * rxb, __const__ char *string, int size, int startpos, int range, struct re_registers *regs); extern int re_match_2 (struct re_pattern_buffer * rxb, __const__ char * string1, int size1, __const__ char * string2, int size2, int pos, struct re_registers *regs, int stop); extern int re_match (struct re_pattern_buffer * rxb, __const__ char * string, int size, int pos, struct re_registers *regs); extern reg_syntax_t re_set_syntax (reg_syntax_t syntax); extern void re_set_registers (struct re_pattern_buffer *bufp, struct re_registers *regs, unsigned num_regs, regoff_t * starts, regoff_t * ends); extern __const__ char * re_compile_pattern (__const__ char *pattern, int length, struct re_pattern_buffer * rxb); extern int re_compile_fastmap (struct re_pattern_buffer * rxb); extern char * re_comp (__const__ char *s); extern int re_exec (__const__ char *s); extern int regcomp (regex_t * preg, __const__ char * pattern, int cflags); extern int regexec (__const__ regex_t *preg, __const__ char *string, size_t nmatch, regmatch_t pmatch[], int eflags); extern size_t regerror (int errcode, __const__ regex_t *preg, char *errbuf, size_t errbuf_size); extern void regfree (regex_t *preg); #else /* STDC */ extern int re_search_2 (); extern int re_search (); extern int re_match_2 (); extern int re_match (); extern reg_syntax_t re_set_syntax (); extern void re_set_registers (); extern __const__ char * re_compile_pattern (); extern int re_compile_fastmap (); extern char * re_comp (); extern int re_exec (); extern int regcomp (); extern int regexec (); extern size_t regerror (); extern void regfree (); #endif /* STDC */ #ifdef RX_WANT_RX_DEFS struct rx_counter_frame { int tag; int val; struct rx_counter_frame * inherited_from; /* If this is a copy. */ struct rx_counter_frame * cdr; }; struct rx_backtrack_frame { char * counter_stack_sp; /* A frame is used to save the matchers state when it crosses a * backtracking point. The `stk_' fields correspond to variables * in re_search_2 (just strip off thes `stk_'). They are documented * tere. */ struct rx_superstate * stk_super; unsigned int stk_c; struct rx_string_position stk_test_pos; int stk_last_l; int stk_last_r; int stk_test_ret; /* This is the list of options left to explore at the backtrack * point for which this frame was created. */ struct rx_distinct_future * df; struct rx_distinct_future * first_df; #ifdef RX_DEBUG int stk_line_no; #endif }; struct rx_stack_chunk { struct rx_stack_chunk * next_chunk; int bytes_left; char * sp; }; enum rx_outer_entry { rx_outer_start, rx_outer_fastmap, rx_outer_test, rx_outer_restore_pos }; enum rx_fastmap_return { rx_fastmap_continuation, rx_fastmap_error, rx_fastmap_ok, rx_fastmap_fail }; enum rx_fastmap_entry { rx_fastmap_start, rx_fastmap_string_break }; enum rx_test_return { rx_test_continuation, rx_test_error, rx_test_fail, rx_test_ok }; enum rx_test_internal_return { rx_test_internal_error, rx_test_found_first, rx_test_line_finished }; enum rx_test_match_entry { rx_test_start, rx_test_cache_hit_loop, rx_test_backreference_check, rx_test_backtrack_return }; struct rx_search_state { /* Two groups of registers are kept. The group with the register state * of the current test match, and the group that holds the state at the end * of the best known match, if any. * * For some patterns, there may also be registers saved on the stack. */ unsigned num_regs; /* Includes an element for register zero. */ regoff_t * lparen; /* scratch space for register returns */ regoff_t * rparen; regoff_t * best_lpspace; /* in case the user doesn't want these */ regoff_t * best_rpspace; /* values, we still need space to store * them. Normally, this memoryis unused * and the space pointed to by REGS is * used instead. */ int last_l; /* Highest index of a valid lparen. */ int last_r; /* It's dual. */ int * best_lparen; /* This contains the best known register */ int * best_rparen; /* assignments. * This may point to the same mem as * best_lpspace, or it might point to memory * passed by the caller. */ int best_last_l; /* best_last_l:best_lparen::last_l:lparen */ int best_last_r; unsigned char * translate; struct rx_string_position outer_pos; struct rx_superstate * start_super; int nfa_choice; int first_found; /* If true, return after finding any match. */ int ret_val; /* For continuations... */ enum rx_outer_entry outer_search_resume_pt; struct re_pattern_buffer * saved_rxb; int saved_startpos; int saved_range; int saved_stop; int saved_total_size; rx_get_burst_fn saved_get_burst; rx_back_check_fn saved_back_check; struct re_registers * saved_regs; /** ** state for fastmap **/ char * fastmap; int fastmap_chr; int fastmap_val; /* for continuations in the fastmap procedure: */ enum rx_fastmap_entry fastmap_resume_pt; /** ** state for test_match **/ /* The current superNFA position of the matcher. */ struct rx_superstate * super; /* The matcher interprets a series of instruction frames. * This is the `instruction counter' for the interpretation. */ struct rx_inx * ifr; /* We insert a ghost character in the string to prime * the nfa. test_pos.pos, test_pos.str_half, and test_pos.end_half * keep track of the test-match position and string-half. */ unsigned char c; /* Position within the string. */ struct rx_string_position test_pos; struct rx_stack_chunk * counter_stack; struct rx_stack_chunk * backtrack_stack; int backtrack_frame_bytes; int chunk_bytes; struct rx_stack_chunk * free_chunks; /* To return from this function, set test_ret and * `goto test_do_return'. * * Possible return values are: * 1 --- end of string while the superNFA is still going * 0 --- internal error (out of memory) * -1 --- search completed by reaching the superNFA fail state * -2 --- a match was found, maybe not the longest. * * When the search is complete (-1), best_last_r indicates whether * a match was found. * * -2 is return only if search_state.first_found is non-zero. * * if search_state.first_found is non-zero, a return of -1 indicates no match, * otherwise, best_last_r has to be checked. */ int test_ret; int could_have_continued; #ifdef RX_DEBUG int backtrack_depth; /* There is a search tree with every node as set of deterministic * transitions in the super nfa. For every branch of a * backtrack point is an edge in the tree. * This counts up a pre-order of nodes in that tree. * It's saved on the search stack and printed when debugging. */ int line_no; int lines_found; #endif /* For continuations within the match tester */ enum rx_test_match_entry test_match_resume_pt; struct rx_inx * saved_next_tr_table; struct rx_inx * saved_this_tr_table; int saved_reg; struct rx_backtrack_frame * saved_bf; }; extern char rx_slowmap[]; extern unsigned char rx_id_translation[]; static __inline__ void init_fastmap (rxb, search_state) struct re_pattern_buffer * rxb; struct rx_search_state * search_state; { search_state->fastmap = (rxb->fastmap ? (char *)rxb->fastmap : (char *)rx_slowmap); /* Update the fastmap now if not correct already. * When the regexp was compiled, the fastmap was computed * and stored in a bitset. This expands the bitset into a * character array containing 1s and 0s. */ if ((search_state->fastmap == rxb->fastmap) && !rxb->fastmap_accurate) rx_blow_up_fastmap (rxb); search_state->fastmap_chr = -1; search_state->fastmap_val = 0; search_state->fastmap_resume_pt = rx_fastmap_start; } static __inline__ void uninit_fastmap (rxb, search_state) struct re_pattern_buffer * rxb; struct rx_search_state * search_state; { /* Unset the fastmap sentinel */ if (search_state->fastmap_chr >= 0) search_state->fastmap[search_state->fastmap_chr] = search_state->fastmap_val; } static __inline__ int fastmap_search (rxb, stop, get_burst, app_closure, search_state) struct re_pattern_buffer * rxb; int stop; rx_get_burst_fn get_burst; void * app_closure; struct rx_search_state * search_state; { enum rx_fastmap_entry pc; if (0) { return_continuation: search_state->fastmap_resume_pt = pc; return rx_fastmap_continuation; } pc = search_state->fastmap_resume_pt; switch (pc) { default: return rx_fastmap_error; case rx_fastmap_start: init_fastmap_sentinal: /* For the sake of fast fastmapping, set a sentinal in the fastmap. * This sentinal will trap the fastmap loop when it reaches the last * valid character in a string half. * * This must be reset when the fastmap/search loop crosses a string * boundry, and before returning to the caller. So sometimes, * the fastmap loop is restarted with `continue', othertimes by * `goto init_fastmap_sentinal'. */ if (search_state->outer_pos.size) { search_state->fastmap_chr = ((search_state->outer_pos.search_direction == 1) ? *(search_state->outer_pos.end - 1) : *search_state->outer_pos.string); search_state->fastmap_val = search_state->fastmap[search_state->fastmap_chr]; search_state->fastmap[search_state->fastmap_chr] = 1; } else { search_state->fastmap_chr = -1; search_state->fastmap_val = 0; } if (search_state->outer_pos.pos >= search_state->outer_pos.end) goto fastmap_hit_bound; else { if (search_state->outer_pos.search_direction == 1) { if (search_state->fastmap_val) { for (;;) { while (!search_state->fastmap[*search_state->outer_pos.pos]) ++search_state->outer_pos.pos; return rx_fastmap_ok; } } else { for (;;) { while (!search_state->fastmap[*search_state->outer_pos.pos]) ++search_state->outer_pos.pos; if (*search_state->outer_pos.pos != search_state->fastmap_chr) return rx_fastmap_ok; else { ++search_state->outer_pos.pos; if (search_state->outer_pos.pos == search_state->outer_pos.end) goto fastmap_hit_bound; } } } } else { __const__ unsigned char * bound; bound = search_state->outer_pos.string - 1; if (search_state->fastmap_val) { for (;;) { while (!search_state->fastmap[*search_state->outer_pos.pos]) --search_state->outer_pos.pos; return rx_fastmap_ok; } } else { for (;;) { while (!search_state->fastmap[*search_state->outer_pos.pos]) --search_state->outer_pos.pos; if ((*search_state->outer_pos.pos != search_state->fastmap_chr) || search_state->fastmap_val) return rx_fastmap_ok; else { --search_state->outer_pos.pos; if (search_state->outer_pos.pos == bound) goto fastmap_hit_bound; } } } } } case rx_fastmap_string_break: fastmap_hit_bound: { /* If we hit a bound, it may be time to fetch another burst * of string, or it may be time to return a continuation to * the caller, or it might be time to fail. */ int burst_state; burst_state = get_burst (&search_state->outer_pos, app_closure, stop); switch (burst_state) { default: case rx_get_burst_error: return rx_fastmap_error; case rx_get_burst_continuation: { pc = rx_fastmap_string_break; goto return_continuation; } case rx_get_burst_ok: goto init_fastmap_sentinal; case rx_get_burst_no_more: /* ...not a string split, simply no more string. * * When searching backward, running out of string * is reason to quit. * * When searching forward, we allow the possibility * of an (empty) match after the last character in the * virtual string. So, fall through to the matcher */ return ( (search_state->outer_pos.search_direction == 1) ? rx_fastmap_ok : rx_fastmap_fail); } } } } #ifdef emacs /* The `emacs' switch turns on certain matching commands * that make sense only in Emacs. */ #include "config.h" #include "lisp.h" #include "buffer.h" #include "syntax.h" #endif /* emacs */ /* Setting RX_MEMDBUG is useful if you have dbmalloc. Maybe with similar * packages too. */ #ifdef RX_MEMDBUG #include #endif /* RX_RX_MEMDBUG */ /* We used to test for `BSTRING' here, but only GCC and Emacs define * `BSTRING', as far as I know, and neither of them use this code. */ #if HAVE_STRING_H || STDC_HEADERS #include #ifndef bcmp #define bcmp(s1, s2, n) memcmp ((s1), (s2), (n)) #endif #ifndef bcopy #define bcopy(s, d, n) memcpy ((d), (s), (n)) #endif #ifndef bzero #define bzero(s, n) memset ((s), 0, (n)) #endif #else /* HAVE_STRING_H || STDC_HEADERS */ #include #endif /* not (HAVE_STRING_H || STDC_HEADERS) */ #ifdef STDC_HEADERS #include #else /* not STDC_HEADERS */ char *malloc (); char *realloc (); #endif /* not STDC_HEADERS */ /* How many characters in the character set. */ #define CHAR_SET_SIZE (1 << CHARBITS) #ifndef emacs /* Define the syntax basics for \<, \>, etc. * This must be nonzero for the wordchar and notwordchar pattern * commands in re_match_2. */ #ifndef Sword #define Sword 1 #endif #define SYNTAX(c) re_syntax_table[c] #ifdef SYNTAX_TABLE extern char *re_syntax_table; #else RX_DECL char re_syntax_table[CHAR_SET_SIZE]; #endif #endif /* not emacs */ /* Test if at very beginning or at very end of the virtual concatenation * of `string1' and `string2'. If only one string, it's `string2'. */ #define AT_STRINGS_BEG() \ ( -1 \ == ((search_state.test_pos.pos - search_state.test_pos.string) \ + search_state.test_pos.offset)) #define AT_STRINGS_END() \ ( (total_size - 1) \ == ((search_state.test_pos.pos - search_state.test_pos.string) \ + search_state.test_pos.offset)) /* Test if POS + 1 points to a character which is word-constituent. We have * two special cases to check for: if past the end of string1, look at * the first character in string2; and if before the beginning of * string2, look at the last character in string1. * * Assumes `string1' exists, so use in conjunction with AT_STRINGS_BEG (). */ #define LETTER_P(POS,OFF) \ ( SYNTAX (fetch_char(POS, OFF, app_closure, stop)) \ == Sword) /* Test if the character at D and the one after D differ with respect * to being word-constituent. */ #define AT_WORD_BOUNDARY(d) \ (AT_STRINGS_BEG () || AT_STRINGS_END () || LETTER_P (d,0) != LETTER_P (d, 1)) #ifdef RX_SUPPORT_CONTINUATIONS #define RX_STACK_ALLOC(BYTES) malloc(BYTES) #define RX_STACK_FREE(MEM) free(MEM) #else #define RX_STACK_ALLOC(BYTES) alloca(BYTES) #define RX_STACK_FREE(MEM) \ ((struct rx_stack_chunk *)MEM)->next_chunk = search_state.free_chunks; \ search_state.free_chunks = ((struct rx_stack_chunk *)MEM); #endif #define PUSH(CHUNK_VAR,BYTES) \ if (!CHUNK_VAR || (CHUNK_VAR->bytes_left < (BYTES))) \ { \ struct rx_stack_chunk * new_chunk; \ if (search_state.free_chunks) \ { \ new_chunk = search_state.free_chunks; \ search_state.free_chunks = search_state.free_chunks->next_chunk; \ } \ else \ { \ new_chunk = (struct rx_stack_chunk *)RX_STACK_ALLOC(search_state.chunk_bytes); \ if (!new_chunk) \ { \ search_state.ret_val = 0; \ goto test_do_return; \ } \ } \ new_chunk->sp = (char *)new_chunk + sizeof (struct rx_stack_chunk); \ new_chunk->bytes_left = (search_state.chunk_bytes \ - (BYTES) \ - sizeof (struct rx_stack_chunk)); \ new_chunk->next_chunk = CHUNK_VAR; \ CHUNK_VAR = new_chunk; \ } \ else \ (CHUNK_VAR->sp += (BYTES)), (CHUNK_VAR->bytes_left -= (BYTES)) #define POP(CHUNK_VAR,BYTES) \ if (CHUNK_VAR->sp == ((char *)CHUNK_VAR + sizeof(*CHUNK_VAR))) \ { \ struct rx_stack_chunk * new_chunk = CHUNK_VAR->next_chunk; \ RX_STACK_FREE(CHUNK_VAR); \ CHUNK_VAR = new_chunk; \ } \ else \ (CHUNK_VAR->sp -= BYTES), (CHUNK_VAR->bytes_left += BYTES) #define SRCH_TRANSLATE(C) search_state.translate[(unsigned char) (C)] #ifdef __STDC__ RX_DECL __inline__ int rx_search (struct re_pattern_buffer * rxb, int startpos, int range, int stop, int total_size, rx_get_burst_fn get_burst, rx_back_check_fn back_check, rx_fetch_char_fn fetch_char, void * app_closure, struct re_registers * regs, struct rx_search_state * resume_state, struct rx_search_state * save_state) #else RX_DECL __inline__ int rx_search (rxb, startpos, range, stop, total_size, get_burst, back_check, fetch_char, app_closure, regs, resume_state, save_state) struct re_pattern_buffer * rxb; int startpos; int range; int stop; int total_size; rx_get_burst_fn get_burst; rx_back_check_fn back_check; rx_fetch_char_fn fetch_char; void * app_closure; struct re_registers * regs; struct rx_search_state * resume_state; struct rx_search_state * save_state; #endif { int pc; int test_state; struct rx_search_state search_state; search_state.free_chunks = 0; if (!resume_state) pc = rx_outer_start; else { search_state = *resume_state; regs = search_state.saved_regs; rxb = search_state.saved_rxb; startpos = search_state.saved_startpos; range = search_state.saved_range; stop = search_state.saved_stop; total_size = search_state.saved_total_size; get_burst = search_state.saved_get_burst; back_check = search_state.saved_back_check; pc = search_state.outer_search_resume_pt; if (0) { return_continuation: if (save_state) { *save_state = search_state; save_state->saved_regs = regs; save_state->saved_rxb = rxb; save_state->saved_startpos = startpos; save_state->saved_range = range; save_state->saved_stop = stop; save_state->saved_total_size = total_size; save_state->saved_get_burst = get_burst; save_state->saved_back_check = back_check; save_state->outer_search_resume_pt = pc; } return rx_search_continuation; } } switch (pc) { case rx_outer_start: search_state.ret_val = rx_search_fail; ( search_state.lparen = search_state.rparen = search_state.best_lpspace = search_state.best_rpspace = 0); /* figure the number of registers we may need for use in backreferences. * the number here includes an element for register zero. */ search_state.num_regs = rxb->re_nsub + 1; /* check for out-of-range startpos. */ if ((startpos < 0) || (startpos > total_size)) return rx_search_fail; /* fix up range if it might eventually take us outside the string. */ { int endpos; endpos = startpos + range; if (endpos < -1) range = (-1 - startpos); else if (endpos > (total_size + 1)) range = total_size - startpos; } /* if the search isn't to be a backwards one, don't waste time in a * long search for a pattern that says it is anchored. */ if (rxb->begbuf_only && (range > 0)) { if (startpos > 0) return rx_search_fail; else range = 1; } /* decide whether to use internal or user-provided reg buffers. */ if (!regs || rxb->no_sub) { search_state.best_lpspace = (regoff_t *)REGEX_ALLOCATE (search_state.num_regs * sizeof(regoff_t)); search_state.best_rpspace = (regoff_t *)REGEX_ALLOCATE (search_state.num_regs * sizeof(regoff_t)); search_state.best_lparen = search_state.best_lpspace; search_state.best_rparen = search_state.best_rpspace; } else { /* have the register data arrays been allocated? */ if (rxb->regs_allocated == REGS_UNALLOCATED) { /* no. so allocate them with malloc. we need one extra element beyond `search_state.num_regs' for the `-1' marker gnu code uses. */ regs->num_regs = MAX (RE_NREGS, rxb->re_nsub + 1); regs->start = ((regoff_t *) malloc (regs->num_regs * sizeof ( regoff_t))); regs->end = ((regoff_t *) malloc (regs->num_regs * sizeof ( regoff_t))); if (regs->start == 0 || regs->end == 0) return rx_search_error; rxb->regs_allocated = REGS_REALLOCATE; } else if (rxb->regs_allocated == REGS_REALLOCATE) { /* yes. if we need more elements than were already allocated, reallocate them. if we need fewer, just leave it alone. */ if (regs->num_regs < search_state.num_regs + 1) { regs->num_regs = search_state.num_regs + 1; regs->start = ((regoff_t *) realloc (regs->start, regs->num_regs * sizeof (regoff_t))); regs->end = ((regoff_t *) realloc (regs->end, regs->num_regs * sizeof ( regoff_t))); if (regs->start == 0 || regs->end == 0) return rx_search_error; } } else if (rxb->regs_allocated != REGS_FIXED) return rx_search_error; if (regs->num_regs < search_state.num_regs + 1) { search_state.best_lpspace = ((regoff_t *) REGEX_ALLOCATE (search_state.num_regs * sizeof(regoff_t))); search_state.best_rpspace = ((regoff_t *) REGEX_ALLOCATE (search_state.num_regs * sizeof(regoff_t))); search_state.best_lparen = search_state.best_lpspace; search_state.best_rparen = search_state.best_rpspace; } else { search_state.best_lparen = regs->start; search_state.best_rparen = regs->end; } } search_state.lparen = (regoff_t *) REGEX_ALLOCATE (search_state.num_regs * sizeof(regoff_t)); search_state.rparen = (regoff_t *) REGEX_ALLOCATE (search_state.num_regs * sizeof(regoff_t)); if (! ( search_state.best_rparen && search_state.best_lparen && search_state.lparen && search_state.rparen)) return rx_search_error; search_state.best_last_l = search_state.best_last_r = -1; search_state.translate = (rxb->translate ? rxb->translate : rx_id_translation); /* * two nfa's were compiled. * `0' is complete. * `1' faster but gets registers wrong and ends too soon. */ search_state.nfa_choice = (regs && !rxb->least_subs) ? '\0' : '\1'; /* we have the option to look for the best match or the first * one we can find. if the user isn't asking for register information, * we don't need to find the best match. */ search_state.first_found = !regs; if (range >= 0) { search_state.outer_pos.search_end = startpos + range; search_state.outer_pos.search_direction = 1; } else { search_state.outer_pos.search_end = startpos + range; search_state.outer_pos.search_direction = -1; } /* the vacuous search always turns up nothing. */ if ((search_state.outer_pos.search_direction == 1) ? (startpos > search_state.outer_pos.search_end) : (startpos < search_state.outer_pos.search_end)) return rx_search_fail; /* now we build the starting state of the supernfa. */ { struct rx_superset * start_contents; struct rx_nfa_state_set * start_nfa_set; /* we presume here that the nfa start state has only one * possible future with no side effects. */ start_nfa_set = rxb->start->futures->destset; if ( rxb->rx.start_set && (rxb->rx.start_set->starts_for == &rxb->rx)) start_contents = rxb->rx.start_set; else { start_contents = rx_superstate_eclosure_union (&rxb->rx, rx_superset_cons (&rxb->rx, 0, 0), start_nfa_set); if (!start_contents) return rx_search_fail; start_contents->starts_for = &rxb->rx; rxb->rx.start_set = start_contents; } if ( start_contents->superstate && (start_contents->superstate->rx_id == rxb->rx.rx_id)) { search_state.start_super = start_contents->superstate; rx_lock_superstate (&rxb->rx, search_state.start_super); } else { rx_protect_superset (&rxb->rx, start_contents); search_state.start_super = rx_superstate (&rxb->rx, start_contents); if (!search_state.start_super) return rx_search_fail; rx_lock_superstate (&rxb->rx, search_state.start_super); rx_release_superset (&rxb->rx, start_contents); } } /* The outer_pos tracks the position within the strings * as seen by loop that calls fastmap_search. * * The caller supplied get_burst function actually * gives us pointers to chars. * * Communication with the get_burst function is through an * rx_string_position structure. Here, the structure for * outer_pos is initialized. It is set to point to the * NULL string, at an offset of STARTPOS. STARTPOS is out * of range of the NULL string, so the first call to * getburst will patch up the rx_string_position to point * to valid characters. */ ( search_state.outer_pos.string = search_state.outer_pos.end = 0); search_state.outer_pos.offset = 0; search_state.outer_pos.size = 0; search_state.outer_pos.pos = (unsigned char *)startpos; init_fastmap (rxb, &search_state); search_state.fastmap_resume_pt = rx_fastmap_start; case rx_outer_fastmap: /* do { */ pseudo_do: { { int fastmap_state; fastmap_state = fastmap_search (rxb, stop, get_burst, app_closure, &search_state); switch (fastmap_state) { case rx_fastmap_continuation: pc = rx_outer_fastmap; goto return_continuation; case rx_fastmap_fail: goto finish; case rx_fastmap_ok: break; } } /* now the fastmap loop has brought us to a plausible * starting point for a match. so, it's time to run the * nfa and see if a match occured. */ startpos = ( search_state.outer_pos.pos - search_state.outer_pos.string + search_state.outer_pos.offset); /*|*/ if ((range > 0) && (startpos == search_state.outer_pos.search_end)) /*|*/ goto finish; } search_state.test_match_resume_pt = rx_test_start; /* do interrupted for entry point... */ case rx_outer_test: /* ...do continued */ { goto test_match; test_returns_to_search: switch (test_state) { case rx_test_continuation: pc = rx_outer_test; goto return_continuation; case rx_test_error: search_state.ret_val = rx_search_error; goto finish; case rx_test_fail: break; case rx_test_ok: goto finish; } search_state.outer_pos.pos += search_state.outer_pos.search_direction; startpos += search_state.outer_pos.search_direction; #if 0 /*|*/ if (search_state.test_pos.pos < search_state.test_pos.end) /*|*/ break; #endif } /* do interrupted for entry point... */ case rx_outer_restore_pos: { int x; x = get_burst (&search_state.outer_pos, app_closure, stop); switch (x) { case rx_get_burst_continuation: pc = rx_outer_restore_pos; goto return_continuation; case rx_get_burst_error: search_state.ret_val = rx_search_error; goto finish; case rx_get_burst_no_more: if (rxb->can_match_empty) break; goto finish; case rx_get_burst_ok: break; } } /* } while (...see below...) */ if ((search_state.outer_pos.search_direction == 1) ? (startpos < search_state.outer_pos.search_end) : (startpos > search_state.outer_pos.search_end)) goto pseudo_do; finish: uninit_fastmap (rxb, &search_state); if (search_state.start_super) rx_unlock_superstate (&rxb->rx, search_state.start_super); #ifdef regex_malloc if (search_state.lparen) free (search_state.lparen); if (search_state.rparen) free (search_state.rparen); if (search_state.best_lpspace) free (search_state.best_lpspace); if (search_state.best_rpspace) free (search_state.best_rpspace); #endif return search_state.ret_val; } test_match: { enum rx_test_match_entry test_pc; int inx; test_pc = search_state.test_match_resume_pt; if (test_pc == rx_test_start) { #ifdef RX_DEBUG search_state.backtrack_depth = 0; #endif search_state.last_l = search_state.last_r = 0; search_state.lparen[0] = startpos; search_state.super = search_state.start_super; search_state.c = search_state.nfa_choice; search_state.test_pos.pos = search_state.outer_pos.pos - 1; search_state.test_pos.string = search_state.outer_pos.string; search_state.test_pos.end = search_state.outer_pos.end; search_state.test_pos.offset = search_state.outer_pos.offset; search_state.test_pos.size = search_state.outer_pos.size; search_state.test_pos.search_direction = 1; search_state.counter_stack = 0; search_state.backtrack_stack = 0; search_state.backtrack_frame_bytes = (sizeof (struct rx_backtrack_frame) + (rxb->match_regs_on_stack ? sizeof (regoff_t) * (search_state.num_regs + 1) * 2 : 0)); search_state.chunk_bytes = search_state.backtrack_frame_bytes * 64; search_state.test_ret = rx_test_line_finished; search_state.could_have_continued = 0; } /* This is while (1)...except that the body of the loop is interrupted * by some alternative entry points. */ pseudo_while_1: switch (test_pc) { case rx_test_cache_hit_loop: goto resume_continuation_1; case rx_test_backreference_check: goto resume_continuation_2; case rx_test_backtrack_return: goto resume_continuation_3; case rx_test_start: #ifdef RX_DEBUG /* There is a search tree with every node as set of deterministic * transitions in the super nfa. For every branch of a * backtrack point is an edge in the tree. * This counts up a pre-order of nodes in that tree. * It's saved on the search stack and printed when debugging. */ search_state.line_no = 0; search_state.lines_found = 0; #endif top_of_cycle: /* A superstate is basicly a transition table, indexed by * characters from the string being tested, and containing * RX_INX (`instruction frame') structures. */ search_state.ifr = &search_state.super->transitions [search_state.c]; recurse_test_match: /* This is the point to which control is sent when the * test matcher `recurses'. Before jumping here, some variables * need to be saved on the stack and the next instruction frame * has to be computed. */ restart: /* Some instructions don't advance the matcher, but just * carry out some side effects and fetch a new instruction. * To dispatch that new instruction, `goto restart'. */ { struct rx_inx * next_tr_table; struct rx_inx * this_tr_table; /* The fastest route through the loop is when the instruction * is RX_NEXT_CHAR. This case is detected when SEARCH_STATE.IFR->DATA * is non-zero. In that case, it points to the next * superstate. * * This allows us to not bother fetching the bytecode. */ next_tr_table = (struct rx_inx *)search_state.ifr->data; this_tr_table = search_state.super->transitions; while (next_tr_table) { #ifdef RX_DEBUG_0 if (rx_debug_trace) { struct rx_superset * setp; fprintf (stderr, "%d %d>> re_next_char @ %d (%d)", search_state.line_no, search_state.backtrack_depth, (search_state.test_pos.pos - search_state.test_pos.string + search_state.test_pos.offset), search_state.c); search_state.super = ((struct rx_superstate *) ((char *)this_tr_table - ((unsigned long) ((struct rx_superstate *)0)->transitions))); setp = search_state.super->contents; fprintf (stderr, " superstet (rx=%d, &=%x: ", rxb->rx.rx_id, setp); while (setp) { fprintf (stderr, "%d ", setp->id); setp = setp->cdr; } fprintf (stderr, "\n"); } #endif this_tr_table = next_tr_table; ++search_state.test_pos.pos; if (search_state.test_pos.pos == search_state.test_pos.end) { int burst_state; try_burst_1: burst_state = get_burst (&search_state.test_pos, app_closure, stop); switch (burst_state) { case rx_get_burst_continuation: search_state.saved_this_tr_table = this_tr_table; search_state.saved_next_tr_table = next_tr_table; test_pc = rx_test_cache_hit_loop; goto test_return_continuation; resume_continuation_1: /* Continuation one jumps here to do its work: */ search_state.saved_this_tr_table = this_tr_table; search_state.saved_next_tr_table = next_tr_table; goto try_burst_1; case rx_get_burst_ok: /* get_burst succeeded...keep going */ break; case rx_get_burst_no_more: search_state.test_ret = rx_test_line_finished; search_state.could_have_continued = 1; goto test_do_return; case rx_get_burst_error: /* An error... */ search_state.test_ret = rx_test_internal_error; goto test_do_return; } } search_state.c = *search_state.test_pos.pos; search_state.ifr = this_tr_table + search_state.c; next_tr_table = (struct rx_inx *)search_state.ifr->data; } /* Fast loop through cached transition tables */ /* Here when we ran out of cached next-char transitions. * So, it will be necessary to do a more expensive * dispatch on the current instruction. The superstate * pointer is allowed to become invalid during next-char * transitions -- now we must bring it up to date. */ search_state.super = ((struct rx_superstate *) ((char *)this_tr_table - ((unsigned long) ((struct rx_superstate *)0)->transitions))); } /* We've encountered an instruction other than next-char. * Dispatch that instruction: */ inx = (int)search_state.ifr->inx; #ifdef RX_DEBUG_0 if (rx_debug_trace) { struct rx_superset * setp = search_state.super->contents; fprintf (stderr, "%d %d>> %s @ %d (%d)", search_state.line_no, search_state.backtrack_depth, inx_names[inx], (search_state.test_pos.pos - search_state.test_pos.string + (test_pos.half == 0 ? 0 : size1)), search_state.c); fprintf (stderr, " superstet (rx=%d, &=%x: ", rxb->rx.rx_id, setp); while (setp) { fprintf (stderr, "%d ", setp->id); setp = setp->cdr; } fprintf (stderr, "\n"); } #endif switch ((enum rx_opcode)inx) { case rx_do_side_effects: /* RX_DO_SIDE_EFFECTS occurs when we cross epsilon * edges associated with parentheses, backreferencing, etc. */ { struct rx_distinct_future * df = (struct rx_distinct_future *)search_state.ifr->data_2; struct rx_se_list * el = df->effects; /* Side effects come in lists. This walks down * a list, dispatching. */ while (el) { long effect; effect = (long)el->car; if (effect < 0) { #ifdef RX_DEBUG_0 if (rx_debug_trace) { struct rx_superset * setp = search_state.super->contents; fprintf (stderr, "....%d %d>> %s\n", search_state.line_no, search_state.backtrack_depth, efnames[-effect]); } #endif switch ((enum re_side_effects) effect) { case re_se_pushback: search_state.ifr = &df->future_frame; if (!search_state.ifr->data) { struct rx_superstate * sup; sup = search_state.super; rx_lock_superstate (rx, sup); if (!rx_handle_cache_miss (&rxb->rx, search_state.super, search_state.c, (search_state.ifr ->data_2))) { rx_unlock_superstate (rx, sup); search_state.test_ret = rx_test_internal_error; goto test_do_return; } rx_unlock_superstate (rx, sup); } /* --search_state.test_pos.pos; */ search_state.c = 't'; search_state.super = ((struct rx_superstate *) ((char *)search_state.ifr->data - (long)(((struct rx_superstate *)0) ->transitions))); goto top_of_cycle; break; case re_se_push0: { struct rx_counter_frame * old_cf = (search_state.counter_stack ? ((struct rx_counter_frame *) search_state.counter_stack->sp) : 0); struct rx_counter_frame * cf; PUSH (search_state.counter_stack, sizeof (struct rx_counter_frame)); cf = ((struct rx_counter_frame *) search_state.counter_stack->sp); cf->tag = re_se_iter; cf->val = 0; cf->inherited_from = 0; cf->cdr = old_cf; break; } case re_se_fail: goto test_do_return; case re_se_begbuf: if (!AT_STRINGS_BEG ()) goto test_do_return; break; case re_se_endbuf: if (!AT_STRINGS_END ()) goto test_do_return; break; case re_se_wordbeg: if ( LETTER_P (&search_state.test_pos, 1) && ( AT_STRINGS_BEG() || !LETTER_P (&search_state.test_pos, 0))) break; else goto test_do_return; case re_se_wordend: if ( !AT_STRINGS_BEG () && LETTER_P (&search_state.test_pos, 0) && (AT_STRINGS_END () || !LETTER_P (&search_state.test_pos, 1))) break; else goto test_do_return; case re_se_wordbound: if (AT_WORD_BOUNDARY (&search_state.test_pos)) break; else goto test_do_return; case re_se_notwordbound: if (!AT_WORD_BOUNDARY (&search_state.test_pos)) break; else goto test_do_return; case re_se_hat: if (AT_STRINGS_BEG ()) { if (rxb->not_bol) goto test_do_return; else break; } else { char pos_c = *search_state.test_pos.pos; if ( (SRCH_TRANSLATE (pos_c) == SRCH_TRANSLATE('\n')) && rxb->newline_anchor) break; else goto test_do_return; } case re_se_dollar: if (AT_STRINGS_END ()) { if (rxb->not_eol) goto test_do_return; else break; } else { if ( ( SRCH_TRANSLATE (fetch_char (&search_state.test_pos, 1, app_closure, stop)) == SRCH_TRANSLATE ('\n')) && rxb->newline_anchor) break; else goto test_do_return; } case re_se_try: /* This is the first side effect in every * expression. * * FOR NO GOOD REASON...get rid of it... */ break; case re_se_pushpos: { int urhere = ((int)(search_state.test_pos.pos - search_state.test_pos.string) + search_state.test_pos.offset); struct rx_counter_frame * old_cf = (search_state.counter_stack ? ((struct rx_counter_frame *) search_state.counter_stack->sp) : 0); struct rx_counter_frame * cf; PUSH(search_state.counter_stack, sizeof (struct rx_counter_frame)); cf = ((struct rx_counter_frame *) search_state.counter_stack->sp); cf->tag = re_se_pushpos; cf->val = urhere; cf->inherited_from = 0; cf->cdr = old_cf; break; } case re_se_chkpos: { int urhere = ((int)(search_state.test_pos.pos - search_state.test_pos.string) + search_state.test_pos.offset); struct rx_counter_frame * cf = ((struct rx_counter_frame *) search_state.counter_stack->sp); if (cf->val == urhere) goto test_do_return; cf->val = urhere; break; } break; case re_se_poppos: POP(search_state.counter_stack, sizeof (struct rx_counter_frame)); break; case re_se_at_dot: case re_se_syntax: case re_se_not_syntax: #ifdef emacs /* * this release lacks emacs support */ #endif break; case re_se_win: case re_se_lparen: case re_se_rparen: case re_se_backref: case re_se_iter: case re_se_end_iter: case re_se_tv: case re_floogle_flap: search_state.ret_val = 0; goto test_do_return; } } else { #ifdef RX_DEBUG_0 if (rx_debug_trace) fprintf (stderr, "....%d %d>> %s %d %d\n", search_state.line_no, search_state.backtrack_depth, efnames2[rxb->se_params [effect].se], rxb->se_params [effect].op1, rxb->se_params [effect].op2); #endif switch (rxb->se_params [effect].se) { case re_se_win: /* This side effect indicates that we've * found a match, though not necessarily the * best match. This is a fancy assignment to * register 0 unless the caller didn't * care about registers. In which case, * this stops the match. */ { int urhere = ((int)(search_state.test_pos.pos - search_state.test_pos.string) + search_state.test_pos.offset); if ( (search_state.best_last_r < 0) || (urhere + 1 > search_state.best_rparen[0])) { /* Record the best known and keep * looking. */ int x; for (x = 0; x <= search_state.last_l; ++x) search_state.best_lparen[x] = search_state.lparen[x]; search_state.best_last_l = search_state.last_l; for (x = 0; x <= search_state.last_r; ++x) search_state.best_rparen[x] = search_state.rparen[x]; search_state.best_rparen[0] = urhere + 1; search_state.best_last_r = search_state.last_r; } /* If we're not reporting the match-length * or other register info, we need look no * further. */ if (search_state.first_found) { search_state.test_ret = rx_test_found_first; goto test_do_return; } } break; case re_se_lparen: { int urhere = ((int)(search_state.test_pos.pos - search_state.test_pos.string) + search_state.test_pos.offset); int reg = rxb->se_params [effect].op1; #if 0 if (reg > search_state.last_l) #endif { search_state.lparen[reg] = urhere + 1; /* In addition to making this assignment, * we now know that lower numbered regs * that haven't already been assigned, * won't be. We make sure they're * filled with -1, so they can be * recognized as unassigned. */ if (search_state.last_l < reg) while (++search_state.last_l < reg) search_state.lparen[search_state.last_l] = -1; } break; } case re_se_rparen: { int urhere = ((int)(search_state.test_pos.pos - search_state.test_pos.string) + search_state.test_pos.offset); int reg = rxb->se_params [effect].op1; search_state.rparen[reg] = urhere + 1; if (search_state.last_r < reg) { while (++search_state.last_r < reg) search_state.rparen[search_state.last_r] = -1; } break; } case re_se_backref: { int reg = rxb->se_params [effect].op1; if ( reg > search_state.last_r || search_state.rparen[reg] < 0) goto test_do_return; { int backref_status; check_backreference: backref_status = back_check (&search_state.test_pos, search_state.lparen[reg], search_state.rparen[reg], search_state.translate, app_closure, stop); switch (backref_status) { case rx_back_check_continuation: search_state.saved_reg = reg; test_pc = rx_test_backreference_check; goto test_return_continuation; resume_continuation_2: reg = search_state.saved_reg; goto check_backreference; case rx_back_check_fail: /* Fail */ goto test_do_return; case rx_back_check_pass: /* pass -- * test_pos now advanced to last * char matched by backref */ break; } } break; } case re_se_iter: { struct rx_counter_frame * csp = ((struct rx_counter_frame *) search_state.counter_stack->sp); if (csp->val == rxb->se_params[effect].op2) goto test_do_return; else ++csp->val; break; } case re_se_end_iter: { struct rx_counter_frame * csp = ((struct rx_counter_frame *) search_state.counter_stack->sp); if (csp->val < rxb->se_params[effect].op1) goto test_do_return; else { struct rx_counter_frame * source = csp; while (source->inherited_from) source = source->inherited_from; if (!source || !source->cdr) { POP(search_state.counter_stack, sizeof(struct rx_counter_frame)); } else { source = source->cdr; csp->val = source->val; csp->tag = source->tag; csp->cdr = 0; csp->inherited_from = source; } } break; } case re_se_tv: /* is a noop */ break; case re_se_try: case re_se_pushback: case re_se_push0: case re_se_pushpos: case re_se_chkpos: case re_se_poppos: case re_se_at_dot: case re_se_syntax: case re_se_not_syntax: case re_se_begbuf: case re_se_hat: case re_se_wordbeg: case re_se_wordbound: case re_se_notwordbound: case re_se_wordend: case re_se_endbuf: case re_se_dollar: case re_se_fail: case re_floogle_flap: search_state.ret_val = 0; goto test_do_return; } } el = el->cdr; } /* Now the side effects are done, * so get the next instruction. * and move on. */ search_state.ifr = &df->future_frame; goto restart; } case rx_backtrack_point: { /* A backtrack point indicates that we've reached a * non-determinism in the superstate NFA. This is a * loop that exhaustively searches the possibilities. * * A backtracking strategy is used. We keep track of what * registers are valid so we can erase side effects. * * First, make sure there is some stack space to hold * our state. */ struct rx_backtrack_frame * bf; PUSH(search_state.backtrack_stack, search_state.backtrack_frame_bytes); #ifdef RX_DEBUG_0 ++search_state.backtrack_depth; #endif bf = ((struct rx_backtrack_frame *) search_state.backtrack_stack->sp); { bf->stk_super = search_state.super; /* We prevent the current superstate from being * deleted from the superstate cache. */ rx_lock_superstate (&rxb->rx, search_state.super); #ifdef RX_DEBUG_0 bf->stk_search_state.line_no = search_state.line_no; #endif bf->stk_c = search_state.c; bf->stk_test_pos = search_state.test_pos; bf->stk_last_l = search_state.last_l; bf->stk_last_r = search_state.last_r; bf->df = ((struct rx_super_edge *) search_state.ifr->data_2)->options; bf->first_df = bf->df; bf->counter_stack_sp = (search_state.counter_stack ? search_state.counter_stack->sp : 0); bf->stk_test_ret = search_state.test_ret; if (rxb->match_regs_on_stack) { int x; regoff_t * stk = (regoff_t *)((char *)bf + sizeof (*bf)); for (x = 0; x <= search_state.last_l; ++x) stk[x] = search_state.lparen[x]; stk += x; for (x = 0; x <= search_state.last_r; ++x) stk[x] = search_state.rparen[x]; } } /* Here is a while loop whose body is mainly a function * call and some code to handle a return from that * function. * * From here on for the rest of `case backtrack_point' it * is unsafe to assume that the search_state copies of * variables saved on the backtracking stack are valid * -- so read their values from the backtracking stack. * * This lets us use one generation fewer stack saves in * the call-graph of a search. */ while_non_det_options: #ifdef RX_DEBUG_0 ++search_state.lines_found; if (rx_debug_trace) fprintf (stderr, "@@@ %d calls %d @@@\n", search_state.line_no, search_state.lines_found); search_state.line_no = search_state.lines_found; #endif if (bf->df->next_same_super_edge[0] == bf->first_df) { /* This is a tail-call optimization -- we don't recurse * for the last of the possible futures. */ search_state.ifr = (bf->df->effects ? &bf->df->side_effects_frame : &bf->df->future_frame); rx_unlock_superstate (&rxb->rx, search_state.super); POP(search_state.backtrack_stack, search_state.backtrack_frame_bytes); #ifdef RX_DEBUG --search_state.backtrack_depth; #endif goto restart; } else { if (search_state.counter_stack) { struct rx_counter_frame * old_cf = ((struct rx_counter_frame *)search_state.counter_stack->sp); struct rx_counter_frame * cf; PUSH(search_state.counter_stack, sizeof (struct rx_counter_frame)); cf = ((struct rx_counter_frame *)search_state.counter_stack->sp); cf->tag = old_cf->tag; cf->val = old_cf->val; cf->inherited_from = old_cf; cf->cdr = 0; } /* `Call' this test-match block */ search_state.ifr = (bf->df->effects ? &bf->df->side_effects_frame : &bf->df->future_frame); goto recurse_test_match; } /* Returns in this block are accomplished by * goto test_do_return. There are two cases. * If there is some search-stack left, * then it is a return from a `recursive' call. * If there is no search-stack left, then * we should return to the fastmap/search loop. */ test_do_return: if (!search_state.backtrack_stack) { #ifdef RX_DEBUG_0 if (rx_debug_trace) fprintf (stderr, "!!! %d bails returning %d !!!\n", search_state.line_no, search_state.test_ret); #endif /* No more search-stack -- this test is done. */ if (search_state.test_ret) goto return_from_test_match; else goto error_in_testing_match; } /* Returning from a recursive call to * the test match block: */ bf = ((struct rx_backtrack_frame *) search_state.backtrack_stack->sp); #ifdef RX_DEBUG_0 if (rx_debug_trace) fprintf (stderr, "+++ %d returns %d (to %d)+++\n", search_state.line_no, search_state.test_ret, bf->stk_search_state.line_no); #endif while (search_state.counter_stack && (!bf->counter_stack_sp || (bf->counter_stack_sp != search_state.counter_stack->sp))) { POP(search_state.counter_stack, sizeof (struct rx_counter_frame)); } if (search_state.test_ret == rx_test_error) { POP (search_state.backtrack_stack, search_state.backtrack_frame_bytes); goto test_do_return; } /* If a non-longest match was found and that is good * enough, return immediately. */ if ( (search_state.test_ret == rx_test_found_first) && search_state.first_found) { rx_unlock_superstate (&rxb->rx, bf->stk_super); POP (search_state.backtrack_stack, search_state.backtrack_frame_bytes); goto test_do_return; } search_state.test_ret = bf->stk_test_ret; search_state.last_l = bf->stk_last_l; search_state.last_r = bf->stk_last_r; bf->df = bf->df->next_same_super_edge[0]; search_state.super = bf->stk_super; search_state.c = bf->stk_c; #ifdef RX_DEBUG_0 search_state.line_no = bf->stk_search_state.line_no; #endif if (rxb->match_regs_on_stack) { int x; regoff_t * stk = (regoff_t *)((char *)bf + sizeof (*bf)); for (x = 0; x <= search_state.last_l; ++x) search_state.lparen[x] = stk[x]; stk += x; for (x = 0; x <= search_state.last_r; ++x) search_state.rparen[x] = stk[x]; } { int x; try_burst_2: x = get_burst (&bf->stk_test_pos, app_closure, stop); switch (x) { case rx_get_burst_continuation: search_state.saved_bf = bf; test_pc = rx_test_backtrack_return; goto test_return_continuation; resume_continuation_3: bf = search_state.saved_bf; goto try_burst_2; case rx_get_burst_no_more: /* Since we've been here before, it is some kind of * error that we can't return. */ case rx_get_burst_error: search_state.test_ret = rx_test_internal_error; goto test_do_return; case rx_get_burst_ok: break; } } search_state.test_pos = bf->stk_test_pos; goto while_non_det_options; } case rx_cache_miss: /* Because the superstate NFA is lazily constructed, * and in fact may erode from underneath us, we sometimes * have to construct the next instruction from the hard way. * This invokes one step in the lazy-conversion. */ search_state.ifr = rx_handle_cache_miss (&rxb->rx, search_state.super, search_state.c, search_state.ifr->data_2); if (!search_state.ifr) { search_state.test_ret = rx_test_internal_error; goto test_do_return; } goto restart; case rx_backtrack: /* RX_BACKTRACK means that we've reached the empty * superstate, indicating that match can't succeed * from this point. */ goto test_do_return; case rx_next_char: case rx_error_inx: case rx_num_instructions: search_state.ret_val = 0; goto test_do_return; } goto pseudo_while_1; } /* Healthy exits from the test-match loop do a * `goto return_from_test_match' On the other hand, * we might end up here. */ error_in_testing_match: test_state = rx_test_error; goto test_returns_to_search; /***** fastmap/search loop body * considering the results testing for a match */ return_from_test_match: if (search_state.best_last_l >= 0) { if (regs && (regs->start != search_state.best_lparen)) { bcopy (search_state.best_lparen, regs->start, regs->num_regs * sizeof (int)); bcopy (search_state.best_rparen, regs->end, regs->num_regs * sizeof (int)); } if (regs && !rxb->no_sub) { int q; int bound = (regs->num_regs > search_state.num_regs ? regs->num_regs : search_state.num_regs); regoff_t * s = regs->start; regoff_t * e = regs->end; for (q = search_state.best_last_l + 1; q < bound; ++q) s[q] = e[q] = -1; } search_state.ret_val = search_state.best_lparen[0]; test_state = rx_test_ok; goto test_returns_to_search; } else { test_state = rx_test_fail; goto test_returns_to_search; } test_return_continuation: search_state.test_match_resume_pt = test_pc; test_state = rx_test_continuation; goto test_returns_to_search; } } #endif /* RX_WANT_RX_DEFS */ #else /* RX_WANT_SE_DEFS */ /* Integers are used to represent side effects. * * Simple side effects are given negative integer names by these enums. * * Non-negative names are reserved for complex effects. * * Complex effects are those that take arguments. For example, * a register assignment associated with a group is complex because * it requires an argument to tell which group is being matched. * * The integer name of a complex effect is an index into rxb->se_params. */ RX_DEF_SE(1, re_se_try, = -1) /* Epsilon from start state */ RX_DEF_SE(0, re_se_pushback, = re_se_try - 1) RX_DEF_SE(0, re_se_push0, = re_se_pushback -1) RX_DEF_SE(0, re_se_pushpos, = re_se_push0 - 1) RX_DEF_SE(0, re_se_chkpos, = re_se_pushpos -1) RX_DEF_SE(0, re_se_poppos, = re_se_chkpos - 1) RX_DEF_SE(1, re_se_at_dot, = re_se_poppos - 1) /* Emacs only */ RX_DEF_SE(0, re_se_syntax, = re_se_at_dot - 1) /* Emacs only */ RX_DEF_SE(0, re_se_not_syntax, = re_se_syntax - 1) /* Emacs only */ RX_DEF_SE(1, re_se_begbuf, = re_se_not_syntax - 1) /* match beginning of buffer */ RX_DEF_SE(1, re_se_hat, = re_se_begbuf - 1) /* match beginning of line */ RX_DEF_SE(1, re_se_wordbeg, = re_se_hat - 1) RX_DEF_SE(1, re_se_wordbound, = re_se_wordbeg - 1) RX_DEF_SE(1, re_se_notwordbound, = re_se_wordbound - 1) RX_DEF_SE(1, re_se_wordend, = re_se_notwordbound - 1) RX_DEF_SE(1, re_se_endbuf, = re_se_wordend - 1) /* This fails except at the end of a line. * It deserves to go here since it is typicly one of the last steps * in a match. */ RX_DEF_SE(1, re_se_dollar, = re_se_endbuf - 1) /* Simple effects: */ RX_DEF_SE(1, re_se_fail, = re_se_dollar - 1) /* Complex effects. These are used in the 'se' field of * a struct re_se_params. Indexes into the se array * are stored as instructions on nfa edges. */ RX_DEF_CPLX_SE(1, re_se_win, = 0) RX_DEF_CPLX_SE(1, re_se_lparen, = re_se_win + 1) RX_DEF_CPLX_SE(1, re_se_rparen, = re_se_lparen + 1) RX_DEF_CPLX_SE(0, re_se_backref, = re_se_rparen + 1) RX_DEF_CPLX_SE(0, re_se_iter, = re_se_backref + 1) RX_DEF_CPLX_SE(0, re_se_end_iter, = re_se_iter + 1) RX_DEF_CPLX_SE(0, re_se_tv, = re_se_end_iter + 1) #endif #endif tar-1.11.8/lib/safe-stat.h 644 625 1 3044 5675144375 10224 /* safe-stat.h -- EINTR-safe interface to stat Copyright (C) 1994 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Written by Jim Meyering . */ #ifndef _safe_stat_h_ #define _safe_stat_h_ 1 /* NOTE: you must include the following headers (in the listed order) before this one: , . */ #include #ifndef errno extern int errno; #endif #ifndef __GNUC__ #define __inline /* empty */ #endif /* On some systems, stat can return EINTR. */ #ifndef EINTR # define SAFE_STAT(name, buf) stat (name, buf) #else # ifndef __static # define __static static # endif # define SAFE_STAT(name, buf) safe_stat (name, buf) __static __inline int safe_stat (name, buf) const char *name; struct stat *buf; { int ret; do ret = stat (name, buf); while (ret < 0 && errno == EINTR); return ret; } #endif #endif /* _safe_stat_h_ */ tar-1.11.8/lib/alloca.c 444 625 1 33405 5641641234 7572 /* alloca.c -- allocate automatically reclaimed memory (Mostly) portable public-domain implementation -- D A Gwyn This implementation of the PWB library alloca function, which is used to allocate space off the run-time stack so that it is automatically reclaimed upon procedure exit, was inspired by discussions with J. Q. Johnson of Cornell. J.Otto Tennant contributed the Cray support. There are some preprocessor constants that can be defined when compiling for your specific system, for improved efficiency; however, the defaults should be okay. The general concept of this implementation is to keep track of all alloca-allocated blocks, and reclaim any that are found to be deeper in the stack than the current invocation. This heuristic does not reclaim storage as soon as it becomes invalid, but it will do so eventually. As a special case, alloca(0) reclaims storage without allocating any. It is a good idea to use alloca(0) in your main control loop, etc. to force garbage collection. */ #ifdef HAVE_CONFIG_H #include #endif #ifdef emacs #include "blockinput.h" #endif /* If compiling with GCC 2, this file's not needed. */ #if !defined (__GNUC__) || __GNUC__ < 2 /* If someone has defined alloca as a macro, there must be some other way alloca is supposed to work. */ #ifndef alloca #ifdef emacs #ifdef static /* actually, only want this if static is defined as "" -- this is for usg, in which emacs must undefine static in order to make unexec workable */ #ifndef STACK_DIRECTION you lose -- must know STACK_DIRECTION at compile-time #endif /* STACK_DIRECTION undefined */ #endif /* static */ #endif /* emacs */ /* If your stack is a linked list of frames, you have to provide an "address metric" ADDRESS_FUNCTION macro. */ #if defined (CRAY) && defined (CRAY_STACKSEG_END) long i00afunc (); #define ADDRESS_FUNCTION(arg) (char *) i00afunc (&(arg)) #else #define ADDRESS_FUNCTION(arg) &(arg) #endif #if __STDC__ typedef void *pointer; #else typedef char *pointer; #endif #define NULL 0 /* Different portions of Emacs need to call different versions of malloc. The Emacs executable needs alloca to call xmalloc, because ordinary malloc isn't protected from input signals. On the other hand, the utilities in lib-src need alloca to call malloc; some of them are very simple, and don't have an xmalloc routine. Non-Emacs programs expect this to call use xmalloc. Callers below should use malloc. */ #ifndef emacs #define malloc xmalloc #endif extern pointer malloc (); /* Define STACK_DIRECTION if you know the direction of stack growth for your system; otherwise it will be automatically deduced at run-time. STACK_DIRECTION > 0 => grows toward higher addresses STACK_DIRECTION < 0 => grows toward lower addresses STACK_DIRECTION = 0 => direction of growth unknown */ #ifndef STACK_DIRECTION #define STACK_DIRECTION 0 /* Direction unknown. */ #endif #if STACK_DIRECTION != 0 #define STACK_DIR STACK_DIRECTION /* Known at compile-time. */ #else /* STACK_DIRECTION == 0; need run-time code. */ static int stack_dir; /* 1 or -1 once known. */ #define STACK_DIR stack_dir static void find_stack_direction () { static char *addr = NULL; /* Address of first `dummy', once known. */ auto char dummy; /* To get stack address. */ if (addr == NULL) { /* Initial entry. */ addr = ADDRESS_FUNCTION (dummy); find_stack_direction (); /* Recurse once. */ } else { /* Second entry. */ if (ADDRESS_FUNCTION (dummy) > addr) stack_dir = 1; /* Stack grew upward. */ else stack_dir = -1; /* Stack grew downward. */ } } #endif /* STACK_DIRECTION == 0 */ /* An "alloca header" is used to: (a) chain together all alloca'ed blocks; (b) keep track of stack depth. It is very important that sizeof(header) agree with malloc alignment chunk size. The following default should work okay. */ #ifndef ALIGN_SIZE #define ALIGN_SIZE sizeof(double) #endif typedef union hdr { char align[ALIGN_SIZE]; /* To force sizeof(header). */ struct { union hdr *next; /* For chaining headers. */ char *deep; /* For stack depth measure. */ } h; } header; static header *last_alloca_header = NULL; /* -> last alloca header. */ /* Return a pointer to at least SIZE bytes of storage, which will be automatically reclaimed upon exit from the procedure that called alloca. Originally, this space was supposed to be taken from the current stack frame of the caller, but that method cannot be made to work for some implementations of C, for example under Gould's UTX/32. */ pointer alloca (size) unsigned size; { auto char probe; /* Probes stack depth: */ register char *depth = ADDRESS_FUNCTION (probe); #if STACK_DIRECTION == 0 if (STACK_DIR == 0) /* Unknown growth direction. */ find_stack_direction (); #endif /* Reclaim garbage, defined as all alloca'd storage that was allocated from deeper in the stack than currently. */ { register header *hp; /* Traverses linked list. */ #ifdef emacs BLOCK_INPUT; #endif for (hp = last_alloca_header; hp != NULL;) if ((STACK_DIR > 0 && hp->h.deep > depth) || (STACK_DIR < 0 && hp->h.deep < depth)) { register header *np = hp->h.next; free ((pointer) hp); /* Collect garbage. */ hp = np; /* -> next header. */ } else break; /* Rest are not deeper. */ last_alloca_header = hp; /* -> last valid storage. */ #ifdef emacs UNBLOCK_INPUT; #endif } if (size == 0) return NULL; /* No allocation required. */ /* Allocate combined header + user data storage. */ { register pointer new = malloc (sizeof (header) + size); /* Address of header. */ ((header *) new)->h.next = last_alloca_header; ((header *) new)->h.deep = depth; last_alloca_header = (header *) new; /* User storage begins just after header. */ return (pointer) ((char *) new + sizeof (header)); } } #if defined (CRAY) && defined (CRAY_STACKSEG_END) #ifdef DEBUG_I00AFUNC #include #endif #ifndef CRAY_STACK #define CRAY_STACK #ifndef CRAY2 /* Stack structures for CRAY-1, CRAY X-MP, and CRAY Y-MP */ struct stack_control_header { long shgrow:32; /* Number of times stack has grown. */ long shaseg:32; /* Size of increments to stack. */ long shhwm:32; /* High water mark of stack. */ long shsize:32; /* Current size of stack (all segments). */ }; /* The stack segment linkage control information occurs at the high-address end of a stack segment. (The stack grows from low addresses to high addresses.) The initial part of the stack segment linkage control information is 0200 (octal) words. This provides for register storage for the routine which overflows the stack. */ struct stack_segment_linkage { long ss[0200]; /* 0200 overflow words. */ long sssize:32; /* Number of words in this segment. */ long ssbase:32; /* Offset to stack base. */ long:32; long sspseg:32; /* Offset to linkage control of previous segment of stack. */ long:32; long sstcpt:32; /* Pointer to task common address block. */ long sscsnm; /* Private control structure number for microtasking. */ long ssusr1; /* Reserved for user. */ long ssusr2; /* Reserved for user. */ long sstpid; /* Process ID for pid based multi-tasking. */ long ssgvup; /* Pointer to multitasking thread giveup. */ long sscray[7]; /* Reserved for Cray Research. */ long ssa0; long ssa1; long ssa2; long ssa3; long ssa4; long ssa5; long ssa6; long ssa7; long sss0; long sss1; long sss2; long sss3; long sss4; long sss5; long sss6; long sss7; }; #else /* CRAY2 */ /* The following structure defines the vector of words returned by the STKSTAT library routine. */ struct stk_stat { long now; /* Current total stack size. */ long maxc; /* Amount of contiguous space which would be required to satisfy the maximum stack demand to date. */ long high_water; /* Stack high-water mark. */ long overflows; /* Number of stack overflow ($STKOFEN) calls. */ long hits; /* Number of internal buffer hits. */ long extends; /* Number of block extensions. */ long stko_mallocs; /* Block allocations by $STKOFEN. */ long underflows; /* Number of stack underflow calls ($STKRETN). */ long stko_free; /* Number of deallocations by $STKRETN. */ long stkm_free; /* Number of deallocations by $STKMRET. */ long segments; /* Current number of stack segments. */ long maxs; /* Maximum number of stack segments so far. */ long pad_size; /* Stack pad size. */ long current_address; /* Current stack segment address. */ long current_size; /* Current stack segment size. This number is actually corrupted by STKSTAT to include the fifteen word trailer area. */ long initial_address; /* Address of initial segment. */ long initial_size; /* Size of initial segment. */ }; /* The following structure describes the data structure which trails any stack segment. I think that the description in 'asdef' is out of date. I only describe the parts that I am sure about. */ struct stk_trailer { long this_address; /* Address of this block. */ long this_size; /* Size of this block (does not include this trailer). */ long unknown2; long unknown3; long link; /* Address of trailer block of previous segment. */ long unknown5; long unknown6; long unknown7; long unknown8; long unknown9; long unknown10; long unknown11; long unknown12; long unknown13; long unknown14; }; #endif /* CRAY2 */ #endif /* not CRAY_STACK */ #ifdef CRAY2 /* Determine a "stack measure" for an arbitrary ADDRESS. I doubt that "lint" will like this much. */ static long i00afunc (long *address) { struct stk_stat status; struct stk_trailer *trailer; long *block, size; long result = 0; /* We want to iterate through all of the segments. The first step is to get the stack status structure. We could do this more quickly and more directly, perhaps, by referencing the $LM00 common block, but I know that this works. */ STKSTAT (&status); /* Set up the iteration. */ trailer = (struct stk_trailer *) (status.current_address + status.current_size - 15); /* There must be at least one stack segment. Therefore it is a fatal error if "trailer" is null. */ if (trailer == 0) abort (); /* Discard segments that do not contain our argument address. */ while (trailer != 0) { block = (long *) trailer->this_address; size = trailer->this_size; if (block == 0 || size == 0) abort (); trailer = (struct stk_trailer *) trailer->link; if ((block <= address) && (address < (block + size))) break; } /* Set the result to the offset in this segment and add the sizes of all predecessor segments. */ result = address - block; if (trailer == 0) { return result; } do { if (trailer->this_size <= 0) abort (); result += trailer->this_size; trailer = (struct stk_trailer *) trailer->link; } while (trailer != 0); /* We are done. Note that if you present a bogus address (one not in any segment), you will get a different number back, formed from subtracting the address of the first block. This is probably not what you want. */ return (result); } #else /* not CRAY2 */ /* Stack address function for a CRAY-1, CRAY X-MP, or CRAY Y-MP. Determine the number of the cell within the stack, given the address of the cell. The purpose of this routine is to linearize, in some sense, stack addresses for alloca. */ static long i00afunc (long address) { long stkl = 0; long size, pseg, this_segment, stack; long result = 0; struct stack_segment_linkage *ssptr; /* Register B67 contains the address of the end of the current stack segment. If you (as a subprogram) store your registers on the stack and find that you are past the contents of B67, you have overflowed the segment. B67 also points to the stack segment linkage control area, which is what we are really interested in. */ stkl = CRAY_STACKSEG_END (); ssptr = (struct stack_segment_linkage *) stkl; /* If one subtracts 'size' from the end of the segment, one has the address of the first word of the segment. If this is not the first segment, 'pseg' will be nonzero. */ pseg = ssptr->sspseg; size = ssptr->sssize; this_segment = stkl - size; /* It is possible that calling this routine itself caused a stack overflow. Discard stack segments which do not contain the target address. */ while (!(this_segment <= address && address <= stkl)) { #ifdef DEBUG_I00AFUNC fprintf (stderr, "%011o %011o %011o\n", this_segment, address, stkl); #endif if (pseg == 0) break; stkl = stkl - pseg; ssptr = (struct stack_segment_linkage *) stkl; size = ssptr->sssize; pseg = ssptr->sspseg; this_segment = stkl - size; } result = address - this_segment; /* If you subtract pseg from the current end of the stack, you get the address of the previous stack segment's end. This seems a little convoluted to me, but I'll bet you save a cycle somewhere. */ while (pseg != 0) { #ifdef DEBUG_I00AFUNC fprintf (stderr, "%011o %011o\n", pseg, size); #endif stkl = stkl - pseg; ssptr = (struct stack_segment_linkage *) stkl; size = ssptr->sssize; pseg = ssptr->sspseg; result += size; } return (result); } #endif /* not CRAY2 */ #endif /* CRAY */ #endif /* no alloca */ #endif /* not GCC version 2 */ tar-1.11.8/lib/fileblocks.c 444 625 1 3471 5641640415 10434 /* Convert file size to number of blocks on System V-like machines. Copyright (C) 1990 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Written by Brian L. Matthews, blm@6sceng.UUCP. */ #ifdef HAVE_CONFIG_H #include #endif #if !defined (HAVE_ST_BLOCKS) && !defined(_POSIX_SOURCE) #include #include #ifndef NINDIR /* Some SysV's, like Irix, seem to lack these. Hope they're correct. */ /* Size of a indirect block, in bytes. */ #ifndef BSIZE #define BSIZE 1024 #endif /* Number of inode pointers per indirect block. */ #define NINDIR (BSIZE/sizeof(daddr_t)) #endif /* !NINDIR */ /* Number of direct block addresses in an inode. */ #define NDIR 10 /* Return the number of 512-byte blocks in a file of SIZE bytes. */ long st_blocks (size) long size; { long datablks = (size + 512 - 1) / 512; long indrblks = 0; if (datablks > NDIR) { indrblks = (datablks - NDIR - 1) / NINDIR + 1; if (datablks > NDIR + NINDIR) { indrblks += (datablks - NDIR - NINDIR - 1) / (NINDIR * NINDIR) + 1; if (datablks > NDIR + NINDIR + NINDIR * NINDIR) indrblks++; } } return datablks + indrblks; } #endif tar-1.11.8/lib/fnmatch.c 644 625 1 11754 5675174050 7770 /* Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. NOTE: The canonical source of this file is maintained with the GNU C Library. Bugs can be reported to bug-glibc@prep.ai.mit.edu. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include #endif #include #include #include #if defined (STDC_HEADERS) || !defined (isascii) #define ISASCII(c) 1 #else #define ISASCII(c) isascii(c) #endif #define ISUPPER(c) (ISASCII (c) && isupper (c)) /* Comment out all this code if we are using the GNU C Library, and are not actually compiling the library itself. This code is part of the GNU C Library, but also included in many other GNU distributions. Compiling and linking in this code is a waste when using the GNU C library (especially if it is a shared library). Rather than having every GNU program understand `configure --with-gnu-libc' and omit the object files, it is simpler to just do this in the source for each such file. */ #if defined (_LIBC) || !defined (__GNU_LIBRARY__) #if !defined(__GNU_LIBRARY__) && !defined(STDC_HEADERS) extern int errno; #endif /* Match STRING against the filename pattern PATTERN, returning zero if it matches, nonzero if not. */ int fnmatch (pattern, string, flags) const char *pattern; const char *string; int flags; { register const char *p = pattern, *n = string; register char c; /* Note that this evalutes C many times. */ #define FOLD(c) ((flags & FNM_CASEFOLD) && ISUPPER (c) ? tolower (c) : (c)) while ((c = *p++) != '\0') { c = FOLD (c); switch (c) { case '?': if (*n == '\0') return FNM_NOMATCH; else if ((flags & FNM_FILE_NAME) && *n == '/') return FNM_NOMATCH; else if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_FILE_NAME) && n[-1] == '/'))) return FNM_NOMATCH; break; case '\\': if (!(flags & FNM_NOESCAPE)) { c = *p++; c = FOLD (c); } if (FOLD (*n) != c) return FNM_NOMATCH; break; case '*': if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_FILE_NAME) && n[-1] == '/'))) return FNM_NOMATCH; for (c = *p++; c == '?' || c == '*'; c = *p++, ++n) if (((flags & FNM_FILE_NAME) && *n == '/') || (c == '?' && *n == '\0')) return FNM_NOMATCH; if (c == '\0') return 0; { char c1 = (!(flags & FNM_NOESCAPE) && c == '\\') ? *p : c; c1 = FOLD (c1); for (--p; *n != '\0'; ++n) if ((c == '[' || FOLD (*n) == c1) && fnmatch (p, n, flags & ~FNM_PERIOD) == 0) return 0; return FNM_NOMATCH; } case '[': { /* Nonzero if the sense of the character class is inverted. */ register int not; if (*n == '\0') return FNM_NOMATCH; if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_FILE_NAME) && n[-1] == '/'))) return FNM_NOMATCH; not = (*p == '!' || *p == '^'); if (not) ++p; c = *p++; for (;;) { register char cstart = c, cend = c; if (!(flags & FNM_NOESCAPE) && c == '\\') cstart = cend = *p++; cstart = cend = FOLD (cstart); if (c == '\0') /* [ (unterminated) loses. */ return FNM_NOMATCH; c = *p++; c = FOLD (c); if ((flags & FNM_FILE_NAME) && c == '/') /* [/] can never match. */ return FNM_NOMATCH; if (c == '-' && *p != ']') { cend = *p++; if (!(flags & FNM_NOESCAPE) && cend == '\\') cend = *p++; if (cend == '\0') return FNM_NOMATCH; cend = FOLD (cend); c = *p++; } if (FOLD (*n) >= cstart && FOLD (*n) <= cend) goto matched; if (c == ']') break; } if (!not) return FNM_NOMATCH; break; matched:; /* Skip the rest of the [...] that already matched. */ while (c != ']') { if (c == '\0') /* [... (unterminated) loses. */ return FNM_NOMATCH; c = *p++; if (!(flags & FNM_NOESCAPE) && c == '\\') /* XXX 1003.2d11 is unclear if this is right. */ ++p; } if (not) return FNM_NOMATCH; } break; default: if (c != FOLD (*n)) return FNM_NOMATCH; } ++n; } if (*n == '\0') return 0; if ((flags & FNM_LEADING_DIR) && *n == '/') /* The FNM_LEADING_DIR flag says that "foo*" matches "foobar/frobozz". */ return 0; return FNM_NOMATCH; } #endif /* _LIBC or not __GNU_LIBRARY__. */ tar-1.11.8/lib/ftruncate.c 444 625 1 3317 5641636071 10314 /* ftruncate emulations that work on some System V's. This file is in the public domain. */ #ifdef HAVE_CONFIG_H #include #endif #include #include #ifdef F_CHSIZE int ftruncate (fd, length) int fd; off_t length; { return fcntl (fd, F_CHSIZE, length); } #else /* not F_CHSIZE */ #ifdef F_FREESP /* By William Kucharski . */ #include #include #ifdef HAVE_UNISTD_H #include #endif int ftruncate (fd, length) int fd; off_t length; { struct flock fl; struct stat filebuf; if (fstat (fd, &filebuf) < 0) return -1; if (filebuf.st_size < length) { /* Extend file length. */ if (lseek (fd, (length - 1), SEEK_SET) < 0) return -1; /* Write a "0" byte. */ if (write (fd, "", 1) != 1) return -1; } else { /* Truncate length. */ fl.l_whence = 0; fl.l_len = 0; fl.l_start = length; fl.l_type = F_WRLCK; /* write lock on file space */ /* This relies on the *undocumented* F_FREESP argument to fcntl, which truncates the file so that it ends at the position indicated by fl.l_start. Will minor miracles never cease? */ if (fcntl (fd, F_FREESP, &fl) < 0) return -1; } return 0; } #else /* not F_CHSIZE nor F_FREESP */ #ifdef HAVE_CHSIZE int ftruncate (fd, length) int fd; off_t length; { return chsize (fd, length); } #else /* not F_CHSIZE nor F_FREESP nor HAVE_CHSIZE */ #include #ifndef errno extern int errno; #endif int ftruncate (fd, length) int fd; off_t length; { errno = EIO; return -1; } #endif /* not HAVE_CHSIZE */ #endif /* not F_FREESP */ #endif /* not F_CHSIZE */ tar-1.11.8/lib/gmalloc.c 644 625 1 113675 5655006511 10005 /* DO NOT EDIT THIS FILE -- it is automagically generated. -*- C -*- */ #define _MALLOC_INTERNAL /* The malloc headers and source files from the C library follow here. */ /* Declarations for `malloc' and friends. Copyright 1990, 1991, 1992, 1993 Free Software Foundation, Inc. Written May 1989 by Mike Haertel. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_H #define _MALLOC_H 1 #ifdef _MALLOC_INTERNAL #ifdef HAVE_CONFIG_H #include #endif #if defined(_LIBC) || defined(STDC_HEADERS) || defined(USG) #include #else #ifndef memset #define memset(s, zero, n) bzero ((s), (n)) #endif #ifndef memcpy #define memcpy(d, s, n) bcopy ((s), (d), (n)) #endif #endif #if defined(__GNU_LIBRARY__) || __STDC__ #include #else #define CHAR_BIT 8 #endif #ifdef HAVE_UNISTD_H #include #endif #endif /* _MALLOC_INTERNAL. */ #ifdef __cplusplus extern "C" { #endif #if defined (__cplusplus) || __STDC__ #undef __P #define __P(args) args #undef __ptr_t #define __ptr_t void * #else /* Not C++ or ANSI C. */ #undef __P #define __P(args) () #undef const #define const #undef __ptr_t #define __ptr_t char * #endif /* C++ or ANSI C. */ #if __STDC__ #include #else #undef size_t #define size_t unsigned int #undef ptrdiff_t #define ptrdiff_t int #endif #ifndef NULL #define NULL 0 #endif /* Allocate SIZE bytes of memory. */ extern __ptr_t malloc __P ((size_t __size)); /* Re-allocate the previously allocated block in __ptr_t, making the new block SIZE bytes long. */ extern __ptr_t realloc __P ((__ptr_t __ptr, size_t __size)); /* Allocate NMEMB elements of SIZE bytes each, all initialized to 0. */ extern __ptr_t calloc __P ((size_t __nmemb, size_t __size)); /* Free a block allocated by `malloc', `realloc' or `calloc'. */ extern void free __P ((__ptr_t __ptr)); /* Allocate SIZE bytes allocated to ALIGNMENT bytes. */ extern __ptr_t memalign __P ((size_t __alignment, size_t __size)); /* Allocate SIZE bytes on a page boundary. */ extern __ptr_t valloc __P ((size_t __size)); #ifdef _MALLOC_INTERNAL /* The allocator divides the heap into blocks of fixed size; large requests receive one or more whole blocks, and small requests receive a fragment of a block. Fragment sizes are powers of two, and all fragments of a block are the same size. When all the fragments in a block have been freed, the block itself is freed. */ #define INT_BIT (CHAR_BIT * sizeof(int)) #define BLOCKLOG (INT_BIT > 16 ? 12 : 9) #define BLOCKSIZE (1 << BLOCKLOG) #define BLOCKIFY(SIZE) (((SIZE) + BLOCKSIZE - 1) / BLOCKSIZE) /* Determine the amount of memory spanned by the initial heap table (not an absolute limit). */ #define HEAP (INT_BIT > 16 ? 4194304 : 65536) /* Number of contiguous free blocks allowed to build up at the end of memory before they will be returned to the system. */ #define FINAL_FREE_BLOCKS 8 /* Data structure giving per-block information. */ typedef union { /* Heap information for a busy block. */ struct { /* Zero for a large block, or positive giving the logarithm to the base two of the fragment size. */ int type; union { struct { size_t nfree; /* Free fragments in a fragmented block. */ size_t first; /* First free fragment of the block. */ } frag; /* Size (in blocks) of a large cluster. */ size_t size; } info; } busy; /* Heap information for a free block (that may be the first of a free cluster). */ struct { size_t size; /* Size (in blocks) of a free cluster. */ size_t next; /* Index of next free cluster. */ size_t prev; /* Index of previous free cluster. */ } free; } malloc_info; /* Pointer to first block of the heap. */ extern char *_heapbase; /* Table indexed by block number giving per-block information. */ extern malloc_info *_heapinfo; /* Address to block number and vice versa. */ #define BLOCK(A) (((char *) (A) - _heapbase) / BLOCKSIZE + 1) #define ADDRESS(B) ((__ptr_t) (((B) - 1) * BLOCKSIZE + _heapbase)) /* Current search index for the heap table. */ extern size_t _heapindex; /* Limit of valid info table indices. */ extern size_t _heaplimit; /* Doubly linked lists of free fragments. */ struct list { struct list *next; struct list *prev; }; /* Free list headers for each fragment size. */ extern struct list _fraghead[]; /* List of blocks allocated with `memalign' (or `valloc'). */ struct alignlist { struct alignlist *next; __ptr_t aligned; /* The address that memaligned returned. */ __ptr_t exact; /* The address that malloc returned. */ }; extern struct alignlist *_aligned_blocks; /* Instrumentation. */ extern size_t _chunks_used; extern size_t _bytes_used; extern size_t _chunks_free; extern size_t _bytes_free; /* Internal version of `free' used in `morecore' (malloc.c). */ extern void _free_internal __P ((__ptr_t __ptr)); #endif /* _MALLOC_INTERNAL. */ /* Underlying allocation function; successive calls should return contiguous pieces of memory. */ extern __ptr_t (*__morecore) __P ((ptrdiff_t __size)); /* Default value of `__morecore'. */ extern __ptr_t __default_morecore __P ((ptrdiff_t __size)); /* If not NULL, this function is called after each time `__morecore' is called to increase the data size. */ extern void (*__after_morecore_hook) __P ((void)); /* Nonzero if `malloc' has been called and done its initialization. */ extern int __malloc_initialized; /* Hooks for debugging versions. */ extern void (*__free_hook) __P ((__ptr_t __ptr)); extern __ptr_t (*__malloc_hook) __P ((size_t __size)); extern __ptr_t (*__realloc_hook) __P ((__ptr_t __ptr, size_t __size)); /* Return values for `mprobe': these are the kinds of inconsistencies that `mcheck' enables detection of. */ enum mcheck_status { MCHECK_DISABLED = -1, /* Consistency checking is not turned on. */ MCHECK_OK, /* Block is fine. */ MCHECK_FREE, /* Block freed twice. */ MCHECK_HEAD, /* Memory before the block was clobbered. */ MCHECK_TAIL /* Memory after the block was clobbered. */ }; /* Activate a standard collection of debugging hooks. This must be called before `malloc' is ever called. ABORTFUNC is called with an error code (see enum above) when an inconsistency is detected. If ABORTFUNC is null, the standard function prints on stderr and then calls `abort'. */ extern int mcheck __P ((void (*__abortfunc) __P ((enum mcheck_status)))); /* Check for aberrations in a particular malloc'd block. You must have called `mcheck' already. These are the same checks that `mcheck' does when you free or reallocate a block. */ extern enum mcheck_status mprobe __P ((__ptr_t __ptr)); /* Activate a standard collection of tracing hooks. */ extern void mtrace __P ((void)); /* Statistics available to the user. */ struct mstats { size_t bytes_total; /* Total size of the heap. */ size_t chunks_used; /* Chunks allocated by the user. */ size_t bytes_used; /* Byte total of user-allocated chunks. */ size_t chunks_free; /* Chunks in the free list. */ size_t bytes_free; /* Byte total of chunks in the free list. */ }; /* Pick up the current statistics. */ extern struct mstats mstats __P ((void)); /* Call WARNFUN with a warning message when memory usage is high. */ extern void memory_warnings __P ((__ptr_t __start, void (*__warnfun) __P ((const char *)))); /* Relocating allocator. */ /* Allocate SIZE bytes, and store the address in *HANDLEPTR. */ extern __ptr_t r_alloc __P ((__ptr_t *__handleptr, size_t __size)); /* Free the storage allocated in HANDLEPTR. */ extern void r_alloc_free __P ((__ptr_t *__handleptr)); /* Adjust the block at HANDLEPTR to be SIZE bytes long. */ extern __ptr_t r_re_alloc __P ((__ptr_t *__handleptr, size_t __size)); #ifdef __cplusplus } #endif #endif /* malloc.h */ /* Allocate memory on a page boundary. Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #if defined (__GNU_LIBRARY__) || defined (_LIBC) #include #include extern size_t __getpagesize __P ((void)); #else #include "getpagesize.h" #define __getpagesize() getpagesize() #endif #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif static size_t pagesize; __ptr_t valloc (size) size_t size; { if (pagesize == 0) pagesize = __getpagesize (); return memalign (pagesize, size); } /* Memory allocator `malloc'. Copyright 1990, 1991, 1992, 1993, 1994 Free Software Foundation Written May 1989 by Mike Haertel. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif /* How to really get more memory. */ __ptr_t (*__morecore) __P ((ptrdiff_t __size)) = __default_morecore; /* Debugging hook for `malloc'. */ __ptr_t (*__malloc_hook) __P ((size_t __size)); /* Pointer to the base of the first block. */ char *_heapbase; /* Block information table. Allocated with align/__free (not malloc/free). */ malloc_info *_heapinfo; /* Number of info entries. */ static size_t heapsize; /* Search index in the info table. */ size_t _heapindex; /* Limit of valid info table indices. */ size_t _heaplimit; /* Free lists for each fragment size. */ struct list _fraghead[BLOCKLOG]; /* Instrumentation. */ size_t _chunks_used; size_t _bytes_used; size_t _chunks_free; size_t _bytes_free; /* Are you experienced? */ int __malloc_initialized; void (*__after_morecore_hook) __P ((void)); /* Aligned allocation. */ static __ptr_t align __P ((size_t)); static __ptr_t align (size) size_t size; { __ptr_t result; unsigned long int adj; result = (*__morecore) (size); adj = (unsigned long int) ((unsigned long int) ((char *) result - (char *) NULL)) % BLOCKSIZE; if (adj != 0) { adj = BLOCKSIZE - adj; (void) (*__morecore) (adj); result = (char *) result + adj; } if (__after_morecore_hook) (*__after_morecore_hook) (); return result; } /* Set everything up and remember that we have. */ static int initialize __P ((void)); static int initialize () { heapsize = HEAP / BLOCKSIZE; _heapinfo = (malloc_info *) align (heapsize * sizeof (malloc_info)); if (_heapinfo == NULL) return 0; memset (_heapinfo, 0, heapsize * sizeof (malloc_info)); _heapinfo[0].free.size = 0; _heapinfo[0].free.next = _heapinfo[0].free.prev = 0; _heapindex = 0; _heapbase = (char *) _heapinfo; /* Account for the _heapinfo block itself in the statistics. */ _bytes_used = heapsize * sizeof (malloc_info); _chunks_used = 1; __malloc_initialized = 1; return 1; } /* Get neatly aligned memory, initializing or growing the heap info table as necessary. */ static __ptr_t morecore __P ((size_t)); static __ptr_t morecore (size) size_t size; { __ptr_t result; malloc_info *newinfo, *oldinfo; size_t newsize; result = align (size); if (result == NULL) return NULL; /* Check if we need to grow the info table. */ if ((size_t) BLOCK ((char *) result + size) > heapsize) { newsize = heapsize; while ((size_t) BLOCK ((char *) result + size) > newsize) newsize *= 2; newinfo = (malloc_info *) align (newsize * sizeof (malloc_info)); if (newinfo == NULL) { (*__morecore) (-size); return NULL; } memcpy (newinfo, _heapinfo, heapsize * sizeof (malloc_info)); memset (&newinfo[heapsize], 0, (newsize - heapsize) * sizeof (malloc_info)); oldinfo = _heapinfo; newinfo[BLOCK (oldinfo)].busy.type = 0; newinfo[BLOCK (oldinfo)].busy.info.size = BLOCKIFY (heapsize * sizeof (malloc_info)); _heapinfo = newinfo; /* Account for the _heapinfo block itself in the statistics. */ _bytes_used += newsize * sizeof (malloc_info); ++_chunks_used; _free_internal (oldinfo); heapsize = newsize; } _heaplimit = BLOCK ((char *) result + size); return result; } /* Allocate memory from the heap. */ __ptr_t malloc (size) size_t size; { __ptr_t result; size_t block, blocks, lastblocks, start; register size_t i; struct list *next; /* ANSI C allows `malloc (0)' to either return NULL, or to return a valid address you can realloc and free (though not dereference). It turns out that some extant code (sunrpc, at least Ultrix's version) expects `malloc (0)' to return non-NULL and breaks otherwise. Be compatible. */ #if 0 if (size == 0) return NULL; #endif if (__malloc_hook != NULL) return (*__malloc_hook) (size); if (!__malloc_initialized) if (!initialize ()) return NULL; if (size < sizeof (struct list)) size = sizeof (struct list); #ifdef SUNOS_LOCALTIME_BUG if (size < 16) size = 16; #endif /* Determine the allocation policy based on the request size. */ if (size <= BLOCKSIZE / 2) { /* Small allocation to receive a fragment of a block. Determine the logarithm to base two of the fragment size. */ register size_t log = 1; --size; while ((size /= 2) != 0) ++log; /* Look in the fragment lists for a free fragment of the desired size. */ next = _fraghead[log].next; if (next != NULL) { /* There are free fragments of this size. Pop a fragment out of the fragment list and return it. Update the block's nfree and first counters. */ result = (__ptr_t) next; next->prev->next = next->next; if (next->next != NULL) next->next->prev = next->prev; block = BLOCK (result); if (--_heapinfo[block].busy.info.frag.nfree != 0) _heapinfo[block].busy.info.frag.first = (unsigned long int) ((unsigned long int) ((char *) next->next - (char *) NULL) % BLOCKSIZE) >> log; /* Update the statistics. */ ++_chunks_used; _bytes_used += 1 << log; --_chunks_free; _bytes_free -= 1 << log; } else { /* No free fragments of the desired size, so get a new block and break it into fragments, returning the first. */ result = malloc (BLOCKSIZE); if (result == NULL) return NULL; /* Link all fragments but the first into the free list. */ for (i = 1; i < (size_t) (BLOCKSIZE >> log); ++i) { next = (struct list *) ((char *) result + (i << log)); next->next = _fraghead[log].next; next->prev = &_fraghead[log]; next->prev->next = next; if (next->next != NULL) next->next->prev = next; } /* Initialize the nfree and first counters for this block. */ block = BLOCK (result); _heapinfo[block].busy.type = log; _heapinfo[block].busy.info.frag.nfree = i - 1; _heapinfo[block].busy.info.frag.first = i - 1; _chunks_free += (BLOCKSIZE >> log) - 1; _bytes_free += BLOCKSIZE - (1 << log); _bytes_used -= BLOCKSIZE - (1 << log); } } else { /* Large allocation to receive one or more blocks. Search the free list in a circle starting at the last place visited. If we loop completely around without finding a large enough space we will have to get more memory from the system. */ blocks = BLOCKIFY (size); start = block = _heapindex; while (_heapinfo[block].free.size < blocks) { block = _heapinfo[block].free.next; if (block == start) { /* Need to get more from the system. Check to see if the new core will be contiguous with the final free block; if so we don't need to get as much. */ block = _heapinfo[0].free.prev; lastblocks = _heapinfo[block].free.size; if (_heaplimit != 0 && block + lastblocks == _heaplimit && (*__morecore) (0) == ADDRESS (block + lastblocks) && (morecore ((blocks - lastblocks) * BLOCKSIZE)) != NULL) { /* Which block we are extending (the `final free block' referred to above) might have changed, if it got combined with a freed info table. */ block = _heapinfo[0].free.prev; _heapinfo[block].free.size += (blocks - lastblocks); _bytes_free += (blocks - lastblocks) * BLOCKSIZE; continue; } result = morecore (blocks * BLOCKSIZE); if (result == NULL) return NULL; block = BLOCK (result); _heapinfo[block].busy.type = 0; _heapinfo[block].busy.info.size = blocks; ++_chunks_used; _bytes_used += blocks * BLOCKSIZE; return result; } } /* At this point we have found a suitable free list entry. Figure out how to remove what we need from the list. */ result = ADDRESS (block); if (_heapinfo[block].free.size > blocks) { /* The block we found has a bit left over, so relink the tail end back into the free list. */ _heapinfo[block + blocks].free.size = _heapinfo[block].free.size - blocks; _heapinfo[block + blocks].free.next = _heapinfo[block].free.next; _heapinfo[block + blocks].free.prev = _heapinfo[block].free.prev; _heapinfo[_heapinfo[block].free.prev].free.next = _heapinfo[_heapinfo[block].free.next].free.prev = _heapindex = block + blocks; } else { /* The block exactly matches our requirements, so just remove it from the list. */ _heapinfo[_heapinfo[block].free.next].free.prev = _heapinfo[block].free.prev; _heapinfo[_heapinfo[block].free.prev].free.next = _heapindex = _heapinfo[block].free.next; --_chunks_free; } _heapinfo[block].busy.type = 0; _heapinfo[block].busy.info.size = blocks; ++_chunks_used; _bytes_used += blocks * BLOCKSIZE; _bytes_free -= blocks * BLOCKSIZE; } return result; } #ifndef _LIBC /* On some ANSI C systems, some libc functions call _malloc, _free and _realloc. Make them use the GNU functions. */ __ptr_t _malloc (size) size_t size; { return malloc (size); } void _free (ptr) __ptr_t ptr; { free (ptr); } __ptr_t _realloc (ptr, size) __ptr_t ptr; size_t size; { return realloc (ptr, size); } #endif /* Free a block of memory allocated by `malloc'. Copyright 1990, 1991, 1992 Free Software Foundation Written May 1989 by Mike Haertel. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif /* Debugging hook for free. */ void (*__free_hook) __P ((__ptr_t __ptr)); /* List of blocks allocated by memalign. */ struct alignlist *_aligned_blocks = NULL; /* Return memory to the heap. Like `free' but don't call a __free_hook if there is one. */ void _free_internal (ptr) __ptr_t ptr; { int type; size_t block, blocks; register size_t i; struct list *prev, *next; block = BLOCK (ptr); type = _heapinfo[block].busy.type; switch (type) { case 0: /* Get as many statistics as early as we can. */ --_chunks_used; _bytes_used -= _heapinfo[block].busy.info.size * BLOCKSIZE; _bytes_free += _heapinfo[block].busy.info.size * BLOCKSIZE; /* Find the free cluster previous to this one in the free list. Start searching at the last block referenced; this may benefit programs with locality of allocation. */ i = _heapindex; if (i > block) while (i > block) i = _heapinfo[i].free.prev; else { do i = _heapinfo[i].free.next; while (i > 0 && i < block); i = _heapinfo[i].free.prev; } /* Determine how to link this block into the free list. */ if (block == i + _heapinfo[i].free.size) { /* Coalesce this block with its predecessor. */ _heapinfo[i].free.size += _heapinfo[block].busy.info.size; block = i; } else { /* Really link this block back into the free list. */ _heapinfo[block].free.size = _heapinfo[block].busy.info.size; _heapinfo[block].free.next = _heapinfo[i].free.next; _heapinfo[block].free.prev = i; _heapinfo[i].free.next = block; _heapinfo[_heapinfo[block].free.next].free.prev = block; ++_chunks_free; } /* Now that the block is linked in, see if we can coalesce it with its successor (by deleting its successor from the list and adding in its size). */ if (block + _heapinfo[block].free.size == _heapinfo[block].free.next) { _heapinfo[block].free.size += _heapinfo[_heapinfo[block].free.next].free.size; _heapinfo[block].free.next = _heapinfo[_heapinfo[block].free.next].free.next; _heapinfo[_heapinfo[block].free.next].free.prev = block; --_chunks_free; } /* Now see if we can return stuff to the system. */ blocks = _heapinfo[block].free.size; if (blocks >= FINAL_FREE_BLOCKS && block + blocks == _heaplimit && (*__morecore) (0) == ADDRESS (block + blocks)) { register size_t bytes = blocks * BLOCKSIZE; _heaplimit -= blocks; (*__morecore) (-bytes); _heapinfo[_heapinfo[block].free.prev].free.next = _heapinfo[block].free.next; _heapinfo[_heapinfo[block].free.next].free.prev = _heapinfo[block].free.prev; block = _heapinfo[block].free.prev; --_chunks_free; _bytes_free -= bytes; } /* Set the next search to begin at this block. */ _heapindex = block; break; default: /* Do some of the statistics. */ --_chunks_used; _bytes_used -= 1 << type; ++_chunks_free; _bytes_free += 1 << type; /* Get the address of the first free fragment in this block. */ prev = (struct list *) ((char *) ADDRESS (block) + (_heapinfo[block].busy.info.frag.first << type)); if (_heapinfo[block].busy.info.frag.nfree == (BLOCKSIZE >> type) - 1) { /* If all fragments of this block are free, remove them from the fragment list and free the whole block. */ next = prev; for (i = 1; i < (size_t) (BLOCKSIZE >> type); ++i) next = next->next; prev->prev->next = next; if (next != NULL) next->prev = prev->prev; _heapinfo[block].busy.type = 0; _heapinfo[block].busy.info.size = 1; /* Keep the statistics accurate. */ ++_chunks_used; _bytes_used += BLOCKSIZE; _chunks_free -= BLOCKSIZE >> type; _bytes_free -= BLOCKSIZE; free (ADDRESS (block)); } else if (_heapinfo[block].busy.info.frag.nfree != 0) { /* If some fragments of this block are free, link this fragment into the fragment list after the first free fragment of this block. */ next = (struct list *) ptr; next->next = prev->next; next->prev = prev; prev->next = next; if (next->next != NULL) next->next->prev = next; ++_heapinfo[block].busy.info.frag.nfree; } else { /* No fragments of this block are free, so link this fragment into the fragment list and announce that it is the first free fragment of this block. */ prev = (struct list *) ptr; _heapinfo[block].busy.info.frag.nfree = 1; _heapinfo[block].busy.info.frag.first = (unsigned long int) ((unsigned long int) ((char *) ptr - (char *) NULL) % BLOCKSIZE >> type); prev->next = _fraghead[type].next; prev->prev = &_fraghead[type]; prev->prev->next = prev; if (prev->next != NULL) prev->next->prev = prev; } break; } } /* Return memory to the heap. */ void free (ptr) __ptr_t ptr; { register struct alignlist *l; if (ptr == NULL) return; for (l = _aligned_blocks; l != NULL; l = l->next) if (l->aligned == ptr) { l->aligned = NULL; /* Mark the slot in the list as free. */ ptr = l->exact; break; } if (__free_hook != NULL) (*__free_hook) (ptr); else _free_internal (ptr); } /* Copyright (C) 1991, 1993, 1994 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with the GNU C Library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif #ifdef _LIBC #include #include #undef cfree function_alias(cfree, free, void, (ptr), DEFUN(cfree, (ptr), PTR ptr)) #else void cfree (ptr) __ptr_t ptr; { free (ptr); } #endif /* Change the size of a block allocated by `malloc'. Copyright 1990, 1991, 1992, 1993, 1994 Free Software Foundation, Inc. Written May 1989 by Mike Haertel. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif #if (defined (MEMMOVE_MISSING) || \ !defined(_LIBC) && !defined(STDC_HEADERS) && !defined(USG)) /* Snarfed directly from Emacs src/dispnew.c: XXX Should use system bcopy if it handles overlap. */ #ifndef emacs /* Like bcopy except never gets confused by overlap. */ static void safe_bcopy (from, to, size) char *from, *to; int size; { if (size <= 0 || from == to) return; /* If the source and destination don't overlap, then bcopy can handle it. If they do overlap, but the destination is lower in memory than the source, we'll assume bcopy can handle that. */ if (to < from || from + size <= to) bcopy (from, to, size); /* Otherwise, we'll copy from the end. */ else { register char *endf = from + size; register char *endt = to + size; /* If TO - FROM is large, then we should break the copy into nonoverlapping chunks of TO - FROM bytes each. However, if TO - FROM is small, then the bcopy function call overhead makes this not worth it. The crossover point could be about anywhere. Since I don't think the obvious copy loop is too bad, I'm trying to err in its favor. */ if (to - from < 64) { do *--endt = *--endf; while (endf != from); } else { for (;;) { endt -= (to - from); endf -= (to - from); if (endt < to) break; bcopy (endf, endt, to - from); } /* If SIZE wasn't a multiple of TO - FROM, there will be a little left over. The amount left over is (endt + (to - from)) - to, which is endt - from. */ bcopy (from, to, endt - from); } } } #endif /* Not emacs. */ #define memmove(to, from, size) safe_bcopy ((from), (to), (size)) #endif #define min(A, B) ((A) < (B) ? (A) : (B)) /* Debugging hook for realloc. */ __ptr_t (*__realloc_hook) __P ((__ptr_t __ptr, size_t __size)); /* Resize the given region to the new size, returning a pointer to the (possibly moved) region. This is optimized for speed; some benchmarks seem to indicate that greater compactness is achieved by unconditionally allocating and copying to a new region. This module has incestuous knowledge of the internals of both free and malloc. */ __ptr_t realloc (ptr, size) __ptr_t ptr; size_t size; { __ptr_t result; int type; size_t block, blocks, oldlimit; if (size == 0) { free (ptr); return malloc (0); } else if (ptr == NULL) return malloc (size); if (__realloc_hook != NULL) return (*__realloc_hook) (ptr, size); block = BLOCK (ptr); type = _heapinfo[block].busy.type; switch (type) { case 0: /* Maybe reallocate a large block to a small fragment. */ if (size <= BLOCKSIZE / 2) { result = malloc (size); if (result != NULL) { memcpy (result, ptr, size); _free_internal (ptr); return result; } } /* The new size is a large allocation as well; see if we can hold it in place. */ blocks = BLOCKIFY (size); if (blocks < _heapinfo[block].busy.info.size) { /* The new size is smaller; return excess memory to the free list. */ _heapinfo[block + blocks].busy.type = 0; _heapinfo[block + blocks].busy.info.size = _heapinfo[block].busy.info.size - blocks; _heapinfo[block].busy.info.size = blocks; /* We have just created a new chunk by splitting a chunk in two. Now we will free this chunk; increment the statistics counter so it doesn't become wrong when _free_internal decrements it. */ ++_chunks_used; _free_internal (ADDRESS (block + blocks)); result = ptr; } else if (blocks == _heapinfo[block].busy.info.size) /* No size change necessary. */ result = ptr; else { /* Won't fit, so allocate a new region that will. Free the old region first in case there is sufficient adjacent free space to grow without moving. */ blocks = _heapinfo[block].busy.info.size; /* Prevent free from actually returning memory to the system. */ oldlimit = _heaplimit; _heaplimit = 0; _free_internal (ptr); _heaplimit = oldlimit; result = malloc (size); if (result == NULL) { /* Now we're really in trouble. We have to unfree the thing we just freed. Unfortunately it might have been coalesced with its neighbors. */ if (_heapindex == block) (void) malloc (blocks * BLOCKSIZE); else { __ptr_t previous = malloc ((block - _heapindex) * BLOCKSIZE); (void) malloc (blocks * BLOCKSIZE); _free_internal (previous); } return NULL; } if (ptr != result) memmove (result, ptr, blocks * BLOCKSIZE); } break; default: /* Old size is a fragment; type is logarithm to base two of the fragment size. */ if (size > (size_t) (1 << (type - 1)) && size <= (size_t) (1 << type)) /* The new size is the same kind of fragment. */ result = ptr; else { /* The new size is different; allocate a new space, and copy the lesser of the new size and the old. */ result = malloc (size); if (result == NULL) return NULL; memcpy (result, ptr, min (size, (size_t) 1 << type)); free (ptr); } break; } return result; } /* Copyright (C) 1991, 1992 Free Software Foundation, Inc. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif /* Allocate an array of NMEMB elements each SIZE bytes long. The entire array is initialized to zeros. */ __ptr_t calloc (nmemb, size) register size_t nmemb; register size_t size; { register __ptr_t result = malloc (nmemb * size); if (result != NULL) (void) memset (result, 0, nmemb * size); return result; } /* Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with the GNU C Library; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif #ifndef __GNU_LIBRARY__ #define __sbrk sbrk #endif #ifdef __GNU_LIBRARY__ /* It is best not to declare this and cast its result on foreign operating systems with potentially hostile include files. */ extern __ptr_t __sbrk __P ((int increment)); #endif #ifndef NULL #define NULL 0 #endif /* Allocate INCREMENT more bytes of data space, and return the start of data space, or NULL on errors. If INCREMENT is negative, shrink data space. */ __ptr_t __default_morecore (increment) ptrdiff_t increment; { __ptr_t result = (__ptr_t) __sbrk ((int) increment); if (result == (__ptr_t) -1) return NULL; return result; } /* Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif __ptr_t memalign (alignment, size) size_t alignment; size_t size; { __ptr_t result; unsigned long int adj; size = ((size + alignment - 1) / alignment) * alignment; result = malloc (size); if (result == NULL) return NULL; adj = (unsigned long int) ((unsigned long int) ((char *) result - (char *) NULL)) % alignment; if (adj != 0) { struct alignlist *l; for (l = _aligned_blocks; l != NULL; l = l->next) if (l->aligned == NULL) /* This slot is free. Use it. */ break; if (l == NULL) { l = (struct alignlist *) malloc (sizeof (struct alignlist)); if (l == NULL) { free (result); return NULL; } l->next = _aligned_blocks; _aligned_blocks = l; } l->exact = result; result = l->aligned = (char *) result + alignment - adj; } return result; } tar-1.11.8/lib/insremque.c 444 625 1 2716 5754236411 10332 /* Copyright (C) 1992 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with the GNU C Library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #include #include "insremque.h" /* Insert ELEM into a doubly-linked list, after PREV. */ void insque (elem, prev) struct qelem *elem; struct qelem *prev; { struct qelem *next = prev->q_forw; prev->q_forw = elem; if (next != NULL) next->q_back = elem; elem->q_forw = next; elem->q_back = prev; } /* Unlink ELEM from the doubly-linked list that it is in. */ void remque (elem) struct qelem *elem; { struct qelem *next = elem->q_forw; struct qelem *prev = elem->q_back; if (next != NULL) next->q_back = prev; if (prev != NULL) prev->q_forw = next; } tar-1.11.8/lib/memset.c 644 625 1 1663 5050603657 7615 /* memset.c -- set an area of memory to a given value Copyright (C) 1991 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ char * memset (str, c, len) char *str; int c; unsigned len; { register char *st = str; while (len-- > 0) *st++ = c; return str; } tar-1.11.8/lib/mkdir.c 444 625 1 5341 5645644602 7431 /* mkdir.c -- BSD compatible make directory function for System V Copyright (C) 1988, 1990 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include #endif #include #include #include #ifndef errno extern int errno; #endif #ifdef STAT_MACROS_BROKEN #undef S_ISDIR #endif #if !defined(S_ISDIR) && defined(S_IFDIR) #define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR) #endif #include "safe-stat.h" /* mkdir adapted from GNU tar. */ /* Make directory DPATH, with permission mode DMODE. Written by Robert Rother, Mariah Corporation, August 1985 (sdcsvax!rmr or rmr@uscd). If you want it, it's yours. Severely hacked over by John Gilmore to make a 4.2BSD compatible subroutine. 11Mar86; hoptoad!gnu Modified by rmtodd@uokmax 6-28-87 -- when making an already existing dir, subroutine didn't return EEXIST. It does now. */ int mkdir (dpath, dmode) char *dpath; int dmode; { int cpid, status; struct stat statbuf; if (SAFE_STAT (dpath, &statbuf) == 0) { errno = EEXIST; /* stat worked, so it already exists. */ return -1; } /* If stat fails for a reason other than non-existence, return error. */ if (errno != ENOENT) return -1; cpid = fork (); switch (cpid) { case -1: /* Cannot fork. */ return -1; /* errno is already set. */ case 0: /* Child process. */ /* Cheap hack to set mode of new directory. Since this child process is going away anyway, we zap its umask. This won't suffice to set SUID, SGID, etc. on this directory, so the parent process calls chmod afterward. */ status = umask (0); /* Get current umask. */ umask (status | (0777 & ~dmode)); /* Set for mkdir. */ execl ("/bin/mkdir", "mkdir", dpath, (char *) 0); _exit (1); default: /* Parent process. */ /* Wait for kid to finish. */ while (wait (&status) != cpid) /* Do nothing. */ ; if (status & 0xFFFF) { /* /bin/mkdir failed. */ errno = EIO; return -1; } return chmod (dpath, dmode); } } tar-1.11.8/lib/rename.c 644 625 1 6351 5625427665 7604 /* rename.c -- BSD compatible directory function for System V Copyright (C) 1988, 1990 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #if defined (CONFIG_BROKETS) /* We use instead of "config.h" so that a compilation using -I. -I$srcdir will use ./config.h rather than $srcdir/config.h (which it would do because it found this file in $srcdir). */ #include #else #include "config.h" #endif #endif #include #include #include #ifndef errno extern int errno; #endif /* Rename file FROM to file TO. Return 0 if successful, -1 if not. */ int rename (from, to) char *from; char *to; { struct stat from_stats, to_stats; int pid, status; if (stat (from, &from_stats)) return -1; /* Be careful not to unlink `from' if it happens to be equal to `to' or (on filesystems that silently truncate filenames after 14 characters) if `from' and `to' share the significant characters. */ if (stat (to, &to_stats)) { if (errno != ENOENT) return -1; } else { if ((from_stats.st_dev == to_stats.st_dev) && (from_stats.st_ino == to_stats.st_dev)) /* `from' and `to' designate the same file on that filesystem. */ return 0; if (unlink (to) && errno != ENOENT) return -1; } #ifdef MVDIR /* If MVDIR is defined, it should be the full filename of a setuid root program able to link and unlink directories. If MVDIR is not defined, then the capability of renaming directories may be missing. */ #ifdef STAT_MACROS_BROKEN #ifdef S_ISDIR #undef S_ISDIR #endif #endif /* STAT_MACROS_BROKEN. */ #if !defined(S_ISDIR) && defined(S_IFDIR) #define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR) #endif if (S_ISDIR (from_stats.st_mode)) { /* Need a setuid root process to link and unlink directories. */ pid = fork (); switch (pid) { case -1: /* Error. */ error (1, errno, "cannot fork"); case 0: /* Child. */ execl (MVDIR, "mvdir", from, to, (char *) 0); error (255, errno, "cannot run `%s'", MVDIR); default: /* Parent. */ while (wait (&status) != pid) /* Do nothing. */ ; errno = 0; /* mvdir printed the system error message. */ if (status) return -1; } } else { if (link (from, to)) return -1; if (unlink (from) && errno != ENOENT) { unlink (to); return -1; } } #else /* not MVDIR */ if (link (from, to)) return -1; if (unlink (from) && errno != ENOENT) { unlink (to); return -1; } #endif /* not MVDIR */ return 0; } tar-1.11.8/lib/regex.c 444 625 1 527000 5757633402 7476 /* Extended regular expression matching and search library, version 0.12. (Implements POSIX draft P10003.2/D11.2, except for internationalization features.) Copyright (C) 1993, 1994, 1995 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* AIX requires this to be the first thing in the file. */ #if defined (_AIX) && !defined (REGEX_MALLOC) #pragma alloca #endif #define _GNU_SOURCE #ifdef HAVE_CONFIG_H #include #endif /* We need this for `regex.h', and perhaps for the Emacs include files. */ #include /* This is for other GNU distributions with internationalized messages. */ #if HAVE_LIBINTL_H || defined (_LIBC) # include #else # define gettext(msgid) (msgid) #endif /* The `emacs' switch turns on certain matching commands that make sense only in Emacs. */ #ifdef emacs #include "lisp.h" #include "buffer.h" #include "syntax.h" #else /* not emacs */ /* If we are not linking with Emacs proper, we can't use the relocating allocator even if config.h says that we can. */ #undef REL_ALLOC #if defined (STDC_HEADERS) || defined (_LIBC) #include #else char *malloc (); char *realloc (); #endif /* We used to test for `BSTRING' here, but only GCC and Emacs define `BSTRING', as far as I know, and neither of them use this code. */ #ifndef INHIBIT_STRING_HEADER #if HAVE_STRING_H || STDC_HEADERS || defined (_LIBC) #include #ifndef bcmp #define bcmp(s1, s2, n) memcmp ((s1), (s2), (n)) #endif #ifndef bcopy #define bcopy(s, d, n) memcpy ((d), (s), (n)) #endif #ifndef bzero #define bzero(s, n) memset ((s), 0, (n)) #endif #else #include #endif #endif /* Define the syntax stuff for \<, \>, etc. */ /* This must be nonzero for the wordchar and notwordchar pattern commands in re_match_2. */ #ifndef Sword #define Sword 1 #endif #ifdef SWITCH_ENUM_BUG #define SWITCH_ENUM_CAST(x) ((int)(x)) #else #define SWITCH_ENUM_CAST(x) (x) #endif #ifdef SYNTAX_TABLE extern char *re_syntax_table; #else /* not SYNTAX_TABLE */ /* How many characters in the character set. */ #define CHAR_SET_SIZE 256 static char re_syntax_table[CHAR_SET_SIZE]; static void init_syntax_once () { register int c; static int done = 0; if (done) return; bzero (re_syntax_table, sizeof re_syntax_table); for (c = 'a'; c <= 'z'; c++) re_syntax_table[c] = Sword; for (c = 'A'; c <= 'Z'; c++) re_syntax_table[c] = Sword; for (c = '0'; c <= '9'; c++) re_syntax_table[c] = Sword; re_syntax_table['_'] = Sword; done = 1; } #endif /* not SYNTAX_TABLE */ #define SYNTAX(c) re_syntax_table[c] #endif /* not emacs */ /* Get the interface, including the syntax bits. */ #include "regex.h" /* isalpha etc. are used for the character classes. */ #include /* Jim Meyering writes: "... Some ctype macros are valid only for character codes that isascii says are ASCII (SGI's IRIX-4.0.5 is one such system --when using /bin/cc or gcc but without giving an ansi option). So, all ctype uses should be through macros like ISPRINT... If STDC_HEADERS is defined, then autoconf has verified that the ctype macros don't need to be guarded with references to isascii. ... Defining isascii to 1 should let any compiler worth its salt eliminate the && through constant folding." */ #if defined (STDC_HEADERS) || (!defined (isascii) && !defined (HAVE_ISASCII)) #define ISASCII(c) 1 #else #define ISASCII(c) isascii(c) #endif #ifdef isblank #define ISBLANK(c) (ISASCII (c) && isblank (c)) #else #define ISBLANK(c) ((c) == ' ' || (c) == '\t') #endif #ifdef isgraph #define ISGRAPH(c) (ISASCII (c) && isgraph (c)) #else #define ISGRAPH(c) (ISASCII (c) && isprint (c) && !isspace (c)) #endif #define ISPRINT(c) (ISASCII (c) && isprint (c)) #define ISDIGIT(c) (ISASCII (c) && isdigit (c)) #define ISALNUM(c) (ISASCII (c) && isalnum (c)) #define ISALPHA(c) (ISASCII (c) && isalpha (c)) #define ISCNTRL(c) (ISASCII (c) && iscntrl (c)) #define ISLOWER(c) (ISASCII (c) && islower (c)) #define ISPUNCT(c) (ISASCII (c) && ispunct (c)) #define ISSPACE(c) (ISASCII (c) && isspace (c)) #define ISUPPER(c) (ISASCII (c) && isupper (c)) #define ISXDIGIT(c) (ISASCII (c) && isxdigit (c)) #ifndef NULL #define NULL 0 #endif /* We remove any previous definition of `SIGN_EXTEND_CHAR', since ours (we hope) works properly with all combinations of machines, compilers, `char' and `unsigned char' argument types. (Per Bothner suggested the basic approach.) */ #undef SIGN_EXTEND_CHAR #if __STDC__ #define SIGN_EXTEND_CHAR(c) ((signed char) (c)) #else /* not __STDC__ */ /* As in Harbison and Steele. */ #define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128) #endif /* Should we use malloc or alloca? If REGEX_MALLOC is not defined, we use `alloca' instead of `malloc'. This is because using malloc in re_search* or re_match* could cause memory leaks when C-g is used in Emacs; also, malloc is slower and causes storage fragmentation. On the other hand, malloc is more portable, and easier to debug. Because we sometimes use alloca, some routines have to be macros, not functions -- `alloca'-allocated space disappears at the end of the function it is called in. */ #ifdef REGEX_MALLOC #define REGEX_ALLOCATE malloc #define REGEX_REALLOCATE(source, osize, nsize) realloc (source, nsize) #define REGEX_FREE free #else /* not REGEX_MALLOC */ /* Emacs already defines alloca, sometimes. */ #ifndef alloca /* Make alloca work the best possible way. */ #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not __GNUC__ */ #if HAVE_ALLOCA_H #include #else /* not __GNUC__ or HAVE_ALLOCA_H */ #ifndef _AIX /* Already did AIX, up at the top. */ char *alloca (); #endif /* not _AIX */ #endif /* not HAVE_ALLOCA_H */ #endif /* not __GNUC__ */ #endif /* not alloca */ #define REGEX_ALLOCATE alloca /* Assumes a `char *destination' variable. */ #define REGEX_REALLOCATE(source, osize, nsize) \ (destination = (char *) alloca (nsize), \ bcopy (source, destination, osize), \ destination) /* No need to do anything to free, after alloca. */ #define REGEX_FREE(arg) ((void)0) /* Do nothing! But inhibit gcc warning. */ #endif /* not REGEX_MALLOC */ /* Define how to allocate the failure stack. */ #ifdef REL_ALLOC #define REGEX_ALLOCATE_STACK(size) \ r_alloc (&failure_stack_ptr, (size)) #define REGEX_REALLOCATE_STACK(source, osize, nsize) \ r_re_alloc (&failure_stack_ptr, (nsize)) #define REGEX_FREE_STACK(ptr) \ r_alloc_free (&failure_stack_ptr) #else /* not REL_ALLOC */ #ifdef REGEX_MALLOC #define REGEX_ALLOCATE_STACK malloc #define REGEX_REALLOCATE_STACK(source, osize, nsize) realloc (source, nsize) #define REGEX_FREE_STACK free #else /* not REGEX_MALLOC */ #define REGEX_ALLOCATE_STACK alloca #define REGEX_REALLOCATE_STACK(source, osize, nsize) \ REGEX_REALLOCATE (source, osize, nsize) /* No need to explicitly free anything. */ #define REGEX_FREE_STACK(arg) #endif /* not REGEX_MALLOC */ #endif /* not REL_ALLOC */ /* True if `size1' is non-NULL and PTR is pointing anywhere inside `string1' or just past its end. This works if PTR is NULL, which is a good thing. */ #define FIRST_STRING_P(ptr) \ (size1 && string1 <= (ptr) && (ptr) <= string1 + size1) /* (Re)Allocate N items of type T using malloc, or fail. */ #define TALLOC(n, t) ((t *) malloc ((n) * sizeof (t))) #define RETALLOC(addr, n, t) ((addr) = (t *) realloc (addr, (n) * sizeof (t))) #define RETALLOC_IF(addr, n, t) \ if (addr) RETALLOC((addr), (n), t); else (addr) = TALLOC ((n), t) #define REGEX_TALLOC(n, t) ((t *) REGEX_ALLOCATE ((n) * sizeof (t))) #define BYTEWIDTH 8 /* In bits. */ #define STREQ(s1, s2) ((strcmp (s1, s2) == 0)) #undef MAX #undef MIN #define MAX(a, b) ((a) > (b) ? (a) : (b)) #define MIN(a, b) ((a) < (b) ? (a) : (b)) typedef char boolean; #define false 0 #define true 1 static int re_match_2_internal (); /* These are the command codes that appear in compiled regular expressions. Some opcodes are followed by argument bytes. A command code can specify any interpretation whatsoever for its arguments. Zero bytes may appear in the compiled regular expression. */ typedef enum { no_op = 0, /* Succeed right away--no more backtracking. */ succeed, /* Followed by one byte giving n, then by n literal bytes. */ exactn, /* Matches any (more or less) character. */ anychar, /* Matches any one char belonging to specified set. First following byte is number of bitmap bytes. Then come bytes for a bitmap saying which chars are in. Bits in each byte are ordered low-bit-first. A character is in the set if its bit is 1. A character too large to have a bit in the map is automatically not in the set. */ charset, /* Same parameters as charset, but match any character that is not one of those specified. */ charset_not, /* Start remembering the text that is matched, for storing in a register. Followed by one byte with the register number, in the range 0 to one less than the pattern buffer's re_nsub field. Then followed by one byte with the number of groups inner to this one. (This last has to be part of the start_memory only because we need it in the on_failure_jump of re_match_2.) */ start_memory, /* Stop remembering the text that is matched and store it in a memory register. Followed by one byte with the register number, in the range 0 to one less than `re_nsub' in the pattern buffer, and one byte with the number of inner groups, just like `start_memory'. (We need the number of inner groups here because we don't have any easy way of finding the corresponding start_memory when we're at a stop_memory.) */ stop_memory, /* Match a duplicate of something remembered. Followed by one byte containing the register number. */ duplicate, /* Fail unless at beginning of line. */ begline, /* Fail unless at end of line. */ endline, /* Succeeds if at beginning of buffer (if emacs) or at beginning of string to be matched (if not). */ begbuf, /* Analogously, for end of buffer/string. */ endbuf, /* Followed by two byte relative address to which to jump. */ jump, /* Same as jump, but marks the end of an alternative. */ jump_past_alt, /* Followed by two-byte relative address of place to resume at in case of failure. */ on_failure_jump, /* Like on_failure_jump, but pushes a placeholder instead of the current string position when executed. */ on_failure_keep_string_jump, /* Throw away latest failure point and then jump to following two-byte relative address. */ pop_failure_jump, /* Change to pop_failure_jump if know won't have to backtrack to match; otherwise change to jump. This is used to jump back to the beginning of a repeat. If what follows this jump clearly won't match what the repeat does, such that we can be sure that there is no use backtracking out of repetitions already matched, then we change it to a pop_failure_jump. Followed by two-byte address. */ maybe_pop_jump, /* Jump to following two-byte address, and push a dummy failure point. This failure point will be thrown away if an attempt is made to use it for a failure. A `+' construct makes this before the first repeat. Also used as an intermediary kind of jump when compiling an alternative. */ dummy_failure_jump, /* Push a dummy failure point and continue. Used at the end of alternatives. */ push_dummy_failure, /* Followed by two-byte relative address and two-byte number n. After matching N times, jump to the address upon failure. */ succeed_n, /* Followed by two-byte relative address, and two-byte number n. Jump to the address N times, then fail. */ jump_n, /* Set the following two-byte relative address to the subsequent two-byte number. The address *includes* the two bytes of number. */ set_number_at, wordchar, /* Matches any word-constituent character. */ notwordchar, /* Matches any char that is not a word-constituent. */ wordbeg, /* Succeeds if at word beginning. */ wordend, /* Succeeds if at word end. */ wordbound, /* Succeeds if at a word boundary. */ notwordbound /* Succeeds if not at a word boundary. */ #ifdef emacs ,before_dot, /* Succeeds if before point. */ at_dot, /* Succeeds if at point. */ after_dot, /* Succeeds if after point. */ /* Matches any character whose syntax is specified. Followed by a byte which contains a syntax code, e.g., Sword. */ syntaxspec, /* Matches any character whose syntax is not that specified. */ notsyntaxspec #endif /* emacs */ } re_opcode_t; /* Common operations on the compiled pattern. */ /* Store NUMBER in two contiguous bytes starting at DESTINATION. */ #define STORE_NUMBER(destination, number) \ do { \ (destination)[0] = (number) & 0377; \ (destination)[1] = (number) >> 8; \ } while (0) /* Same as STORE_NUMBER, except increment DESTINATION to the byte after where the number is stored. Therefore, DESTINATION must be an lvalue. */ #define STORE_NUMBER_AND_INCR(destination, number) \ do { \ STORE_NUMBER (destination, number); \ (destination) += 2; \ } while (0) /* Put into DESTINATION a number stored in two contiguous bytes starting at SOURCE. */ #define EXTRACT_NUMBER(destination, source) \ do { \ (destination) = *(source) & 0377; \ (destination) += SIGN_EXTEND_CHAR (*((source) + 1)) << 8; \ } while (0) #ifdef DEBUG static void extract_number (dest, source) int *dest; unsigned char *source; { int temp = SIGN_EXTEND_CHAR (*(source + 1)); *dest = *source & 0377; *dest += temp << 8; } #ifndef EXTRACT_MACROS /* To debug the macros. */ #undef EXTRACT_NUMBER #define EXTRACT_NUMBER(dest, src) extract_number (&dest, src) #endif /* not EXTRACT_MACROS */ #endif /* DEBUG */ /* Same as EXTRACT_NUMBER, except increment SOURCE to after the number. SOURCE must be an lvalue. */ #define EXTRACT_NUMBER_AND_INCR(destination, source) \ do { \ EXTRACT_NUMBER (destination, source); \ (source) += 2; \ } while (0) #ifdef DEBUG static void extract_number_and_incr (destination, source) int *destination; unsigned char **source; { extract_number (destination, *source); *source += 2; } #ifndef EXTRACT_MACROS #undef EXTRACT_NUMBER_AND_INCR #define EXTRACT_NUMBER_AND_INCR(dest, src) \ extract_number_and_incr (&dest, &src) #endif /* not EXTRACT_MACROS */ #endif /* DEBUG */ /* If DEBUG is defined, Regex prints many voluminous messages about what it is doing (if the variable `debug' is nonzero). If linked with the main program in `iregex.c', you can enter patterns and strings interactively. And if linked with the main program in `main.c' and the other test files, you can run the already-written tests. */ #ifdef DEBUG /* We use standard I/O for debugging. */ #include /* It is useful to test things that ``must'' be true when debugging. */ #include static int debug = 0; #define DEBUG_STATEMENT(e) e #define DEBUG_PRINT1(x) if (debug) printf (x) #define DEBUG_PRINT2(x1, x2) if (debug) printf (x1, x2) #define DEBUG_PRINT3(x1, x2, x3) if (debug) printf (x1, x2, x3) #define DEBUG_PRINT4(x1, x2, x3, x4) if (debug) printf (x1, x2, x3, x4) #define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) \ if (debug) print_partial_compiled_pattern (s, e) #define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2) \ if (debug) print_double_string (w, s1, sz1, s2, sz2) /* Print the fastmap in human-readable form. */ void print_fastmap (fastmap) char *fastmap; { unsigned was_a_range = 0; unsigned i = 0; while (i < (1 << BYTEWIDTH)) { if (fastmap[i++]) { was_a_range = 0; putchar (i - 1); while (i < (1 << BYTEWIDTH) && fastmap[i]) { was_a_range = 1; i++; } if (was_a_range) { printf ("-"); putchar (i - 1); } } } putchar ('\n'); } /* Print a compiled pattern string in human-readable form, starting at the START pointer into it and ending just before the pointer END. */ void print_partial_compiled_pattern (start, end) unsigned char *start; unsigned char *end; { int mcnt, mcnt2; unsigned char *p = start; unsigned char *pend = end; if (start == NULL) { printf ("(null)\n"); return; } /* Loop over pattern commands. */ while (p < pend) { printf ("%d:\t", p - start); switch ((re_opcode_t) *p++) { case no_op: printf ("/no_op"); break; case exactn: mcnt = *p++; printf ("/exactn/%d", mcnt); do { putchar ('/'); putchar (*p++); } while (--mcnt); break; case start_memory: mcnt = *p++; printf ("/start_memory/%d/%d", mcnt, *p++); break; case stop_memory: mcnt = *p++; printf ("/stop_memory/%d/%d", mcnt, *p++); break; case duplicate: printf ("/duplicate/%d", *p++); break; case anychar: printf ("/anychar"); break; case charset: case charset_not: { register int c, last = -100; register int in_range = 0; printf ("/charset [%s", (re_opcode_t) *(p - 1) == charset_not ? "^" : ""); assert (p + *p < pend); for (c = 0; c < 256; c++) if (c / 8 < *p && (p[1 + (c/8)] & (1 << (c % 8)))) { /* Are we starting a range? */ if (last + 1 == c && ! in_range) { putchar ('-'); in_range = 1; } /* Have we broken a range? */ else if (last + 1 != c && in_range) { putchar (last); in_range = 0; } if (! in_range) putchar (c); last = c; } if (in_range) putchar (last); putchar (']'); p += 1 + *p; } break; case begline: printf ("/begline"); break; case endline: printf ("/endline"); break; case on_failure_jump: extract_number_and_incr (&mcnt, &p); printf ("/on_failure_jump to %d", p + mcnt - start); break; case on_failure_keep_string_jump: extract_number_and_incr (&mcnt, &p); printf ("/on_failure_keep_string_jump to %d", p + mcnt - start); break; case dummy_failure_jump: extract_number_and_incr (&mcnt, &p); printf ("/dummy_failure_jump to %d", p + mcnt - start); break; case push_dummy_failure: printf ("/push_dummy_failure"); break; case maybe_pop_jump: extract_number_and_incr (&mcnt, &p); printf ("/maybe_pop_jump to %d", p + mcnt - start); break; case pop_failure_jump: extract_number_and_incr (&mcnt, &p); printf ("/pop_failure_jump to %d", p + mcnt - start); break; case jump_past_alt: extract_number_and_incr (&mcnt, &p); printf ("/jump_past_alt to %d", p + mcnt - start); break; case jump: extract_number_and_incr (&mcnt, &p); printf ("/jump to %d", p + mcnt - start); break; case succeed_n: extract_number_and_incr (&mcnt, &p); extract_number_and_incr (&mcnt2, &p); printf ("/succeed_n to %d, %d times", p + mcnt - start, mcnt2); break; case jump_n: extract_number_and_incr (&mcnt, &p); extract_number_and_incr (&mcnt2, &p); printf ("/jump_n to %d, %d times", p + mcnt - start, mcnt2); break; case set_number_at: extract_number_and_incr (&mcnt, &p); extract_number_and_incr (&mcnt2, &p); printf ("/set_number_at location %d to %d", p + mcnt - start, mcnt2); break; case wordbound: printf ("/wordbound"); break; case notwordbound: printf ("/notwordbound"); break; case wordbeg: printf ("/wordbeg"); break; case wordend: printf ("/wordend"); #ifdef emacs case before_dot: printf ("/before_dot"); break; case at_dot: printf ("/at_dot"); break; case after_dot: printf ("/after_dot"); break; case syntaxspec: printf ("/syntaxspec"); mcnt = *p++; printf ("/%d", mcnt); break; case notsyntaxspec: printf ("/notsyntaxspec"); mcnt = *p++; printf ("/%d", mcnt); break; #endif /* emacs */ case wordchar: printf ("/wordchar"); break; case notwordchar: printf ("/notwordchar"); break; case begbuf: printf ("/begbuf"); break; case endbuf: printf ("/endbuf"); break; default: printf ("?%d", *(p-1)); } putchar ('\n'); } printf ("%d:\tend of pattern.\n", p - start); } void print_compiled_pattern (bufp) struct re_pattern_buffer *bufp; { unsigned char *buffer = bufp->buffer; print_partial_compiled_pattern (buffer, buffer + bufp->used); printf ("%d bytes used/%d bytes allocated.\n", bufp->used, bufp->allocated); if (bufp->fastmap_accurate && bufp->fastmap) { printf ("fastmap: "); print_fastmap (bufp->fastmap); } printf ("re_nsub: %d\t", bufp->re_nsub); printf ("regs_alloc: %d\t", bufp->regs_allocated); printf ("can_be_null: %d\t", bufp->can_be_null); printf ("newline_anchor: %d\n", bufp->newline_anchor); printf ("no_sub: %d\t", bufp->no_sub); printf ("not_bol: %d\t", bufp->not_bol); printf ("not_eol: %d\t", bufp->not_eol); printf ("syntax: %d\n", bufp->syntax); /* Perhaps we should print the translate table? */ } void print_double_string (where, string1, size1, string2, size2) const char *where; const char *string1; const char *string2; int size1; int size2; { unsigned this_char; if (where == NULL) printf ("(null)"); else { if (FIRST_STRING_P (where)) { for (this_char = where - string1; this_char < size1; this_char++) putchar (string1[this_char]); where = string2; } for (this_char = where - string2; this_char < size2; this_char++) putchar (string2[this_char]); } } #else /* not DEBUG */ #undef assert #define assert(e) #define DEBUG_STATEMENT(e) #define DEBUG_PRINT1(x) #define DEBUG_PRINT2(x1, x2) #define DEBUG_PRINT3(x1, x2, x3) #define DEBUG_PRINT4(x1, x2, x3, x4) #define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) #define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2) #endif /* not DEBUG */ /* Set by `re_set_syntax' to the current regexp syntax to recognize. Can also be assigned to arbitrarily: each pattern buffer stores its own syntax, so it can be changed between regex compilations. */ /* This has no initializer because initialized variables in Emacs become read-only after dumping. */ reg_syntax_t re_syntax_options; /* Specify the precise syntax of regexps for compilation. This provides for compatibility for various utilities which historically have different, incompatible syntaxes. The argument SYNTAX is a bit mask comprised of the various bits defined in regex.h. We return the old syntax. */ reg_syntax_t re_set_syntax (syntax) reg_syntax_t syntax; { reg_syntax_t ret = re_syntax_options; re_syntax_options = syntax; return ret; } /* This table gives an error message for each of the error codes listed in regex.h. Obviously the order here has to be same as there. POSIX doesn't require that we do anything for REG_NOERROR, but why not be nice? */ static const char *re_error_msgid[] = { "Success", /* REG_NOERROR */ "No match", /* REG_NOMATCH */ "Invalid regular expression", /* REG_BADPAT */ "Invalid collation character", /* REG_ECOLLATE */ "Invalid character class name", /* REG_ECTYPE */ "Trailing backslash", /* REG_EESCAPE */ "Invalid back reference", /* REG_ESUBREG */ "Unmatched [ or [^", /* REG_EBRACK */ "Unmatched ( or \\(", /* REG_EPAREN */ "Unmatched \\{", /* REG_EBRACE */ "Invalid content of \\{\\}", /* REG_BADBR */ "Invalid range end", /* REG_ERANGE */ "Memory exhausted", /* REG_ESPACE */ "Invalid preceding regular expression", /* REG_BADRPT */ "Premature end of regular expression", /* REG_EEND */ "Regular expression too big", /* REG_ESIZE */ "Unmatched ) or \\)", /* REG_ERPAREN */ }; /* Avoiding alloca during matching, to placate r_alloc. */ /* Define MATCH_MAY_ALLOCATE unless we need to make sure that the searching and matching functions should not call alloca. On some systems, alloca is implemented in terms of malloc, and if we're using the relocating allocator routines, then malloc could cause a relocation, which might (if the strings being searched are in the ralloc heap) shift the data out from underneath the regexp routines. Here's another reason to avoid allocation: Emacs processes input from X in a signal handler; processing X input may call malloc; if input arrives while a matching routine is calling malloc, then we're scrod. But Emacs can't just block input while calling matching routines; then we don't notice interrupts when they come in. So, Emacs blocks input around all regexp calls except the matching calls, which it leaves unprotected, in the faith that they will not malloc. */ /* Normally, this is fine. */ #define MATCH_MAY_ALLOCATE /* When using GNU C, we are not REALLY using the C alloca, no matter what config.h may say. So don't take precautions for it. */ #ifdef __GNUC__ #undef C_ALLOCA #endif /* The match routines may not allocate if (1) they would do it with malloc and (2) it's not safe for them to use malloc. Note that if REL_ALLOC is defined, matching would not use malloc for the failure stack, but we would still use it for the register vectors; so REL_ALLOC should not affect this. */ #if (defined (C_ALLOCA) || defined (REGEX_MALLOC)) && defined (emacs) #undef MATCH_MAY_ALLOCATE #endif /* Failure stack declarations and macros; both re_compile_fastmap and re_match_2 use a failure stack. These have to be macros because of REGEX_ALLOCATE_STACK. */ /* Number of failure points for which to initially allocate space when matching. If this number is exceeded, we allocate more space, so it is not a hard limit. */ #ifndef INIT_FAILURE_ALLOC #define INIT_FAILURE_ALLOC 5 #endif /* Roughly the maximum number of failure points on the stack. Would be exactly that if always used MAX_FAILURE_SPACE each time we failed. This is a variable only so users of regex can assign to it; we never change it ourselves. */ #if defined (MATCH_MAY_ALLOCATE) int re_max_failures = 200000; #else int re_max_failures = 2000; #endif union fail_stack_elt { unsigned char *pointer; int integer; }; typedef union fail_stack_elt fail_stack_elt_t; typedef struct { fail_stack_elt_t *stack; unsigned size; unsigned avail; /* Offset of next open position. */ } fail_stack_type; #define FAIL_STACK_EMPTY() (fail_stack.avail == 0) #define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0) #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size) /* Define macros to initialize and free the failure stack. Do `return -2' if the alloc fails. */ #ifdef MATCH_MAY_ALLOCATE #define INIT_FAIL_STACK() \ do { \ fail_stack.stack = (fail_stack_elt_t *) \ REGEX_ALLOCATE_STACK (INIT_FAILURE_ALLOC * sizeof (fail_stack_elt_t)); \ \ if (fail_stack.stack == NULL) \ return -2; \ \ fail_stack.size = INIT_FAILURE_ALLOC; \ fail_stack.avail = 0; \ } while (0) #define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack) #else #define INIT_FAIL_STACK() \ do { \ fail_stack.avail = 0; \ } while (0) #define RESET_FAIL_STACK() #endif /* Double the size of FAIL_STACK, up to approximately `re_max_failures' items. Return 1 if succeeds, and 0 if either ran out of memory allocating space for it or it was already too large. REGEX_REALLOCATE_STACK requires `destination' be declared. */ #define DOUBLE_FAIL_STACK(fail_stack) \ ((fail_stack).size > re_max_failures * MAX_FAILURE_ITEMS \ ? 0 \ : ((fail_stack).stack = (fail_stack_elt_t *) \ REGEX_REALLOCATE_STACK ((fail_stack).stack, \ (fail_stack).size * sizeof (fail_stack_elt_t), \ ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)), \ \ (fail_stack).stack == NULL \ ? 0 \ : ((fail_stack).size <<= 1, \ 1))) /* Push pointer POINTER on FAIL_STACK. Return 1 if was able to do so and 0 if ran out of memory allocating space to do so. */ #define PUSH_PATTERN_OP(POINTER, FAIL_STACK) \ ((FAIL_STACK_FULL () \ && !DOUBLE_FAIL_STACK (FAIL_STACK)) \ ? 0 \ : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER, \ 1)) /* Push a pointer value onto the failure stack. Assumes the variable `fail_stack'. Probably should only be called from within `PUSH_FAILURE_POINT'. */ #define PUSH_FAILURE_POINTER(item) \ fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item) /* This pushes an integer-valued item onto the failure stack. Assumes the variable `fail_stack'. Probably should only be called from within `PUSH_FAILURE_POINT'. */ #define PUSH_FAILURE_INT(item) \ fail_stack.stack[fail_stack.avail++].integer = (item) /* Push a fail_stack_elt_t value onto the failure stack. Assumes the variable `fail_stack'. Probably should only be called from within `PUSH_FAILURE_POINT'. */ #define PUSH_FAILURE_ELT(item) \ fail_stack.stack[fail_stack.avail++] = (item) /* These three POP... operations complement the three PUSH... operations. All assume that `fail_stack' is nonempty. */ #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail] /* Used to omit pushing failure point id's when we're not debugging. */ #ifdef DEBUG #define DEBUG_PUSH PUSH_FAILURE_INT #define DEBUG_POP(item_addr) *(item_addr) = POP_FAILURE_INT () #else #define DEBUG_PUSH(item) #define DEBUG_POP(item_addr) #endif /* Push the information about the state we will need if we ever fail back to it. Requires variables fail_stack, regstart, regend, reg_info, and num_regs be declared. DOUBLE_FAIL_STACK requires `destination' be declared. Does `return FAILURE_CODE' if runs out of memory. */ #define PUSH_FAILURE_POINT(pattern_place, string_place, failure_code) \ do { \ char *destination; \ /* Must be int, so when we don't save any registers, the arithmetic \ of 0 + -1 isn't done as unsigned. */ \ int this_reg; \ \ DEBUG_STATEMENT (failure_id++); \ DEBUG_STATEMENT (nfailure_points_pushed++); \ DEBUG_PRINT2 ("\nPUSH_FAILURE_POINT #%u:\n", failure_id); \ DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail);\ DEBUG_PRINT2 (" size: %d\n", (fail_stack).size);\ \ DEBUG_PRINT2 (" slots needed: %d\n", NUM_FAILURE_ITEMS); \ DEBUG_PRINT2 (" available: %d\n", REMAINING_AVAIL_SLOTS); \ \ /* Ensure we have enough space allocated for what we will push. */ \ while (REMAINING_AVAIL_SLOTS < NUM_FAILURE_ITEMS) \ { \ if (!DOUBLE_FAIL_STACK (fail_stack)) \ return failure_code; \ \ DEBUG_PRINT2 ("\n Doubled stack; size now: %d\n", \ (fail_stack).size); \ DEBUG_PRINT2 (" slots available: %d\n", REMAINING_AVAIL_SLOTS);\ } \ \ /* Push the info, starting with the registers. */ \ DEBUG_PRINT1 ("\n"); \ \ for (this_reg = lowest_active_reg; this_reg <= highest_active_reg; \ this_reg++) \ { \ DEBUG_PRINT2 (" Pushing reg: %d\n", this_reg); \ DEBUG_STATEMENT (num_regs_pushed++); \ \ DEBUG_PRINT2 (" start: 0x%x\n", regstart[this_reg]); \ PUSH_FAILURE_POINTER (regstart[this_reg]); \ \ DEBUG_PRINT2 (" end: 0x%x\n", regend[this_reg]); \ PUSH_FAILURE_POINTER (regend[this_reg]); \ \ DEBUG_PRINT2 (" info: 0x%x\n ", reg_info[this_reg]); \ DEBUG_PRINT2 (" match_null=%d", \ REG_MATCH_NULL_STRING_P (reg_info[this_reg])); \ DEBUG_PRINT2 (" active=%d", IS_ACTIVE (reg_info[this_reg])); \ DEBUG_PRINT2 (" matched_something=%d", \ MATCHED_SOMETHING (reg_info[this_reg])); \ DEBUG_PRINT2 (" ever_matched=%d", \ EVER_MATCHED_SOMETHING (reg_info[this_reg])); \ DEBUG_PRINT1 ("\n"); \ PUSH_FAILURE_ELT (reg_info[this_reg].word); \ } \ \ DEBUG_PRINT2 (" Pushing low active reg: %d\n", lowest_active_reg);\ PUSH_FAILURE_INT (lowest_active_reg); \ \ DEBUG_PRINT2 (" Pushing high active reg: %d\n", highest_active_reg);\ PUSH_FAILURE_INT (highest_active_reg); \ \ DEBUG_PRINT2 (" Pushing pattern 0x%x: ", pattern_place); \ DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \ PUSH_FAILURE_POINTER (pattern_place); \ \ DEBUG_PRINT2 (" Pushing string 0x%x: `", string_place); \ DEBUG_PRINT_DOUBLE_STRING (string_place, string1, size1, string2, \ size2); \ DEBUG_PRINT1 ("'\n"); \ PUSH_FAILURE_POINTER (string_place); \ \ DEBUG_PRINT2 (" Pushing failure id: %u\n", failure_id); \ DEBUG_PUSH (failure_id); \ } while (0) /* This is the number of items that are pushed and popped on the stack for each register. */ #define NUM_REG_ITEMS 3 /* Individual items aside from the registers. */ #ifdef DEBUG #define NUM_NONREG_ITEMS 5 /* Includes failure point id. */ #else #define NUM_NONREG_ITEMS 4 #endif /* We push at most this many items on the stack. */ #define MAX_FAILURE_ITEMS ((num_regs - 1) * NUM_REG_ITEMS + NUM_NONREG_ITEMS) /* We actually push this many items. */ #define NUM_FAILURE_ITEMS \ ((highest_active_reg - lowest_active_reg + 1) * NUM_REG_ITEMS \ + NUM_NONREG_ITEMS) /* How many items can still be added to the stack without overflowing it. */ #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail) /* Pops what PUSH_FAIL_STACK pushes. We restore into the parameters, all of which should be lvalues: STR -- the saved data position. PAT -- the saved pattern position. LOW_REG, HIGH_REG -- the highest and lowest active registers. REGSTART, REGEND -- arrays of string positions. REG_INFO -- array of information about each subexpression. Also assumes the variables `fail_stack' and (if debugging), `bufp', `pend', `string1', `size1', `string2', and `size2'. */ #define POP_FAILURE_POINT(str, pat, low_reg, high_reg, regstart, regend, reg_info)\ { \ DEBUG_STATEMENT (fail_stack_elt_t failure_id;) \ int this_reg; \ const unsigned char *string_temp; \ \ assert (!FAIL_STACK_EMPTY ()); \ \ /* Remove failure points and point to how many regs pushed. */ \ DEBUG_PRINT1 ("POP_FAILURE_POINT:\n"); \ DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \ DEBUG_PRINT2 (" size: %d\n", fail_stack.size); \ \ assert (fail_stack.avail >= NUM_NONREG_ITEMS); \ \ DEBUG_POP (&failure_id); \ DEBUG_PRINT2 (" Popping failure id: %u\n", failure_id); \ \ /* If the saved string location is NULL, it came from an \ on_failure_keep_string_jump opcode, and we want to throw away the \ saved NULL, thus retaining our current position in the string. */ \ string_temp = POP_FAILURE_POINTER (); \ if (string_temp != NULL) \ str = (const char *) string_temp; \ \ DEBUG_PRINT2 (" Popping string 0x%x: `", str); \ DEBUG_PRINT_DOUBLE_STRING (str, string1, size1, string2, size2); \ DEBUG_PRINT1 ("'\n"); \ \ pat = (unsigned char *) POP_FAILURE_POINTER (); \ DEBUG_PRINT2 (" Popping pattern 0x%x: ", pat); \ DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \ \ /* Restore register info. */ \ high_reg = (unsigned) POP_FAILURE_INT (); \ DEBUG_PRINT2 (" Popping high active reg: %d\n", high_reg); \ \ low_reg = (unsigned) POP_FAILURE_INT (); \ DEBUG_PRINT2 (" Popping low active reg: %d\n", low_reg); \ \ for (this_reg = high_reg; this_reg >= low_reg; this_reg--) \ { \ DEBUG_PRINT2 (" Popping reg: %d\n", this_reg); \ \ reg_info[this_reg].word = POP_FAILURE_ELT (); \ DEBUG_PRINT2 (" info: 0x%x\n", reg_info[this_reg]); \ \ regend[this_reg] = (const char *) POP_FAILURE_POINTER (); \ DEBUG_PRINT2 (" end: 0x%x\n", regend[this_reg]); \ \ regstart[this_reg] = (const char *) POP_FAILURE_POINTER (); \ DEBUG_PRINT2 (" start: 0x%x\n", regstart[this_reg]); \ } \ \ set_regs_matched_done = 0; \ DEBUG_STATEMENT (nfailure_points_popped++); \ } /* POP_FAILURE_POINT */ /* Structure for per-register (a.k.a. per-group) information. Other register information, such as the starting and ending positions (which are addresses), and the list of inner groups (which is a bits list) are maintained in separate variables. We are making a (strictly speaking) nonportable assumption here: that the compiler will pack our bit fields into something that fits into the type of `word', i.e., is something that fits into one item on the failure stack. */ typedef union { fail_stack_elt_t word; struct { /* This field is one if this group can match the empty string, zero if not. If not yet determined, `MATCH_NULL_UNSET_VALUE'. */ #define MATCH_NULL_UNSET_VALUE 3 unsigned match_null_string_p : 2; unsigned is_active : 1; unsigned matched_something : 1; unsigned ever_matched_something : 1; } bits; } register_info_type; #define REG_MATCH_NULL_STRING_P(R) ((R).bits.match_null_string_p) #define IS_ACTIVE(R) ((R).bits.is_active) #define MATCHED_SOMETHING(R) ((R).bits.matched_something) #define EVER_MATCHED_SOMETHING(R) ((R).bits.ever_matched_something) /* Call this when have matched a real character; it sets `matched' flags for the subexpressions which we are currently inside. Also records that those subexprs have matched. */ #define SET_REGS_MATCHED() \ do \ { \ if (!set_regs_matched_done) \ { \ unsigned r; \ set_regs_matched_done = 1; \ for (r = lowest_active_reg; r <= highest_active_reg; r++) \ { \ MATCHED_SOMETHING (reg_info[r]) \ = EVER_MATCHED_SOMETHING (reg_info[r]) \ = 1; \ } \ } \ } \ while (0) /* Registers are set to a sentinel when they haven't yet matched. */ static char reg_unset_dummy; #define REG_UNSET_VALUE (®_unset_dummy) #define REG_UNSET(e) ((e) == REG_UNSET_VALUE) /* Subroutine declarations and macros for regex_compile. */ static void store_op1 (), store_op2 (); static void insert_op1 (), insert_op2 (); static boolean at_begline_loc_p (), at_endline_loc_p (); static boolean group_in_compile_stack (); static reg_errcode_t compile_range (); /* Fetch the next character in the uncompiled pattern---translating it if necessary. Also cast from a signed character in the constant string passed to us by the user to an unsigned char that we can use as an array index (in, e.g., `translate'). */ #define PATFETCH(c) \ do {if (p == pend) return REG_EEND; \ c = (unsigned char) *p++; \ if (translate) c = translate[c]; \ } while (0) /* Fetch the next character in the uncompiled pattern, with no translation. */ #define PATFETCH_RAW(c) \ do {if (p == pend) return REG_EEND; \ c = (unsigned char) *p++; \ } while (0) /* Go backwards one character in the pattern. */ #define PATUNFETCH p-- /* If `translate' is non-null, return translate[D], else just D. We cast the subscript to translate because some data is declared as `char *', to avoid warnings when a string constant is passed. But when we use a character as a subscript we must make it unsigned. */ #define TRANSLATE(d) (translate ? translate[(unsigned char) (d)] : (d)) /* Macros for outputting the compiled pattern into `buffer'. */ /* If the buffer isn't allocated when it comes in, use this. */ #define INIT_BUF_SIZE 32 /* Make sure we have at least N more bytes of space in buffer. */ #define GET_BUFFER_SPACE(n) \ while (b - bufp->buffer + (n) > bufp->allocated) \ EXTEND_BUFFER () /* Make sure we have one more byte of buffer space and then add C to it. */ #define BUF_PUSH(c) \ do { \ GET_BUFFER_SPACE (1); \ *b++ = (unsigned char) (c); \ } while (0) /* Ensure we have two more bytes of buffer space and then append C1 and C2. */ #define BUF_PUSH_2(c1, c2) \ do { \ GET_BUFFER_SPACE (2); \ *b++ = (unsigned char) (c1); \ *b++ = (unsigned char) (c2); \ } while (0) /* As with BUF_PUSH_2, except for three bytes. */ #define BUF_PUSH_3(c1, c2, c3) \ do { \ GET_BUFFER_SPACE (3); \ *b++ = (unsigned char) (c1); \ *b++ = (unsigned char) (c2); \ *b++ = (unsigned char) (c3); \ } while (0) /* Store a jump with opcode OP at LOC to location TO. We store a relative address offset by the three bytes the jump itself occupies. */ #define STORE_JUMP(op, loc, to) \ store_op1 (op, loc, (to) - (loc) - 3) /* Likewise, for a two-argument jump. */ #define STORE_JUMP2(op, loc, to, arg) \ store_op2 (op, loc, (to) - (loc) - 3, arg) /* Like `STORE_JUMP', but for inserting. Assume `b' is the buffer end. */ #define INSERT_JUMP(op, loc, to) \ insert_op1 (op, loc, (to) - (loc) - 3, b) /* Like `STORE_JUMP2', but for inserting. Assume `b' is the buffer end. */ #define INSERT_JUMP2(op, loc, to, arg) \ insert_op2 (op, loc, (to) - (loc) - 3, arg, b) /* This is not an arbitrary limit: the arguments which represent offsets into the pattern are two bytes long. So if 2^16 bytes turns out to be too small, many things would have to change. */ #define MAX_BUF_SIZE (1L << 16) /* Extend the buffer by twice its current size via realloc and reset the pointers that pointed into the old block to point to the correct places in the new one. If extending the buffer results in it being larger than MAX_BUF_SIZE, then flag memory exhausted. */ #define EXTEND_BUFFER() \ do { \ unsigned char *old_buffer = bufp->buffer; \ if (bufp->allocated == MAX_BUF_SIZE) \ return REG_ESIZE; \ bufp->allocated <<= 1; \ if (bufp->allocated > MAX_BUF_SIZE) \ bufp->allocated = MAX_BUF_SIZE; \ bufp->buffer = (unsigned char *) realloc (bufp->buffer, bufp->allocated);\ if (bufp->buffer == NULL) \ return REG_ESPACE; \ /* If the buffer moved, move all the pointers into it. */ \ if (old_buffer != bufp->buffer) \ { \ b = (b - old_buffer) + bufp->buffer; \ begalt = (begalt - old_buffer) + bufp->buffer; \ if (fixup_alt_jump) \ fixup_alt_jump = (fixup_alt_jump - old_buffer) + bufp->buffer;\ if (laststart) \ laststart = (laststart - old_buffer) + bufp->buffer; \ if (pending_exact) \ pending_exact = (pending_exact - old_buffer) + bufp->buffer; \ } \ } while (0) /* Since we have one byte reserved for the register number argument to {start,stop}_memory, the maximum number of groups we can report things about is what fits in that byte. */ #define MAX_REGNUM 255 /* But patterns can have more than `MAX_REGNUM' registers. We just ignore the excess. */ typedef unsigned regnum_t; /* Macros for the compile stack. */ /* Since offsets can go either forwards or backwards, this type needs to be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1. */ typedef int pattern_offset_t; typedef struct { pattern_offset_t begalt_offset; pattern_offset_t fixup_alt_jump; pattern_offset_t inner_group_offset; pattern_offset_t laststart_offset; regnum_t regnum; } compile_stack_elt_t; typedef struct { compile_stack_elt_t *stack; unsigned size; unsigned avail; /* Offset of next open position. */ } compile_stack_type; #define INIT_COMPILE_STACK_SIZE 32 #define COMPILE_STACK_EMPTY (compile_stack.avail == 0) #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size) /* The next available element. */ #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail]) /* Set the bit for character C in a list. */ #define SET_LIST_BIT(c) \ (b[((unsigned char) (c)) / BYTEWIDTH] \ |= 1 << (((unsigned char) c) % BYTEWIDTH)) /* Get the next unsigned number in the uncompiled pattern. */ #define GET_UNSIGNED_NUMBER(num) \ { if (p != pend) \ { \ PATFETCH (c); \ while (ISDIGIT (c)) \ { \ if (num < 0) \ num = 0; \ num = num * 10 + c - '0'; \ if (p == pend) \ break; \ PATFETCH (c); \ } \ } \ } #define CHAR_CLASS_MAX_LENGTH 6 /* Namely, `xdigit'. */ #define IS_CHAR_CLASS(string) \ (STREQ (string, "alpha") || STREQ (string, "upper") \ || STREQ (string, "lower") || STREQ (string, "digit") \ || STREQ (string, "alnum") || STREQ (string, "xdigit") \ || STREQ (string, "space") || STREQ (string, "print") \ || STREQ (string, "punct") || STREQ (string, "graph") \ || STREQ (string, "cntrl") || STREQ (string, "blank")) #ifndef MATCH_MAY_ALLOCATE /* If we cannot allocate large objects within re_match_2_internal, we make the fail stack and register vectors global. The fail stack, we grow to the maximum size when a regexp is compiled. The register vectors, we adjust in size each time we compile a regexp, according to the number of registers it needs. */ static fail_stack_type fail_stack; /* Size with which the following vectors are currently allocated. That is so we can make them bigger as needed, but never make them smaller. */ static int regs_allocated_size; static const char ** regstart, ** regend; static const char ** old_regstart, ** old_regend; static const char **best_regstart, **best_regend; static register_info_type *reg_info; static const char **reg_dummy; static register_info_type *reg_info_dummy; /* Make the register vectors big enough for NUM_REGS registers, but don't make them smaller. */ static regex_grow_registers (num_regs) int num_regs; { if (num_regs > regs_allocated_size) { RETALLOC_IF (regstart, num_regs, const char *); RETALLOC_IF (regend, num_regs, const char *); RETALLOC_IF (old_regstart, num_regs, const char *); RETALLOC_IF (old_regend, num_regs, const char *); RETALLOC_IF (best_regstart, num_regs, const char *); RETALLOC_IF (best_regend, num_regs, const char *); RETALLOC_IF (reg_info, num_regs, register_info_type); RETALLOC_IF (reg_dummy, num_regs, const char *); RETALLOC_IF (reg_info_dummy, num_regs, register_info_type); regs_allocated_size = num_regs; } } #endif /* not MATCH_MAY_ALLOCATE */ /* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX. Returns one of error codes defined in `regex.h', or zero for success. Assumes the `allocated' (and perhaps `buffer') and `translate' fields are set in BUFP on entry. If it succeeds, results are put in BUFP (if it returns an error, the contents of BUFP are undefined): `buffer' is the compiled pattern; `syntax' is set to SYNTAX; `used' is set to the length of the compiled pattern; `fastmap_accurate' is zero; `re_nsub' is the number of subexpressions in PATTERN; `not_bol' and `not_eol' are zero; The `fastmap' and `newline_anchor' fields are neither examined nor set. */ /* Return, freeing storage we allocated. */ #define FREE_STACK_RETURN(value) \ return (free (compile_stack.stack), value) static reg_errcode_t regex_compile (pattern, size, syntax, bufp) const char *pattern; int size; reg_syntax_t syntax; struct re_pattern_buffer *bufp; { /* We fetch characters from PATTERN here. Even though PATTERN is `char *' (i.e., signed), we declare these variables as unsigned, so they can be reliably used as array indices. */ register unsigned char c, c1; /* A random temporary spot in PATTERN. */ const char *p1; /* Points to the end of the buffer, where we should append. */ register unsigned char *b; /* Keeps track of unclosed groups. */ compile_stack_type compile_stack; /* Points to the current (ending) position in the pattern. */ const char *p = pattern; const char *pend = pattern + size; /* How to translate the characters in the pattern. */ char *translate = bufp->translate; /* Address of the count-byte of the most recently inserted `exactn' command. This makes it possible to tell if a new exact-match character can be added to that command or if the character requires a new `exactn' command. */ unsigned char *pending_exact = 0; /* Address of start of the most recently finished expression. This tells, e.g., postfix * where to find the start of its operand. Reset at the beginning of groups and alternatives. */ unsigned char *laststart = 0; /* Address of beginning of regexp, or inside of last group. */ unsigned char *begalt; /* Place in the uncompiled pattern (i.e., the {) to which to go back if the interval is invalid. */ const char *beg_interval; /* Address of the place where a forward jump should go to the end of the containing expression. Each alternative of an `or' -- except the last -- ends with a forward jump of this sort. */ unsigned char *fixup_alt_jump = 0; /* Counts open-groups as they are encountered. Remembered for the matching close-group on the compile stack, so the same register number is put in the stop_memory as the start_memory. */ regnum_t regnum = 0; #ifdef DEBUG DEBUG_PRINT1 ("\nCompiling pattern: "); if (debug) { unsigned debug_count; for (debug_count = 0; debug_count < size; debug_count++) putchar (pattern[debug_count]); putchar ('\n'); } #endif /* DEBUG */ /* Initialize the compile stack. */ compile_stack.stack = TALLOC (INIT_COMPILE_STACK_SIZE, compile_stack_elt_t); if (compile_stack.stack == NULL) return REG_ESPACE; compile_stack.size = INIT_COMPILE_STACK_SIZE; compile_stack.avail = 0; /* Initialize the pattern buffer. */ bufp->syntax = syntax; bufp->fastmap_accurate = 0; bufp->not_bol = bufp->not_eol = 0; /* Set `used' to zero, so that if we return an error, the pattern printer (for debugging) will think there's no pattern. We reset it at the end. */ bufp->used = 0; /* Always count groups, whether or not bufp->no_sub is set. */ bufp->re_nsub = 0; #if !defined (emacs) && !defined (SYNTAX_TABLE) /* Initialize the syntax table. */ init_syntax_once (); #endif if (bufp->allocated == 0) { if (bufp->buffer) { /* If zero allocated, but buffer is non-null, try to realloc enough space. This loses if buffer's address is bogus, but that is the user's responsibility. */ RETALLOC (bufp->buffer, INIT_BUF_SIZE, unsigned char); } else { /* Caller did not allocate a buffer. Do it for them. */ bufp->buffer = TALLOC (INIT_BUF_SIZE, unsigned char); } if (!bufp->buffer) FREE_STACK_RETURN (REG_ESPACE); bufp->allocated = INIT_BUF_SIZE; } begalt = b = bufp->buffer; /* Loop through the uncompiled pattern until we're at the end. */ while (p != pend) { PATFETCH (c); switch (c) { case '^': { if ( /* If at start of pattern, it's an operator. */ p == pattern + 1 /* If context independent, it's an operator. */ || syntax & RE_CONTEXT_INDEP_ANCHORS /* Otherwise, depends on what's come before. */ || at_begline_loc_p (pattern, p, syntax)) BUF_PUSH (begline); else goto normal_char; } break; case '$': { if ( /* If at end of pattern, it's an operator. */ p == pend /* If context independent, it's an operator. */ || syntax & RE_CONTEXT_INDEP_ANCHORS /* Otherwise, depends on what's next. */ || at_endline_loc_p (p, pend, syntax)) BUF_PUSH (endline); else goto normal_char; } break; case '+': case '?': if ((syntax & RE_BK_PLUS_QM) || (syntax & RE_LIMITED_OPS)) goto normal_char; handle_plus: case '*': /* If there is no previous pattern... */ if (!laststart) { if (syntax & RE_CONTEXT_INVALID_OPS) FREE_STACK_RETURN (REG_BADRPT); else if (!(syntax & RE_CONTEXT_INDEP_OPS)) goto normal_char; } { /* Are we optimizing this jump? */ boolean keep_string_p = false; /* 1 means zero (many) matches is allowed. */ char zero_times_ok = 0, many_times_ok = 0; /* If there is a sequence of repetition chars, collapse it down to just one (the right one). We can't combine interval operators with these because of, e.g., `a{2}*', which should only match an even number of `a's. */ for (;;) { zero_times_ok |= c != '+'; many_times_ok |= c != '?'; if (p == pend) break; PATFETCH (c); if (c == '*' || (!(syntax & RE_BK_PLUS_QM) && (c == '+' || c == '?'))) ; else if (syntax & RE_BK_PLUS_QM && c == '\\') { if (p == pend) FREE_STACK_RETURN (REG_EESCAPE); PATFETCH (c1); if (!(c1 == '+' || c1 == '?')) { PATUNFETCH; PATUNFETCH; break; } c = c1; } else { PATUNFETCH; break; } /* If we get here, we found another repeat character. */ } /* Star, etc. applied to an empty pattern is equivalent to an empty pattern. */ if (!laststart) break; /* Now we know whether or not zero matches is allowed and also whether or not two or more matches is allowed. */ if (many_times_ok) { /* More than one repetition is allowed, so put in at the end a backward relative jump from `b' to before the next jump we're going to put in below (which jumps from laststart to after this jump). But if we are at the `*' in the exact sequence `.*\n', insert an unconditional jump backwards to the ., instead of the beginning of the loop. This way we only push a failure point once, instead of every time through the loop. */ assert (p - 1 > pattern); /* Allocate the space for the jump. */ GET_BUFFER_SPACE (3); /* We know we are not at the first character of the pattern, because laststart was nonzero. And we've already incremented `p', by the way, to be the character after the `*'. Do we have to do something analogous here for null bytes, because of RE_DOT_NOT_NULL? */ if (TRANSLATE (*(p - 2)) == TRANSLATE ('.') && zero_times_ok && p < pend && TRANSLATE (*p) == TRANSLATE ('\n') && !(syntax & RE_DOT_NEWLINE)) { /* We have .*\n. */ STORE_JUMP (jump, b, laststart); keep_string_p = true; } else /* Anything else. */ STORE_JUMP (maybe_pop_jump, b, laststart - 3); /* We've added more stuff to the buffer. */ b += 3; } /* On failure, jump from laststart to b + 3, which will be the end of the buffer after this jump is inserted. */ GET_BUFFER_SPACE (3); INSERT_JUMP (keep_string_p ? on_failure_keep_string_jump : on_failure_jump, laststart, b + 3); pending_exact = 0; b += 3; if (!zero_times_ok) { /* At least one repetition is required, so insert a `dummy_failure_jump' before the initial `on_failure_jump' instruction of the loop. This effects a skip over that instruction the first time we hit that loop. */ GET_BUFFER_SPACE (3); INSERT_JUMP (dummy_failure_jump, laststart, laststart + 6); b += 3; } } break; case '.': laststart = b; BUF_PUSH (anychar); break; case '[': { boolean had_char_class = false; if (p == pend) FREE_STACK_RETURN (REG_EBRACK); /* Ensure that we have enough space to push a charset: the opcode, the length count, and the bitset; 34 bytes in all. */ GET_BUFFER_SPACE (34); laststart = b; /* We test `*p == '^' twice, instead of using an if statement, so we only need one BUF_PUSH. */ BUF_PUSH (*p == '^' ? charset_not : charset); if (*p == '^') p++; /* Remember the first position in the bracket expression. */ p1 = p; /* Push the number of bytes in the bitmap. */ BUF_PUSH ((1 << BYTEWIDTH) / BYTEWIDTH); /* Clear the whole map. */ bzero (b, (1 << BYTEWIDTH) / BYTEWIDTH); /* charset_not matches newline according to a syntax bit. */ if ((re_opcode_t) b[-2] == charset_not && (syntax & RE_HAT_LISTS_NOT_NEWLINE)) SET_LIST_BIT ('\n'); /* Read in characters and ranges, setting map bits. */ for (;;) { if (p == pend) FREE_STACK_RETURN (REG_EBRACK); PATFETCH (c); /* \ might escape characters inside [...] and [^...]. */ if ((syntax & RE_BACKSLASH_ESCAPE_IN_LISTS) && c == '\\') { if (p == pend) FREE_STACK_RETURN (REG_EESCAPE); PATFETCH (c1); SET_LIST_BIT (c1); continue; } /* Could be the end of the bracket expression. If it's not (i.e., when the bracket expression is `[]' so far), the ']' character bit gets set way below. */ if (c == ']' && p != p1 + 1) break; /* Look ahead to see if it's a range when the last thing was a character class. */ if (had_char_class && c == '-' && *p != ']') FREE_STACK_RETURN (REG_ERANGE); /* Look ahead to see if it's a range when the last thing was a character: if this is a hyphen not at the beginning or the end of a list, then it's the range operator. */ if (c == '-' && !(p - 2 >= pattern && p[-2] == '[') && !(p - 3 >= pattern && p[-3] == '[' && p[-2] == '^') && *p != ']') { reg_errcode_t ret = compile_range (&p, pend, translate, syntax, b); if (ret != REG_NOERROR) FREE_STACK_RETURN (ret); } else if (p[0] == '-' && p[1] != ']') { /* This handles ranges made up of characters only. */ reg_errcode_t ret; /* Move past the `-'. */ PATFETCH (c1); ret = compile_range (&p, pend, translate, syntax, b); if (ret != REG_NOERROR) FREE_STACK_RETURN (ret); } /* See if we're at the beginning of a possible character class. */ else if (syntax & RE_CHAR_CLASSES && c == '[' && *p == ':') { /* Leave room for the null. */ char str[CHAR_CLASS_MAX_LENGTH + 1]; PATFETCH (c); c1 = 0; /* If pattern is `[[:'. */ if (p == pend) FREE_STACK_RETURN (REG_EBRACK); for (;;) { PATFETCH (c); if (c == ':' || c == ']' || p == pend || c1 == CHAR_CLASS_MAX_LENGTH) break; str[c1++] = c; } str[c1] = '\0'; /* If isn't a word bracketed by `[:' and:`]': undo the ending character, the letters, and leave the leading `:' and `[' (but set bits for them). */ if (c == ':' && *p == ']') { int ch; boolean is_alnum = STREQ (str, "alnum"); boolean is_alpha = STREQ (str, "alpha"); boolean is_blank = STREQ (str, "blank"); boolean is_cntrl = STREQ (str, "cntrl"); boolean is_digit = STREQ (str, "digit"); boolean is_graph = STREQ (str, "graph"); boolean is_lower = STREQ (str, "lower"); boolean is_print = STREQ (str, "print"); boolean is_punct = STREQ (str, "punct"); boolean is_space = STREQ (str, "space"); boolean is_upper = STREQ (str, "upper"); boolean is_xdigit = STREQ (str, "xdigit"); if (!IS_CHAR_CLASS (str)) FREE_STACK_RETURN (REG_ECTYPE); /* Throw away the ] at the end of the character class. */ PATFETCH (c); if (p == pend) FREE_STACK_RETURN (REG_EBRACK); for (ch = 0; ch < 1 << BYTEWIDTH; ch++) { /* This was split into 3 if's to avoid an arbitrary limit in some compiler. */ if ( (is_alnum && ISALNUM (ch)) || (is_alpha && ISALPHA (ch)) || (is_blank && ISBLANK (ch)) || (is_cntrl && ISCNTRL (ch))) SET_LIST_BIT (ch); if ( (is_digit && ISDIGIT (ch)) || (is_graph && ISGRAPH (ch)) || (is_lower && ISLOWER (ch)) || (is_print && ISPRINT (ch))) SET_LIST_BIT (ch); if ( (is_punct && ISPUNCT (ch)) || (is_space && ISSPACE (ch)) || (is_upper && ISUPPER (ch)) || (is_xdigit && ISXDIGIT (ch))) SET_LIST_BIT (ch); } had_char_class = true; } else { c1++; while (c1--) PATUNFETCH; SET_LIST_BIT ('['); SET_LIST_BIT (':'); had_char_class = false; } } else { had_char_class = false; SET_LIST_BIT (c); } } /* Discard any (non)matching list bytes that are all 0 at the end of the map. Decrease the map-length byte too. */ while ((int) b[-1] > 0 && b[b[-1] - 1] == 0) b[-1]--; b += b[-1]; } break; case '(': if (syntax & RE_NO_BK_PARENS) goto handle_open; else goto normal_char; case ')': if (syntax & RE_NO_BK_PARENS) goto handle_close; else goto normal_char; case '\n': if (syntax & RE_NEWLINE_ALT) goto handle_alt; else goto normal_char; case '|': if (syntax & RE_NO_BK_VBAR) goto handle_alt; else goto normal_char; case '{': if (syntax & RE_INTERVALS && syntax & RE_NO_BK_BRACES) goto handle_interval; else goto normal_char; case '\\': if (p == pend) FREE_STACK_RETURN (REG_EESCAPE); /* Do not translate the character after the \, so that we can distinguish, e.g., \B from \b, even if we normally would translate, e.g., B to b. */ PATFETCH_RAW (c); switch (c) { case '(': if (syntax & RE_NO_BK_PARENS) goto normal_backslash; handle_open: bufp->re_nsub++; regnum++; if (COMPILE_STACK_FULL) { RETALLOC (compile_stack.stack, compile_stack.size << 1, compile_stack_elt_t); if (compile_stack.stack == NULL) return REG_ESPACE; compile_stack.size <<= 1; } /* These are the values to restore when we hit end of this group. They are all relative offsets, so that if the whole pattern moves because of realloc, they will still be valid. */ COMPILE_STACK_TOP.begalt_offset = begalt - bufp->buffer; COMPILE_STACK_TOP.fixup_alt_jump = fixup_alt_jump ? fixup_alt_jump - bufp->buffer + 1 : 0; COMPILE_STACK_TOP.laststart_offset = b - bufp->buffer; COMPILE_STACK_TOP.regnum = regnum; /* We will eventually replace the 0 with the number of groups inner to this one. But do not push a start_memory for groups beyond the last one we can represent in the compiled pattern. */ if (regnum <= MAX_REGNUM) { COMPILE_STACK_TOP.inner_group_offset = b - bufp->buffer + 2; BUF_PUSH_3 (start_memory, regnum, 0); } compile_stack.avail++; fixup_alt_jump = 0; laststart = 0; begalt = b; /* If we've reached MAX_REGNUM groups, then this open won't actually generate any code, so we'll have to clear pending_exact explicitly. */ pending_exact = 0; break; case ')': if (syntax & RE_NO_BK_PARENS) goto normal_backslash; if (COMPILE_STACK_EMPTY) if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD) goto normal_backslash; else FREE_STACK_RETURN (REG_ERPAREN); handle_close: if (fixup_alt_jump) { /* Push a dummy failure point at the end of the alternative for a possible future `pop_failure_jump' to pop. See comments at `push_dummy_failure' in `re_match_2'. */ BUF_PUSH (push_dummy_failure); /* We allocated space for this jump when we assigned to `fixup_alt_jump', in the `handle_alt' case below. */ STORE_JUMP (jump_past_alt, fixup_alt_jump, b - 1); } /* See similar code for backslashed left paren above. */ if (COMPILE_STACK_EMPTY) if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD) goto normal_char; else FREE_STACK_RETURN (REG_ERPAREN); /* Since we just checked for an empty stack above, this ``can't happen''. */ assert (compile_stack.avail != 0); { /* We don't just want to restore into `regnum', because later groups should continue to be numbered higher, as in `(ab)c(de)' -- the second group is #2. */ regnum_t this_group_regnum; compile_stack.avail--; begalt = bufp->buffer + COMPILE_STACK_TOP.begalt_offset; fixup_alt_jump = COMPILE_STACK_TOP.fixup_alt_jump ? bufp->buffer + COMPILE_STACK_TOP.fixup_alt_jump - 1 : 0; laststart = bufp->buffer + COMPILE_STACK_TOP.laststart_offset; this_group_regnum = COMPILE_STACK_TOP.regnum; /* If we've reached MAX_REGNUM groups, then this open won't actually generate any code, so we'll have to clear pending_exact explicitly. */ pending_exact = 0; /* We're at the end of the group, so now we know how many groups were inside this one. */ if (this_group_regnum <= MAX_REGNUM) { unsigned char *inner_group_loc = bufp->buffer + COMPILE_STACK_TOP.inner_group_offset; *inner_group_loc = regnum - this_group_regnum; BUF_PUSH_3 (stop_memory, this_group_regnum, regnum - this_group_regnum); } } break; case '|': /* `\|'. */ if (syntax & RE_LIMITED_OPS || syntax & RE_NO_BK_VBAR) goto normal_backslash; handle_alt: if (syntax & RE_LIMITED_OPS) goto normal_char; /* Insert before the previous alternative a jump which jumps to this alternative if the former fails. */ GET_BUFFER_SPACE (3); INSERT_JUMP (on_failure_jump, begalt, b + 6); pending_exact = 0; b += 3; /* The alternative before this one has a jump after it which gets executed if it gets matched. Adjust that jump so it will jump to this alternative's analogous jump (put in below, which in turn will jump to the next (if any) alternative's such jump, etc.). The last such jump jumps to the correct final destination. A picture: _____ _____ | | | | | v | v a | b | c If we are at `b', then fixup_alt_jump right now points to a three-byte space after `a'. We'll put in the jump, set fixup_alt_jump to right after `b', and leave behind three bytes which we'll fill in when we get to after `c'. */ if (fixup_alt_jump) STORE_JUMP (jump_past_alt, fixup_alt_jump, b); /* Mark and leave space for a jump after this alternative, to be filled in later either by next alternative or when know we're at the end of a series of alternatives. */ fixup_alt_jump = b; GET_BUFFER_SPACE (3); b += 3; laststart = 0; begalt = b; break; case '{': /* If \{ is a literal. */ if (!(syntax & RE_INTERVALS) /* If we're at `\{' and it's not the open-interval operator. */ || ((syntax & RE_INTERVALS) && (syntax & RE_NO_BK_BRACES)) || (p - 2 == pattern && p == pend)) goto normal_backslash; handle_interval: { /* If got here, then the syntax allows intervals. */ /* At least (most) this many matches must be made. */ int lower_bound = -1, upper_bound = -1; beg_interval = p - 1; if (p == pend) { if (syntax & RE_NO_BK_BRACES) goto unfetch_interval; else FREE_STACK_RETURN (REG_EBRACE); } GET_UNSIGNED_NUMBER (lower_bound); if (c == ',') { GET_UNSIGNED_NUMBER (upper_bound); if (upper_bound < 0) upper_bound = RE_DUP_MAX; } else /* Interval such as `{1}' => match exactly once. */ upper_bound = lower_bound; if (lower_bound < 0 || upper_bound > RE_DUP_MAX || lower_bound > upper_bound) { if (syntax & RE_NO_BK_BRACES) goto unfetch_interval; else FREE_STACK_RETURN (REG_BADBR); } if (!(syntax & RE_NO_BK_BRACES)) { if (c != '\\') FREE_STACK_RETURN (REG_EBRACE); PATFETCH (c); } if (c != '}') { if (syntax & RE_NO_BK_BRACES) goto unfetch_interval; else FREE_STACK_RETURN (REG_BADBR); } /* We just parsed a valid interval. */ /* If it's invalid to have no preceding re. */ if (!laststart) { if (syntax & RE_CONTEXT_INVALID_OPS) FREE_STACK_RETURN (REG_BADRPT); else if (syntax & RE_CONTEXT_INDEP_OPS) laststart = b; else goto unfetch_interval; } /* If the upper bound is zero, don't want to succeed at all; jump from `laststart' to `b + 3', which will be the end of the buffer after we insert the jump. */ if (upper_bound == 0) { GET_BUFFER_SPACE (3); INSERT_JUMP (jump, laststart, b + 3); b += 3; } /* Otherwise, we have a nontrivial interval. When we're all done, the pattern will look like: set_number_at set_number_at succeed_n jump_n (The upper bound and `jump_n' are omitted if `upper_bound' is 1, though.) */ else { /* If the upper bound is > 1, we need to insert more at the end of the loop. */ unsigned nbytes = 10 + (upper_bound > 1) * 10; GET_BUFFER_SPACE (nbytes); /* Initialize lower bound of the `succeed_n', even though it will be set during matching by its attendant `set_number_at' (inserted next), because `re_compile_fastmap' needs to know. Jump to the `jump_n' we might insert below. */ INSERT_JUMP2 (succeed_n, laststart, b + 5 + (upper_bound > 1) * 5, lower_bound); b += 5; /* Code to initialize the lower bound. Insert before the `succeed_n'. The `5' is the last two bytes of this `set_number_at', plus 3 bytes of the following `succeed_n'. */ insert_op2 (set_number_at, laststart, 5, lower_bound, b); b += 5; if (upper_bound > 1) { /* More than one repetition is allowed, so append a backward jump to the `succeed_n' that starts this interval. When we've reached this during matching, we'll have matched the interval once, so jump back only `upper_bound - 1' times. */ STORE_JUMP2 (jump_n, b, laststart + 5, upper_bound - 1); b += 5; /* The location we want to set is the second parameter of the `jump_n'; that is `b-2' as an absolute address. `laststart' will be the `set_number_at' we're about to insert; `laststart+3' the number to set, the source for the relative address. But we are inserting into the middle of the pattern -- so everything is getting moved up by 5. Conclusion: (b - 2) - (laststart + 3) + 5, i.e., b - laststart. We insert this at the beginning of the loop so that if we fail during matching, we'll reinitialize the bounds. */ insert_op2 (set_number_at, laststart, b - laststart, upper_bound - 1, b); b += 5; } } pending_exact = 0; beg_interval = NULL; } break; unfetch_interval: /* If an invalid interval, match the characters as literals. */ assert (beg_interval); p = beg_interval; beg_interval = NULL; /* normal_char and normal_backslash need `c'. */ PATFETCH (c); if (!(syntax & RE_NO_BK_BRACES)) { if (p > pattern && p[-1] == '\\') goto normal_backslash; } goto normal_char; #ifdef emacs /* There is no way to specify the before_dot and after_dot operators. rms says this is ok. --karl */ case '=': BUF_PUSH (at_dot); break; case 's': laststart = b; PATFETCH (c); BUF_PUSH_2 (syntaxspec, syntax_spec_code[c]); break; case 'S': laststart = b; PATFETCH (c); BUF_PUSH_2 (notsyntaxspec, syntax_spec_code[c]); break; #endif /* emacs */ case 'w': laststart = b; BUF_PUSH (wordchar); break; case 'W': laststart = b; BUF_PUSH (notwordchar); break; case '<': BUF_PUSH (wordbeg); break; case '>': BUF_PUSH (wordend); break; case 'b': BUF_PUSH (wordbound); break; case 'B': BUF_PUSH (notwordbound); break; case '`': BUF_PUSH (begbuf); break; case '\'': BUF_PUSH (endbuf); break; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (syntax & RE_NO_BK_REFS) goto normal_char; c1 = c - '0'; if (c1 > regnum) FREE_STACK_RETURN (REG_ESUBREG); /* Can't back reference to a subexpression if inside of it. */ if (group_in_compile_stack (compile_stack, c1)) goto normal_char; laststart = b; BUF_PUSH_2 (duplicate, c1); break; case '+': case '?': if (syntax & RE_BK_PLUS_QM) goto handle_plus; else goto normal_backslash; default: normal_backslash: /* You might think it would be useful for \ to mean not to translate; but if we don't translate it it will never match anything. */ c = TRANSLATE (c); goto normal_char; } break; default: /* Expects the character in `c'. */ normal_char: /* If no exactn currently being built. */ if (!pending_exact /* If last exactn not at current position. */ || pending_exact + *pending_exact + 1 != b /* We have only one byte following the exactn for the count. */ || *pending_exact == (1 << BYTEWIDTH) - 1 /* If followed by a repetition operator. */ || *p == '*' || *p == '^' || ((syntax & RE_BK_PLUS_QM) ? *p == '\\' && (p[1] == '+' || p[1] == '?') : (*p == '+' || *p == '?')) || ((syntax & RE_INTERVALS) && ((syntax & RE_NO_BK_BRACES) ? *p == '{' : (p[0] == '\\' && p[1] == '{')))) { /* Start building a new exactn. */ laststart = b; BUF_PUSH_2 (exactn, 0); pending_exact = b - 1; } BUF_PUSH (c); (*pending_exact)++; break; } /* switch (c) */ } /* while p != pend */ /* Through the pattern now. */ if (fixup_alt_jump) STORE_JUMP (jump_past_alt, fixup_alt_jump, b); if (!COMPILE_STACK_EMPTY) FREE_STACK_RETURN (REG_EPAREN); /* If we don't want backtracking, force success the first time we reach the end of the compiled pattern. */ if (syntax & RE_NO_POSIX_BACKTRACKING) BUF_PUSH (succeed); free (compile_stack.stack); /* We have succeeded; set the length of the buffer. */ bufp->used = b - bufp->buffer; #ifdef DEBUG if (debug) { DEBUG_PRINT1 ("\nCompiled pattern: \n"); print_compiled_pattern (bufp); } #endif /* DEBUG */ #ifndef MATCH_MAY_ALLOCATE /* Initialize the failure stack to the largest possible stack. This isn't necessary unless we're trying to avoid calling alloca in the search and match routines. */ { int num_regs = bufp->re_nsub + 1; /* Since DOUBLE_FAIL_STACK refuses to double only if the current size is strictly greater than re_max_failures, the largest possible stack is 2 * re_max_failures failure points. */ if (fail_stack.size < (2 * re_max_failures * MAX_FAILURE_ITEMS)) { fail_stack.size = (2 * re_max_failures * MAX_FAILURE_ITEMS); #ifdef emacs if (! fail_stack.stack) fail_stack.stack = (fail_stack_elt_t *) xmalloc (fail_stack.size * sizeof (fail_stack_elt_t)); else fail_stack.stack = (fail_stack_elt_t *) xrealloc (fail_stack.stack, (fail_stack.size * sizeof (fail_stack_elt_t))); #else /* not emacs */ if (! fail_stack.stack) fail_stack.stack = (fail_stack_elt_t *) malloc (fail_stack.size * sizeof (fail_stack_elt_t)); else fail_stack.stack = (fail_stack_elt_t *) realloc (fail_stack.stack, (fail_stack.size * sizeof (fail_stack_elt_t))); #endif /* not emacs */ } regex_grow_registers (num_regs); } #endif /* not MATCH_MAY_ALLOCATE */ return REG_NOERROR; } /* regex_compile */ /* Subroutines for `regex_compile'. */ /* Store OP at LOC followed by two-byte integer parameter ARG. */ static void store_op1 (op, loc, arg) re_opcode_t op; unsigned char *loc; int arg; { *loc = (unsigned char) op; STORE_NUMBER (loc + 1, arg); } /* Like `store_op1', but for two two-byte parameters ARG1 and ARG2. */ static void store_op2 (op, loc, arg1, arg2) re_opcode_t op; unsigned char *loc; int arg1, arg2; { *loc = (unsigned char) op; STORE_NUMBER (loc + 1, arg1); STORE_NUMBER (loc + 3, arg2); } /* Copy the bytes from LOC to END to open up three bytes of space at LOC for OP followed by two-byte integer parameter ARG. */ static void insert_op1 (op, loc, arg, end) re_opcode_t op; unsigned char *loc; int arg; unsigned char *end; { register unsigned char *pfrom = end; register unsigned char *pto = end + 3; while (pfrom != loc) *--pto = *--pfrom; store_op1 (op, loc, arg); } /* Like `insert_op1', but for two two-byte parameters ARG1 and ARG2. */ static void insert_op2 (op, loc, arg1, arg2, end) re_opcode_t op; unsigned char *loc; int arg1, arg2; unsigned char *end; { register unsigned char *pfrom = end; register unsigned char *pto = end + 5; while (pfrom != loc) *--pto = *--pfrom; store_op2 (op, loc, arg1, arg2); } /* P points to just after a ^ in PATTERN. Return true if that ^ comes after an alternative or a begin-subexpression. We assume there is at least one character before the ^. */ static boolean at_begline_loc_p (pattern, p, syntax) const char *pattern, *p; reg_syntax_t syntax; { const char *prev = p - 2; boolean prev_prev_backslash = prev > pattern && prev[-1] == '\\'; return /* After a subexpression? */ (*prev == '(' && (syntax & RE_NO_BK_PARENS || prev_prev_backslash)) /* After an alternative? */ || (*prev == '|' && (syntax & RE_NO_BK_VBAR || prev_prev_backslash)); } /* The dual of at_begline_loc_p. This one is for $. We assume there is at least one character after the $, i.e., `P < PEND'. */ static boolean at_endline_loc_p (p, pend, syntax) const char *p, *pend; int syntax; { const char *next = p; boolean next_backslash = *next == '\\'; const char *next_next = p + 1 < pend ? p + 1 : NULL; return /* Before a subexpression? */ (syntax & RE_NO_BK_PARENS ? *next == ')' : next_backslash && next_next && *next_next == ')') /* Before an alternative? */ || (syntax & RE_NO_BK_VBAR ? *next == '|' : next_backslash && next_next && *next_next == '|'); } /* Returns true if REGNUM is in one of COMPILE_STACK's elements and false if it's not. */ static boolean group_in_compile_stack (compile_stack, regnum) compile_stack_type compile_stack; regnum_t regnum; { int this_element; for (this_element = compile_stack.avail - 1; this_element >= 0; this_element--) if (compile_stack.stack[this_element].regnum == regnum) return true; return false; } /* Read the ending character of a range (in a bracket expression) from the uncompiled pattern *P_PTR (which ends at PEND). We assume the starting character is in `P[-2]'. (`P[-1]' is the character `-'.) Then we set the translation of all bits between the starting and ending characters (inclusive) in the compiled pattern B. Return an error code. We use these short variable names so we can use the same macros as `regex_compile' itself. */ static reg_errcode_t compile_range (p_ptr, pend, translate, syntax, b) const char **p_ptr, *pend; char *translate; reg_syntax_t syntax; unsigned char *b; { unsigned this_char; const char *p = *p_ptr; int range_start, range_end; if (p == pend) return REG_ERANGE; /* Even though the pattern is a signed `char *', we need to fetch with unsigned char *'s; if the high bit of the pattern character is set, the range endpoints will be negative if we fetch using a signed char *. We also want to fetch the endpoints without translating them; the appropriate translation is done in the bit-setting loop below. */ /* The SVR4 compiler on the 3B2 had trouble with unsigned const char *. */ range_start = ((const unsigned char *) p)[-2]; range_end = ((const unsigned char *) p)[0]; /* Have to increment the pointer into the pattern string, so the caller isn't still at the ending character. */ (*p_ptr)++; /* If the start is after the end, the range is empty. */ if (range_start > range_end) return syntax & RE_NO_EMPTY_RANGES ? REG_ERANGE : REG_NOERROR; /* Here we see why `this_char' has to be larger than an `unsigned char' -- the range is inclusive, so if `range_end' == 0xff (assuming 8-bit characters), we would otherwise go into an infinite loop, since all characters <= 0xff. */ for (this_char = range_start; this_char <= range_end; this_char++) { SET_LIST_BIT (TRANSLATE (this_char)); } return REG_NOERROR; } /* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in BUFP. A fastmap records which of the (1 << BYTEWIDTH) possible characters can start a string that matches the pattern. This fastmap is used by re_search to skip quickly over impossible starting points. The caller must supply the address of a (1 << BYTEWIDTH)-byte data area as BUFP->fastmap. We set the `fastmap', `fastmap_accurate', and `can_be_null' fields in the pattern buffer. Returns 0 if we succeed, -2 if an internal error. */ int re_compile_fastmap (bufp) struct re_pattern_buffer *bufp; { int j, k; #ifdef MATCH_MAY_ALLOCATE fail_stack_type fail_stack; #endif #ifndef REGEX_MALLOC char *destination; #endif /* We don't push any register information onto the failure stack. */ unsigned num_regs = 0; register char *fastmap = bufp->fastmap; unsigned char *pattern = bufp->buffer; unsigned long size = bufp->used; unsigned char *p = pattern; register unsigned char *pend = pattern + size; /* This holds the pointer to the failure stack, when it is allocated relocatably. */ fail_stack_elt_t *failure_stack_ptr; /* Assume that each path through the pattern can be null until proven otherwise. We set this false at the bottom of switch statement, to which we get only if a particular path doesn't match the empty string. */ boolean path_can_be_null = true; /* We aren't doing a `succeed_n' to begin with. */ boolean succeed_n_p = false; assert (fastmap != NULL && p != NULL); INIT_FAIL_STACK (); bzero (fastmap, 1 << BYTEWIDTH); /* Assume nothing's valid. */ bufp->fastmap_accurate = 1; /* It will be when we're done. */ bufp->can_be_null = 0; while (1) { if (p == pend || *p == succeed) { /* We have reached the (effective) end of pattern. */ if (!FAIL_STACK_EMPTY ()) { bufp->can_be_null |= path_can_be_null; /* Reset for next path. */ path_can_be_null = true; p = fail_stack.stack[--fail_stack.avail].pointer; continue; } else break; } /* We should never be about to go beyond the end of the pattern. */ assert (p < pend); switch (SWITCH_ENUM_CAST ((re_opcode_t) *p++)) { /* I guess the idea here is to simply not bother with a fastmap if a backreference is used, since it's too hard to figure out the fastmap for the corresponding group. Setting `can_be_null' stops `re_search_2' from using the fastmap, so that is all we do. */ case duplicate: bufp->can_be_null = 1; goto done; /* Following are the cases which match a character. These end with `break'. */ case exactn: fastmap[p[1]] = 1; break; case charset: for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--) if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))) fastmap[j] = 1; break; case charset_not: /* Chars beyond end of map must be allowed. */ for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++) fastmap[j] = 1; for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--) if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))) fastmap[j] = 1; break; case wordchar: for (j = 0; j < (1 << BYTEWIDTH); j++) if (SYNTAX (j) == Sword) fastmap[j] = 1; break; case notwordchar: for (j = 0; j < (1 << BYTEWIDTH); j++) if (SYNTAX (j) != Sword) fastmap[j] = 1; break; case anychar: { int fastmap_newline = fastmap['\n']; /* `.' matches anything ... */ for (j = 0; j < (1 << BYTEWIDTH); j++) fastmap[j] = 1; /* ... except perhaps newline. */ if (!(bufp->syntax & RE_DOT_NEWLINE)) fastmap['\n'] = fastmap_newline; /* Return if we have already set `can_be_null'; if we have, then the fastmap is irrelevant. Something's wrong here. */ else if (bufp->can_be_null) goto done; /* Otherwise, have to check alternative paths. */ break; } #ifdef emacs case syntaxspec: k = *p++; for (j = 0; j < (1 << BYTEWIDTH); j++) if (SYNTAX (j) == (enum syntaxcode) k) fastmap[j] = 1; break; case notsyntaxspec: k = *p++; for (j = 0; j < (1 << BYTEWIDTH); j++) if (SYNTAX (j) != (enum syntaxcode) k) fastmap[j] = 1; break; /* All cases after this match the empty string. These end with `continue'. */ case before_dot: case at_dot: case after_dot: continue; #endif /* not emacs */ case no_op: case begline: case endline: case begbuf: case endbuf: case wordbound: case notwordbound: case wordbeg: case wordend: case push_dummy_failure: continue; case jump_n: case pop_failure_jump: case maybe_pop_jump: case jump: case jump_past_alt: case dummy_failure_jump: EXTRACT_NUMBER_AND_INCR (j, p); p += j; if (j > 0) continue; /* Jump backward implies we just went through the body of a loop and matched nothing. Opcode jumped to should be `on_failure_jump' or `succeed_n'. Just treat it like an ordinary jump. For a * loop, it has pushed its failure point already; if so, discard that as redundant. */ if ((re_opcode_t) *p != on_failure_jump && (re_opcode_t) *p != succeed_n) continue; p++; EXTRACT_NUMBER_AND_INCR (j, p); p += j; /* If what's on the stack is where we are now, pop it. */ if (!FAIL_STACK_EMPTY () && fail_stack.stack[fail_stack.avail - 1].pointer == p) fail_stack.avail--; continue; case on_failure_jump: case on_failure_keep_string_jump: handle_on_failure_jump: EXTRACT_NUMBER_AND_INCR (j, p); /* For some patterns, e.g., `(a?)?', `p+j' here points to the end of the pattern. We don't want to push such a point, since when we restore it above, entering the switch will increment `p' past the end of the pattern. We don't need to push such a point since we obviously won't find any more fastmap entries beyond `pend'. Such a pattern can match the null string, though. */ if (p + j < pend) { if (!PUSH_PATTERN_OP (p + j, fail_stack)) { RESET_FAIL_STACK (); return -2; } } else bufp->can_be_null = 1; if (succeed_n_p) { EXTRACT_NUMBER_AND_INCR (k, p); /* Skip the n. */ succeed_n_p = false; } continue; case succeed_n: /* Get to the number of times to succeed. */ p += 2; /* Increment p past the n for when k != 0. */ EXTRACT_NUMBER_AND_INCR (k, p); if (k == 0) { p -= 4; succeed_n_p = true; /* Spaghetti code alert. */ goto handle_on_failure_jump; } continue; case set_number_at: p += 4; continue; case start_memory: case stop_memory: p += 2; continue; default: abort (); /* We have listed all the cases. */ } /* switch *p++ */ /* Getting here means we have found the possible starting characters for one path of the pattern -- and that the empty string does not match. We need not follow this path further. Instead, look at the next alternative (remembered on the stack), or quit if no more. The test at the top of the loop does these things. */ path_can_be_null = false; p = pend; } /* while p */ /* Set `can_be_null' for the last path (also the first path, if the pattern is empty). */ bufp->can_be_null |= path_can_be_null; done: RESET_FAIL_STACK (); return 0; } /* re_compile_fastmap */ /* Set REGS to hold NUM_REGS registers, storing them in STARTS and ENDS. Subsequent matches using PATTERN_BUFFER and REGS will use this memory for recording register information. STARTS and ENDS must be allocated using the malloc library routine, and must each be at least NUM_REGS * sizeof (regoff_t) bytes long. If NUM_REGS == 0, then subsequent matches should allocate their own register data. Unless this function is called, the first search or match using PATTERN_BUFFER will allocate its own register data, without freeing the old data. */ void re_set_registers (bufp, regs, num_regs, starts, ends) struct re_pattern_buffer *bufp; struct re_registers *regs; unsigned num_regs; regoff_t *starts, *ends; { if (num_regs) { bufp->regs_allocated = REGS_REALLOCATE; regs->num_regs = num_regs; regs->start = starts; regs->end = ends; } else { bufp->regs_allocated = REGS_UNALLOCATED; regs->num_regs = 0; regs->start = regs->end = (regoff_t *) 0; } } /* Searching routines. */ /* Like re_search_2, below, but only one string is specified, and doesn't let you say where to stop matching. */ int re_search (bufp, string, size, startpos, range, regs) struct re_pattern_buffer *bufp; const char *string; int size, startpos, range; struct re_registers *regs; { return re_search_2 (bufp, NULL, 0, string, size, startpos, range, regs, size); } /* Using the compiled pattern in BUFP->buffer, first tries to match the virtual concatenation of STRING1 and STRING2, starting first at index STARTPOS, then at STARTPOS + 1, and so on. STRING1 and STRING2 have length SIZE1 and SIZE2, respectively. RANGE is how far to scan while trying to match. RANGE = 0 means try only at STARTPOS; in general, the last start tried is STARTPOS + RANGE. In REGS, return the indices of the virtual concatenation of STRING1 and STRING2 that matched the entire BUFP->buffer and its contained subexpressions. Do not consider matching one past the index STOP in the virtual concatenation of STRING1 and STRING2. We return either the position in the strings at which the match was found, -1 if no match, or -2 if error (such as failure stack overflow). */ int re_search_2 (bufp, string1, size1, string2, size2, startpos, range, regs, stop) struct re_pattern_buffer *bufp; const char *string1, *string2; int size1, size2; int startpos; int range; struct re_registers *regs; int stop; { int val; register char *fastmap = bufp->fastmap; register char *translate = bufp->translate; int total_size = size1 + size2; int endpos = startpos + range; /* Check for out-of-range STARTPOS. */ if (startpos < 0 || startpos > total_size) return -1; /* Fix up RANGE if it might eventually take us outside the virtual concatenation of STRING1 and STRING2. */ if (endpos < -1) range = -1 - startpos; else if (endpos > total_size) range = total_size - startpos; /* If the search isn't to be a backwards one, don't waste time in a search for a pattern that must be anchored. */ if (bufp->used > 0 && (re_opcode_t) bufp->buffer[0] == begbuf && range > 0) { if (startpos > 0) return -1; else range = 1; } /* Update the fastmap now if not correct already. */ if (fastmap && !bufp->fastmap_accurate) if (re_compile_fastmap (bufp) == -2) return -2; /* Loop through the string, looking for a place to start matching. */ for (;;) { /* If a fastmap is supplied, skip quickly over characters that cannot be the start of a match. If the pattern can match the null string, however, we don't need to skip characters; we want the first null string. */ if (fastmap && startpos < total_size && !bufp->can_be_null) { if (range > 0) /* Searching forwards. */ { register const char *d; register int lim = 0; int irange = range; if (startpos < size1 && startpos + range >= size1) lim = range - (size1 - startpos); d = (startpos >= size1 ? string2 - size1 : string1) + startpos; /* Written out as an if-else to avoid testing `translate' inside the loop. */ if (translate) while (range > lim && !fastmap[(unsigned char) translate[(unsigned char) *d++]]) range--; else while (range > lim && !fastmap[(unsigned char) *d++]) range--; startpos += irange - range; } else /* Searching backwards. */ { register char c = (size1 == 0 || startpos >= size1 ? string2[startpos - size1] : string1[startpos]); if (!fastmap[(unsigned char) TRANSLATE (c)]) goto advance; } } /* If can't match the null string, and that's all we have left, fail. */ if (range >= 0 && startpos == total_size && fastmap && !bufp->can_be_null) return -1; val = re_match_2_internal (bufp, string1, size1, string2, size2, startpos, regs, stop); #ifndef REGEX_MALLOC #ifdef C_ALLOCA alloca (0); #endif #endif if (val >= 0) return startpos; if (val == -2) return -2; advance: if (!range) break; else if (range > 0) { range--; startpos++; } else { range++; startpos--; } } return -1; } /* re_search_2 */ /* Declarations and macros for re_match_2. */ static int bcmp_translate (); static boolean alt_match_null_string_p (), common_op_match_null_string_p (), group_match_null_string_p (); /* This converts PTR, a pointer into one of the search strings `string1' and `string2' into an offset from the beginning of that string. */ #define POINTER_TO_OFFSET(ptr) \ (FIRST_STRING_P (ptr) \ ? ((regoff_t) ((ptr) - string1)) \ : ((regoff_t) ((ptr) - string2 + size1))) /* Macros for dealing with the split strings in re_match_2. */ #define MATCHING_IN_FIRST_STRING (dend == end_match_1) /* Call before fetching a character with *d. This switches over to string2 if necessary. */ #define PREFETCH() \ while (d == dend) \ { \ /* End of string2 => fail. */ \ if (dend == end_match_2) \ goto fail; \ /* End of string1 => advance to string2. */ \ d = string2; \ dend = end_match_2; \ } /* Test if at very beginning or at very end of the virtual concatenation of `string1' and `string2'. If only one string, it's `string2'. */ #define AT_STRINGS_BEG(d) ((d) == (size1 ? string1 : string2) || !size2) #define AT_STRINGS_END(d) ((d) == end2) /* Test if D points to a character which is word-constituent. We have two special cases to check for: if past the end of string1, look at the first character in string2; and if before the beginning of string2, look at the last character in string1. */ #define WORDCHAR_P(d) \ (SYNTAX ((d) == end1 ? *string2 \ : (d) == string2 - 1 ? *(end1 - 1) : *(d)) \ == Sword) /* Test if the character before D and the one at D differ with respect to being word-constituent. */ #define AT_WORD_BOUNDARY(d) \ (AT_STRINGS_BEG (d) || AT_STRINGS_END (d) \ || WORDCHAR_P (d - 1) != WORDCHAR_P (d)) /* Free everything we malloc. */ #ifdef MATCH_MAY_ALLOCATE #define FREE_VAR(var) if (var) REGEX_FREE (var); var = NULL #define FREE_VARIABLES() \ do { \ REGEX_FREE_STACK (fail_stack.stack); \ FREE_VAR (regstart); \ FREE_VAR (regend); \ FREE_VAR (old_regstart); \ FREE_VAR (old_regend); \ FREE_VAR (best_regstart); \ FREE_VAR (best_regend); \ FREE_VAR (reg_info); \ FREE_VAR (reg_dummy); \ FREE_VAR (reg_info_dummy); \ } while (0) #else #define FREE_VARIABLES() ((void)0) /* Do nothing! But inhibit gcc warning. */ #endif /* not MATCH_MAY_ALLOCATE */ /* These values must meet several constraints. They must not be valid register values; since we have a limit of 255 registers (because we use only one byte in the pattern for the register number), we can use numbers larger than 255. They must differ by 1, because of NUM_FAILURE_ITEMS above. And the value for the lowest register must be larger than the value for the highest register, so we do not try to actually save any registers when none are active. */ #define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH) #define NO_LOWEST_ACTIVE_REG (NO_HIGHEST_ACTIVE_REG + 1) /* Matching routines. */ #ifndef emacs /* Emacs never uses this. */ /* re_match is like re_match_2 except it takes only a single string. */ int re_match (bufp, string, size, pos, regs) struct re_pattern_buffer *bufp; const char *string; int size, pos; struct re_registers *regs; { int result = re_match_2_internal (bufp, NULL, 0, string, size, pos, regs, size); alloca (0); return result; } #endif /* not emacs */ /* re_match_2 matches the compiled pattern in BUFP against the the (virtual) concatenation of STRING1 and STRING2 (of length SIZE1 and SIZE2, respectively). We start matching at POS, and stop matching at STOP. If REGS is non-null and the `no_sub' field of BUFP is nonzero, we store offsets for the substring each group matched in REGS. See the documentation for exactly how many groups we fill. We return -1 if no match, -2 if an internal error (such as the failure stack overflowing). Otherwise, we return the length of the matched substring. */ int re_match_2 (bufp, string1, size1, string2, size2, pos, regs, stop) struct re_pattern_buffer *bufp; const char *string1, *string2; int size1, size2; int pos; struct re_registers *regs; int stop; { int result = re_match_2_internal (bufp, string1, size1, string2, size2, pos, regs, stop); alloca (0); return result; } /* This is a separate function so that we can force an alloca cleanup afterwards. */ static int re_match_2_internal (bufp, string1, size1, string2, size2, pos, regs, stop) struct re_pattern_buffer *bufp; const char *string1, *string2; int size1, size2; int pos; struct re_registers *regs; int stop; { /* General temporaries. */ int mcnt; unsigned char *p1; /* Just past the end of the corresponding string. */ const char *end1, *end2; /* Pointers into string1 and string2, just past the last characters in each to consider matching. */ const char *end_match_1, *end_match_2; /* Where we are in the data, and the end of the current string. */ const char *d, *dend; /* Where we are in the pattern, and the end of the pattern. */ unsigned char *p = bufp->buffer; register unsigned char *pend = p + bufp->used; /* Mark the opcode just after a start_memory, so we can test for an empty subpattern when we get to the stop_memory. */ unsigned char *just_past_start_mem = 0; /* We use this to map every character in the string. */ char *translate = bufp->translate; /* Failure point stack. Each place that can handle a failure further down the line pushes a failure point on this stack. It consists of restart, regend, and reg_info for all registers corresponding to the subexpressions we're currently inside, plus the number of such registers, and, finally, two char *'s. The first char * is where to resume scanning the pattern; the second one is where to resume scanning the strings. If the latter is zero, the failure point is a ``dummy''; if a failure happens and the failure point is a dummy, it gets discarded and the next next one is tried. */ #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */ fail_stack_type fail_stack; #endif #ifdef DEBUG static unsigned failure_id = 0; unsigned nfailure_points_pushed = 0, nfailure_points_popped = 0; #endif /* This holds the pointer to the failure stack, when it is allocated relocatably. */ fail_stack_elt_t *failure_stack_ptr; /* We fill all the registers internally, independent of what we return, for use in backreferences. The number here includes an element for register zero. */ unsigned num_regs = bufp->re_nsub + 1; /* The currently active registers. */ unsigned lowest_active_reg = NO_LOWEST_ACTIVE_REG; unsigned highest_active_reg = NO_HIGHEST_ACTIVE_REG; /* Information on the contents of registers. These are pointers into the input strings; they record just what was matched (on this attempt) by a subexpression part of the pattern, that is, the regnum-th regstart pointer points to where in the pattern we began matching and the regnum-th regend points to right after where we stopped matching the regnum-th subexpression. (The zeroth register keeps track of what the whole pattern matches.) */ #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */ const char **regstart, **regend; #endif /* If a group that's operated upon by a repetition operator fails to match anything, then the register for its start will need to be restored because it will have been set to wherever in the string we are when we last see its open-group operator. Similarly for a register's end. */ #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */ const char **old_regstart, **old_regend; #endif /* The is_active field of reg_info helps us keep track of which (possibly nested) subexpressions we are currently in. The matched_something field of reg_info[reg_num] helps us tell whether or not we have matched any of the pattern so far this time through the reg_num-th subexpression. These two fields get reset each time through any loop their register is in. */ #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */ register_info_type *reg_info; #endif /* The following record the register info as found in the above variables when we find a match better than any we've seen before. This happens as we backtrack through the failure points, which in turn happens only if we have not yet matched the entire string. */ unsigned best_regs_set = false; #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */ const char **best_regstart, **best_regend; #endif /* Logically, this is `best_regend[0]'. But we don't want to have to allocate space for that if we're not allocating space for anything else (see below). Also, we never need info about register 0 for any of the other register vectors, and it seems rather a kludge to treat `best_regend' differently than the rest. So we keep track of the end of the best match so far in a separate variable. We initialize this to NULL so that when we backtrack the first time and need to test it, it's not garbage. */ const char *match_end = NULL; /* This helps SET_REGS_MATCHED avoid doing redundant work. */ int set_regs_matched_done = 0; /* Used when we pop values we don't care about. */ #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */ const char **reg_dummy; register_info_type *reg_info_dummy; #endif #ifdef DEBUG /* Counts the total number of registers pushed. */ unsigned num_regs_pushed = 0; #endif DEBUG_PRINT1 ("\n\nEntering re_match_2.\n"); INIT_FAIL_STACK (); #ifdef MATCH_MAY_ALLOCATE /* Do not bother to initialize all the register variables if there are no groups in the pattern, as it takes a fair amount of time. If there are groups, we include space for register 0 (the whole pattern), even though we never use it, since it simplifies the array indexing. We should fix this. */ if (bufp->re_nsub) { regstart = REGEX_TALLOC (num_regs, const char *); regend = REGEX_TALLOC (num_regs, const char *); old_regstart = REGEX_TALLOC (num_regs, const char *); old_regend = REGEX_TALLOC (num_regs, const char *); best_regstart = REGEX_TALLOC (num_regs, const char *); best_regend = REGEX_TALLOC (num_regs, const char *); reg_info = REGEX_TALLOC (num_regs, register_info_type); reg_dummy = REGEX_TALLOC (num_regs, const char *); reg_info_dummy = REGEX_TALLOC (num_regs, register_info_type); if (!(regstart && regend && old_regstart && old_regend && reg_info && best_regstart && best_regend && reg_dummy && reg_info_dummy)) { FREE_VARIABLES (); return -2; } } else { /* We must initialize all our variables to NULL, so that `FREE_VARIABLES' doesn't try to free them. */ regstart = regend = old_regstart = old_regend = best_regstart = best_regend = reg_dummy = NULL; reg_info = reg_info_dummy = (register_info_type *) NULL; } #endif /* MATCH_MAY_ALLOCATE */ /* The starting position is bogus. */ if (pos < 0 || pos > size1 + size2) { FREE_VARIABLES (); return -1; } /* Initialize subexpression text positions to -1 to mark ones that no start_memory/stop_memory has been seen for. Also initialize the register information struct. */ for (mcnt = 1; mcnt < num_regs; mcnt++) { regstart[mcnt] = regend[mcnt] = old_regstart[mcnt] = old_regend[mcnt] = REG_UNSET_VALUE; REG_MATCH_NULL_STRING_P (reg_info[mcnt]) = MATCH_NULL_UNSET_VALUE; IS_ACTIVE (reg_info[mcnt]) = 0; MATCHED_SOMETHING (reg_info[mcnt]) = 0; EVER_MATCHED_SOMETHING (reg_info[mcnt]) = 0; } /* We move `string1' into `string2' if the latter's empty -- but not if `string1' is null. */ if (size2 == 0 && string1 != NULL) { string2 = string1; size2 = size1; string1 = 0; size1 = 0; } end1 = string1 + size1; end2 = string2 + size2; /* Compute where to stop matching, within the two strings. */ if (stop <= size1) { end_match_1 = string1 + stop; end_match_2 = string2; } else { end_match_1 = end1; end_match_2 = string2 + stop - size1; } /* `p' scans through the pattern as `d' scans through the data. `dend' is the end of the input string that `d' points within. `d' is advanced into the following input string whenever necessary, but this happens before fetching; therefore, at the beginning of the loop, `d' can be pointing at the end of a string, but it cannot equal `string2'. */ if (size1 > 0 && pos <= size1) { d = string1 + pos; dend = end_match_1; } else { d = string2 + pos - size1; dend = end_match_2; } DEBUG_PRINT1 ("The compiled pattern is: "); DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend); DEBUG_PRINT1 ("The string to match is: `"); DEBUG_PRINT_DOUBLE_STRING (d, string1, size1, string2, size2); DEBUG_PRINT1 ("'\n"); /* This loops over pattern commands. It exits by returning from the function if the match is complete, or it drops through if the match fails at this starting point in the input data. */ for (;;) { DEBUG_PRINT2 ("\n0x%x: ", p); if (p == pend) { /* End of pattern means we might have succeeded. */ DEBUG_PRINT1 ("end of pattern ... "); /* If we haven't matched the entire string, and we want the longest match, try backtracking. */ if (d != end_match_2) { /* 1 if this match ends in the same string (string1 or string2) as the best previous match. */ boolean same_str_p = (FIRST_STRING_P (match_end) == MATCHING_IN_FIRST_STRING); /* 1 if this match is the best seen so far. */ boolean best_match_p; /* AIX compiler got confused when this was combined with the previous declaration. */ if (same_str_p) best_match_p = d > match_end; else best_match_p = !MATCHING_IN_FIRST_STRING; DEBUG_PRINT1 ("backtracking.\n"); if (!FAIL_STACK_EMPTY ()) { /* More failure points to try. */ /* If exceeds best match so far, save it. */ if (!best_regs_set || best_match_p) { best_regs_set = true; match_end = d; DEBUG_PRINT1 ("\nSAVING match as best so far.\n"); for (mcnt = 1; mcnt < num_regs; mcnt++) { best_regstart[mcnt] = regstart[mcnt]; best_regend[mcnt] = regend[mcnt]; } } goto fail; } /* If no failure points, don't restore garbage. And if last match is real best match, don't restore second best one. */ else if (best_regs_set && !best_match_p) { restore_best_regs: /* Restore best match. It may happen that `dend == end_match_1' while the restored d is in string2. For example, the pattern `x.*y.*z' against the strings `x-' and `y-z-', if the two strings are not consecutive in memory. */ DEBUG_PRINT1 ("Restoring best registers.\n"); d = match_end; dend = ((d >= string1 && d <= end1) ? end_match_1 : end_match_2); for (mcnt = 1; mcnt < num_regs; mcnt++) { regstart[mcnt] = best_regstart[mcnt]; regend[mcnt] = best_regend[mcnt]; } } } /* d != end_match_2 */ succeed_label: DEBUG_PRINT1 ("Accepting match.\n"); /* If caller wants register contents data back, do it. */ if (regs && !bufp->no_sub) { /* Have the register data arrays been allocated? */ if (bufp->regs_allocated == REGS_UNALLOCATED) { /* No. So allocate them with malloc. We need one extra element beyond `num_regs' for the `-1' marker GNU code uses. */ regs->num_regs = MAX (RE_NREGS, num_regs + 1); regs->start = TALLOC (regs->num_regs, regoff_t); regs->end = TALLOC (regs->num_regs, regoff_t); if (regs->start == NULL || regs->end == NULL) { FREE_VARIABLES (); return -2; } bufp->regs_allocated = REGS_REALLOCATE; } else if (bufp->regs_allocated == REGS_REALLOCATE) { /* Yes. If we need more elements than were already allocated, reallocate them. If we need fewer, just leave it alone. */ if (regs->num_regs < num_regs + 1) { regs->num_regs = num_regs + 1; RETALLOC (regs->start, regs->num_regs, regoff_t); RETALLOC (regs->end, regs->num_regs, regoff_t); if (regs->start == NULL || regs->end == NULL) { FREE_VARIABLES (); return -2; } } } else { /* These braces fend off a "empty body in an else-statement" warning under GCC when assert expands to nothing. */ assert (bufp->regs_allocated == REGS_FIXED); } /* Convert the pointer data in `regstart' and `regend' to indices. Register zero has to be set differently, since we haven't kept track of any info for it. */ if (regs->num_regs > 0) { regs->start[0] = pos; regs->end[0] = (MATCHING_IN_FIRST_STRING ? ((regoff_t) (d - string1)) : ((regoff_t) (d - string2 + size1))); } /* Go through the first `min (num_regs, regs->num_regs)' registers, since that is all we initialized. */ for (mcnt = 1; mcnt < MIN (num_regs, regs->num_regs); mcnt++) { if (REG_UNSET (regstart[mcnt]) || REG_UNSET (regend[mcnt])) regs->start[mcnt] = regs->end[mcnt] = -1; else { regs->start[mcnt] = (regoff_t) POINTER_TO_OFFSET (regstart[mcnt]); regs->end[mcnt] = (regoff_t) POINTER_TO_OFFSET (regend[mcnt]); } } /* If the regs structure we return has more elements than were in the pattern, set the extra elements to -1. If we (re)allocated the registers, this is the case, because we always allocate enough to have at least one -1 at the end. */ for (mcnt = num_regs; mcnt < regs->num_regs; mcnt++) regs->start[mcnt] = regs->end[mcnt] = -1; } /* regs && !bufp->no_sub */ DEBUG_PRINT4 ("%u failure points pushed, %u popped (%u remain).\n", nfailure_points_pushed, nfailure_points_popped, nfailure_points_pushed - nfailure_points_popped); DEBUG_PRINT2 ("%u registers pushed.\n", num_regs_pushed); mcnt = d - pos - (MATCHING_IN_FIRST_STRING ? string1 : string2 - size1); DEBUG_PRINT2 ("Returning %d from re_match_2.\n", mcnt); FREE_VARIABLES (); return mcnt; } /* Otherwise match next pattern command. */ switch (SWITCH_ENUM_CAST ((re_opcode_t) *p++)) { /* Ignore these. Used to ignore the n of succeed_n's which currently have n == 0. */ case no_op: DEBUG_PRINT1 ("EXECUTING no_op.\n"); break; case succeed: DEBUG_PRINT1 ("EXECUTING succeed.\n"); goto succeed_label; /* Match the next n pattern characters exactly. The following byte in the pattern defines n, and the n bytes after that are the characters to match. */ case exactn: mcnt = *p++; DEBUG_PRINT2 ("EXECUTING exactn %d.\n", mcnt); /* This is written out as an if-else so we don't waste time testing `translate' inside the loop. */ if (translate) { do { PREFETCH (); if (translate[(unsigned char) *d++] != (char) *p++) goto fail; } while (--mcnt); } else { do { PREFETCH (); if (*d++ != (char) *p++) goto fail; } while (--mcnt); } SET_REGS_MATCHED (); break; /* Match any character except possibly a newline or a null. */ case anychar: DEBUG_PRINT1 ("EXECUTING anychar.\n"); PREFETCH (); if ((!(bufp->syntax & RE_DOT_NEWLINE) && TRANSLATE (*d) == '\n') || (bufp->syntax & RE_DOT_NOT_NULL && TRANSLATE (*d) == '\000')) goto fail; SET_REGS_MATCHED (); DEBUG_PRINT2 (" Matched `%d'.\n", *d); d++; break; case charset: case charset_not: { register unsigned char c; boolean not = (re_opcode_t) *(p - 1) == charset_not; DEBUG_PRINT2 ("EXECUTING charset%s.\n", not ? "_not" : ""); PREFETCH (); c = TRANSLATE (*d); /* The character to match. */ /* Cast to `unsigned' instead of `unsigned char' in case the bit list is a full 32 bytes long. */ if (c < (unsigned) (*p * BYTEWIDTH) && p[1 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH))) not = !not; p += 1 + *p; if (!not) goto fail; SET_REGS_MATCHED (); d++; break; } /* The beginning of a group is represented by start_memory. The arguments are the register number in the next byte, and the number of groups inner to this one in the next. The text matched within the group is recorded (in the internal registers data structure) under the register number. */ case start_memory: DEBUG_PRINT3 ("EXECUTING start_memory %d (%d):\n", *p, p[1]); /* Find out if this group can match the empty string. */ p1 = p; /* To send to group_match_null_string_p. */ if (REG_MATCH_NULL_STRING_P (reg_info[*p]) == MATCH_NULL_UNSET_VALUE) REG_MATCH_NULL_STRING_P (reg_info[*p]) = group_match_null_string_p (&p1, pend, reg_info); /* Save the position in the string where we were the last time we were at this open-group operator in case the group is operated upon by a repetition operator, e.g., with `(a*)*b' against `ab'; then we want to ignore where we are now in the string in case this attempt to match fails. */ old_regstart[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p]) ? REG_UNSET (regstart[*p]) ? d : regstart[*p] : regstart[*p]; DEBUG_PRINT2 (" old_regstart: %d\n", POINTER_TO_OFFSET (old_regstart[*p])); regstart[*p] = d; DEBUG_PRINT2 (" regstart: %d\n", POINTER_TO_OFFSET (regstart[*p])); IS_ACTIVE (reg_info[*p]) = 1; MATCHED_SOMETHING (reg_info[*p]) = 0; /* Clear this whenever we change the register activity status. */ set_regs_matched_done = 0; /* This is the new highest active register. */ highest_active_reg = *p; /* If nothing was active before, this is the new lowest active register. */ if (lowest_active_reg == NO_LOWEST_ACTIVE_REG) lowest_active_reg = *p; /* Move past the register number and inner group count. */ p += 2; just_past_start_mem = p; break; /* The stop_memory opcode represents the end of a group. Its arguments are the same as start_memory's: the register number, and the number of inner groups. */ case stop_memory: DEBUG_PRINT3 ("EXECUTING stop_memory %d (%d):\n", *p, p[1]); /* We need to save the string position the last time we were at this close-group operator in case the group is operated upon by a repetition operator, e.g., with `((a*)*(b*)*)*' against `aba'; then we want to ignore where we are now in the string in case this attempt to match fails. */ old_regend[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p]) ? REG_UNSET (regend[*p]) ? d : regend[*p] : regend[*p]; DEBUG_PRINT2 (" old_regend: %d\n", POINTER_TO_OFFSET (old_regend[*p])); regend[*p] = d; DEBUG_PRINT2 (" regend: %d\n", POINTER_TO_OFFSET (regend[*p])); /* This register isn't active anymore. */ IS_ACTIVE (reg_info[*p]) = 0; /* Clear this whenever we change the register activity status. */ set_regs_matched_done = 0; /* If this was the only register active, nothing is active anymore. */ if (lowest_active_reg == highest_active_reg) { lowest_active_reg = NO_LOWEST_ACTIVE_REG; highest_active_reg = NO_HIGHEST_ACTIVE_REG; } else { /* We must scan for the new highest active register, since it isn't necessarily one less than now: consider (a(b)c(d(e)f)g). When group 3 ends, after the f), the new highest active register is 1. */ unsigned char r = *p - 1; while (r > 0 && !IS_ACTIVE (reg_info[r])) r--; /* If we end up at register zero, that means that we saved the registers as the result of an `on_failure_jump', not a `start_memory', and we jumped to past the innermost `stop_memory'. For example, in ((.)*) we save registers 1 and 2 as a result of the *, but when we pop back to the second ), we are at the stop_memory 1. Thus, nothing is active. */ if (r == 0) { lowest_active_reg = NO_LOWEST_ACTIVE_REG; highest_active_reg = NO_HIGHEST_ACTIVE_REG; } else highest_active_reg = r; } /* If just failed to match something this time around with a group that's operated on by a repetition operator, try to force exit from the ``loop'', and restore the register information for this group that we had before trying this last match. */ if ((!MATCHED_SOMETHING (reg_info[*p]) || just_past_start_mem == p - 1) && (p + 2) < pend) { boolean is_a_jump_n = false; p1 = p + 2; mcnt = 0; switch ((re_opcode_t) *p1++) { case jump_n: is_a_jump_n = true; case pop_failure_jump: case maybe_pop_jump: case jump: case dummy_failure_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p1); if (is_a_jump_n) p1 += 2; break; default: /* do nothing */ ; } p1 += mcnt; /* If the next operation is a jump backwards in the pattern to an on_failure_jump right before the start_memory corresponding to this stop_memory, exit from the loop by forcing a failure after pushing on the stack the on_failure_jump's jump in the pattern, and d. */ if (mcnt < 0 && (re_opcode_t) *p1 == on_failure_jump && (re_opcode_t) p1[3] == start_memory && p1[4] == *p) { /* If this group ever matched anything, then restore what its registers were before trying this last failed match, e.g., with `(a*)*b' against `ab' for regstart[1], and, e.g., with `((a*)*(b*)*)*' against `aba' for regend[3]. Also restore the registers for inner groups for, e.g., `((a*)(b*))*' against `aba' (register 3 would otherwise get trashed). */ if (EVER_MATCHED_SOMETHING (reg_info[*p])) { unsigned r; EVER_MATCHED_SOMETHING (reg_info[*p]) = 0; /* Restore this and inner groups' (if any) registers. */ for (r = *p; r < *p + *(p + 1); r++) { regstart[r] = old_regstart[r]; /* xx why this test? */ if (old_regend[r] >= regstart[r]) regend[r] = old_regend[r]; } } p1++; EXTRACT_NUMBER_AND_INCR (mcnt, p1); PUSH_FAILURE_POINT (p1 + mcnt, d, -2); goto fail; } } /* Move past the register number and the inner group count. */ p += 2; break; /* \ has been turned into a `duplicate' command which is followed by the numeric value of as the register number. */ case duplicate: { register const char *d2, *dend2; int regno = *p++; /* Get which register to match against. */ DEBUG_PRINT2 ("EXECUTING duplicate %d.\n", regno); /* Can't back reference a group which we've never matched. */ if (REG_UNSET (regstart[regno]) || REG_UNSET (regend[regno])) goto fail; /* Where in input to try to start matching. */ d2 = regstart[regno]; /* Where to stop matching; if both the place to start and the place to stop matching are in the same string, then set to the place to stop, otherwise, for now have to use the end of the first string. */ dend2 = ((FIRST_STRING_P (regstart[regno]) == FIRST_STRING_P (regend[regno])) ? regend[regno] : end_match_1); for (;;) { /* If necessary, advance to next segment in register contents. */ while (d2 == dend2) { if (dend2 == end_match_2) break; if (dend2 == regend[regno]) break; /* End of string1 => advance to string2. */ d2 = string2; dend2 = regend[regno]; } /* At end of register contents => success */ if (d2 == dend2) break; /* If necessary, advance to next segment in data. */ PREFETCH (); /* How many characters left in this segment to match. */ mcnt = dend - d; /* Want how many consecutive characters we can match in one shot, so, if necessary, adjust the count. */ if (mcnt > dend2 - d2) mcnt = dend2 - d2; /* Compare that many; failure if mismatch, else move past them. */ if (translate ? bcmp_translate (d, d2, mcnt, translate) : bcmp (d, d2, mcnt)) goto fail; d += mcnt, d2 += mcnt; /* Do this because we've match some characters. */ SET_REGS_MATCHED (); } } break; /* begline matches the empty string at the beginning of the string (unless `not_bol' is set in `bufp'), and, if `newline_anchor' is set, after newlines. */ case begline: DEBUG_PRINT1 ("EXECUTING begline.\n"); if (AT_STRINGS_BEG (d)) { if (!bufp->not_bol) break; } else if (d[-1] == '\n' && bufp->newline_anchor) { break; } /* In all other cases, we fail. */ goto fail; /* endline is the dual of begline. */ case endline: DEBUG_PRINT1 ("EXECUTING endline.\n"); if (AT_STRINGS_END (d)) { if (!bufp->not_eol) break; } /* We have to ``prefetch'' the next character. */ else if ((d == end1 ? *string2 : *d) == '\n' && bufp->newline_anchor) { break; } goto fail; /* Match at the very beginning of the data. */ case begbuf: DEBUG_PRINT1 ("EXECUTING begbuf.\n"); if (AT_STRINGS_BEG (d)) break; goto fail; /* Match at the very end of the data. */ case endbuf: DEBUG_PRINT1 ("EXECUTING endbuf.\n"); if (AT_STRINGS_END (d)) break; goto fail; /* on_failure_keep_string_jump is used to optimize `.*\n'. It pushes NULL as the value for the string on the stack. Then `pop_failure_point' will keep the current value for the string, instead of restoring it. To see why, consider matching `foo\nbar' against `.*\n'. The .* matches the foo; then the . fails against the \n. But the next thing we want to do is match the \n against the \n; if we restored the string value, we would be back at the foo. Because this is used only in specific cases, we don't need to check all the things that `on_failure_jump' does, to make sure the right things get saved on the stack. Hence we don't share its code. The only reason to push anything on the stack at all is that otherwise we would have to change `anychar's code to do something besides goto fail in this case; that seems worse than this. */ case on_failure_keep_string_jump: DEBUG_PRINT1 ("EXECUTING on_failure_keep_string_jump"); EXTRACT_NUMBER_AND_INCR (mcnt, p); DEBUG_PRINT3 (" %d (to 0x%x):\n", mcnt, p + mcnt); PUSH_FAILURE_POINT (p + mcnt, NULL, -2); break; /* Uses of on_failure_jump: Each alternative starts with an on_failure_jump that points to the beginning of the next alternative. Each alternative except the last ends with a jump that in effect jumps past the rest of the alternatives. (They really jump to the ending jump of the following alternative, because tensioning these jumps is a hassle.) Repeats start with an on_failure_jump that points past both the repetition text and either the following jump or pop_failure_jump back to this on_failure_jump. */ case on_failure_jump: on_failure: DEBUG_PRINT1 ("EXECUTING on_failure_jump"); EXTRACT_NUMBER_AND_INCR (mcnt, p); DEBUG_PRINT3 (" %d (to 0x%x)", mcnt, p + mcnt); /* If this on_failure_jump comes right before a group (i.e., the original * applied to a group), save the information for that group and all inner ones, so that if we fail back to this point, the group's information will be correct. For example, in \(a*\)*\1, we need the preceding group, and in \(\(a*\)b*\)\2, we need the inner group. */ /* We can't use `p' to check ahead because we push a failure point to `p + mcnt' after we do this. */ p1 = p; /* We need to skip no_op's before we look for the start_memory in case this on_failure_jump is happening as the result of a completed succeed_n, as in \(a\)\{1,3\}b\1 against aba. */ while (p1 < pend && (re_opcode_t) *p1 == no_op) p1++; if (p1 < pend && (re_opcode_t) *p1 == start_memory) { /* We have a new highest active register now. This will get reset at the start_memory we are about to get to, but we will have saved all the registers relevant to this repetition op, as described above. */ highest_active_reg = *(p1 + 1) + *(p1 + 2); if (lowest_active_reg == NO_LOWEST_ACTIVE_REG) lowest_active_reg = *(p1 + 1); } DEBUG_PRINT1 (":\n"); PUSH_FAILURE_POINT (p + mcnt, d, -2); break; /* A smart repeat ends with `maybe_pop_jump'. We change it to either `pop_failure_jump' or `jump'. */ case maybe_pop_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); DEBUG_PRINT2 ("EXECUTING maybe_pop_jump %d.\n", mcnt); { register unsigned char *p2 = p; /* Compare the beginning of the repeat with what in the pattern follows its end. If we can establish that there is nothing that they would both match, i.e., that we would have to backtrack because of (as in, e.g., `a*a') then we can change to pop_failure_jump, because we'll never have to backtrack. This is not true in the case of alternatives: in `(a|ab)*' we do need to backtrack to the `ab' alternative (e.g., if the string was `ab'). But instead of trying to detect that here, the alternative has put on a dummy failure point which is what we will end up popping. */ /* Skip over open/close-group commands. If what follows this loop is a ...+ construct, look at what begins its body, since we will have to match at least one of that. */ while (1) { if (p2 + 2 < pend && ((re_opcode_t) *p2 == stop_memory || (re_opcode_t) *p2 == start_memory)) p2 += 3; else if (p2 + 6 < pend && (re_opcode_t) *p2 == dummy_failure_jump) p2 += 6; else break; } p1 = p + mcnt; /* p1[0] ... p1[2] are the `on_failure_jump' corresponding to the `maybe_finalize_jump' of this case. Examine what follows. */ /* If we're at the end of the pattern, we can change. */ if (p2 == pend) { /* Consider what happens when matching ":\(.*\)" against ":/". I don't really understand this code yet. */ p[-3] = (unsigned char) pop_failure_jump; DEBUG_PRINT1 (" End of pattern: change to `pop_failure_jump'.\n"); } else if ((re_opcode_t) *p2 == exactn || (bufp->newline_anchor && (re_opcode_t) *p2 == endline)) { register unsigned char c = *p2 == (unsigned char) endline ? '\n' : p2[2]; if ((re_opcode_t) p1[3] == exactn && p1[5] != c) { p[-3] = (unsigned char) pop_failure_jump; DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n", c, p1[5]); } else if ((re_opcode_t) p1[3] == charset || (re_opcode_t) p1[3] == charset_not) { int not = (re_opcode_t) p1[3] == charset_not; if (c < (unsigned char) (p1[4] * BYTEWIDTH) && p1[5 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH))) not = !not; /* `not' is equal to 1 if c would match, which means that we can't change to pop_failure_jump. */ if (!not) { p[-3] = (unsigned char) pop_failure_jump; DEBUG_PRINT1 (" No match => pop_failure_jump.\n"); } } } else if ((re_opcode_t) *p2 == charset) { #ifdef DEBUG register unsigned char c = *p2 == (unsigned char) endline ? '\n' : p2[2]; #endif if ((re_opcode_t) p1[3] == exactn && ! ((int) p2[1] * BYTEWIDTH > (int) p1[4] && (p2[1 + p1[4] / BYTEWIDTH] & (1 << (p1[4] % BYTEWIDTH))))) { p[-3] = (unsigned char) pop_failure_jump; DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n", c, p1[5]); } else if ((re_opcode_t) p1[3] == charset_not) { int idx; /* We win if the charset_not inside the loop lists every character listed in the charset after. */ for (idx = 0; idx < (int) p2[1]; idx++) if (! (p2[2 + idx] == 0 || (idx < (int) p1[4] && ((p2[2 + idx] & ~ p1[5 + idx]) == 0)))) break; if (idx == p2[1]) { p[-3] = (unsigned char) pop_failure_jump; DEBUG_PRINT1 (" No match => pop_failure_jump.\n"); } } else if ((re_opcode_t) p1[3] == charset) { int idx; /* We win if the charset inside the loop has no overlap with the one after the loop. */ for (idx = 0; idx < (int) p2[1] && idx < (int) p1[4]; idx++) if ((p2[2 + idx] & p1[5 + idx]) != 0) break; if (idx == p2[1] || idx == p1[4]) { p[-3] = (unsigned char) pop_failure_jump; DEBUG_PRINT1 (" No match => pop_failure_jump.\n"); } } } } p -= 2; /* Point at relative address again. */ if ((re_opcode_t) p[-1] != pop_failure_jump) { p[-1] = (unsigned char) jump; DEBUG_PRINT1 (" Match => jump.\n"); goto unconditional_jump; } /* Note fall through. */ /* The end of a simple repeat has a pop_failure_jump back to its matching on_failure_jump, where the latter will push a failure point. The pop_failure_jump takes off failure points put on by this pop_failure_jump's matching on_failure_jump; we got through the pattern to here from the matching on_failure_jump, so didn't fail. */ case pop_failure_jump: { /* We need to pass separate storage for the lowest and highest registers, even though we don't care about the actual values. Otherwise, we will restore only one register from the stack, since lowest will == highest in `pop_failure_point'. */ unsigned dummy_low_reg, dummy_high_reg; unsigned char *pdummy; const char *sdummy; DEBUG_PRINT1 ("EXECUTING pop_failure_jump.\n"); POP_FAILURE_POINT (sdummy, pdummy, dummy_low_reg, dummy_high_reg, reg_dummy, reg_dummy, reg_info_dummy); } /* Note fall through. */ /* Unconditionally jump (without popping any failure points). */ case jump: unconditional_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); /* Get the amount to jump. */ DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt); p += mcnt; /* Do the jump. */ DEBUG_PRINT2 ("(to 0x%x).\n", p); break; /* We need this opcode so we can detect where alternatives end in `group_match_null_string_p' et al. */ case jump_past_alt: DEBUG_PRINT1 ("EXECUTING jump_past_alt.\n"); goto unconditional_jump; /* Normally, the on_failure_jump pushes a failure point, which then gets popped at pop_failure_jump. We will end up at pop_failure_jump, also, and with a pattern of, say, `a+', we are skipping over the on_failure_jump, so we have to push something meaningless for pop_failure_jump to pop. */ case dummy_failure_jump: DEBUG_PRINT1 ("EXECUTING dummy_failure_jump.\n"); /* It doesn't matter what we push for the string here. What the code at `fail' tests is the value for the pattern. */ PUSH_FAILURE_POINT (0, 0, -2); goto unconditional_jump; /* At the end of an alternative, we need to push a dummy failure point in case we are followed by a `pop_failure_jump', because we don't want the failure point for the alternative to be popped. For example, matching `(a|ab)*' against `aab' requires that we match the `ab' alternative. */ case push_dummy_failure: DEBUG_PRINT1 ("EXECUTING push_dummy_failure.\n"); /* See comments just above at `dummy_failure_jump' about the two zeroes. */ PUSH_FAILURE_POINT (0, 0, -2); break; /* Have to succeed matching what follows at least n times. After that, handle like `on_failure_jump'. */ case succeed_n: EXTRACT_NUMBER (mcnt, p + 2); DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt); assert (mcnt >= 0); /* Originally, this is how many times we HAVE to succeed. */ if (mcnt > 0) { mcnt--; p += 2; STORE_NUMBER_AND_INCR (p, mcnt); DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p, mcnt); } else if (mcnt == 0) { DEBUG_PRINT2 (" Setting two bytes from 0x%x to no_op.\n", p+2); p[2] = (unsigned char) no_op; p[3] = (unsigned char) no_op; goto on_failure; } break; case jump_n: EXTRACT_NUMBER (mcnt, p + 2); DEBUG_PRINT2 ("EXECUTING jump_n %d.\n", mcnt); /* Originally, this is how many times we CAN jump. */ if (mcnt) { mcnt--; STORE_NUMBER (p + 2, mcnt); goto unconditional_jump; } /* If don't have to jump any more, skip over the rest of command. */ else p += 4; break; case set_number_at: { DEBUG_PRINT1 ("EXECUTING set_number_at.\n"); EXTRACT_NUMBER_AND_INCR (mcnt, p); p1 = p + mcnt; EXTRACT_NUMBER_AND_INCR (mcnt, p); DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p1, mcnt); STORE_NUMBER (p1, mcnt); break; } case wordbound: DEBUG_PRINT1 ("EXECUTING wordbound.\n"); if (AT_WORD_BOUNDARY (d)) break; goto fail; case notwordbound: DEBUG_PRINT1 ("EXECUTING notwordbound.\n"); if (AT_WORD_BOUNDARY (d)) goto fail; break; case wordbeg: DEBUG_PRINT1 ("EXECUTING wordbeg.\n"); if (WORDCHAR_P (d) && (AT_STRINGS_BEG (d) || !WORDCHAR_P (d - 1))) break; goto fail; case wordend: DEBUG_PRINT1 ("EXECUTING wordend.\n"); if (!AT_STRINGS_BEG (d) && WORDCHAR_P (d - 1) && (!WORDCHAR_P (d) || AT_STRINGS_END (d))) break; goto fail; #ifdef emacs case before_dot: DEBUG_PRINT1 ("EXECUTING before_dot.\n"); if (PTR_CHAR_POS ((unsigned char *) d) >= point) goto fail; break; case at_dot: DEBUG_PRINT1 ("EXECUTING at_dot.\n"); if (PTR_CHAR_POS ((unsigned char *) d) != point) goto fail; break; case after_dot: DEBUG_PRINT1 ("EXECUTING after_dot.\n"); if (PTR_CHAR_POS ((unsigned char *) d) <= point) goto fail; break; #if 0 /* not emacs19 */ case at_dot: DEBUG_PRINT1 ("EXECUTING at_dot.\n"); if (PTR_CHAR_POS ((unsigned char *) d) + 1 != point) goto fail; break; #endif /* not emacs19 */ case syntaxspec: DEBUG_PRINT2 ("EXECUTING syntaxspec %d.\n", mcnt); mcnt = *p++; goto matchsyntax; case wordchar: DEBUG_PRINT1 ("EXECUTING Emacs wordchar.\n"); mcnt = (int) Sword; matchsyntax: PREFETCH (); /* Can't use *d++ here; SYNTAX may be an unsafe macro. */ d++; if (SYNTAX (d[-1]) != (enum syntaxcode) mcnt) goto fail; SET_REGS_MATCHED (); break; case notsyntaxspec: DEBUG_PRINT2 ("EXECUTING notsyntaxspec %d.\n", mcnt); mcnt = *p++; goto matchnotsyntax; case notwordchar: DEBUG_PRINT1 ("EXECUTING Emacs notwordchar.\n"); mcnt = (int) Sword; matchnotsyntax: PREFETCH (); /* Can't use *d++ here; SYNTAX may be an unsafe macro. */ d++; if (SYNTAX (d[-1]) == (enum syntaxcode) mcnt) goto fail; SET_REGS_MATCHED (); break; #else /* not emacs */ case wordchar: DEBUG_PRINT1 ("EXECUTING non-Emacs wordchar.\n"); PREFETCH (); if (!WORDCHAR_P (d)) goto fail; SET_REGS_MATCHED (); d++; break; case notwordchar: DEBUG_PRINT1 ("EXECUTING non-Emacs notwordchar.\n"); PREFETCH (); if (WORDCHAR_P (d)) goto fail; SET_REGS_MATCHED (); d++; break; #endif /* not emacs */ default: abort (); } continue; /* Successfully executed one pattern command; keep going. */ /* We goto here if a matching operation fails. */ fail: if (!FAIL_STACK_EMPTY ()) { /* A restart point is known. Restore to that state. */ DEBUG_PRINT1 ("\nFAIL:\n"); POP_FAILURE_POINT (d, p, lowest_active_reg, highest_active_reg, regstart, regend, reg_info); /* If this failure point is a dummy, try the next one. */ if (!p) goto fail; /* If we failed to the end of the pattern, don't examine *p. */ assert (p <= pend); if (p < pend) { boolean is_a_jump_n = false; /* If failed to a backwards jump that's part of a repetition loop, need to pop this failure point and use the next one. */ switch ((re_opcode_t) *p) { case jump_n: is_a_jump_n = true; case maybe_pop_jump: case pop_failure_jump: case jump: p1 = p + 1; EXTRACT_NUMBER_AND_INCR (mcnt, p1); p1 += mcnt; if ((is_a_jump_n && (re_opcode_t) *p1 == succeed_n) || (!is_a_jump_n && (re_opcode_t) *p1 == on_failure_jump)) goto fail; break; default: /* do nothing */ ; } } if (d >= string1 && d <= end1) dend = end_match_1; } else break; /* Matching at this starting point really fails. */ } /* for (;;) */ if (best_regs_set) goto restore_best_regs; FREE_VARIABLES (); return -1; /* Failure to match. */ } /* re_match_2 */ /* Subroutine definitions for re_match_2. */ /* We are passed P pointing to a register number after a start_memory. Return true if the pattern up to the corresponding stop_memory can match the empty string, and false otherwise. If we find the matching stop_memory, sets P to point to one past its number. Otherwise, sets P to an undefined byte less than or equal to END. We don't handle duplicates properly (yet). */ static boolean group_match_null_string_p (p, end, reg_info) unsigned char **p, *end; register_info_type *reg_info; { int mcnt; /* Point to after the args to the start_memory. */ unsigned char *p1 = *p + 2; while (p1 < end) { /* Skip over opcodes that can match nothing, and return true or false, as appropriate, when we get to one that can't, or to the matching stop_memory. */ switch ((re_opcode_t) *p1) { /* Could be either a loop or a series of alternatives. */ case on_failure_jump: p1++; EXTRACT_NUMBER_AND_INCR (mcnt, p1); /* If the next operation is not a jump backwards in the pattern. */ if (mcnt >= 0) { /* Go through the on_failure_jumps of the alternatives, seeing if any of the alternatives cannot match nothing. The last alternative starts with only a jump, whereas the rest start with on_failure_jump and end with a jump, e.g., here is the pattern for `a|b|c': /on_failure_jump/0/6/exactn/1/a/jump_past_alt/0/6 /on_failure_jump/0/6/exactn/1/b/jump_past_alt/0/3 /exactn/1/c So, we have to first go through the first (n-1) alternatives and then deal with the last one separately. */ /* Deal with the first (n-1) alternatives, which start with an on_failure_jump (see above) that jumps to right past a jump_past_alt. */ while ((re_opcode_t) p1[mcnt-3] == jump_past_alt) { /* `mcnt' holds how many bytes long the alternative is, including the ending `jump_past_alt' and its number. */ if (!alt_match_null_string_p (p1, p1 + mcnt - 3, reg_info)) return false; /* Move to right after this alternative, including the jump_past_alt. */ p1 += mcnt; /* Break if it's the beginning of an n-th alternative that doesn't begin with an on_failure_jump. */ if ((re_opcode_t) *p1 != on_failure_jump) break; /* Still have to check that it's not an n-th alternative that starts with an on_failure_jump. */ p1++; EXTRACT_NUMBER_AND_INCR (mcnt, p1); if ((re_opcode_t) p1[mcnt-3] != jump_past_alt) { /* Get to the beginning of the n-th alternative. */ p1 -= 3; break; } } /* Deal with the last alternative: go back and get number of the `jump_past_alt' just before it. `mcnt' contains the length of the alternative. */ EXTRACT_NUMBER (mcnt, p1 - 2); if (!alt_match_null_string_p (p1, p1 + mcnt, reg_info)) return false; p1 += mcnt; /* Get past the n-th alternative. */ } /* if mcnt > 0 */ break; case stop_memory: assert (p1[1] == **p); *p = p1 + 2; return true; default: if (!common_op_match_null_string_p (&p1, end, reg_info)) return false; } } /* while p1 < end */ return false; } /* group_match_null_string_p */ /* Similar to group_match_null_string_p, but doesn't deal with alternatives: It expects P to be the first byte of a single alternative and END one byte past the last. The alternative can contain groups. */ static boolean alt_match_null_string_p (p, end, reg_info) unsigned char *p, *end; register_info_type *reg_info; { int mcnt; unsigned char *p1 = p; while (p1 < end) { /* Skip over opcodes that can match nothing, and break when we get to one that can't. */ switch ((re_opcode_t) *p1) { /* It's a loop. */ case on_failure_jump: p1++; EXTRACT_NUMBER_AND_INCR (mcnt, p1); p1 += mcnt; break; default: if (!common_op_match_null_string_p (&p1, end, reg_info)) return false; } } /* while p1 < end */ return true; } /* alt_match_null_string_p */ /* Deals with the ops common to group_match_null_string_p and alt_match_null_string_p. Sets P to one after the op and its arguments, if any. */ static boolean common_op_match_null_string_p (p, end, reg_info) unsigned char **p, *end; register_info_type *reg_info; { int mcnt; boolean ret; int reg_no; unsigned char *p1 = *p; switch ((re_opcode_t) *p1++) { case no_op: case begline: case endline: case begbuf: case endbuf: case wordbeg: case wordend: case wordbound: case notwordbound: #ifdef emacs case before_dot: case at_dot: case after_dot: #endif break; case start_memory: reg_no = *p1; assert (reg_no > 0 && reg_no <= MAX_REGNUM); ret = group_match_null_string_p (&p1, end, reg_info); /* Have to set this here in case we're checking a group which contains a group and a back reference to it. */ if (REG_MATCH_NULL_STRING_P (reg_info[reg_no]) == MATCH_NULL_UNSET_VALUE) REG_MATCH_NULL_STRING_P (reg_info[reg_no]) = ret; if (!ret) return false; break; /* If this is an optimized succeed_n for zero times, make the jump. */ case jump: EXTRACT_NUMBER_AND_INCR (mcnt, p1); if (mcnt >= 0) p1 += mcnt; else return false; break; case succeed_n: /* Get to the number of times to succeed. */ p1 += 2; EXTRACT_NUMBER_AND_INCR (mcnt, p1); if (mcnt == 0) { p1 -= 4; EXTRACT_NUMBER_AND_INCR (mcnt, p1); p1 += mcnt; } else return false; break; case duplicate: if (!REG_MATCH_NULL_STRING_P (reg_info[*p1])) return false; break; case set_number_at: p1 += 4; default: /* All other opcodes mean we cannot match the empty string. */ return false; } *p = p1; return true; } /* common_op_match_null_string_p */ /* Return zero if TRANSLATE[S1] and TRANSLATE[S2] are identical for LEN bytes; nonzero otherwise. */ static int bcmp_translate (s1, s2, len, translate) unsigned char *s1, *s2; register int len; char *translate; { register unsigned char *p1 = s1, *p2 = s2; while (len) { if (translate[*p1++] != translate[*p2++]) return 1; len--; } return 0; } /* Entry points for GNU code. */ /* re_compile_pattern is the GNU regular expression compiler: it compiles PATTERN (of length SIZE) and puts the result in BUFP. Returns 0 if the pattern was valid, otherwise an error string. Assumes the `allocated' (and perhaps `buffer') and `translate' fields are set in BUFP on entry. We call regex_compile to do the actual compilation. */ const char * re_compile_pattern (pattern, length, bufp) const char *pattern; int length; struct re_pattern_buffer *bufp; { reg_errcode_t ret; /* GNU code is written to assume at least RE_NREGS registers will be set (and at least one extra will be -1). */ bufp->regs_allocated = REGS_UNALLOCATED; /* And GNU code determines whether or not to get register information by passing null for the REGS argument to re_match, etc., not by setting no_sub. */ bufp->no_sub = 0; /* Match anchors at newline. */ bufp->newline_anchor = 1; ret = regex_compile (pattern, length, re_syntax_options, bufp); if (!ret) return NULL; return gettext (re_error_msgid[(int) ret]); } /* Entry points compatible with 4.2 BSD regex library. We don't define them unless specifically requested. */ #ifdef _REGEX_RE_COMP /* BSD has one and only one pattern buffer. */ static struct re_pattern_buffer re_comp_buf; char * re_comp (s) const char *s; { reg_errcode_t ret; if (!s) { if (!re_comp_buf.buffer) return gettext ("No previous regular expression"); return 0; } if (!re_comp_buf.buffer) { re_comp_buf.buffer = (unsigned char *) malloc (200); if (re_comp_buf.buffer == NULL) return gettext (re_error_msgid[(int) REG_ESPACE]); re_comp_buf.allocated = 200; re_comp_buf.fastmap = (char *) malloc (1 << BYTEWIDTH); if (re_comp_buf.fastmap == NULL) return gettext (re_error_msgid[(int) REG_ESPACE]); } /* Since `re_exec' always passes NULL for the `regs' argument, we don't need to initialize the pattern buffer fields which affect it. */ /* Match anchors at newlines. */ re_comp_buf.newline_anchor = 1; ret = regex_compile (s, strlen (s), re_syntax_options, &re_comp_buf); if (!ret) return NULL; /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */ return (char *) gettext (re_error_msgid[(int) ret]); } int re_exec (s) const char *s; { const int len = strlen (s); return 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0); } #endif /* _REGEX_RE_COMP */ /* POSIX.2 functions. Don't define these for Emacs. */ #ifndef emacs /* regcomp takes a regular expression as a string and compiles it. PREG is a regex_t *. We do not expect any fields to be initialized, since POSIX says we shouldn't. Thus, we set `buffer' to the compiled pattern; `used' to the length of the compiled pattern; `syntax' to RE_SYNTAX_POSIX_EXTENDED if the REG_EXTENDED bit in CFLAGS is set; otherwise, to RE_SYNTAX_POSIX_BASIC; `newline_anchor' to REG_NEWLINE being set in CFLAGS; `fastmap' and `fastmap_accurate' to zero; `re_nsub' to the number of subexpressions in PATTERN. PATTERN is the address of the pattern string. CFLAGS is a series of bits which affect compilation. If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we use POSIX basic syntax. If REG_NEWLINE is set, then . and [^...] don't match newline. Also, regexec will try a match beginning after every newline. If REG_ICASE is set, then we considers upper- and lowercase versions of letters to be equivalent when matching. If REG_NOSUB is set, then when PREG is passed to regexec, that routine will report only success or failure, and nothing about the registers. It returns 0 if it succeeds, nonzero if it doesn't. (See regex.h for the return codes and their meanings.) */ int regcomp (preg, pattern, cflags) regex_t *preg; const char *pattern; int cflags; { reg_errcode_t ret; unsigned syntax = (cflags & REG_EXTENDED) ? RE_SYNTAX_POSIX_EXTENDED : RE_SYNTAX_POSIX_BASIC; /* regex_compile will allocate the space for the compiled pattern. */ preg->buffer = 0; preg->allocated = 0; preg->used = 0; /* Don't bother to use a fastmap when searching. This simplifies the REG_NEWLINE case: if we used a fastmap, we'd have to put all the characters after newlines into the fastmap. This way, we just try every character. */ preg->fastmap = 0; if (cflags & REG_ICASE) { unsigned i; preg->translate = (char *) malloc (CHAR_SET_SIZE); if (preg->translate == NULL) return (int) REG_ESPACE; /* Map uppercase characters to corresponding lowercase ones. */ for (i = 0; i < CHAR_SET_SIZE; i++) preg->translate[i] = ISUPPER (i) ? tolower (i) : i; } else preg->translate = NULL; /* If REG_NEWLINE is set, newlines are treated differently. */ if (cflags & REG_NEWLINE) { /* REG_NEWLINE implies neither . nor [^...] match newline. */ syntax &= ~RE_DOT_NEWLINE; syntax |= RE_HAT_LISTS_NOT_NEWLINE; /* It also changes the matching behavior. */ preg->newline_anchor = 1; } else preg->newline_anchor = 0; preg->no_sub = !!(cflags & REG_NOSUB); /* POSIX says a null character in the pattern terminates it, so we can use strlen here in compiling the pattern. */ ret = regex_compile (pattern, strlen (pattern), syntax, preg); /* POSIX doesn't distinguish between an unmatched open-group and an unmatched close-group: both are REG_EPAREN. */ if (ret == REG_ERPAREN) ret = REG_EPAREN; return (int) ret; } /* regexec searches for a given pattern, specified by PREG, in the string STRING. If NMATCH is zero or REG_NOSUB was set in the cflags argument to `regcomp', we ignore PMATCH. Otherwise, we assume PMATCH has at least NMATCH elements, and we set them to the offsets of the corresponding matched substrings. EFLAGS specifies `execution flags' which affect matching: if REG_NOTBOL is set, then ^ does not match at the beginning of the string; if REG_NOTEOL is set, then $ does not match at the end. We return 0 if we find a match and REG_NOMATCH if not. */ int regexec (preg, string, nmatch, pmatch, eflags) const regex_t *preg; const char *string; size_t nmatch; regmatch_t pmatch[]; int eflags; { int ret; struct re_registers regs; regex_t private_preg; int len = strlen (string); boolean want_reg_info = !preg->no_sub && nmatch > 0; private_preg = *preg; private_preg.not_bol = !!(eflags & REG_NOTBOL); private_preg.not_eol = !!(eflags & REG_NOTEOL); /* The user has told us exactly how many registers to return information about, via `nmatch'. We have to pass that on to the matching routines. */ private_preg.regs_allocated = REGS_FIXED; if (want_reg_info) { regs.num_regs = nmatch; regs.start = TALLOC (nmatch, regoff_t); regs.end = TALLOC (nmatch, regoff_t); if (regs.start == NULL || regs.end == NULL) return (int) REG_NOMATCH; } /* Perform the searching operation. */ ret = re_search (&private_preg, string, len, /* start: */ 0, /* range: */ len, want_reg_info ? ®s : (struct re_registers *) 0); /* Copy the register information to the POSIX structure. */ if (want_reg_info) { if (ret >= 0) { unsigned r; for (r = 0; r < nmatch; r++) { pmatch[r].rm_so = regs.start[r]; pmatch[r].rm_eo = regs.end[r]; } } /* If we needed the temporary register info, free the space now. */ free (regs.start); free (regs.end); } /* We want zero return to mean success, unlike `re_search'. */ return ret >= 0 ? (int) REG_NOERROR : (int) REG_NOMATCH; } /* Returns a message corresponding to an error code, ERRCODE, returned from either regcomp or regexec. We don't use PREG here. */ size_t regerror (errcode, preg, errbuf, errbuf_size) int errcode; const regex_t *preg; char *errbuf; size_t errbuf_size; { const char *msg; size_t msg_size; if (errcode < 0 || errcode >= (sizeof (re_error_msgid) / sizeof (re_error_msgid[0]))) /* Only error codes returned by the rest of the code should be passed to this routine. If we are given anything else, or if other regex code generates an invalid error code, then the program has a bug. Dump core so we can fix it. */ abort (); msg = gettext (re_error_msgid[errcode]); msg_size = strlen (msg) + 1; /* Includes the null. */ if (errbuf_size != 0) { if (msg_size > errbuf_size) { strncpy (errbuf, msg, errbuf_size - 1); errbuf[errbuf_size - 1] = 0; } else strcpy (errbuf, msg); } return msg_size; } /* Free dynamically allocated space used by PREG. */ void regfree (preg) regex_t *preg; { if (preg->buffer != NULL) free (preg->buffer); preg->buffer = NULL; preg->allocated = 0; preg->used = 0; if (preg->fastmap != NULL) free (preg->fastmap); preg->fastmap = NULL; preg->fastmap_accurate = 0; if (preg->translate != NULL) free (preg->translate); preg->translate = NULL; } #endif /* not emacs */ /* Local variables: make-backup-files: t version-control: t trim-versions-without-asking: nil End: */ tar-1.11.8/lib/rmdir.c 444 625 1 3661 5645644643 7450 /* rmdir.c -- BSD compatible remove directory function for System V Copyright (C) 1988, 1990 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include #endif #include #include #include #ifndef errno extern int errno; #endif #ifdef STAT_MACROS_BROKEN #undef S_ISDIR #endif #if !defined(S_ISDIR) && defined(S_IFDIR) #define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR) #endif #include "safe-stat.h" /* rmdir adapted from GNU tar. */ /* Remove directory DPATH. Return 0 if successful, -1 if not. */ int rmdir (dpath) char *dpath; { int cpid, status; struct stat statbuf; if (SAFE_STAT (dpath, &statbuf) != 0) return -1; /* errno already set */ if (!S_ISDIR (statbuf.st_mode)) { errno = ENOTDIR; return -1; } cpid = fork (); switch (cpid) { case -1: /* cannot fork */ return -1; /* errno already set */ case 0: /* child process */ execl ("/bin/rmdir", "rmdir", dpath, (char *) 0); _exit (1); default: /* parent process */ /* Wait for kid to finish. */ while (wait (&status) != cpid) /* Do nothing. */ ; if (status & 0xFFFF) { /* /bin/rmdir failed. */ errno = EIO; return -1; } return 0; } } tar-1.11.8/lib/rx.c 644 625 1 533655 5762162431 7027 /* Copyright (C) 1992, 1993, 1994, 1995 Free Software Foundation, Inc. This file is part of the librx library. Librx is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. Librx is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU Library General Public License along with this software; see the file COPYING.LIB. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* NOTE!!! AIX is so losing it requires this to be the first thing in the * file. * Do not put ANYTHING before it! */ #if !defined (__GNUC__) && defined (_AIX) #pragma alloca #endif /* To make linux happy? */ #ifndef _GNU_SOURCE #define _GNU_SOURCE #endif #if HAVE_CONFIG_H #include #endif char rx_version_string[] = "GNU Rx version 0.07.1"; /* ``Too hard!'' * -- anon. */ #include #include #ifndef isgraph #define isgraph(c) (isprint (c) && !isspace (c)) #endif #ifndef isblank #define isblank(c) ((c) == ' ' || (c) == '\t') #endif #include #undef MAX #undef MIN #define MAX(a, b) ((a) > (b) ? (a) : (b)) #define MIN(a, b) ((a) < (b) ? (a) : (b)) typedef char boolean; #define false 0 #define true 1 #ifndef __GCC__ #undef __inline__ #define __inline__ #endif /* Emacs already defines alloca, sometimes. */ #ifndef alloca /* Make alloca work the best possible way. */ #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not __GNUC__ */ #if HAVE_ALLOCA_H #include #else /* not __GNUC__ or HAVE_ALLOCA_H */ #ifndef _AIX /* Already did AIX, up at the top. */ char *alloca (); #endif /* not _AIX */ #endif /* not HAVE_ALLOCA_H */ #endif /* not __GNUC__ */ #endif /* not alloca */ /* Memory management and stuff for emacs. */ #define CHARBITS 8 #define remalloc(M, S) (M ? realloc (M, S) : malloc (S)) /* Should we use malloc or alloca? If REGEX_MALLOC is not defined, we * use `alloca' instead of `malloc' for the backtracking stack. * * Emacs will die miserably if we don't do this. */ #ifdef REGEX_MALLOC #define REGEX_ALLOCATE malloc #else /* not REGEX_MALLOC */ #define REGEX_ALLOCATE alloca #endif /* not REGEX_MALLOC */ #ifdef RX_WANT_RX_DEFS #define RX_DECL extern #define RX_DEF_QUAL #else #define RX_WANT_RX_DEFS #define RX_DECL static #define RX_DEF_QUAL static #endif #include "rx.h" #undef RX_DECL #define RX_DECL RX_DEF_QUAL #ifndef emacs #ifdef SYNTAX_TABLE extern char *re_syntax_table; #else /* not SYNTAX_TABLE */ #ifdef __STDC__ static void init_syntax_once (void) #else static void init_syntax_once () #endif { register int c; static int done = 0; if (done) return; bzero (re_syntax_table, sizeof re_syntax_table); for (c = 'a'; c <= 'z'; c++) re_syntax_table[c] = Sword; for (c = 'A'; c <= 'Z'; c++) re_syntax_table[c] = Sword; for (c = '0'; c <= '9'; c++) re_syntax_table[c] = Sword; re_syntax_table['_'] = Sword; done = 1; } #endif /* not SYNTAX_TABLE */ #endif /* not emacs */ /* Compile with `-DRX_DEBUG' and use the following flags. * * Debugging flags: * rx_debug - print information as a regexp is compiled * rx_debug_trace - print information as a regexp is executed */ #ifdef RX_DEBUG int rx_debug_compile = 0; int rx_debug_trace = 0; static struct re_pattern_buffer * dbug_rxb = 0; #ifdef __STDC__ typedef void (*side_effect_printer) (struct rx *, void *, FILE *); #else typedef void (*side_effect_printer) (); #endif #ifdef __STDC__ static void print_cset (struct rx *rx, rx_Bitset cset, FILE * fp); #else static void print_cset (); #endif #ifdef __STDC__ static void print_rexp (struct rx *rx, struct rexp_node *node, int depth, side_effect_printer seprint, FILE * fp) #else static void print_rexp (rx, node, depth, seprint, fp) struct rx *rx; struct rexp_node *node; int depth; side_effect_printer seprint; FILE * fp; #endif { if (!node) return; else { switch (node->type) { case r_cset: { fprintf (fp, "%*s", depth, ""); print_cset (rx, node->params.cset, fp); fputc ('\n', fp); break; } case r_opt: case r_star: fprintf (fp, "%*s%s\n", depth, "", node->type == r_opt ? "opt" : "star"); print_rexp (rx, node->params.pair.left, depth + 3, seprint, fp); break; case r_2phase_star: fprintf (fp, "%*s2phase star\n", depth, ""); print_rexp (rx, node->params.pair.right, depth + 3, seprint, fp); print_rexp (rx, node->params.pair.left, depth + 3, seprint, fp); break; case r_alternate: case r_concat: fprintf (fp, "%*s%s\n", depth, "", node->type == r_alternate ? "alt" : "concat"); print_rexp (rx, node->params.pair.left, depth + 3, seprint, fp); print_rexp (rx, node->params.pair.right, depth + 3, seprint, fp); break; case r_side_effect: fprintf (fp, "%*sSide effect: ", depth, ""); seprint (rx, node->params.side_effect, fp); fputc ('\n', fp); } } } #ifdef __STDC__ static void print_nfa (struct rx * rx, struct rx_nfa_state * n, side_effect_printer seprint, FILE * fp) #else static void print_nfa (rx, n, seprint, fp) struct rx * rx; struct rx_nfa_state * n; side_effect_printer seprint; FILE * fp; #endif { while (n) { struct rx_nfa_edge *e = n->edges; struct rx_possible_future *ec = n->futures; fprintf (fp, "node %d %s\n", n->id, n->is_final ? "final" : (n->is_start ? "start" : "")); while (e) { fprintf (fp, " edge to %d, ", e->dest->id); switch (e->type) { case ne_epsilon: fprintf (fp, "epsilon\n"); break; case ne_side_effect: fprintf (fp, "side effect "); seprint (rx, e->params.side_effect, fp); fputc ('\n', fp); break; case ne_cset: fprintf (fp, "cset "); print_cset (rx, e->params.cset, fp); fputc ('\n', fp); break; } e = e->next; } while (ec) { int x; struct rx_nfa_state_set * s; struct rx_se_list * l; fprintf (fp, " eclosure to {"); for (s = ec->destset; s; s = s->cdr) fprintf (fp, "%d ", s->car->id); fprintf (fp, "} ("); for (l = ec->effects; l; l = l->cdr) { seprint (rx, l->car, fp); fputc (' ', fp); } fprintf (fp, ")\n"); ec = ec->next; } n = n->next; } } static char * efnames [] = { "bogon", "re_se_try", "re_se_pushback", "re_se_push0", "re_se_pushpos", "re_se_chkpos", "re_se_poppos", "re_se_at_dot", "re_se_syntax", "re_se_not_syntax", "re_se_begbuf", "re_se_hat", "re_se_wordbeg", "re_se_wordbound", "re_se_notwordbound", "re_se_wordend", "re_se_endbuf", "re_se_dollar", "re_se_fail", }; static char * efnames2[] = { "re_se_win", "re_se_lparen", "re_se_rparen", "re_se_backref", "re_se_iter", "re_se_end_iter", "re_se_tv" }; static char * inx_names[] = { "rx_backtrack_point", "rx_do_side_effects", "rx_cache_miss", "rx_next_char", "rx_backtrack", "rx_error_inx", "rx_num_instructions" }; #ifdef __STDC__ static void re_seprint (struct rx * rx, void * effect, FILE * fp) #else static void re_seprint (rx, effect, fp) struct rx * rx; void * effect; FILE * fp; #endif { if ((int)effect < 0) fputs (efnames[-(int)effect], fp); else if (dbug_rxb) { struct re_se_params * p = &dbug_rxb->se_params[(int)effect]; fprintf (fp, "%s(%d,%d)", efnames2[p->se], p->op1, p->op2); } else fprintf (fp, "[complex op # %d]", (int)effect); } /* These are so the regex.c regression tests will compile. */ void print_compiled_pattern (rxb) struct re_pattern_buffer * rxb; { } void print_fastmap (fm) char * fm; { } #endif /* RX_DEBUG */ /* This page: Bitsets. Completely unintersting. */ #ifdef __STDC__ RX_DECL int rx_bitset_is_equal (int size, rx_Bitset a, rx_Bitset b) #else RX_DECL int rx_bitset_is_equal (size, a, b) int size; rx_Bitset a; rx_Bitset b; #endif { int x; RX_subset s = b[0]; b[0] = ~a[0]; for (x = rx_bitset_numb_subsets(size) - 1; a[x] == b[x]; --x) ; b[0] = s; return !x && s == a[0]; } #ifdef __STDC__ RX_DECL int rx_bitset_is_subset (int size, rx_Bitset a, rx_Bitset b) #else RX_DECL int rx_bitset_is_subset (size, a, b) int size; rx_Bitset a; rx_Bitset b; #endif { int x = rx_bitset_numb_subsets(size) - 1; while (x-- && (a[x] & b[x]) == a[x]); return x == -1; } #ifdef __STDC__ RX_DECL int rx_bitset_empty (int size, rx_Bitset set) #else RX_DECL int rx_bitset_empty (size, set) int size; rx_Bitset set; #endif { int x; RX_subset s = set[0]; set[0] = 1; for (x = rx_bitset_numb_subsets(size) - 1; !set[x]; --x) ; set[0] = s; return !s; } #ifdef __STDC__ RX_DECL void rx_bitset_null (int size, rx_Bitset b) #else RX_DECL void rx_bitset_null (size, b) int size; rx_Bitset b; #endif { bzero (b, rx_sizeof_bitset(size)); } #ifdef __STDC__ RX_DECL void rx_bitset_universe (int size, rx_Bitset b) #else RX_DECL void rx_bitset_universe (size, b) int size; rx_Bitset b; #endif { int x = rx_bitset_numb_subsets (size); while (x--) *b++ = ~(RX_subset)0; } #ifdef __STDC__ RX_DECL void rx_bitset_complement (int size, rx_Bitset b) #else RX_DECL void rx_bitset_complement (size, b) int size; rx_Bitset b; #endif { int x = rx_bitset_numb_subsets (size); while (x--) { *b = ~*b; ++b; } } #ifdef __STDC__ RX_DECL void rx_bitset_assign (int size, rx_Bitset a, rx_Bitset b) #else RX_DECL void rx_bitset_assign (size, a, b) int size; rx_Bitset a; rx_Bitset b; #endif { int x; for (x = rx_bitset_numb_subsets(size) - 1; x >=0; --x) a[x] = b[x]; } #ifdef __STDC__ RX_DECL void rx_bitset_union (int size, rx_Bitset a, rx_Bitset b) #else RX_DECL void rx_bitset_union (size, a, b) int size; rx_Bitset a; rx_Bitset b; #endif { int x; for (x = rx_bitset_numb_subsets(size) - 1; x >=0; --x) a[x] |= b[x]; } #ifdef __STDC__ RX_DECL void rx_bitset_intersection (int size, rx_Bitset a, rx_Bitset b) #else RX_DECL void rx_bitset_intersection (size, a, b) int size; rx_Bitset a; rx_Bitset b; #endif { int x; for (x = rx_bitset_numb_subsets(size) - 1; x >=0; --x) a[x] &= b[x]; } #ifdef __STDC__ RX_DECL void rx_bitset_difference (int size, rx_Bitset a, rx_Bitset b) #else RX_DECL void rx_bitset_difference (size, a, b) int size; rx_Bitset a; rx_Bitset b; #endif { int x; for (x = rx_bitset_numb_subsets(size) - 1; x >=0; --x) a[x] &= ~ b[x]; } #ifdef __STDC__ RX_DECL void rx_bitset_revdifference (int size, rx_Bitset a, rx_Bitset b) #else RX_DECL void rx_bitset_revdifference (size, a, b) int size; rx_Bitset a; rx_Bitset b; #endif { int x; for (x = rx_bitset_numb_subsets(size) - 1; x >=0; --x) a[x] = ~a[x] & b[x]; } #ifdef __STDC__ RX_DECL void rx_bitset_xor (int size, rx_Bitset a, rx_Bitset b) #else RX_DECL void rx_bitset_xor (size, a, b) int size; rx_Bitset a; rx_Bitset b; #endif { int x; for (x = rx_bitset_numb_subsets(size) - 1; x >=0; --x) a[x] ^= b[x]; } #ifdef __STDC__ RX_DECL unsigned long rx_bitset_hash (int size, rx_Bitset b) #else RX_DECL unsigned long rx_bitset_hash (size, b) int size; rx_Bitset b; #endif { int x; unsigned long hash = (unsigned long)rx_bitset_hash; for (x = rx_bitset_numb_subsets(size) - 1; x >= 0; --x) hash ^= rx_bitset_subset_val(b, x); return hash; } RX_DECL RX_subset rx_subset_singletons [RX_subset_bits] = { 0x1, 0x2, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000, 0x2000, 0x4000, 0x8000, 0x10000, 0x20000, 0x40000, 0x80000, 0x100000, 0x200000, 0x400000, 0x800000, 0x1000000, 0x2000000, 0x4000000, 0x8000000, 0x10000000, 0x20000000, 0x40000000, 0x80000000 }; #ifdef RX_DEBUG #ifdef __STDC__ static void print_cset (struct rx *rx, rx_Bitset cset, FILE * fp) #else static void print_cset (rx, cset, fp) struct rx *rx; rx_Bitset cset; FILE * fp; #endif { int x; fputc ('[', fp); for (x = 0; x < rx->local_cset_size; ++x) if (RX_bitset_member (cset, x)) { if (isprint(x)) fputc (x, fp); else fprintf (fp, "\\0%o ", x); } fputc (']', fp); } #endif /* RX_DEBUG */ static unsigned long rx_hash_masks[4] = { 0x12488421, 0x96699669, 0xbe7dd7eb, 0xffffffff }; /* Hash tables */ #ifdef __STDC__ RX_DECL struct rx_hash_item * rx_hash_find (struct rx_hash * table, unsigned long hash, void * value, struct rx_hash_rules * rules) #else RX_DECL struct rx_hash_item * rx_hash_find (table, hash, value, rules) struct rx_hash * table; unsigned long hash; void * value; struct rx_hash_rules * rules; #endif { rx_hash_eq eq = rules->eq; int maskc = 0; long mask = rx_hash_masks [0]; int bucket = (hash & mask) % 13; while (table->children [bucket]) { table = table->children [bucket]; ++maskc; mask = rx_hash_masks[maskc]; bucket = (hash & mask) % 13; } { struct rx_hash_item * it = table->buckets[bucket]; while (it) if (eq (it->data, value)) return it; else it = it->next_same_hash; } return 0; } #ifdef __STDC__ RX_DECL struct rx_hash_item * rx_hash_store (struct rx_hash * table, unsigned long hash, void * value, struct rx_hash_rules * rules) #else RX_DECL struct rx_hash_item * rx_hash_store (table, hash, value, rules) struct rx_hash * table; unsigned long hash; void * value; struct rx_hash_rules * rules; #endif { rx_hash_eq eq = rules->eq; int maskc = 0; long mask = rx_hash_masks[0]; int bucket = (hash & mask) % 13; int depth = 0; while (table->children [bucket]) { table = table->children [bucket]; ++maskc; mask = rx_hash_masks[maskc]; bucket = (hash & mask) % 13; ++depth; } { struct rx_hash_item * it = table->buckets[bucket]; while (it) if (eq (it->data, value)) return it; else it = it->next_same_hash; } { if ( (depth < 3) && (table->bucket_size [bucket] >= 4)) { struct rx_hash * newtab = ((struct rx_hash *) rules->hash_alloc (rules)); if (!newtab) goto add_to_bucket; bzero (newtab, sizeof (*newtab)); newtab->parent = table; { struct rx_hash_item * them = table->buckets[bucket]; unsigned long newmask = rx_hash_masks[maskc + 1]; while (them) { struct rx_hash_item * save = them->next_same_hash; int new_buck = (them->hash & newmask) % 13; them->next_same_hash = newtab->buckets[new_buck]; newtab->buckets[new_buck] = them; them->table = newtab; them = save; ++newtab->bucket_size[new_buck]; ++newtab->refs; } table->refs = (table->refs - table->bucket_size[bucket] + 1); table->bucket_size[bucket] = 0; table->buckets[bucket] = 0; table->children[bucket] = newtab; table = newtab; bucket = (hash & newmask) % 13; } } } add_to_bucket: { struct rx_hash_item * it = ((struct rx_hash_item *) rules->hash_item_alloc (rules, value)); if (!it) return 0; it->hash = hash; it->table = table; /* DATA and BINDING are to be set in hash_item_alloc */ it->next_same_hash = table->buckets [bucket]; table->buckets[bucket] = it; ++table->bucket_size [bucket]; ++table->refs; return it; } } #ifdef __STDC__ RX_DECL void rx_hash_free (struct rx_hash_item * it, struct rx_hash_rules * rules) #else RX_DECL void rx_hash_free (it, rules) struct rx_hash_item * it; struct rx_hash_rules * rules; #endif { if (it) { struct rx_hash * table = it->table; unsigned long hash = it->hash; int depth = (table->parent ? (table->parent->parent ? (table->parent->parent->parent ? 3 : 2) : 1) : 0); int bucket = (hash & rx_hash_masks [depth]) % 13; struct rx_hash_item ** pos = &table->buckets [bucket]; while (*pos != it) pos = &(*pos)->next_same_hash; *pos = it->next_same_hash; rules->free_hash_item (it, rules); --table->bucket_size[bucket]; --table->refs; while (!table->refs && depth) { struct rx_hash * save = table; table = table->parent; --depth; bucket = (hash & rx_hash_masks [depth]) % 13; --table->refs; table->children[bucket] = 0; rules->free_hash (save, rules); } } } #ifdef __STDC__ RX_DECL void rx_free_hash_table (struct rx_hash * tab, rx_hash_freefn freefn, struct rx_hash_rules * rules) #else RX_DECL void rx_free_hash_table (tab, freefn, rules) struct rx_hash * tab; rx_hash_freefn freefn; struct rx_hash_rules * rules; #endif { int x; for (x = 0; x < 13; ++x) if (tab->children[x]) { rx_free_hash_table (tab->children[x], freefn, rules); rules->free_hash (tab->children[x], rules); } else { struct rx_hash_item * them = tab->buckets[x]; while (them) { struct rx_hash_item * that = them; them = that->next_same_hash; freefn (that); rules->free_hash_item (that, rules); } } } /* Utilities for manipulating bitset represntations of characters sets. */ #ifdef __STDC__ RX_DECL rx_Bitset rx_cset (struct rx *rx) #else RX_DECL rx_Bitset rx_cset (rx) struct rx *rx; #endif { rx_Bitset b = (rx_Bitset) malloc (rx_sizeof_bitset (rx->local_cset_size)); if (b) rx_bitset_null (rx->local_cset_size, b); return b; } #ifdef __STDC__ RX_DECL rx_Bitset rx_copy_cset (struct rx *rx, rx_Bitset a) #else RX_DECL rx_Bitset rx_copy_cset (rx, a) struct rx *rx; rx_Bitset a; #endif { rx_Bitset cs = rx_cset (rx); if (cs) rx_bitset_union (rx->local_cset_size, cs, a); return cs; } #ifdef __STDC__ RX_DECL void rx_free_cset (struct rx * rx, rx_Bitset c) #else RX_DECL void rx_free_cset (rx, c) struct rx * rx; rx_Bitset c; #endif { if (c) free ((char *)c); } /* Hash table memory allocation policy for the regexp compiler */ #ifdef __STDC__ static struct rx_hash * compiler_hash_alloc (struct rx_hash_rules * rules) #else static struct rx_hash * compiler_hash_alloc (rules) struct rx_hash_rules * rules; #endif { return (struct rx_hash *)malloc (sizeof (struct rx_hash)); } #ifdef __STDC__ static struct rx_hash_item * compiler_hash_item_alloc (struct rx_hash_rules * rules, void * value) #else static struct rx_hash_item * compiler_hash_item_alloc (rules, value) struct rx_hash_rules * rules; void * value; #endif { struct rx_hash_item * it; it = (struct rx_hash_item *)malloc (sizeof (*it)); if (it) { it->data = value; it->binding = 0; } return it; } #ifdef __STDC__ static void compiler_free_hash (struct rx_hash * tab, struct rx_hash_rules * rules) #else static void compiler_free_hash (tab, rules) struct rx_hash * tab; struct rx_hash_rules * rules; #endif { free ((char *)tab); } #ifdef __STDC__ static void compiler_free_hash_item (struct rx_hash_item * item, struct rx_hash_rules * rules) #else static void compiler_free_hash_item (item, rules) struct rx_hash_item * item; struct rx_hash_rules * rules; #endif { free ((char *)item); } /* This page: REXP_NODE (expression tree) structures. */ #ifdef __STDC__ RX_DECL struct rexp_node * rexp_node (struct rx *rx, enum rexp_node_type type) #else RX_DECL struct rexp_node * rexp_node (rx, type) struct rx *rx; enum rexp_node_type type; #endif { struct rexp_node *n; n = (struct rexp_node *)malloc (sizeof (*n)); bzero (n, sizeof (*n)); if (n) n->type = type; return n; } /* free_rexp_node assumes that the bitset passed to rx_mk_r_cset * can be freed using rx_free_cset. */ #ifdef __STDC__ RX_DECL struct rexp_node * rx_mk_r_cset (struct rx * rx, rx_Bitset b) #else RX_DECL struct rexp_node * rx_mk_r_cset (rx, b) struct rx * rx; rx_Bitset b; #endif { struct rexp_node * n = rexp_node (rx, r_cset); if (n) n->params.cset = b; return n; } #ifdef __STDC__ RX_DECL struct rexp_node * rx_mk_r_concat (struct rx * rx, struct rexp_node * a, struct rexp_node * b) #else RX_DECL struct rexp_node * rx_mk_r_concat (rx, a, b) struct rx * rx; struct rexp_node * a; struct rexp_node * b; #endif { struct rexp_node * n = rexp_node (rx, r_concat); if (n) { n->params.pair.left = a; n->params.pair.right = b; } return n; } #ifdef __STDC__ RX_DECL struct rexp_node * rx_mk_r_alternate (struct rx * rx, struct rexp_node * a, struct rexp_node * b) #else RX_DECL struct rexp_node * rx_mk_r_alternate (rx, a, b) struct rx * rx; struct rexp_node * a; struct rexp_node * b; #endif { struct rexp_node * n = rexp_node (rx, r_alternate); if (n) { n->params.pair.left = a; n->params.pair.right = b; } return n; } #ifdef __STDC__ RX_DECL struct rexp_node * rx_mk_r_opt (struct rx * rx, struct rexp_node * a) #else RX_DECL struct rexp_node * rx_mk_r_opt (rx, a) struct rx * rx; struct rexp_node * a; #endif { struct rexp_node * n = rexp_node (rx, r_opt); if (n) { n->params.pair.left = a; n->params.pair.right = 0; } return n; } #ifdef __STDC__ RX_DECL struct rexp_node * rx_mk_r_star (struct rx * rx, struct rexp_node * a) #else RX_DECL struct rexp_node * rx_mk_r_star (rx, a) struct rx * rx; struct rexp_node * a; #endif { struct rexp_node * n = rexp_node (rx, r_star); if (n) { n->params.pair.left = a; n->params.pair.right = 0; } return n; } #ifdef __STDC__ RX_DECL struct rexp_node * rx_mk_r_2phase_star (struct rx * rx, struct rexp_node * a, struct rexp_node * b) #else RX_DECL struct rexp_node * rx_mk_r_2phase_star (rx, a, b) struct rx * rx; struct rexp_node * a; struct rexp_node * b; #endif { struct rexp_node * n = rexp_node (rx, r_2phase_star); if (n) { n->params.pair.left = a; n->params.pair.right = b; } return n; } #ifdef __STDC__ RX_DECL struct rexp_node * rx_mk_r_side_effect (struct rx * rx, rx_side_effect a) #else RX_DECL struct rexp_node * rx_mk_r_side_effect (rx, a) struct rx * rx; rx_side_effect a; #endif { struct rexp_node * n = rexp_node (rx, r_side_effect); if (n) { n->params.side_effect = a; n->params.pair.right = 0; } return n; } #ifdef __STDC__ RX_DECL struct rexp_node * rx_mk_r_data (struct rx * rx, void * a) #else RX_DECL struct rexp_node * rx_mk_r_data (rx, a) struct rx * rx; void * a; #endif { struct rexp_node * n = rexp_node (rx, r_data); if (n) { n->params.pair.left = a; n->params.pair.right = 0; } return n; } #ifdef __STDC__ RX_DECL void rx_free_rexp (struct rx * rx, struct rexp_node * node) #else RX_DECL void rx_free_rexp (rx, node) struct rx * rx; struct rexp_node * node; #endif { if (node) { switch (node->type) { case r_cset: if (node->params.cset) rx_free_cset (rx, node->params.cset); case r_side_effect: break; case r_concat: case r_alternate: case r_2phase_star: case r_opt: case r_star: rx_free_rexp (rx, node->params.pair.left); rx_free_rexp (rx, node->params.pair.right); break; case r_data: /* This shouldn't occur. */ break; } free ((char *)node); } } #ifdef __STDC__ RX_DECL struct rexp_node * rx_copy_rexp (struct rx *rx, struct rexp_node *node) #else RX_DECL struct rexp_node * rx_copy_rexp (rx, node) struct rx *rx; struct rexp_node *node; #endif { if (!node) return 0; else { struct rexp_node *n = rexp_node (rx, node->type); if (!n) return 0; switch (node->type) { case r_cset: n->params.cset = rx_copy_cset (rx, node->params.cset); if (!n->params.cset) { rx_free_rexp (rx, n); return 0; } break; case r_side_effect: n->params.side_effect = node->params.side_effect; break; case r_concat: case r_alternate: case r_opt: case r_2phase_star: case r_star: n->params.pair.left = rx_copy_rexp (rx, node->params.pair.left); n->params.pair.right = rx_copy_rexp (rx, node->params.pair.right); if ( (node->params.pair.left && !n->params.pair.left) || (node->params.pair.right && !n->params.pair.right)) { rx_free_rexp (rx, n); return 0; } break; case r_data: /* shouldn't happen */ break; } return n; } } /* This page: functions to build and destroy graphs that describe nfa's */ /* Constructs a new nfa node. */ #ifdef __STDC__ RX_DECL struct rx_nfa_state * rx_nfa_state (struct rx *rx) #else RX_DECL struct rx_nfa_state * rx_nfa_state (rx) struct rx *rx; #endif { struct rx_nfa_state * n = (struct rx_nfa_state *)malloc (sizeof (*n)); if (!n) return 0; bzero (n, sizeof (*n)); n->next = rx->nfa_states; rx->nfa_states = n; return n; } #ifdef __STDC__ RX_DECL void rx_free_nfa_state (struct rx_nfa_state * n) #else RX_DECL void rx_free_nfa_state (n) struct rx_nfa_state * n; #endif { free ((char *)n); } /* This looks up an nfa node, given a numeric id. Numeric id's are * assigned after the nfa has been built. */ #ifdef __STDC__ RX_DECL struct rx_nfa_state * rx_id_to_nfa_state (struct rx * rx, int id) #else RX_DECL struct rx_nfa_state * rx_id_to_nfa_state (rx, id) struct rx * rx; int id; #endif { struct rx_nfa_state * n; for (n = rx->nfa_states; n; n = n->next) if (n->id == id) return n; return 0; } /* This adds an edge between two nodes, but doesn't initialize the * edge label. */ #ifdef __STDC__ RX_DECL struct rx_nfa_edge * rx_nfa_edge (struct rx *rx, enum rx_nfa_etype type, struct rx_nfa_state *start, struct rx_nfa_state *dest) #else RX_DECL struct rx_nfa_edge * rx_nfa_edge (rx, type, start, dest) struct rx *rx; enum rx_nfa_etype type; struct rx_nfa_state *start; struct rx_nfa_state *dest; #endif { struct rx_nfa_edge *e; e = (struct rx_nfa_edge *)malloc (sizeof (*e)); if (!e) return 0; e->next = start->edges; start->edges = e; e->type = type; e->dest = dest; return e; } #ifdef __STDC__ RX_DECL void rx_free_nfa_edge (struct rx_nfa_edge * e) #else RX_DECL void rx_free_nfa_edge (e) struct rx_nfa_edge * e; #endif { free ((char *)e); } /* This constructs a POSSIBLE_FUTURE, which is a kind epsilon-closure * of an NFA. These are added to an nfa automaticly by eclose_nfa. */ #ifdef __STDC__ static struct rx_possible_future * rx_possible_future (struct rx * rx, struct rx_se_list * effects) #else static struct rx_possible_future * rx_possible_future (rx, effects) struct rx * rx; struct rx_se_list * effects; #endif { struct rx_possible_future *ec; ec = (struct rx_possible_future *) malloc (sizeof (*ec)); if (!ec) return 0; ec->destset = 0; ec->next = 0; ec->effects = effects; return ec; } #ifdef __STDC__ static void rx_free_possible_future (struct rx_possible_future * pf) #else static void rx_free_possible_future (pf) struct rx_possible_future * pf; #endif { free ((char *)pf); } #ifdef __STDC__ RX_DECL void rx_free_nfa (struct rx *rx) #else RX_DECL void rx_free_nfa (rx) struct rx *rx; #endif { while (rx->nfa_states) { while (rx->nfa_states->edges) { switch (rx->nfa_states->edges->type) { case ne_cset: rx_free_cset (rx, rx->nfa_states->edges->params.cset); break; default: break; } { struct rx_nfa_edge * e; e = rx->nfa_states->edges; rx->nfa_states->edges = rx->nfa_states->edges->next; rx_free_nfa_edge (e); } } /* while (rx->nfa_states->edges) */ { /* Iterate over the partial epsilon closures of rx->nfa_states */ struct rx_possible_future * pf = rx->nfa_states->futures; while (pf) { struct rx_possible_future * pft = pf; pf = pf->next; rx_free_possible_future (pft); } } { struct rx_nfa_state *n; n = rx->nfa_states; rx->nfa_states = rx->nfa_states->next; rx_free_nfa_state (n); } } } /* This page: translating a pattern expression into an nfa and doing the * static part of the nfa->super-nfa translation. */ /* This is the thompson regexp->nfa algorithm. * It is modified to allow for `side-effect epsilons.' Those are * edges that are taken whenever a similar epsilon edge would be, * but which imply that some side effect occurs when the edge * is taken. * * Side effects are used to model parts of the pattern langauge * that are not regular (in the formal sense). */ #ifdef __STDC__ RX_DECL int rx_build_nfa (struct rx *rx, struct rexp_node *rexp, struct rx_nfa_state **start, struct rx_nfa_state **end) #else RX_DECL int rx_build_nfa (rx, rexp, start, end) struct rx *rx; struct rexp_node *rexp; struct rx_nfa_state **start; struct rx_nfa_state **end; #endif { struct rx_nfa_edge *edge; /* Start & end nodes may have been allocated by the caller. */ *start = *start ? *start : rx_nfa_state (rx); if (!*start) return 0; if (!rexp) { *end = *start; return 1; } *end = *end ? *end : rx_nfa_state (rx); if (!*end) { rx_free_nfa_state (*start); return 0; } switch (rexp->type) { case r_data: return 0; case r_cset: edge = rx_nfa_edge (rx, ne_cset, *start, *end); if (!edge) return 0; edge->params.cset = rx_copy_cset (rx, rexp->params.cset); if (!edge->params.cset) { rx_free_nfa_edge (edge); return 0; } return 1; case r_opt: return (rx_build_nfa (rx, rexp->params.pair.left, start, end) && rx_nfa_edge (rx, ne_epsilon, *start, *end)); case r_star: { struct rx_nfa_state * star_start = 0; struct rx_nfa_state * star_end = 0; return (rx_build_nfa (rx, rexp->params.pair.left, &star_start, &star_end) && star_start && star_end && rx_nfa_edge (rx, ne_epsilon, star_start, star_end) && rx_nfa_edge (rx, ne_epsilon, *start, star_start) && rx_nfa_edge (rx, ne_epsilon, star_end, *end) && rx_nfa_edge (rx, ne_epsilon, star_end, star_start)); } case r_2phase_star: { struct rx_nfa_state * star_start = 0; struct rx_nfa_state * star_end = 0; struct rx_nfa_state * loop_exp_start = 0; struct rx_nfa_state * loop_exp_end = 0; return (rx_build_nfa (rx, rexp->params.pair.left, &star_start, &star_end) && rx_build_nfa (rx, rexp->params.pair.right, &loop_exp_start, &loop_exp_end) && star_start && star_end && loop_exp_end && loop_exp_start && rx_nfa_edge (rx, ne_epsilon, star_start, *end) && rx_nfa_edge (rx, ne_epsilon, *start, star_start) && rx_nfa_edge (rx, ne_epsilon, star_end, *end) && rx_nfa_edge (rx, ne_epsilon, star_end, loop_exp_start) && rx_nfa_edge (rx, ne_epsilon, loop_exp_end, star_start)); } case r_concat: { struct rx_nfa_state *shared = 0; return (rx_build_nfa (rx, rexp->params.pair.left, start, &shared) && rx_build_nfa (rx, rexp->params.pair.right, &shared, end)); } case r_alternate: { struct rx_nfa_state *ls = 0; struct rx_nfa_state *le = 0; struct rx_nfa_state *rs = 0; struct rx_nfa_state *re = 0; return (rx_build_nfa (rx, rexp->params.pair.left, &ls, &le) && rx_build_nfa (rx, rexp->params.pair.right, &rs, &re) && rx_nfa_edge (rx, ne_epsilon, *start, ls) && rx_nfa_edge (rx, ne_epsilon, *start, rs) && rx_nfa_edge (rx, ne_epsilon, le, *end) && rx_nfa_edge (rx, ne_epsilon, re, *end)); } case r_side_effect: edge = rx_nfa_edge (rx, ne_side_effect, *start, *end); if (!edge) return 0; edge->params.side_effect = rexp->params.side_effect; return 1; } /* this should never happen */ return 0; } /* RX_NAME_NFA_STATES identifies all nodes with outgoing non-epsilon * transitions. Only these nodes can occur in super-states. * All nodes are given an integer id. * The id is non-negative if the node has non-epsilon out-transitions, negative * otherwise (this is because we want the non-negative ids to be used as * array indexes in a few places). */ #ifdef __STDC__ RX_DECL void rx_name_nfa_states (struct rx *rx) #else RX_DECL void rx_name_nfa_states (rx) struct rx *rx; #endif { struct rx_nfa_state *n = rx->nfa_states; rx->nodec = 0; rx->epsnodec = -1; while (n) { struct rx_nfa_edge *e = n->edges; if (n->is_start) n->eclosure_needed = 1; while (e) { switch (e->type) { case ne_epsilon: case ne_side_effect: break; case ne_cset: n->id = rx->nodec++; { struct rx_nfa_edge *from_n = n->edges; while (from_n) { from_n->dest->eclosure_needed = 1; from_n = from_n->next; } } goto cont; } e = e->next; } n->id = rx->epsnodec--; cont: n = n->next; } rx->epsnodec = -rx->epsnodec; } /* This page: data structures for the static part of the nfa->supernfa * translation. * * There are side effect lists -- lists of side effects occuring * along an uninterrupted, acyclic path of side-effect epsilon edges. * Such paths are collapsed to single edges in the course of computing * epsilon closures. Such single edges are labled with a list of all * the side effects entailed in crossing them. Like lists of side * effects are made == by the constructors below. * * There are also nfa state sets. These are used to hold a list of all * states reachable from a starting state for a given type of transition * and side effect list. These are also hash-consed. */ /* The next several functions compare, construct, etc. lists of side * effects. See ECLOSE_NFA (below) for details. */ /* Ordering of rx_se_list * (-1, 0, 1 return value convention). */ #ifdef __STDC__ static int se_list_cmp (void * va, void * vb) #else static int se_list_cmp (va, vb) void * va; void * vb; #endif { struct rx_se_list * a = (struct rx_se_list *)va; struct rx_se_list * b = (struct rx_se_list *)vb; return ((va == vb) ? 0 : (!va ? -1 : (!vb ? 1 : ((long)a->car < (long)b->car ? 1 : ((long)a->car > (long)b->car ? -1 : se_list_cmp ((void *)a->cdr, (void *)b->cdr)))))); } #ifdef __STDC__ static int se_list_equal (void * va, void * vb) #else static int se_list_equal (va, vb) void * va; void * vb; #endif { return !(se_list_cmp (va, vb)); } static struct rx_hash_rules se_list_hash_rules = { se_list_equal, compiler_hash_alloc, compiler_free_hash, compiler_hash_item_alloc, compiler_free_hash_item }; #ifdef __STDC__ static struct rx_se_list * side_effect_cons (struct rx * rx, void * se, struct rx_se_list * list) #else static struct rx_se_list * side_effect_cons (rx, se, list) struct rx * rx; void * se; struct rx_se_list * list; #endif { struct rx_se_list * l; l = ((struct rx_se_list *) malloc (sizeof (*l))); if (!l) return 0; l->car = se; l->cdr = list; return l; } #ifdef __STDC__ static struct rx_se_list * hash_cons_se_prog (struct rx * rx, struct rx_hash * memo, void * car, struct rx_se_list * cdr) #else static struct rx_se_list * hash_cons_se_prog (rx, memo, car, cdr) struct rx * rx; struct rx_hash * memo; void * car; struct rx_se_list * cdr; #endif { long hash = (long)car ^ (long)cdr; struct rx_se_list template; template.car = car; template.cdr = cdr; { struct rx_hash_item * it = rx_hash_store (memo, hash, (void *)&template, &se_list_hash_rules); if (!it) return 0; if (it->data == (void *)&template) { struct rx_se_list * consed; consed = (struct rx_se_list *) malloc (sizeof (*consed)); *consed = template; it->data = (void *)consed; } return (struct rx_se_list *)it->data; } } #ifdef __STDC__ static struct rx_se_list * hash_se_prog (struct rx * rx, struct rx_hash * memo, struct rx_se_list * prog) #else static struct rx_se_list * hash_se_prog (rx, memo, prog) struct rx * rx; struct rx_hash * memo; struct rx_se_list * prog; #endif { struct rx_se_list * answer = 0; while (prog) { answer = hash_cons_se_prog (rx, memo, prog->car, answer); if (!answer) return 0; prog = prog->cdr; } return answer; } #ifdef __STDC__ static int nfa_set_cmp (void * va, void * vb) #else static int nfa_set_cmp (va, vb) void * va; void * vb; #endif { struct rx_nfa_state_set * a = (struct rx_nfa_state_set *)va; struct rx_nfa_state_set * b = (struct rx_nfa_state_set *)vb; return ((va == vb) ? 0 : (!va ? -1 : (!vb ? 1 : (a->car->id < b->car->id ? 1 : (a->car->id > b->car->id ? -1 : nfa_set_cmp ((void *)a->cdr, (void *)b->cdr)))))); } #ifdef __STDC__ static int nfa_set_equal (void * va, void * vb) #else static int nfa_set_equal (va, vb) void * va; void * vb; #endif { return !nfa_set_cmp (va, vb); } static struct rx_hash_rules nfa_set_hash_rules = { nfa_set_equal, compiler_hash_alloc, compiler_free_hash, compiler_hash_item_alloc, compiler_free_hash_item }; #ifdef __STDC__ static struct rx_nfa_state_set * nfa_set_cons (struct rx * rx, struct rx_hash * memo, struct rx_nfa_state * state, struct rx_nfa_state_set * set) #else static struct rx_nfa_state_set * nfa_set_cons (rx, memo, state, set) struct rx * rx; struct rx_hash * memo; struct rx_nfa_state * state; struct rx_nfa_state_set * set; #endif { struct rx_nfa_state_set template; struct rx_hash_item * node; template.car = state; template.cdr = set; node = rx_hash_store (memo, (((long)state) >> 8) ^ (long)set, &template, &nfa_set_hash_rules); if (!node) return 0; if (node->data == &template) { struct rx_nfa_state_set * l; l = (struct rx_nfa_state_set *) malloc (sizeof (*l)); node->data = (void *) l; if (!l) return 0; *l = template; } return (struct rx_nfa_state_set *)node->data; } #ifdef __STDC__ static struct rx_nfa_state_set * nfa_set_enjoin (struct rx * rx, struct rx_hash * memo, struct rx_nfa_state * state, struct rx_nfa_state_set * set) #else static struct rx_nfa_state_set * nfa_set_enjoin (rx, memo, state, set) struct rx * rx; struct rx_hash * memo; struct rx_nfa_state * state; struct rx_nfa_state_set * set; #endif { if (!set || state->id < set->car->id) return nfa_set_cons (rx, memo, state, set); if (state->id == set->car->id) return set; else { struct rx_nfa_state_set * newcdr = nfa_set_enjoin (rx, memo, state, set->cdr); if (newcdr != set->cdr) set = nfa_set_cons (rx, memo, set->car, newcdr); return set; } } /* This page: computing epsilon closures. The closures aren't total. * Each node's closures are partitioned according to the side effects entailed * along the epsilon edges. Return true on success. */ struct eclose_frame { struct rx_se_list *prog_backwards; }; #ifdef __STDC__ static int eclose_node (struct rx *rx, struct rx_nfa_state *outnode, struct rx_nfa_state *node, struct eclose_frame *frame) #else static int eclose_node (rx, outnode, node, frame) struct rx *rx; struct rx_nfa_state *outnode; struct rx_nfa_state *node; struct eclose_frame *frame; #endif { struct rx_nfa_edge *e = node->edges; /* For each node, we follow all epsilon paths to build the closure. * The closure omits nodes that have only epsilon edges. * The closure is split into partial closures -- all the states in * a partial closure are reached by crossing the same list of * of side effects (though not necessarily the same path). */ if (node->mark) return 1; node->mark = 1; if (node->id >= 0 || node->is_final) { struct rx_possible_future **ec; struct rx_se_list * prog_in_order = ((struct rx_se_list *)hash_se_prog (rx, &rx->se_list_memo, frame->prog_backwards)); int cmp; ec = &outnode->futures; while (*ec) { cmp = se_list_cmp ((void *)(*ec)->effects, (void *)prog_in_order); if (cmp <= 0) break; ec = &(*ec)->next; } if (!*ec || (cmp < 0)) { struct rx_possible_future * saved = *ec; *ec = rx_possible_future (rx, prog_in_order); (*ec)->next = saved; if (!*ec) return 0; } if (node->id >= 0) { (*ec)->destset = nfa_set_enjoin (rx, &rx->set_list_memo, node, (*ec)->destset); if (!(*ec)->destset) return 0; } } while (e) { switch (e->type) { case ne_epsilon: if (!eclose_node (rx, outnode, e->dest, frame)) return 0; break; case ne_side_effect: { frame->prog_backwards = side_effect_cons (rx, e->params.side_effect, frame->prog_backwards); if (!frame->prog_backwards) return 0; if (!eclose_node (rx, outnode, e->dest, frame)) return 0; { struct rx_se_list * dying = frame->prog_backwards; frame->prog_backwards = frame->prog_backwards->cdr; free ((char *)dying); } break; } default: break; } e = e->next; } node->mark = 0; return 1; } #ifdef __STDC__ RX_DECL int rx_eclose_nfa (struct rx *rx) #else RX_DECL int rx_eclose_nfa (rx) struct rx *rx; #endif { struct rx_nfa_state *n = rx->nfa_states; struct eclose_frame frame; static int rx_id = 0; frame.prog_backwards = 0; rx->rx_id = rx_id++; bzero (&rx->se_list_memo, sizeof (rx->se_list_memo)); bzero (&rx->set_list_memo, sizeof (rx->set_list_memo)); while (n) { n->futures = 0; if (n->eclosure_needed && !eclose_node (rx, n, n, &frame)) return 0; /* clear_marks (rx); */ n = n->next; } return 1; } /* This deletes epsilon edges from an NFA. After running eclose_node, * we have no more need for these edges. They are removed to simplify * further operations on the NFA. */ #ifdef __STDC__ RX_DECL void rx_delete_epsilon_transitions (struct rx *rx) #else RX_DECL void rx_delete_epsilon_transitions (rx) struct rx *rx; #endif { struct rx_nfa_state *n = rx->nfa_states; struct rx_nfa_edge **e; while (n) { e = &n->edges; while (*e) { struct rx_nfa_edge *t; switch ((*e)->type) { case ne_epsilon: case ne_side_effect: t = *e; *e = t->next; rx_free_nfa_edge (t); break; default: e = &(*e)->next; break; } } n = n->next; } } /* This page: storing the nfa in a contiguous region of memory for * subsequent conversion to a super-nfa. */ /* This is for qsort on an array of nfa_states. The order * is based on state ids and goes * [0...MAX][MIN..-1] where (MAX>=0) and (MIN<0) * This way, positive ids double as array indices. */ #ifdef __STDC__ static int nfacmp (void * va, void * vb) #else static int nfacmp (va, vb) void * va; void * vb; #endif { struct rx_nfa_state **a = (struct rx_nfa_state **)va; struct rx_nfa_state **b = (struct rx_nfa_state **)vb; return (*a == *b /* &&&& 3.18 */ ? 0 : (((*a)->id < 0) == ((*b)->id < 0) ? (((*a)->id < (*b)->id) ? -1 : 1) : (((*a)->id < 0) ? 1 : -1))); } #ifdef __STDC__ static int count_hash_nodes (struct rx_hash * st) #else static int count_hash_nodes (st) struct rx_hash * st; #endif { int x; int count = 0; for (x = 0; x < 13; ++x) count += ((st->children[x]) ? count_hash_nodes (st->children[x]) : st->bucket_size[x]); return count; } #ifdef __STDC__ static void se_memo_freer (struct rx_hash_item * node) #else static void se_memo_freer (node) struct rx_hash_item * node; #endif { free ((char *)node->data); } #ifdef __STDC__ static void nfa_set_freer (struct rx_hash_item * node) #else static void nfa_set_freer (node) struct rx_hash_item * node; #endif { free ((char *)node->data); } /* This copies an entire NFA into a single malloced block of memory. * Mostly this is for compatability with regex.c, though it is convenient * to have the nfa nodes in an array. */ #ifdef __STDC__ RX_DECL int rx_compactify_nfa (struct rx *rx, void **mem, unsigned long *size) #else RX_DECL int rx_compactify_nfa (rx, mem, size) struct rx *rx; void **mem; unsigned long *size; #endif { int total_nodec; struct rx_nfa_state *n; int edgec = 0; int eclosec = 0; int se_list_consc = count_hash_nodes (&rx->se_list_memo); int nfa_setc = count_hash_nodes (&rx->set_list_memo); unsigned long total_size; /* This takes place in two stages. First, the total size of the * nfa is computed, then structures are copied. */ n = rx->nfa_states; total_nodec = 0; while (n) { struct rx_nfa_edge *e = n->edges; struct rx_possible_future *ec = n->futures; ++total_nodec; while (e) { ++edgec; e = e->next; } while (ec) { ++eclosec; ec = ec->next; } n = n->next; } total_size = (total_nodec * sizeof (struct rx_nfa_state) + edgec * rx_sizeof_bitset (rx->local_cset_size) + edgec * sizeof (struct rx_nfa_edge) + nfa_setc * sizeof (struct rx_nfa_state_set) + eclosec * sizeof (struct rx_possible_future) + se_list_consc * sizeof (struct rx_se_list) + rx->reserved); if (total_size > *size) { *mem = remalloc (*mem, total_size); if (*mem) *size = total_size; else return 0; } /* Now we've allocated the memory; this copies the NFA. */ { static struct rx_nfa_state **scratch = 0; static int scratch_alloc = 0; struct rx_nfa_state *state_base = (struct rx_nfa_state *) * mem; struct rx_nfa_state *new_state = state_base; struct rx_nfa_edge *new_edge = (struct rx_nfa_edge *) ((char *) state_base + total_nodec * sizeof (struct rx_nfa_state)); struct rx_se_list * new_se_list = (struct rx_se_list *) ((char *)new_edge + edgec * sizeof (struct rx_nfa_edge)); struct rx_possible_future *new_close = ((struct rx_possible_future *) ((char *) new_se_list + se_list_consc * sizeof (struct rx_se_list))); struct rx_nfa_state_set * new_nfa_set = ((struct rx_nfa_state_set *) ((char *)new_close + eclosec * sizeof (struct rx_possible_future))); char *new_bitset = ((char *) new_nfa_set + nfa_setc * sizeof (struct rx_nfa_state_set)); int x; struct rx_nfa_state *n; if (scratch_alloc < total_nodec) { scratch = ((struct rx_nfa_state **) remalloc (scratch, total_nodec * sizeof (*scratch))); if (scratch) scratch_alloc = total_nodec; else { scratch_alloc = 0; return 0; } } for (x = 0, n = rx->nfa_states; n; n = n->next) scratch[x++] = n; qsort (scratch, total_nodec, sizeof (struct rx_nfa_state *), (int (*)())nfacmp); for (x = 0; x < total_nodec; ++x) { struct rx_possible_future *eclose = scratch[x]->futures; struct rx_nfa_edge *edge = scratch[x]->edges; struct rx_nfa_state *cn = new_state++; cn->futures = 0; cn->edges = 0; cn->next = (x == total_nodec - 1) ? 0 : (cn + 1); cn->id = scratch[x]->id; cn->is_final = scratch[x]->is_final; cn->is_start = scratch[x]->is_start; cn->mark = 0; while (edge) { int indx = (edge->dest->id < 0 ? (total_nodec + edge->dest->id) : edge->dest->id); struct rx_nfa_edge *e = new_edge++; rx_Bitset cset = (rx_Bitset) new_bitset; new_bitset += rx_sizeof_bitset (rx->local_cset_size); rx_bitset_null (rx->local_cset_size, cset); rx_bitset_union (rx->local_cset_size, cset, edge->params.cset); e->next = cn->edges; cn->edges = e; e->type = edge->type; e->dest = state_base + indx; e->params.cset = cset; edge = edge->next; } while (eclose) { struct rx_possible_future *ec = new_close++; struct rx_hash_item * sp; struct rx_se_list ** sepos; struct rx_se_list * sesrc; struct rx_nfa_state_set * destlst; struct rx_nfa_state_set ** destpos; ec->next = cn->futures; cn->futures = ec; for (sepos = &ec->effects, sesrc = eclose->effects; sesrc; sesrc = sesrc->cdr, sepos = &(*sepos)->cdr) { sp = rx_hash_find (&rx->se_list_memo, (long)sesrc->car ^ (long)sesrc->cdr, sesrc, &se_list_hash_rules); if (sp->binding) { sesrc = (struct rx_se_list *)sp->binding; break; } *new_se_list = *sesrc; sp->binding = (void *)new_se_list; *sepos = new_se_list; ++new_se_list; } *sepos = sesrc; for (destpos = &ec->destset, destlst = eclose->destset; destlst; destpos = &(*destpos)->cdr, destlst = destlst->cdr) { sp = rx_hash_find (&rx->set_list_memo, ((((long)destlst->car) >> 8) ^ (long)destlst->cdr), destlst, &nfa_set_hash_rules); if (sp->binding) { destlst = (struct rx_nfa_state_set *)sp->binding; break; } *new_nfa_set = *destlst; new_nfa_set->car = state_base + destlst->car->id; sp->binding = (void *)new_nfa_set; *destpos = new_nfa_set; ++new_nfa_set; } *destpos = destlst; eclose = eclose->next; } } } rx_free_hash_table (&rx->se_list_memo, se_memo_freer, &se_list_hash_rules); bzero (&rx->se_list_memo, sizeof (rx->se_list_memo)); rx_free_hash_table (&rx->set_list_memo, nfa_set_freer, &nfa_set_hash_rules); bzero (&rx->set_list_memo, sizeof (rx->set_list_memo)); rx_free_nfa (rx); rx->nfa_states = (struct rx_nfa_state *)*mem; return 1; } /* The functions in the next several pages define the lazy-NFA-conversion used * by matchers. The input to this construction is an NFA such as * is built by compactify_nfa (rx.c). The output is the superNFA. */ /* Match engines can use arbitrary values for opcodes. So, the parse tree * is built using instructions names (enum rx_opcode), but the superstate * nfa is populated with mystery opcodes (void *). * * For convenience, here is an id table. The opcodes are == to their inxs * * The lables in re_search_2 would make good values for instructions. */ void * rx_id_instruction_table[rx_num_instructions] = { (void *) rx_backtrack_point, (void *) rx_do_side_effects, (void *) rx_cache_miss, (void *) rx_next_char, (void *) rx_backtrack, (void *) rx_error_inx }; /* Memory mgt. for superstate graphs. */ #ifdef __STDC__ static char * rx_cache_malloc (struct rx_cache * cache, int bytes) #else static char * rx_cache_malloc (cache, bytes) struct rx_cache * cache; int bytes; #endif { while (cache->bytes_left < bytes) { if (cache->memory_pos) cache->memory_pos = cache->memory_pos->next; if (!cache->memory_pos) { cache->morecore (cache); if (!cache->memory_pos) return 0; } cache->bytes_left = cache->memory_pos->bytes; cache->memory_addr = ((char *)cache->memory_pos + sizeof (struct rx_blocklist)); } cache->bytes_left -= bytes; { char * addr = cache->memory_addr; cache->memory_addr += bytes; return addr; } } #ifdef __STDC__ static void rx_cache_free (struct rx_cache * cache, struct rx_freelist ** freelist, char * mem) #else static void rx_cache_free (cache, freelist, mem) struct rx_cache * cache; struct rx_freelist ** freelist; char * mem; #endif { struct rx_freelist * it = (struct rx_freelist *)mem; it->next = *freelist; *freelist = it; } /* The partially instantiated superstate graph has a transition * table at every node. There is one entry for every character. * This fills in the transition for a set. */ #ifdef __STDC__ static void install_transition (struct rx_superstate *super, struct rx_inx *answer, rx_Bitset trcset) #else static void install_transition (super, answer, trcset) struct rx_superstate *super; struct rx_inx *answer; rx_Bitset trcset; #endif { struct rx_inx * transitions = super->transitions; int chr; for (chr = 0; chr < 256; ) if (!*trcset) { ++trcset; chr += 32; } else { RX_subset sub = *trcset; RX_subset mask = 1; int bound = chr + 32; while (chr < bound) { if (sub & mask) transitions [chr] = *answer; ++chr; mask <<= 1; } ++trcset; } } #ifdef __STDC__ static int qlen (struct rx_superstate * q) #else static int qlen (q) struct rx_superstate * q; #endif { int count = 1; struct rx_superstate * it; if (!q) return 0; for (it = q->next_recyclable; it != q; it = it->next_recyclable) ++count; return count; } #ifdef __STDC__ static void check_cache (struct rx_cache * cache) #else static void check_cache (cache) struct rx_cache * cache; #endif { struct rx_cache * you_fucked_up = 0; int total = cache->superstates; int semi = cache->semifree_superstates; if (semi != qlen (cache->semifree_superstate)) check_cache (you_fucked_up); if ((total - semi) != qlen (cache->lru_superstate)) check_cache (you_fucked_up); } /* When a superstate is old and neglected, it can enter a * semi-free state. A semi-free state is slated to die. * Incoming transitions to a semi-free state are re-written * to cause an (interpreted) fault when they are taken. * The fault handler revives the semi-free state, patches * incoming transitions back to normal, and continues. * * The idea is basicly to free in two stages, aborting * between the two if the state turns out to be useful again. * When a free is aborted, the rescued superstate is placed * in the most-favored slot to maximize the time until it * is next semi-freed. */ #ifdef __STDC__ static void semifree_superstate (struct rx_cache * cache) #else static void semifree_superstate (cache) struct rx_cache * cache; #endif { int disqualified = cache->semifree_superstates; if (disqualified == cache->superstates) return; while (cache->lru_superstate->locks) { cache->lru_superstate = cache->lru_superstate->next_recyclable; ++disqualified; if (disqualified == cache->superstates) return; } { struct rx_superstate * it = cache->lru_superstate; it->next_recyclable->prev_recyclable = it->prev_recyclable; it->prev_recyclable->next_recyclable = it->next_recyclable; cache->lru_superstate = (it == it->next_recyclable ? 0 : it->next_recyclable); if (!cache->semifree_superstate) { cache->semifree_superstate = it; it->next_recyclable = it; it->prev_recyclable = it; } else { it->prev_recyclable = cache->semifree_superstate->prev_recyclable; it->next_recyclable = cache->semifree_superstate; it->prev_recyclable->next_recyclable = it; it->next_recyclable->prev_recyclable = it; } { struct rx_distinct_future *df; it->is_semifree = 1; ++cache->semifree_superstates; df = it->transition_refs; if (df) { df->prev_same_dest->next_same_dest = 0; for (df = it->transition_refs; df; df = df->next_same_dest) { df->future_frame.inx = cache->instruction_table[rx_cache_miss]; df->future_frame.data = 0; df->future_frame.data_2 = (void *) df; /* If there are any NEXT-CHAR instruction frames that * refer to this state, we convert them to CACHE-MISS frames. */ if (!df->effects && (df->edge->options->next_same_super_edge[0] == df->edge->options)) install_transition (df->present, &df->future_frame, df->edge->cset); } df = it->transition_refs; df->prev_same_dest->next_same_dest = df; } } } } #ifdef __STDC__ static void refresh_semifree_superstate (struct rx_cache * cache, struct rx_superstate * super) #else static void refresh_semifree_superstate (cache, super) struct rx_cache * cache; struct rx_superstate * super; #endif { struct rx_distinct_future *df; if (super->transition_refs) { super->transition_refs->prev_same_dest->next_same_dest = 0; for (df = super->transition_refs; df; df = df->next_same_dest) { df->future_frame.inx = cache->instruction_table[rx_next_char]; df->future_frame.data = (void *) super->transitions; /* CACHE-MISS instruction frames that refer to this state, * must be converted to NEXT-CHAR frames. */ if (!df->effects && (df->edge->options->next_same_super_edge[0] == df->edge->options)) install_transition (df->present, &df->future_frame, df->edge->cset); } super->transition_refs->prev_same_dest->next_same_dest = super->transition_refs; } if (cache->semifree_superstate == super) cache->semifree_superstate = (super->prev_recyclable == super ? 0 : super->prev_recyclable); super->next_recyclable->prev_recyclable = super->prev_recyclable; super->prev_recyclable->next_recyclable = super->next_recyclable; if (!cache->lru_superstate) (cache->lru_superstate = super->next_recyclable = super->prev_recyclable = super); else { super->next_recyclable = cache->lru_superstate; super->prev_recyclable = cache->lru_superstate->prev_recyclable; super->next_recyclable->prev_recyclable = super; super->prev_recyclable->next_recyclable = super; } super->is_semifree = 0; --cache->semifree_superstates; } #ifdef __STDC__ static void rx_refresh_this_superstate (struct rx_cache * cache, struct rx_superstate * superstate) #else static void rx_refresh_this_superstate (cache, superstate) struct rx_cache * cache; struct rx_superstate * superstate; #endif { if (superstate->is_semifree) refresh_semifree_superstate (cache, superstate); else if (cache->lru_superstate == superstate) cache->lru_superstate = superstate->next_recyclable; else if (superstate != cache->lru_superstate->prev_recyclable) { superstate->next_recyclable->prev_recyclable = superstate->prev_recyclable; superstate->prev_recyclable->next_recyclable = superstate->next_recyclable; superstate->next_recyclable = cache->lru_superstate; superstate->prev_recyclable = cache->lru_superstate->prev_recyclable; superstate->next_recyclable->prev_recyclable = superstate; superstate->prev_recyclable->next_recyclable = superstate; } } #ifdef __STDC__ static void release_superset_low (struct rx_cache * cache, struct rx_superset *set) #else static void release_superset_low (cache, set) struct rx_cache * cache; struct rx_superset *set; #endif { if (!--set->refs) { if (set->cdr) release_superset_low (cache, set->cdr); set->starts_for = 0; rx_hash_free (rx_hash_find (&cache->superset_table, (unsigned long)set->car ^ set->id ^ (unsigned long)set->cdr, (void *)set, &cache->superset_hash_rules), &cache->superset_hash_rules); rx_cache_free (cache, &cache->free_supersets, (char *)set); } } #ifdef __STDC__ RX_DECL void rx_release_superset (struct rx *rx, struct rx_superset *set) #else RX_DECL void rx_release_superset (rx, set) struct rx *rx; struct rx_superset *set; #endif { release_superset_low (rx->cache, set); } /* This tries to add a new superstate to the superstate freelist. * It might, as a result, free some edge pieces or hash tables. * If nothing can be freed because too many locks are being held, fail. */ #ifdef __STDC__ static int rx_really_free_superstate (struct rx_cache * cache) #else static int rx_really_free_superstate (cache) struct rx_cache * cache; #endif { int locked_superstates = 0; struct rx_superstate * it; if (!cache->superstates) return 0; { /* This is a total guess. The idea is that we should expect as * many misses as we've recently experienced. I.e., cache->misses * should be the same as cache->semifree_superstates. */ while ((cache->hits + cache->misses) > cache->superstates_allowed) { cache->hits >>= 1; cache->misses >>= 1; } if ( ((cache->hits + cache->misses) * cache->semifree_superstates) < (cache->superstates * cache->misses)) { semifree_superstate (cache); semifree_superstate (cache); } } while (cache->semifree_superstate && cache->semifree_superstate->locks) { refresh_semifree_superstate (cache, cache->semifree_superstate); ++locked_superstates; if (locked_superstates == cache->superstates) return 0; } if (cache->semifree_superstate) { it = cache->semifree_superstate; it->next_recyclable->prev_recyclable = it->prev_recyclable; it->prev_recyclable->next_recyclable = it->next_recyclable; cache->semifree_superstate = ((it == it->next_recyclable) ? 0 : it->next_recyclable); --cache->semifree_superstates; } else { while (cache->lru_superstate->locks) { cache->lru_superstate = cache->lru_superstate->next_recyclable; ++locked_superstates; if (locked_superstates == cache->superstates) return 0; } it = cache->lru_superstate; it->next_recyclable->prev_recyclable = it->prev_recyclable; it->prev_recyclable->next_recyclable = it->next_recyclable; cache->lru_superstate = ((it == it->next_recyclable) ? 0 : it->next_recyclable); } if (it->transition_refs) { struct rx_distinct_future *df; for (df = it->transition_refs, df->prev_same_dest->next_same_dest = 0; df; df = df->next_same_dest) { df->future_frame.inx = cache->instruction_table[rx_cache_miss]; df->future_frame.data = 0; df->future_frame.data_2 = (void *) df; df->future = 0; } it->transition_refs->prev_same_dest->next_same_dest = it->transition_refs; } { struct rx_super_edge *tc = it->edges; while (tc) { struct rx_distinct_future * df; struct rx_super_edge *tct = tc->next; df = tc->options; df->next_same_super_edge[1]->next_same_super_edge[0] = 0; while (df) { struct rx_distinct_future *dft = df; df = df->next_same_super_edge[0]; if (dft->future && dft->future->transition_refs == dft) { dft->future->transition_refs = dft->next_same_dest; if (dft->future->transition_refs == dft) dft->future->transition_refs = 0; } dft->next_same_dest->prev_same_dest = dft->prev_same_dest; dft->prev_same_dest->next_same_dest = dft->next_same_dest; rx_cache_free (cache, &cache->free_discernable_futures, (char *)dft); } rx_cache_free (cache, &cache->free_transition_classes, (char *)tc); tc = tct; } } if (it->contents->superstate == it) it->contents->superstate = 0; release_superset_low (cache, it->contents); rx_cache_free (cache, &cache->free_superstates, (char *)it); --cache->superstates; return 1; } #ifdef __STDC__ static char * rx_cache_get (struct rx_cache * cache, struct rx_freelist ** freelist) #else static char * rx_cache_get (cache, freelist) struct rx_cache * cache; struct rx_freelist ** freelist; #endif { while (!*freelist && rx_really_free_superstate (cache)) ; if (!*freelist) return 0; { struct rx_freelist * it = *freelist; *freelist = it->next; return (char *)it; } } #ifdef __STDC__ static char * rx_cache_malloc_or_get (struct rx_cache * cache, struct rx_freelist ** freelist, int bytes) #else static char * rx_cache_malloc_or_get (cache, freelist, bytes) struct rx_cache * cache; struct rx_freelist ** freelist; int bytes; #endif { if (!*freelist) { char * answer = rx_cache_malloc (cache, bytes); if (answer) return answer; } return rx_cache_get (cache, freelist); } #ifdef __STDC__ static char * rx_cache_get_superstate (struct rx_cache * cache) #else static char * rx_cache_get_superstate (cache) struct rx_cache * cache; #endif { char * answer; int bytes = ( sizeof (struct rx_superstate) + cache->local_cset_size * sizeof (struct rx_inx)); if (!cache->free_superstates && (cache->superstates < cache->superstates_allowed)) { answer = rx_cache_malloc (cache, bytes); if (answer) { ++cache->superstates; return answer; } } answer = rx_cache_get (cache, &cache->free_superstates); if (!answer) { answer = rx_cache_malloc (cache, bytes); if (answer) ++cache->superstates_allowed; } ++cache->superstates; return answer; } #ifdef __STDC__ static int supersetcmp (void * va, void * vb) #else static int supersetcmp (va, vb) void * va; void * vb; #endif { struct rx_superset * a = (struct rx_superset *)va; struct rx_superset * b = (struct rx_superset *)vb; return ( (a == b) || (a && b && (a->car == b->car) && (a->cdr == b->cdr))); } #ifdef __STDC__ static struct rx_hash_item * superset_allocator (struct rx_hash_rules * rules, void * val) #else static struct rx_hash_item * superset_allocator (rules, val) struct rx_hash_rules * rules; void * val; #endif { struct rx_cache * cache = ((struct rx_cache *) ((char *)rules - (unsigned long)(&((struct rx_cache *)0)->superset_hash_rules))); struct rx_superset * template = (struct rx_superset *)val; struct rx_superset * newset = ((struct rx_superset *) rx_cache_malloc_or_get (cache, &cache->free_supersets, sizeof (*template))); if (!newset) return 0; newset->refs = 0; newset->car = template->car; newset->id = template->car->id; newset->cdr = template->cdr; newset->superstate = 0; rx_protect_superset (rx, template->cdr); newset->hash_item.data = (void *)newset; newset->hash_item.binding = 0; return &newset->hash_item; } #ifdef __STDC__ static struct rx_hash * super_hash_allocator (struct rx_hash_rules * rules) #else static struct rx_hash * super_hash_allocator (rules) struct rx_hash_rules * rules; #endif { struct rx_cache * cache = ((struct rx_cache *) ((char *)rules - (unsigned long)(&((struct rx_cache *)0)->superset_hash_rules))); return ((struct rx_hash *) rx_cache_malloc_or_get (cache, &cache->free_hash, sizeof (struct rx_hash))); } #ifdef __STDC__ static void super_hash_liberator (struct rx_hash * hash, struct rx_hash_rules * rules) #else static void super_hash_liberator (hash, rules) struct rx_hash * hash; struct rx_hash_rules * rules; #endif { struct rx_cache * cache = ((struct rx_cache *) (char *)rules - (long)(&((struct rx_cache *)0)->superset_hash_rules)); rx_cache_free (cache, &cache->free_hash, (char *)hash); } #ifdef __STDC__ static void superset_hash_item_liberator (struct rx_hash_item * it, struct rx_hash_rules * rules) #else static void superset_hash_item_liberator (it, rules) /* Well, it does ya know. */ struct rx_hash_item * it; struct rx_hash_rules * rules; #endif { } int rx_cache_bound = 128; static int rx_default_cache_got = 0; #ifdef __STDC__ static int bytes_for_cache_size (int supers, int cset_size) #else static int bytes_for_cache_size (supers, cset_size) int supers; int cset_size; #endif { /* What the hell is this? !!!*/ return (int) ((float)supers * ( (1.03 * (float) ( rx_sizeof_bitset (cset_size) + sizeof (struct rx_super_edge))) + (1.80 * (float) sizeof (struct rx_possible_future)) + (float) ( sizeof (struct rx_superstate) + cset_size * sizeof (struct rx_inx)))); } #ifdef __STDC__ static void rx_morecore (struct rx_cache * cache) #else static void rx_morecore (cache) struct rx_cache * cache; #endif { if (rx_default_cache_got >= rx_cache_bound) return; rx_default_cache_got += 16; cache->superstates_allowed = rx_cache_bound; { struct rx_blocklist ** pos = &cache->memory; int size = bytes_for_cache_size (16, cache->local_cset_size); while (*pos) pos = &(*pos)->next; *pos = ((struct rx_blocklist *) malloc (size + sizeof (struct rx_blocklist))); if (!*pos) return; (*pos)->next = 0; (*pos)->bytes = size; cache->memory_pos = *pos; cache->memory_addr = (char *)*pos + sizeof (**pos); cache->bytes_left = size; } } static struct rx_cache default_cache = { { supersetcmp, super_hash_allocator, super_hash_liberator, superset_allocator, superset_hash_item_liberator, }, 0, 0, 0, 0, rx_morecore, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 256, rx_id_instruction_table, { 0, 0, {0}, {0}, {0} } }; /* This adds an element to a superstate set. These sets are lists, such * that lists with == elements are ==. The empty set is returned by * superset_cons (rx, 0, 0) and is NOT equivelent to * (struct rx_superset)0. */ #ifdef __STDC__ RX_DECL struct rx_superset * rx_superset_cons (struct rx * rx, struct rx_nfa_state *car, struct rx_superset *cdr) #else RX_DECL struct rx_superset * rx_superset_cons (rx, car, cdr) struct rx * rx; struct rx_nfa_state *car; struct rx_superset *cdr; #endif { struct rx_cache * cache = rx->cache; if (!car && !cdr) { if (!cache->empty_superset) { cache->empty_superset = ((struct rx_superset *) rx_cache_malloc_or_get (cache, &cache->free_supersets, sizeof (struct rx_superset))); if (!cache->empty_superset) return 0; bzero (cache->empty_superset, sizeof (struct rx_superset)); cache->empty_superset->refs = 1000; } return cache->empty_superset; } { struct rx_superset template; struct rx_hash_item * hit; template.car = car; template.cdr = cdr; template.id = car->id; hit = rx_hash_store (&cache->superset_table, (unsigned long)car ^ car->id ^ (unsigned long)cdr, (void *)&template, &cache->superset_hash_rules); return (hit ? (struct rx_superset *)hit->data : 0); } } /* This computes a union of two NFA state sets. The sets do not have the * same representation though. One is a RX_SUPERSET structure (part * of the superstate NFA) and the other is an NFA_STATE_SET (part of the NFA). */ #ifdef __STDC__ RX_DECL struct rx_superset * rx_superstate_eclosure_union (struct rx * rx, struct rx_superset *set, struct rx_nfa_state_set *ecl) #else RX_DECL struct rx_superset * rx_superstate_eclosure_union (rx, set, ecl) struct rx * rx; struct rx_superset *set; struct rx_nfa_state_set *ecl; #endif { if (!ecl) return set; if (!set->car) return rx_superset_cons (rx, ecl->car, rx_superstate_eclosure_union (rx, set, ecl->cdr)); if (set->car == ecl->car) return rx_superstate_eclosure_union (rx, set, ecl->cdr); { struct rx_superset * tail; struct rx_nfa_state * first; if (set->car > ecl->car) { tail = rx_superstate_eclosure_union (rx, set->cdr, ecl); first = set->car; } else { tail = rx_superstate_eclosure_union (rx, set, ecl->cdr); first = ecl->car; } if (!tail) return 0; else { struct rx_superset * answer; answer = rx_superset_cons (rx, first, tail); if (!answer) { rx_protect_superset (rx, tail); rx_release_superset (rx, tail); return 0; } else return answer; } } } /* * This makes sure that a list of rx_distinct_futures contains * a future for each possible set of side effects in the eclosure * of a given state. This is some of the work of filling in a * superstate transition. */ #ifdef __STDC__ static struct rx_distinct_future * include_futures (struct rx *rx, struct rx_distinct_future *df, struct rx_nfa_state *state, struct rx_superstate *superstate) #else static struct rx_distinct_future * include_futures (rx, df, state, superstate) struct rx *rx; struct rx_distinct_future *df; struct rx_nfa_state *state; struct rx_superstate *superstate; #endif { struct rx_possible_future *future; struct rx_cache * cache = rx->cache; for (future = state->futures; future; future = future->next) { struct rx_distinct_future *dfp; struct rx_distinct_future *insert_before = 0; if (df) df->next_same_super_edge[1]->next_same_super_edge[0] = 0; for (dfp = df; dfp; dfp = dfp->next_same_super_edge[0]) if (dfp->effects == future->effects) break; else { int order = rx->se_list_cmp (rx, dfp->effects, future->effects); if (order > 0) { insert_before = dfp; dfp = 0; break; } } if (df) df->next_same_super_edge[1]->next_same_super_edge[0] = df; if (!dfp) { dfp = ((struct rx_distinct_future *) rx_cache_malloc_or_get (cache, &cache->free_discernable_futures, sizeof (struct rx_distinct_future))); if (!dfp) return 0; if (!df) { df = insert_before = dfp; df->next_same_super_edge[0] = df->next_same_super_edge[1] = df; } else if (!insert_before) insert_before = df; else if (insert_before == df) df = dfp; dfp->next_same_super_edge[0] = insert_before; dfp->next_same_super_edge[1] = insert_before->next_same_super_edge[1]; dfp->next_same_super_edge[1]->next_same_super_edge[0] = dfp; dfp->next_same_super_edge[0]->next_same_super_edge[1] = dfp; dfp->next_same_dest = dfp->prev_same_dest = dfp; dfp->future = 0; dfp->present = superstate; dfp->future_frame.inx = rx->instruction_table[rx_cache_miss]; dfp->future_frame.data = 0; dfp->future_frame.data_2 = (void *) dfp; dfp->side_effects_frame.inx = rx->instruction_table[rx_do_side_effects]; dfp->side_effects_frame.data = 0; dfp->side_effects_frame.data_2 = (void *) dfp; dfp->effects = future->effects; } } return df; } /* This constructs a new superstate from its state set. The only * complexity here is memory management. */ #ifdef __STDC__ RX_DECL struct rx_superstate * rx_superstate (struct rx *rx, struct rx_superset *set) #else RX_DECL struct rx_superstate * rx_superstate (rx, set) struct rx *rx; struct rx_superset *set; #endif { struct rx_cache * cache = rx->cache; struct rx_superstate * superstate = 0; /* Does the superstate already exist in the cache? */ if (set->superstate) { if (set->superstate->rx_id != rx->rx_id) { /* Aha. It is in the cache, but belongs to a superstate * that refers to an NFA that no longer exists. * (We know it no longer exists because it was evidently * stored in the same region of memory as the current nfa * yet it has a different id.) */ superstate = set->superstate; if (!superstate->is_semifree) { if (cache->lru_superstate == superstate) { cache->lru_superstate = superstate->next_recyclable; if (cache->lru_superstate == superstate) cache->lru_superstate = 0; } { superstate->next_recyclable->prev_recyclable = superstate->prev_recyclable; superstate->prev_recyclable->next_recyclable = superstate->next_recyclable; if (!cache->semifree_superstate) { (cache->semifree_superstate = superstate->next_recyclable = superstate->prev_recyclable = superstate); } else { superstate->next_recyclable = cache->semifree_superstate; superstate->prev_recyclable = cache->semifree_superstate->prev_recyclable; superstate->next_recyclable->prev_recyclable = superstate; superstate->prev_recyclable->next_recyclable = superstate; cache->semifree_superstate = superstate; } ++cache->semifree_superstates; } } set->superstate = 0; goto handle_cache_miss; } ++cache->hits; superstate = set->superstate; rx_refresh_this_superstate (cache, superstate); return superstate; } handle_cache_miss: /* This point reached only for cache misses. */ ++cache->misses; #if RX_DEBUG if (rx_debug_trace > 1) { struct rx_superset * setp = set; fprintf (stderr, "Building a superstet %d(%d): ", rx->rx_id, set); while (setp) { fprintf (stderr, "%d ", setp->id); setp = setp->cdr; } fprintf (stderr, "(%d)\n", set); } #endif superstate = (struct rx_superstate *)rx_cache_get_superstate (cache); if (!superstate) return 0; if (!cache->lru_superstate) (cache->lru_superstate = superstate->next_recyclable = superstate->prev_recyclable = superstate); else { superstate->next_recyclable = cache->lru_superstate; superstate->prev_recyclable = cache->lru_superstate->prev_recyclable; ( superstate->prev_recyclable->next_recyclable = superstate->next_recyclable->prev_recyclable = superstate); } superstate->rx_id = rx->rx_id; superstate->transition_refs = 0; superstate->locks = 0; superstate->is_semifree = 0; set->superstate = superstate; superstate->contents = set; rx_protect_superset (rx, set); superstate->edges = 0; { int x; /* None of the transitions from this superstate are known yet. */ for (x = 0; x < rx->local_cset_size; ++x) /* &&&&& 3.8 % */ { struct rx_inx * ifr = &superstate->transitions[x]; ifr->inx = rx->instruction_table [rx_cache_miss]; ifr->data = ifr->data_2 = 0; } } return superstate; } /* This computes the destination set of one edge of the superstate NFA. * Note that a RX_DISTINCT_FUTURE is a superstate edge. * Returns 0 on an allocation failure. */ #ifdef __STDC__ static int solve_destination (struct rx *rx, struct rx_distinct_future *df) #else static int solve_destination (rx, df) struct rx *rx; struct rx_distinct_future *df; #endif { struct rx_super_edge *tc = df->edge; struct rx_superset *nfa_state; struct rx_superset *nil_set = rx_superset_cons (rx, 0, 0); struct rx_superset *solution = nil_set; struct rx_superstate *dest; rx_protect_superset (rx, solution); /* Iterate over all NFA states in the state set of this superstate. */ for (nfa_state = df->present->contents; nfa_state->car; nfa_state = nfa_state->cdr) { struct rx_nfa_edge *e; /* Iterate over all edges of each NFA state. */ for (e = nfa_state->car->edges; e; e = e->next) /* If we find an edge that is labeled with * the characters we are solving for..... */ if (rx_bitset_is_subset (rx->local_cset_size, tc->cset, e->params.cset)) { struct rx_nfa_state *n = e->dest; struct rx_possible_future *pf; /* ....search the partial epsilon closures of the destination * of that edge for a path that involves the same set of * side effects we are solving for. * If we find such a RX_POSSIBLE_FUTURE, we add members to the * stateset we are computing. */ for (pf = n->futures; pf; pf = pf->next) if (pf->effects == df->effects) { struct rx_superset * old_sol; old_sol = solution; solution = rx_superstate_eclosure_union (rx, solution, pf->destset); if (!solution) return 0; rx_protect_superset (rx, solution); rx_release_superset (rx, old_sol); } } } /* It is possible that the RX_DISTINCT_FUTURE we are working on has * the empty set of NFA states as its definition. In that case, this * is a failure point. */ if (solution == nil_set) { df->future_frame.inx = (void *) rx_backtrack; df->future_frame.data = 0; df->future_frame.data_2 = 0; return 1; } dest = rx_superstate (rx, solution); rx_release_superset (rx, solution); if (!dest) return 0; { struct rx_distinct_future *dft; dft = df; df->prev_same_dest->next_same_dest = 0; while (dft) { dft->future = dest; dft->future_frame.inx = rx->instruction_table[rx_next_char]; dft->future_frame.data = (void *) dest->transitions; dft = dft->next_same_dest; } df->prev_same_dest->next_same_dest = df; } if (!dest->transition_refs) dest->transition_refs = df; else { struct rx_distinct_future *dft = dest->transition_refs->next_same_dest; dest->transition_refs->next_same_dest = df->next_same_dest; df->next_same_dest->prev_same_dest = dest->transition_refs; df->next_same_dest = dft; dft->prev_same_dest = df; } return 1; } /* This takes a superstate and a character, and computes some edges * from the superstate NFA. In particular, this computes all edges * that lead from SUPERSTATE given CHR. This function also * computes the set of characters that share this edge set. * This returns 0 on allocation error. * The character set and list of edges are returned through * the paramters CSETOUT and DFOUT. } */ #ifdef __STDC__ static int compute_super_edge (struct rx *rx, struct rx_distinct_future **dfout, rx_Bitset csetout, struct rx_superstate *superstate, unsigned char chr) #else static int compute_super_edge (rx, dfout, csetout, superstate, chr) struct rx *rx; struct rx_distinct_future **dfout; rx_Bitset csetout; struct rx_superstate *superstate; unsigned char chr; #endif { struct rx_superset *stateset = superstate->contents; /* To compute the set of characters that share edges with CHR, * we start with the full character set, and subtract. */ rx_bitset_universe (rx->local_cset_size, csetout); *dfout = 0; /* Iterate over the NFA states in the superstate state-set. */ while (stateset->car) { struct rx_nfa_edge *e; for (e = stateset->car->edges; e; e = e->next) if (RX_bitset_member (e->params.cset, chr)) { /* If we find an NFA edge that applies, we make sure there * are corresponding edges in the superstate NFA. */ { struct rx_distinct_future * saved; saved = *dfout; *dfout = include_futures (rx, *dfout, e->dest, superstate); if (!*dfout) { struct rx_distinct_future * df; df = saved; df->next_same_super_edge[1]->next_same_super_edge[0] = 0; while (df) { struct rx_distinct_future *dft; dft = df; df = df->next_same_super_edge[0]; if (dft->future && dft->future->transition_refs == dft) { dft->future->transition_refs = dft->next_same_dest; if (dft->future->transition_refs == dft) dft->future->transition_refs = 0; } dft->next_same_dest->prev_same_dest = dft->prev_same_dest; dft->prev_same_dest->next_same_dest = dft->next_same_dest; rx_cache_free (rx->cache, &rx->cache->free_discernable_futures, (char *)dft); } return 0; } } /* We also trim the character set a bit. */ rx_bitset_intersection (rx->local_cset_size, csetout, e->params.cset); } else /* An edge that doesn't apply at least tells us some characters * that don't share the same edge set as CHR. */ rx_bitset_difference (rx->local_cset_size, csetout, e->params.cset); stateset = stateset->cdr; } return 1; } /* This is a constructor for RX_SUPER_EDGE structures. These are * wrappers for lists of superstate NFA edges that share character sets labels. * If a transition class contains more than one rx_distinct_future (superstate * edge), then it represents a non-determinism in the superstate NFA. */ #ifdef __STDC__ static struct rx_super_edge * rx_super_edge (struct rx *rx, struct rx_superstate *super, rx_Bitset cset, struct rx_distinct_future *df) #else static struct rx_super_edge * rx_super_edge (rx, super, cset, df) struct rx *rx; struct rx_superstate *super; rx_Bitset cset; struct rx_distinct_future *df; #endif { struct rx_super_edge *tc = (struct rx_super_edge *)rx_cache_malloc_or_get (rx->cache, &rx->cache->free_transition_classes, sizeof (struct rx_super_edge) + rx_sizeof_bitset (rx->local_cset_size)); if (!tc) return 0; tc->next = super->edges; super->edges = tc; tc->rx_backtrack_frame.inx = rx->instruction_table[rx_backtrack_point]; tc->rx_backtrack_frame.data = 0; tc->rx_backtrack_frame.data_2 = (void *) tc; tc->options = df; tc->cset = (rx_Bitset) ((char *) tc + sizeof (*tc)); rx_bitset_assign (rx->local_cset_size, tc->cset, cset); if (df) { struct rx_distinct_future * dfp = df; df->next_same_super_edge[1]->next_same_super_edge[0] = 0; while (dfp) { dfp->edge = tc; dfp = dfp->next_same_super_edge[0]; } df->next_same_super_edge[1]->next_same_super_edge[0] = df; } return tc; } /* There are three kinds of cache miss. The first occurs when a * transition is taken that has never been computed during the * lifetime of the source superstate. That cache miss is handled by * calling COMPUTE_SUPER_EDGE. The second kind of cache miss * occurs when the destination superstate of a transition doesn't * exist. SOLVE_DESTINATION is used to construct the destination superstate. * Finally, the third kind of cache miss occurs when the destination * superstate of a transition is in a `semi-free state'. That case is * handled by UNFREE_SUPERSTATE. * * The function of HANDLE_CACHE_MISS is to figure out which of these * cases applies. */ #ifdef __STDC__ static void install_partial_transition (struct rx_superstate *super, struct rx_inx *answer, RX_subset set, int offset) #else static void install_partial_transition (super, answer, set, offset) struct rx_superstate *super; struct rx_inx *answer; RX_subset set; int offset; #endif { int start = offset; int end = start + 32; RX_subset pos = 1; struct rx_inx * transitions = super->transitions; while (start < end) { if (set & pos) transitions[start] = *answer; pos <<= 1; ++start; } } #ifdef __STDC__ RX_DECL struct rx_inx * rx_handle_cache_miss (struct rx *rx, struct rx_superstate *super, unsigned char chr, void *data) #else RX_DECL struct rx_inx * rx_handle_cache_miss (rx, super, chr, data) struct rx *rx; struct rx_superstate *super; unsigned char chr; void *data; #endif { int offset = chr / RX_subset_bits; struct rx_distinct_future *df = data; if (!df) /* must be the shared_cache_miss_frame */ { /* Perhaps this is just a transition waiting to be filled. */ struct rx_super_edge *tc; RX_subset mask = rx_subset_singletons [chr % RX_subset_bits]; for (tc = super->edges; tc; tc = tc->next) if (tc->cset[offset] & mask) { struct rx_inx * answer; df = tc->options; answer = ((tc->options->next_same_super_edge[0] != tc->options) ? &tc->rx_backtrack_frame : (df->effects ? &df->side_effects_frame : &df->future_frame)); install_partial_transition (super, answer, tc->cset [offset], offset * 32); return answer; } /* Otherwise, it's a flushed or newly encountered edge. */ { char cset_space[1024]; /* this limit is far from unreasonable */ rx_Bitset trcset; struct rx_inx *answer; if (rx_sizeof_bitset (rx->local_cset_size) > sizeof (cset_space)) return 0; /* If the arbitrary limit is hit, always fail */ /* cleanly. */ trcset = (rx_Bitset)cset_space; rx_lock_superstate (rx, super); if (!compute_super_edge (rx, &df, trcset, super, chr)) { rx_unlock_superstate (rx, super); return 0; } if (!df) /* We just computed the fail transition. */ { static struct rx_inx shared_fail_frame = { 0, 0, (void *)rx_backtrack, 0 }; answer = &shared_fail_frame; } else { tc = rx_super_edge (rx, super, trcset, df); if (!tc) { rx_unlock_superstate (rx, super); return 0; } answer = ((tc->options->next_same_super_edge[0] != tc->options) ? &tc->rx_backtrack_frame : (df->effects ? &df->side_effects_frame : &df->future_frame)); } install_partial_transition (super, answer, trcset[offset], offset * 32); rx_unlock_superstate (rx, super); return answer; } } else if (df->future) /* A cache miss on an edge with a future? Must be * a semi-free destination. */ { if (df->future->is_semifree) refresh_semifree_superstate (rx->cache, df->future); return &df->future_frame; } else /* no future superstate on an existing edge */ { rx_lock_superstate (rx, super); if (!solve_destination (rx, df)) { rx_unlock_superstate (rx, super); return 0; } if (!df->effects && (df->edge->options->next_same_super_edge[0] == df->edge->options)) install_partial_transition (super, &df->future_frame, df->edge->cset[offset], offset * 32); rx_unlock_superstate (rx, super); return &df->future_frame; } } /* The rest of the code provides a regex.c compatable interface. */ __const__ char *re_error_msg[] = { 0, /* REG_NOUT */ "No match", /* REG_NOMATCH */ "Invalid regular expression", /* REG_BADPAT */ "Invalid collation character", /* REG_ECOLLATE */ "Invalid character class name", /* REG_ECTYPE */ "Trailing backslash", /* REG_EESCAPE */ "Invalid back reference", /* REG_ESUBREG */ "Unmatched [ or [^", /* REG_EBRACK */ "Unmatched ( or \\(", /* REG_EPAREN */ "Unmatched \\{", /* REG_EBRACE */ "Invalid content of \\{\\}", /* REG_BADBR */ "Invalid range end", /* REG_ERANGE */ "Memory exhausted", /* REG_ESPACE */ "Invalid preceding regular expression", /* REG_BADRPT */ "Premature end of regular expression", /* REG_EEND */ "Regular expression too big", /* REG_ESIZE */ "Unmatched ) or \\)", /* REG_ERPAREN */ }; /* * Macros used while compiling patterns. * * By convention, PEND points just past the end of the uncompiled pattern, * P points to the read position in the pattern. `translate' is the name * of the translation table (`TRANSLATE' is the name of a macro that looks * things up in `translate'). */ /* * Fetch the next character in the uncompiled pattern---translating it * if necessary. *Also cast from a signed character in the constant * string passed to us by the user to an unsigned char that we can use * as an array index (in, e.g., `translate'). */ #define PATFETCH(c) \ do {if (p == pend) return REG_EEND; \ c = (unsigned char) *p++; \ c = translate[c]; \ } while (0) /* * Fetch the next character in the uncompiled pattern, with no * translation. */ #define PATFETCH_RAW(c) \ do {if (p == pend) return REG_EEND; \ c = (unsigned char) *p++; \ } while (0) /* Go backwards one character in the pattern. */ #define PATUNFETCH p-- #define TRANSLATE(d) translate[(unsigned char) (d)] typedef unsigned regnum_t; /* Since offsets can go either forwards or backwards, this type needs to * be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1. */ typedef int pattern_offset_t; typedef struct { struct rexp_node ** top_expression; /* was begalt */ struct rexp_node ** last_expression; /* was laststart */ pattern_offset_t inner_group_offset; regnum_t regnum; } compile_stack_elt_t; typedef struct { compile_stack_elt_t *stack; unsigned size; unsigned avail; /* Offset of next open position. */ } compile_stack_type; #define INIT_COMPILE_STACK_SIZE 32 #define COMPILE_STACK_EMPTY (compile_stack.avail == 0) #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size) /* The next available element. */ #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail]) /* Set the bit for character C in a list. */ #define SET_LIST_BIT(c) \ (b[((unsigned char) (c)) / CHARBITS] \ |= 1 << (((unsigned char) c) % CHARBITS)) /* Get the next unsigned number in the uncompiled pattern. */ #define GET_UNSIGNED_NUMBER(num) \ { if (p != pend) \ { \ PATFETCH (c); \ while (isdigit (c)) \ { \ if (num < 0) \ num = 0; \ num = num * 10 + c - '0'; \ if (p == pend) \ break; \ PATFETCH (c); \ } \ } \ } #define CHAR_CLASS_MAX_LENGTH 6 /* Namely, `xdigit'. */ #define IS_CHAR_CLASS(string) \ (!strcmp (string, "alpha") || !strcmp (string, "upper") \ || !strcmp (string, "lower") || !strcmp (string, "digit") \ || !strcmp (string, "alnum") || !strcmp (string, "xdigit") \ || !strcmp (string, "space") || !strcmp (string, "print") \ || !strcmp (string, "punct") || !strcmp (string, "graph") \ || !strcmp (string, "cntrl") || !strcmp (string, "blank")) /* These predicates are used in regex_compile. */ /* P points to just after a ^ in PATTERN. Return true if that ^ comes * after an alternative or a begin-subexpression. We assume there is at * least one character before the ^. */ #ifdef __STDC__ static boolean at_begline_loc_p (__const__ char *pattern, __const__ char * p, reg_syntax_t syntax) #else static boolean at_begline_loc_p (pattern, p, syntax) __const__ char *pattern; __const__ char * p; reg_syntax_t syntax; #endif { __const__ char *prev = p - 2; boolean prev_prev_backslash = ((prev > pattern) && (prev[-1] == '\\')); return (/* After a subexpression? */ ((*prev == '(') && ((syntax & RE_NO_BK_PARENS) || prev_prev_backslash)) || /* After an alternative? */ ((*prev == '|') && ((syntax & RE_NO_BK_VBAR) || prev_prev_backslash)) ); } /* The dual of at_begline_loc_p. This one is for $. We assume there is * at least one character after the $, i.e., `P < PEND'. */ #ifdef __STDC__ static boolean at_endline_loc_p (__const__ char *p, __const__ char *pend, int syntax) #else static boolean at_endline_loc_p (p, pend, syntax) __const__ char *p; __const__ char *pend; int syntax; #endif { __const__ char *next = p; boolean next_backslash = (*next == '\\'); __const__ char *next_next = (p + 1 < pend) ? (p + 1) : 0; return ( /* Before a subexpression? */ ((syntax & RE_NO_BK_PARENS) ? (*next == ')') : (next_backslash && next_next && (*next_next == ')'))) || /* Before an alternative? */ ((syntax & RE_NO_BK_VBAR) ? (*next == '|') : (next_backslash && next_next && (*next_next == '|'))) ); } unsigned char rx_id_translation[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255 }; /* The compiler keeps an inverted translation table. * This looks up/inititalize elements. * VALID is an array of booleans that validate CACHE. */ #ifdef __STDC__ static rx_Bitset inverse_translation (struct re_pattern_buffer * rxb, char * valid, rx_Bitset cache, unsigned char * translate, int c) #else static rx_Bitset inverse_translation (rxb, valid, cache, translate, c) struct re_pattern_buffer * rxb; char * valid; rx_Bitset cache; unsigned char * translate; int c; #endif { rx_Bitset cs = cache + c * rx_bitset_numb_subsets (rxb->rx.local_cset_size); if (!valid[c]) { int x; int c_tr = TRANSLATE(c); rx_bitset_null (rxb->rx.local_cset_size, cs); for (x = 0; x < 256; ++x) /* &&&& 13.37 */ if (TRANSLATE(x) == c_tr) RX_bitset_enjoin (cs, x); valid[c] = 1; } return cs; } /* More subroutine declarations and macros for regex_compile. */ /* Returns true if REGNUM is in one of COMPILE_STACK's elements and false if it's not. */ #ifdef __STDC__ static boolean group_in_compile_stack (compile_stack_type compile_stack, regnum_t regnum) #else static boolean group_in_compile_stack (compile_stack, regnum) compile_stack_type compile_stack; regnum_t regnum; #endif { int this_element; for (this_element = compile_stack.avail - 1; this_element >= 0; this_element--) if (compile_stack.stack[this_element].regnum == regnum) return true; return false; } /* * Read the ending character of a range (in a bracket expression) from the * uncompiled pattern *P_PTR (which ends at PEND). We assume the * starting character is in `P[-2]'. (`P[-1]' is the character `-'.) * Then we set the translation of all bits between the starting and * ending characters (inclusive) in the compiled pattern B. * * Return an error code. * * We use these short variable names so we can use the same macros as * `regex_compile' itself. */ #ifdef __STDC__ static reg_errcode_t compile_range (struct re_pattern_buffer * rxb, rx_Bitset cs, __const__ char ** p_ptr, __const__ char * pend, unsigned char * translate, reg_syntax_t syntax, rx_Bitset inv_tr, char * valid_inv_tr) #else static reg_errcode_t compile_range (rxb, cs, p_ptr, pend, translate, syntax, inv_tr, valid_inv_tr) struct re_pattern_buffer * rxb; rx_Bitset cs; __const__ char ** p_ptr; __const__ char * pend; unsigned char * translate; reg_syntax_t syntax; rx_Bitset inv_tr; char * valid_inv_tr; #endif { unsigned this_char; __const__ char *p = *p_ptr; unsigned char range_end; unsigned char range_start = TRANSLATE(p[-2]); if (p == pend) return REG_ERANGE; PATFETCH (range_end); (*p_ptr)++; if (range_start > range_end) return syntax & RE_NO_EMPTY_RANGES ? REG_ERANGE : REG_NOERROR; for (this_char = range_start; this_char <= range_end; this_char++) { rx_Bitset it = inverse_translation (rxb, valid_inv_tr, inv_tr, translate, this_char); rx_bitset_union (rxb->rx.local_cset_size, cs, it); } return REG_NOERROR; } /* This searches a regexp for backreference side effects. * It fills in the array OUT with 1 at the index of every register pair * referenced by a backreference. * * This is used to help optimize patterns for searching. The information is * useful because, if the caller doesn't want register values, backreferenced * registers are the only registers for which we need rx_backtrack. */ #ifdef __STDC__ static void find_backrefs (char * out, struct rexp_node * rexp, struct re_se_params * params) #else static void find_backrefs (out, rexp, params) char * out; struct rexp_node * rexp; struct re_se_params * params; #endif { if (rexp) switch (rexp->type) { case r_cset: case r_data: return; case r_alternate: case r_concat: case r_opt: case r_star: case r_2phase_star: find_backrefs (out, rexp->params.pair.left, params); find_backrefs (out, rexp->params.pair.right, params); return; case r_side_effect: if ( ((long)rexp->params.side_effect >= 0) && (params [(long)rexp->params.side_effect].se == re_se_backref)) out[ params [(long)rexp->params.side_effect].op1] = 1; return; } } /* Returns 0 unless the pattern can match the empty string. */ #ifdef __STDC__ static int compute_fastset (struct re_pattern_buffer * rxb, struct rexp_node * rexp) #else static int compute_fastset (rxb, rexp) struct re_pattern_buffer * rxb; struct rexp_node * rexp; #endif { if (!rexp) return 1; switch (rexp->type) { case r_data: return 1; case r_cset: { rx_bitset_union (rxb->rx.local_cset_size, rxb->fastset, rexp->params.cset); } return 0; case r_concat: return (compute_fastset (rxb, rexp->params.pair.left) && compute_fastset (rxb, rexp->params.pair.right)); case r_2phase_star: compute_fastset (rxb, rexp->params.pair.left); /* compute_fastset (rxb, rexp->params.pair.right); nope... */ return 1; case r_alternate: return !!(compute_fastset (rxb, rexp->params.pair.left) + compute_fastset (rxb, rexp->params.pair.right)); case r_opt: case r_star: compute_fastset (rxb, rexp->params.pair.left); return 1; case r_side_effect: return 1; } /* this should never happen */ return 0; } /* returns * 1 -- yes, definately anchored by the given side effect. * 2 -- maybe anchored, maybe the empty string. * 0 -- definately not anchored * There is simply no other possibility. */ #ifdef __STDC__ static int is_anchored (struct rexp_node * rexp, rx_side_effect se) #else static int is_anchored (rexp, se) struct rexp_node * rexp; rx_side_effect se; #endif { if (!rexp) return 2; switch (rexp->type) { case r_cset: case r_data: return 0; case r_concat: case r_2phase_star: { int l = is_anchored (rexp->params.pair.left, se); return (l == 2 ? is_anchored (rexp->params.pair.right, se) : l); } case r_alternate: { int l = is_anchored (rexp->params.pair.left, se); int r = l ? is_anchored (rexp->params.pair.right, se) : 0; if (l == r) return l; else if ((l == 0) || (r == 0)) return 0; else return 2; } case r_opt: case r_star: return is_anchored (rexp->params.pair.left, se) ? 2 : 0; case r_side_effect: return ((rexp->params.side_effect == se) ? 1 : 2); } /* this should never happen */ return 0; } /* This removes register assignments that aren't required by backreferencing. * This can speed up explore_future, especially if it eliminates * non-determinism in the superstate NFA. * * NEEDED is an array of characters, presumably filled in by FIND_BACKREFS. * The non-zero elements of the array indicate which register assignments * can NOT be removed from the expression. */ #ifdef __STDC__ static struct rexp_node * remove_unecessary_side_effects (struct rx * rx, char * needed, struct rexp_node * rexp, struct re_se_params * params) #else static struct rexp_node * remove_unecessary_side_effects (rx, needed, rexp, params) struct rx * rx; char * needed; struct rexp_node * rexp; struct re_se_params * params; #endif { struct rexp_node * l; struct rexp_node * r; if (!rexp) return 0; else switch (rexp->type) { case r_cset: case r_data: return rexp; case r_alternate: case r_concat: case r_2phase_star: l = remove_unecessary_side_effects (rx, needed, rexp->params.pair.left, params); r = remove_unecessary_side_effects (rx, needed, rexp->params.pair.right, params); if ((l && r) || (rexp->type != r_concat)) { rexp->params.pair.left = l; rexp->params.pair.right = r; return rexp; } else { rexp->params.pair.left = rexp->params.pair.right = 0; rx_free_rexp (rx, rexp); return l ? l : r; } case r_opt: case r_star: l = remove_unecessary_side_effects (rx, needed, rexp->params.pair.left, params); if (l) { rexp->params.pair.left = l; return rexp; } else { rexp->params.pair.left = 0; rx_free_rexp (rx, rexp); return 0; } case r_side_effect: { int se = (long)rexp->params.side_effect; if ( (se >= 0) && ( ((enum re_side_effects)params[se].se == re_se_lparen) || ((enum re_side_effects)params[se].se == re_se_rparen)) && (params [se].op1 > 0) && (!needed [params [se].op1])) { rx_free_rexp (rx, rexp); return 0; } else return rexp; } } /* this should never happen */ return 0; } #ifdef __STDC__ static int pointless_if_repeated (struct rexp_node * node, struct re_se_params * params) #else static int pointless_if_repeated (node, params) struct rexp_node * node; struct re_se_params * params; #endif { if (!node) return 1; switch (node->type) { case r_cset: return 0; case r_alternate: case r_concat: case r_2phase_star: return (pointless_if_repeated (node->params.pair.left, params) && pointless_if_repeated (node->params.pair.right, params)); case r_opt: case r_star: return pointless_if_repeated (node->params.pair.left, params); case r_side_effect: switch (((long)node->params.side_effect < 0) ? (enum re_side_effects)node->params.side_effect : (enum re_side_effects)params[(long)node->params.side_effect].se) { case re_se_try: case re_se_at_dot: case re_se_begbuf: case re_se_hat: case re_se_wordbeg: case re_se_wordbound: case re_se_notwordbound: case re_se_wordend: case re_se_endbuf: case re_se_dollar: case re_se_fail: case re_se_win: return 1; case re_se_lparen: case re_se_rparen: case re_se_iter: case re_se_end_iter: case re_se_syntax: case re_se_not_syntax: case re_se_backref: return 0; } case r_data: default: return 0; } } #ifdef __STDC__ static int registers_on_stack (struct re_pattern_buffer * rxb, struct rexp_node * rexp, int in_danger, struct re_se_params * params) #else static int registers_on_stack (rxb, rexp, in_danger, params) struct re_pattern_buffer * rxb; struct rexp_node * rexp; int in_danger; struct re_se_params * params; #endif { if (!rexp) return 0; else switch (rexp->type) { case r_cset: case r_data: return 0; case r_alternate: case r_concat: return ( registers_on_stack (rxb, rexp->params.pair.left, in_danger, params) || (registers_on_stack (rxb, rexp->params.pair.right, in_danger, params))); case r_opt: return registers_on_stack (rxb, rexp->params.pair.left, 0, params); case r_star: return registers_on_stack (rxb, rexp->params.pair.left, 1, params); case r_2phase_star: return ( registers_on_stack (rxb, rexp->params.pair.left, 1, params) || registers_on_stack (rxb, rexp->params.pair.right, 1, params)); case r_side_effect: { int se = (long)rexp->params.side_effect; if ( in_danger && (se >= 0) && (params [se].op1 > 0) && ( ((enum re_side_effects)params[se].se == re_se_lparen) || ((enum re_side_effects)params[se].se == re_se_rparen))) return 1; else return 0; } } /* this should never happen */ return 0; } static char idempotent_complex_se[] = { #define RX_WANT_SE_DEFS 1 #undef RX_DEF_SE #undef RX_DEF_CPLX_SE #define RX_DEF_SE(IDEM, NAME, VALUE) #define RX_DEF_CPLX_SE(IDEM, NAME, VALUE) IDEM, #include "rx.h" #undef RX_DEF_SE #undef RX_DEF_CPLX_SE #undef RX_WANT_SE_DEFS 23 }; static char idempotent_se[] = { 13, #define RX_WANT_SE_DEFS 1 #undef RX_DEF_SE #undef RX_DEF_CPLX_SE #define RX_DEF_SE(IDEM, NAME, VALUE) IDEM, #define RX_DEF_CPLX_SE(IDEM, NAME, VALUE) #include "rx.h" #undef RX_DEF_SE #undef RX_DEF_CPLX_SE #undef RX_WANT_SE_DEFS 42 }; #ifdef __STDC__ static int has_any_se (struct rx * rx, struct rexp_node * rexp) #else static int has_any_se (rx, rexp) struct rx * rx; struct rexp_node * rexp; #endif { if (!rexp) return 0; switch (rexp->type) { case r_cset: case r_data: return 0; case r_side_effect: return 1; case r_2phase_star: case r_concat: case r_alternate: return ( has_any_se (rx, rexp->params.pair.left) || has_any_se (rx, rexp->params.pair.right)); case r_opt: case r_star: return has_any_se (rx, rexp->params.pair.left); } /* this should never happen */ return 0; } /* This must be called AFTER `convert_hard_loops' for a given REXP. */ #ifdef __STDC__ static int has_non_idempotent_epsilon_path (struct rx * rx, struct rexp_node * rexp, struct re_se_params * params) #else static int has_non_idempotent_epsilon_path (rx, rexp, params) struct rx * rx; struct rexp_node * rexp; struct re_se_params * params; #endif { if (!rexp) return 0; switch (rexp->type) { case r_cset: case r_data: case r_star: return 0; case r_side_effect: return !((long)rexp->params.side_effect > 0 ? idempotent_complex_se [ params [(long)rexp->params.side_effect].se ] : idempotent_se [-(long)rexp->params.side_effect]); case r_alternate: return ( has_non_idempotent_epsilon_path (rx, rexp->params.pair.left, params) || has_non_idempotent_epsilon_path (rx, rexp->params.pair.right, params)); case r_2phase_star: case r_concat: return ( has_non_idempotent_epsilon_path (rx, rexp->params.pair.left, params) && has_non_idempotent_epsilon_path (rx, rexp->params.pair.right, params)); case r_opt: return has_non_idempotent_epsilon_path (rx, rexp->params.pair.left, params); } /* this should never happen */ return 0; } /* This computes rougly what it's name suggests. It can (and does) go wrong * in the direction of returning spurious 0 without causing disasters. */ #ifdef __STDC__ static int begins_with_complex_se (struct rx * rx, struct rexp_node * rexp) #else static int begins_with_complex_se (rx, rexp) struct rx * rx; struct rexp_node * rexp; #endif { if (!rexp) return 0; switch (rexp->type) { case r_cset: case r_data: return 0; case r_side_effect: return ((long)rexp->params.side_effect >= 0); case r_alternate: return ( begins_with_complex_se (rx, rexp->params.pair.left) && begins_with_complex_se (rx, rexp->params.pair.right)); case r_concat: return has_any_se (rx, rexp->params.pair.left); case r_opt: case r_star: case r_2phase_star: return 0; } /* this should never happen */ return 0; } /* This destructively removes some of the re_se_tv side effects from * a rexp tree. In particular, during parsing re_se_tv was inserted on the * right half of every | to guarantee that posix path preference could be * honored. This function removes some which it can be determined aren't * needed. */ #ifdef __STDC__ static void speed_up_alt (struct rx * rx, struct rexp_node * rexp, int unposix) #else static void speed_up_alt (rx, rexp, unposix) struct rx * rx; struct rexp_node * rexp; int unposix; #endif { if (!rexp) return; switch (rexp->type) { case r_cset: case r_data: case r_side_effect: return; case r_opt: case r_star: speed_up_alt (rx, rexp->params.pair.left, unposix); return; case r_2phase_star: case r_concat: speed_up_alt (rx, rexp->params.pair.left, unposix); speed_up_alt (rx, rexp->params.pair.right, unposix); return; case r_alternate: /* the right child is guaranteed to be (concat re_se_tv ) */ speed_up_alt (rx, rexp->params.pair.left, unposix); speed_up_alt (rx, rexp->params.pair.right->params.pair.right, unposix); if ( unposix || (begins_with_complex_se (rx, rexp->params.pair.right->params.pair.right)) || !( has_any_se (rx, rexp->params.pair.right->params.pair.right) || has_any_se (rx, rexp->params.pair.left))) { struct rexp_node * conc = rexp->params.pair.right; rexp->params.pair.right = conc->params.pair.right; conc->params.pair.right = 0; rx_free_rexp (rx, conc); } } } /* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX. Returns one of error codes defined in `regex.h', or zero for success. Assumes the `allocated' (and perhaps `buffer') and `translate' fields are set in BUFP on entry. If it succeeds, results are put in BUFP (if it returns an error, the contents of BUFP are undefined): `buffer' is the compiled pattern; `syntax' is set to SYNTAX; `used' is set to the length of the compiled pattern; `fastmap_accurate' is set to zero; `re_nsub' is set to the number of groups in PATTERN; `not_bol' and `not_eol' are set to zero. The `fastmap' and `newline_anchor' fields are neither examined nor set. */ #ifdef __STDC__ RX_DECL reg_errcode_t rx_compile (__const__ char *pattern, int size, reg_syntax_t syntax, struct re_pattern_buffer * rxb) #else RX_DECL reg_errcode_t rx_compile (pattern, size, syntax, rxb) __const__ char *pattern; int size; reg_syntax_t syntax; struct re_pattern_buffer * rxb; #endif { RX_subset inverse_translate [CHAR_SET_SIZE * rx_bitset_numb_subsets(CHAR_SET_SIZE)]; char validate_inv_tr [CHAR_SET_SIZE * rx_bitset_numb_subsets(CHAR_SET_SIZE)]; /* We fetch characters from PATTERN here. Even though PATTERN is `char *' (i.e., signed), we declare these variables as unsigned, so they can be reliably used as array indices. */ register unsigned char c, c1; /* A random tempory spot in PATTERN. */ __const__ char *p1; /* Keeps track of unclosed groups. */ compile_stack_type compile_stack; /* Points to the current (ending) position in the pattern. */ __const__ char *p = pattern; __const__ char *pend = pattern + size; /* How to translate the characters in the pattern. */ unsigned char *translate = (rxb->translate ? rxb->translate : rx_id_translation); /* When parsing is done, this will hold the expression tree. */ struct rexp_node * rexp = 0; /* In the midst of compilation, this holds onto the regexp * first parst while rexp goes on to aquire additional constructs. */ struct rexp_node * orig_rexp = 0; struct rexp_node * fewer_side_effects = 0; /* This and top_expression are saved on the compile stack. */ struct rexp_node ** top_expression = &rexp; struct rexp_node ** last_expression = top_expression; /* Parameter to `goto append_node' */ struct rexp_node * append; /* Counts open-groups as they are encountered. This is the index of the * innermost group being compiled. */ regnum_t regnum = 0; /* Place in the uncompiled pattern (i.e., the {) to * which to go back if the interval is invalid. */ __const__ char *beg_interval; struct re_se_params * params = 0; int paramc = 0; /* How many complex side effects so far? */ rx_side_effect side; /* param to `goto add_side_effect' */ bzero (validate_inv_tr, sizeof (validate_inv_tr)); rxb->rx.instruction_table = rx_id_instruction_table; /* Initialize the compile stack. */ compile_stack.stack = (( compile_stack_elt_t *) malloc ((INIT_COMPILE_STACK_SIZE) * sizeof ( compile_stack_elt_t))); if (compile_stack.stack == 0) return REG_ESPACE; compile_stack.size = INIT_COMPILE_STACK_SIZE; compile_stack.avail = 0; /* Initialize the pattern buffer. */ rxb->rx.cache = &default_cache; rxb->syntax = syntax; rxb->fastmap_accurate = 0; rxb->not_bol = rxb->not_eol = 0; rxb->least_subs = 0; /* Always count groups, whether or not rxb->no_sub is set. * The whole pattern is implicitly group 0, so counting begins * with 1. */ rxb->re_nsub = 0; #if !defined (emacs) && !defined (SYNTAX_TABLE) /* Initialize the syntax table. */ init_syntax_once (); #endif /* Loop through the uncompiled pattern until we're at the end. */ while (p != pend) { PATFETCH (c); switch (c) { case '^': { if ( /* If at start of pattern, it's an operator. */ p == pattern + 1 /* If context independent, it's an operator. */ || syntax & RE_CONTEXT_INDEP_ANCHORS /* Otherwise, depends on what's come before. */ || at_begline_loc_p (pattern, p, syntax)) { struct rexp_node * n = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)re_se_hat); if (!n) return REG_ESPACE; append = n; goto append_node; } else goto normal_char; } break; case '$': { if ( /* If at end of pattern, it's an operator. */ p == pend /* If context independent, it's an operator. */ || syntax & RE_CONTEXT_INDEP_ANCHORS /* Otherwise, depends on what's next. */ || at_endline_loc_p (p, pend, syntax)) { struct rexp_node * n = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)re_se_dollar); if (!n) return REG_ESPACE; append = n; goto append_node; } else goto normal_char; } break; case '+': case '?': if ((syntax & RE_BK_PLUS_QM) || (syntax & RE_LIMITED_OPS)) goto normal_char; handle_plus: case '*': /* If there is no previous pattern... */ if (pointless_if_repeated (*last_expression, params)) { if (syntax & RE_CONTEXT_INVALID_OPS) return REG_BADRPT; else if (!(syntax & RE_CONTEXT_INDEP_OPS)) goto normal_char; } { /* 1 means zero (many) matches is allowed. */ char zero_times_ok = 0, many_times_ok = 0; /* If there is a sequence of repetition chars, collapse it down to just one (the right one). We can't combine interval operators with these because of, e.g., `a{2}*', which should only match an even number of `a's. */ for (;;) { zero_times_ok |= c != '+'; many_times_ok |= c != '?'; if (p == pend) break; PATFETCH (c); if (c == '*' || (!(syntax & RE_BK_PLUS_QM) && (c == '+' || c == '?'))) ; else if (syntax & RE_BK_PLUS_QM && c == '\\') { if (p == pend) return REG_EESCAPE; PATFETCH (c1); if (!(c1 == '+' || c1 == '?')) { PATUNFETCH; PATUNFETCH; break; } c = c1; } else { PATUNFETCH; break; } /* If we get here, we found another repeat character. */ } /* Star, etc. applied to an empty pattern is equivalent to an empty pattern. */ if (!last_expression) break; /* Now we know whether or not zero matches is allowed * and also whether or not two or more matches is allowed. */ { struct rexp_node * inner_exp = *last_expression; int need_sync = 0; if (many_times_ok && has_non_idempotent_epsilon_path (&rxb->rx, inner_exp, params)) { struct rexp_node * pusher = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)re_se_pushpos); struct rexp_node * checker = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)re_se_chkpos); struct rexp_node * pushback = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)re_se_pushback); rx_Bitset cs = rx_cset (&rxb->rx); struct rexp_node * lit_t = rx_mk_r_cset (&rxb->rx, cs); struct rexp_node * fake_state = rx_mk_r_concat (&rxb->rx, pushback, lit_t); struct rexp_node * phase2 = rx_mk_r_concat (&rxb->rx, checker, fake_state); struct rexp_node * popper = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)re_se_poppos); struct rexp_node * star = rx_mk_r_2phase_star (&rxb->rx, inner_exp, phase2); struct rexp_node * a = rx_mk_r_concat (&rxb->rx, pusher, star); struct rexp_node * whole_thing = rx_mk_r_concat (&rxb->rx, a, popper); if (!(pusher && star && pushback && lit_t && fake_state && lit_t && phase2 && checker && popper && a && whole_thing)) return REG_ESPACE; RX_bitset_enjoin (cs, 't'); *last_expression = whole_thing; } else { struct rexp_node * star = (many_times_ok ? rx_mk_r_star : rx_mk_r_opt) (&rxb->rx, *last_expression); if (!star) return REG_ESPACE; *last_expression = star; need_sync = has_any_se (&rxb->rx, *last_expression); } if (!zero_times_ok) { struct rexp_node * concat = rx_mk_r_concat (&rxb->rx, inner_exp, rx_copy_rexp (&rxb->rx, *last_expression)); if (!concat) return REG_ESPACE; *last_expression = concat; } if (need_sync) { int sync_se = paramc; params = (params ? ((struct re_se_params *) realloc (params, sizeof (*params) * (1 + paramc))) : ((struct re_se_params *) malloc (sizeof (*params)))); if (!params) return REG_ESPACE; ++paramc; params [sync_se].se = re_se_tv; side = (rx_side_effect)sync_se; goto add_side_effect; } } /* The old regex.c used to optimize `.*\n'. * Maybe rx should too? */ } break; case '.': { rx_Bitset cs = rx_cset (&rxb->rx); struct rexp_node * n = rx_mk_r_cset (&rxb->rx, cs); if (!(cs && n)) return REG_ESPACE; rx_bitset_universe (rxb->rx.local_cset_size, cs); if (!(rxb->syntax & RE_DOT_NEWLINE)) RX_bitset_remove (cs, '\n'); if (!(rxb->syntax & RE_DOT_NOT_NULL)) RX_bitset_remove (cs, 0); append = n; goto append_node; break; } case '[': if (p == pend) return REG_EBRACK; { boolean had_char_class = false; rx_Bitset cs = rx_cset (&rxb->rx); struct rexp_node * node = rx_mk_r_cset (&rxb->rx, cs); int is_inverted = *p == '^'; if (!(node && cs)) return REG_ESPACE; /* This branch of the switch is normally exited with *`goto append_node' */ append = node; if (is_inverted) p++; /* Remember the first position in the bracket expression. */ p1 = p; /* Read in characters and ranges, setting map bits. */ for (;;) { if (p == pend) return REG_EBRACK; PATFETCH (c); /* \ might escape characters inside [...] and [^...]. */ if ((syntax & RE_BACKSLASH_ESCAPE_IN_LISTS) && c == '\\') { if (p == pend) return REG_EESCAPE; PATFETCH (c1); { rx_Bitset it = inverse_translation (rxb, validate_inv_tr, inverse_translate, translate, c1); rx_bitset_union (rxb->rx.local_cset_size, cs, it); } continue; } /* Could be the end of the bracket expression. If it's not (i.e., when the bracket expression is `[]' so far), the ']' character bit gets set way below. */ if (c == ']' && p != p1 + 1) goto finalize_class_and_append; /* Look ahead to see if it's a range when the last thing was a character class. */ if (had_char_class && c == '-' && *p != ']') return REG_ERANGE; /* Look ahead to see if it's a range when the last thing was a character: if this is a hyphen not at the beginning or the end of a list, then it's the range operator. */ if (c == '-' && !(p - 2 >= pattern && p[-2] == '[') && !(p - 3 >= pattern && p[-3] == '[' && p[-2] == '^') && *p != ']') { reg_errcode_t ret = compile_range (rxb, cs, &p, pend, translate, syntax, inverse_translate, validate_inv_tr); if (ret != REG_NOERROR) return ret; } else if (p[0] == '-' && p[1] != ']') { /* This handles ranges made up of characters only. */ reg_errcode_t ret; /* Move past the `-'. */ PATFETCH (c1); ret = compile_range (rxb, cs, &p, pend, translate, syntax, inverse_translate, validate_inv_tr); if (ret != REG_NOERROR) return ret; } /* See if we're at the beginning of a possible character class. */ else if ((syntax & RE_CHAR_CLASSES) && (c == '[') && (*p == ':')) { char str[CHAR_CLASS_MAX_LENGTH + 1]; PATFETCH (c); c1 = 0; /* If pattern is `[[:'. */ if (p == pend) return REG_EBRACK; for (;;) { PATFETCH (c); if (c == ':' || c == ']' || p == pend || c1 == CHAR_CLASS_MAX_LENGTH) break; str[c1++] = c; } str[c1] = '\0'; /* If isn't a word bracketed by `[:' and:`]': undo the ending character, the letters, and leave the leading `:' and `[' (but set bits for them). */ if (c == ':' && *p == ']') { int ch; boolean is_alnum = !strcmp (str, "alnum"); boolean is_alpha = !strcmp (str, "alpha"); boolean is_blank = !strcmp (str, "blank"); boolean is_cntrl = !strcmp (str, "cntrl"); boolean is_digit = !strcmp (str, "digit"); boolean is_graph = !strcmp (str, "graph"); boolean is_lower = !strcmp (str, "lower"); boolean is_print = !strcmp (str, "print"); boolean is_punct = !strcmp (str, "punct"); boolean is_space = !strcmp (str, "space"); boolean is_upper = !strcmp (str, "upper"); boolean is_xdigit = !strcmp (str, "xdigit"); if (!IS_CHAR_CLASS (str)) return REG_ECTYPE; /* Throw away the ] at the end of the character class. */ PATFETCH (c); if (p == pend) return REG_EBRACK; for (ch = 0; ch < 1 << CHARBITS; ch++) { if ( (is_alnum && isalnum (ch)) || (is_alpha && isalpha (ch)) || (is_blank && isblank (ch)) || (is_cntrl && iscntrl (ch)) || (is_digit && isdigit (ch)) || (is_graph && isgraph (ch)) || (is_lower && islower (ch)) || (is_print && isprint (ch)) || (is_punct && ispunct (ch)) || (is_space && isspace (ch)) || (is_upper && isupper (ch)) || (is_xdigit && isxdigit (ch))) { rx_Bitset it = inverse_translation (rxb, validate_inv_tr, inverse_translate, translate, ch); rx_bitset_union (rxb->rx.local_cset_size, cs, it); } } had_char_class = true; } else { c1++; while (c1--) PATUNFETCH; { rx_Bitset it = inverse_translation (rxb, validate_inv_tr, inverse_translate, translate, '['); rx_bitset_union (rxb->rx.local_cset_size, cs, it); } { rx_Bitset it = inverse_translation (rxb, validate_inv_tr, inverse_translate, translate, ':'); rx_bitset_union (rxb->rx.local_cset_size, cs, it); } had_char_class = false; } } else { had_char_class = false; { rx_Bitset it = inverse_translation (rxb, validate_inv_tr, inverse_translate, translate, c); rx_bitset_union (rxb->rx.local_cset_size, cs, it); } } } finalize_class_and_append: if (is_inverted) { rx_bitset_complement (rxb->rx.local_cset_size, cs); if (syntax & RE_HAT_LISTS_NOT_NEWLINE) RX_bitset_remove (cs, '\n'); } goto append_node; } break; case '(': if (syntax & RE_NO_BK_PARENS) goto handle_open; else goto normal_char; case ')': if (syntax & RE_NO_BK_PARENS) goto handle_close; else goto normal_char; case '\n': if (syntax & RE_NEWLINE_ALT) goto handle_alt; else goto normal_char; case '|': if (syntax & RE_NO_BK_VBAR) goto handle_alt; else goto normal_char; case '{': if ((syntax & RE_INTERVALS) && (syntax & RE_NO_BK_BRACES)) goto handle_interval; else goto normal_char; case '\\': if (p == pend) return REG_EESCAPE; /* Do not translate the character after the \, so that we can distinguish, e.g., \B from \b, even if we normally would translate, e.g., B to b. */ PATFETCH_RAW (c); switch (c) { case '(': if (syntax & RE_NO_BK_PARENS) goto normal_backslash; handle_open: rxb->re_nsub++; regnum++; if (COMPILE_STACK_FULL) { ((compile_stack.stack) = (compile_stack_elt_t *) realloc (compile_stack.stack, ( compile_stack.size << 1) * sizeof ( compile_stack_elt_t))); if (compile_stack.stack == 0) return REG_ESPACE; compile_stack.size <<= 1; } if (*last_expression) { struct rexp_node * concat = rx_mk_r_concat (&rxb->rx, *last_expression, 0); if (!concat) return REG_ESPACE; *last_expression = concat; last_expression = &concat->params.pair.right; } /* * These are the values to restore when we hit end of this * group. */ COMPILE_STACK_TOP.top_expression = top_expression; COMPILE_STACK_TOP.last_expression = last_expression; COMPILE_STACK_TOP.regnum = regnum; compile_stack.avail++; top_expression = last_expression; break; case ')': if (syntax & RE_NO_BK_PARENS) goto normal_backslash; handle_close: /* See similar code for backslashed left paren above. */ if (COMPILE_STACK_EMPTY) if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD) goto normal_char; else return REG_ERPAREN; /* Since we just checked for an empty stack above, this ``can't happen''. */ { /* We don't just want to restore into `regnum', because later groups should continue to be numbered higher, as in `(ab)c(de)' -- the second group is #2. */ regnum_t this_group_regnum; struct rexp_node ** inner = top_expression; compile_stack.avail--; top_expression = COMPILE_STACK_TOP.top_expression; last_expression = COMPILE_STACK_TOP.last_expression; this_group_regnum = COMPILE_STACK_TOP.regnum; { int left_se = paramc; int right_se = paramc + 1; params = (params ? ((struct re_se_params *) realloc (params, (paramc + 2) * sizeof (params[0]))) : ((struct re_se_params *) malloc (2 * sizeof (params[0])))); if (!params) return REG_ESPACE; paramc += 2; params[left_se].se = re_se_lparen; params[left_se].op1 = this_group_regnum; params[right_se].se = re_se_rparen; params[right_se].op1 = this_group_regnum; { struct rexp_node * left = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)left_se); struct rexp_node * right = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)right_se); struct rexp_node * c1 = (*inner ? rx_mk_r_concat (&rxb->rx, left, *inner) : left); struct rexp_node * c2 = rx_mk_r_concat (&rxb->rx, c1, right); if (!(left && right && c1 && c2)) return REG_ESPACE; *inner = c2; } } break; } case '|': /* `\|'. */ if ((syntax & RE_LIMITED_OPS) || (syntax & RE_NO_BK_VBAR)) goto normal_backslash; handle_alt: if (syntax & RE_LIMITED_OPS) goto normal_char; { struct rexp_node * alt = rx_mk_r_alternate (&rxb->rx, *top_expression, 0); if (!alt) return REG_ESPACE; *top_expression = alt; last_expression = &alt->params.pair.right; { int sync_se = paramc; params = (params ? ((struct re_se_params *) realloc (params, (paramc + 1) * sizeof (params[0]))) : ((struct re_se_params *) malloc (sizeof (params[0])))); if (!params) return REG_ESPACE; ++paramc; params[sync_se].se = re_se_tv; { struct rexp_node * sync = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)sync_se); struct rexp_node * conc = rx_mk_r_concat (&rxb->rx, sync, 0); if (!sync || !conc) return REG_ESPACE; *last_expression = conc; last_expression = &conc->params.pair.right; } } } break; case '{': /* If \{ is a literal. */ if (!(syntax & RE_INTERVALS) /* If we're at `\{' and it's not the open-interval operator. */ || ((syntax & RE_INTERVALS) && (syntax & RE_NO_BK_BRACES)) || (p - 2 == pattern && p == pend)) goto normal_backslash; handle_interval: { /* If got here, then the syntax allows intervals. */ /* At least (most) this many matches must be made. */ int lower_bound = -1, upper_bound = -1; beg_interval = p - 1; if (p == pend) { if (syntax & RE_NO_BK_BRACES) goto unfetch_interval; else return REG_EBRACE; } GET_UNSIGNED_NUMBER (lower_bound); if (c == ',') { GET_UNSIGNED_NUMBER (upper_bound); if (upper_bound < 0) upper_bound = RE_DUP_MAX; } else /* Interval such as `{1}' => match exactly once. */ upper_bound = lower_bound; if (lower_bound < 0 || upper_bound > RE_DUP_MAX || lower_bound > upper_bound) { if (syntax & RE_NO_BK_BRACES) goto unfetch_interval; else return REG_BADBR; } if (!(syntax & RE_NO_BK_BRACES)) { if (c != '\\') return REG_EBRACE; PATFETCH (c); } if (c != '}') { if (syntax & RE_NO_BK_BRACES) goto unfetch_interval; else return REG_BADBR; } /* We just parsed a valid interval. */ /* If it's invalid to have no preceding re. */ if (pointless_if_repeated (*last_expression, params)) { if (syntax & RE_CONTEXT_INVALID_OPS) return REG_BADRPT; else if (!(syntax & RE_CONTEXT_INDEP_OPS)) goto unfetch_interval; /* was: else laststart = b; */ } /* If the upper bound is zero, don't want to iterate * at all. */ if (upper_bound == 0) { if (*last_expression) { rx_free_rexp (&rxb->rx, *last_expression); *last_expression = 0; } } else /* Otherwise, we have a nontrivial interval. */ { int iter_se = paramc; int end_se = paramc + 1; params = (params ? ((struct re_se_params *) realloc (params, sizeof (*params) * (2 + paramc))) : ((struct re_se_params *) malloc (2 * sizeof (*params)))); if (!params) return REG_ESPACE; paramc += 2; params [iter_se].se = re_se_iter; params [iter_se].op1 = lower_bound; params[iter_se].op2 = upper_bound; params[end_se].se = re_se_end_iter; params[end_se].op1 = lower_bound; params[end_se].op2 = upper_bound; { struct rexp_node * push0 = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)re_se_push0); struct rexp_node * start_one_iter = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)iter_se); struct rexp_node * phase1 = rx_mk_r_concat (&rxb->rx, start_one_iter, *last_expression); struct rexp_node * pushback = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)re_se_pushback); rx_Bitset cs = rx_cset (&rxb->rx); struct rexp_node * lit_t = rx_mk_r_cset (&rxb->rx, cs); struct rexp_node * phase2 = rx_mk_r_concat (&rxb->rx, pushback, lit_t); struct rexp_node * loop = rx_mk_r_2phase_star (&rxb->rx, phase1, phase2); struct rexp_node * push_n_loop = rx_mk_r_concat (&rxb->rx, push0, loop); struct rexp_node * final_test = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)end_se); struct rexp_node * full_exp = rx_mk_r_concat (&rxb->rx, push_n_loop, final_test); if (!(push0 && start_one_iter && phase1 && pushback && lit_t && phase2 && loop && push_n_loop && final_test && full_exp)) return REG_ESPACE; RX_bitset_enjoin(cs, 't'); *last_expression = full_exp; } } beg_interval = 0; } break; unfetch_interval: /* If an invalid interval, match the characters as literals. */ p = beg_interval; beg_interval = 0; /* normal_char and normal_backslash need `c'. */ PATFETCH (c); if (!(syntax & RE_NO_BK_BRACES)) { if (p > pattern && p[-1] == '\\') goto normal_backslash; } goto normal_char; #ifdef emacs /* There is no way to specify the before_dot and after_dot operators. rms says this is ok. --karl */ case '=': side = (rx_side_effect)rx_se_at_dot; goto add_side_effect; break; case 's': case 'S': { rx_Bitset cs = rx_cset (&rxb->rx); struct rexp_node * set = rx_mk_r_cset (&rxb->rx, cs); if (!(cs && set)) return REG_ESPACE; if (c == 'S') rx_bitset_universe (rxb->rx.local_cset_size, cs); PATFETCH (c); { int x; enum syntaxcode code = syntax_spec_code [c]; for (x = 0; x < 256; ++x) { if (SYNTAX (x) == code) { rx_Bitset it = inverse_translation (rxb, validate_inv_tr, inverse_translate, translate, x); rx_bitset_xor (rxb->rx.local_cset_size, cs, it); } } } append = set; goto append_node; } break; #endif /* emacs */ case 'w': case 'W': { rx_Bitset cs = rx_cset (&rxb->rx); struct rexp_node * n = (cs ? rx_mk_r_cset (&rxb->rx, cs) : 0); if (!(cs && n)) return REG_ESPACE; if (c == 'W') rx_bitset_universe (rxb->rx.local_cset_size ,cs); { int x; for (x = rxb->rx.local_cset_size - 1; x > 0; --x) if (SYNTAX(x) & Sword) RX_bitset_toggle (cs, x); } append = n; goto append_node; } break; /* With a little extra work, some of these side effects could be optimized * away (basicly by looking at what we already know about the surrounding * chars). */ case '<': side = (rx_side_effect)re_se_wordbeg; goto add_side_effect; break; case '>': side = (rx_side_effect)re_se_wordend; goto add_side_effect; break; case 'b': side = (rx_side_effect)re_se_wordbound; goto add_side_effect; break; case 'B': side = (rx_side_effect)re_se_notwordbound; goto add_side_effect; break; case '`': side = (rx_side_effect)re_se_begbuf; goto add_side_effect; break; case '\'': side = (rx_side_effect)re_se_endbuf; goto add_side_effect; break; add_side_effect: { struct rexp_node * se = rx_mk_r_side_effect (&rxb->rx, side); if (!se) return REG_ESPACE; append = se; goto append_node; } break; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (syntax & RE_NO_BK_REFS) goto normal_char; c1 = c - '0'; if (c1 > regnum) return REG_ESUBREG; /* Can't back reference to a subexpression if inside of it. */ if (group_in_compile_stack (compile_stack, c1)) return REG_ESUBREG; { int backref_se = paramc; params = (params ? ((struct re_se_params *) realloc (params, sizeof (*params) * (1 + paramc))) : ((struct re_se_params *) malloc (sizeof (*params)))); if (!params) return REG_ESPACE; ++paramc; params[backref_se].se = re_se_backref; params[backref_se].op1 = c1; side = (rx_side_effect)backref_se; goto add_side_effect; } break; case '+': case '?': if (syntax & RE_BK_PLUS_QM) goto handle_plus; else goto normal_backslash; default: normal_backslash: /* You might think it would be useful for \ to mean not to translate; but if we don't translate it it will never match anything. */ c = TRANSLATE (c); goto normal_char; } break; default: /* Expects the character in `c'. */ normal_char: { rx_Bitset cs = rx_cset(&rxb->rx); struct rexp_node * match = rx_mk_r_cset (&rxb->rx, cs); rx_Bitset it; if (!(cs && match)) return REG_ESPACE; it = inverse_translation (rxb, validate_inv_tr, inverse_translate, translate, c); rx_bitset_union (CHAR_SET_SIZE, cs, it); append = match; append_node: /* This genericly appends the rexp APPEND to *LAST_EXPRESSION * and then parses the next character normally. */ if (*last_expression) { struct rexp_node * concat = rx_mk_r_concat (&rxb->rx, *last_expression, append); if (!concat) return REG_ESPACE; *last_expression = concat; last_expression = &concat->params.pair.right; } else *last_expression = append; } } /* switch (c) */ } /* while p != pend */ { int win_se = paramc; params = (params ? ((struct re_se_params *) realloc (params, sizeof (*params) * (1 + paramc))) : ((struct re_se_params *) malloc (sizeof (*params)))); if (!params) return REG_ESPACE; ++paramc; params[win_se].se = re_se_win; { struct rexp_node * se = rx_mk_r_side_effect (&rxb->rx, (rx_side_effect)win_se); struct rexp_node * concat = rx_mk_r_concat (&rxb->rx, rexp, se); if (!(se && concat)) return REG_ESPACE; rexp = concat; } } /* Through the pattern now. */ if (!COMPILE_STACK_EMPTY) return REG_EPAREN; free (compile_stack.stack); orig_rexp = rexp; #ifdef RX_DEBUG if (rx_debug_compile) { dbug_rxb = rxb; fputs ("\n\nCompiling ", stdout); fwrite (pattern, 1, size, stdout); fputs (":\n", stdout); rxb->se_params = params; print_rexp (&rxb->rx, orig_rexp, 2, re_seprint, stdout); } #endif { rx_Bitset cs = rx_cset(&rxb->rx); rx_Bitset cs2 = rx_cset(&rxb->rx); char * se_map = (char *) alloca (paramc); struct rexp_node * new_rexp = 0; bzero (se_map, paramc); find_backrefs (se_map, rexp, params); fewer_side_effects = remove_unecessary_side_effects (&rxb->rx, se_map, rx_copy_rexp (&rxb->rx, rexp), params); speed_up_alt (&rxb->rx, rexp, 0); speed_up_alt (&rxb->rx, fewer_side_effects, 1); { char * syntax_parens = rxb->syntax_parens; if (syntax_parens == (char *)0x1) rexp = remove_unecessary_side_effects (&rxb->rx, se_map, rexp, params); else if (syntax_parens) { int x; for (x = 0; x < paramc; ++x) if (( (params[x].se == re_se_lparen) || (params[x].se == re_se_rparen)) && (!syntax_parens [params[x].op1])) se_map [x] = 1; rexp = remove_unecessary_side_effects (&rxb->rx, se_map, rexp, params); } } /* At least one more optimization would be nice to have here but i ran out * of time. The idea would be to delay side effects. * For examle, `(abc)' is the same thing as `abc()' except that the * left paren is offset by 3 (which we know at compile time). * (In this comment, write that second pattern `abc(:3:)' * where `(:3:' is a syntactic unit.) * * Trickier: `(abc|defg)' is the same as `(abc(:3:|defg(:4:))' * (The paren nesting may be hard to follow -- that's an alternation * of `abc(:3:' and `defg(:4:' inside (purely syntactic) parens * followed by the closing paren from the original expression.) * * Neither the expression tree representation nor the the nfa make * this very easy to write. :( */ /* What we compile is different than what the parser returns. * Suppose the parser returns expression R. * Let R' be R with unnecessary register assignments removed * (see REMOVE_UNECESSARY_SIDE_EFFECTS, above). * * What we will compile is the expression: * * m{try}R{win}\|s{try}R'{win} * * {try} and {win} denote side effect epsilons (see EXPLORE_FUTURE). * * When trying a match, we insert an `m' at the beginning of the * string if the user wants registers to be filled, `s' if not. */ new_rexp = rx_mk_r_alternate (&rxb->rx, rx_mk_r_concat (&rxb->rx, rx_mk_r_cset (&rxb->rx, cs2), rexp), rx_mk_r_concat (&rxb->rx, rx_mk_r_cset (&rxb->rx, cs), fewer_side_effects)); if (!(new_rexp && cs && cs2)) return REG_ESPACE; RX_bitset_enjoin (cs2, '\0'); /* prefixed to the rexp used for matching. */ RX_bitset_enjoin (cs, '\1'); /* prefixed to the rexp used for searching. */ rexp = new_rexp; } #ifdef RX_DEBUG if (rx_debug_compile) { fputs ("\n...which is compiled as:\n", stdout); print_rexp (&rxb->rx, rexp, 2, re_seprint, stdout); } #endif { struct rx_nfa_state *start = 0; struct rx_nfa_state *end = 0; if (!rx_build_nfa (&rxb->rx, rexp, &start, &end)) return REG_ESPACE; /* */ else { void * mem = (void *)rxb->buffer; unsigned long size = rxb->allocated; int start_id; char * perm_mem; int iterator_size = paramc * sizeof (params[0]); end->is_final = 1; start->is_start = 1; rx_name_nfa_states (&rxb->rx); start_id = start->id; #ifdef RX_DEBUG if (rx_debug_compile) { fputs ("...giving the NFA: \n", stdout); dbug_rxb = rxb; print_nfa (&rxb->rx, rxb->rx.nfa_states, re_seprint, stdout); } #endif if (!rx_eclose_nfa (&rxb->rx)) return REG_ESPACE; else { rx_delete_epsilon_transitions (&rxb->rx); /* For compatability reasons, we need to shove the * compiled nfa into one chunk of malloced memory. */ rxb->rx.reserved = ( sizeof (params[0]) * paramc + rx_sizeof_bitset (rxb->rx.local_cset_size)); #ifdef RX_DEBUG if (rx_debug_compile) { dbug_rxb = rxb; fputs ("...which cooks down (uncompactified) to: \n", stdout); print_nfa (&rxb->rx, rxb->rx.nfa_states, re_seprint, stdout); } #endif if (!rx_compactify_nfa (&rxb->rx, &mem, &size)) return REG_ESPACE; rxb->buffer = mem; rxb->allocated = size; rxb->rx.buffer = mem; rxb->rx.allocated = size; perm_mem = ((char *)rxb->rx.buffer + rxb->rx.allocated - rxb->rx.reserved); rxb->se_params = ((struct re_se_params *)perm_mem); bcopy (params, rxb->se_params, iterator_size); perm_mem += iterator_size; rxb->fastset = (rx_Bitset) perm_mem; rxb->start = rx_id_to_nfa_state (&rxb->rx, start_id); } rx_bitset_null (rxb->rx.local_cset_size, rxb->fastset); rxb->can_match_empty = compute_fastset (rxb, orig_rexp); rxb->match_regs_on_stack = registers_on_stack (rxb, orig_rexp, 0, params); rxb->search_regs_on_stack = registers_on_stack (rxb, fewer_side_effects, 0, params); if (rxb->can_match_empty) rx_bitset_universe (rxb->rx.local_cset_size, rxb->fastset); rxb->is_anchored = is_anchored (orig_rexp, (rx_side_effect) re_se_hat); rxb->begbuf_only = is_anchored (orig_rexp, (rx_side_effect) re_se_begbuf); } rx_free_rexp (&rxb->rx, rexp); if (params) free (params); #ifdef RX_DEBUG if (rx_debug_compile) { dbug_rxb = rxb; fputs ("...which cooks down to: \n", stdout); print_nfa (&rxb->rx, rxb->rx.nfa_states, re_seprint, stdout); } #endif } return REG_NOERROR; } /* This table gives an error message for each of the error codes listed in regex.h. Obviously the order here has to be same as there. */ __const__ char * rx_error_msg[] = { 0, /* REG_NOERROR */ "No match", /* REG_NOMATCH */ "Invalid regular expression", /* REG_BADPAT */ "Invalid collation character", /* REG_ECOLLATE */ "Invalid character class name", /* REG_ECTYPE */ "Trailing backslash", /* REG_EESCAPE */ "Invalid back reference", /* REG_ESUBREG */ "Unmatched [ or [^", /* REG_EBRACK */ "Unmatched ( or \\(", /* REG_EPAREN */ "Unmatched \\{", /* REG_EBRACE */ "Invalid content of \\{\\}", /* REG_BADBR */ "Invalid range end", /* REG_ERANGE */ "Memory exhausted", /* REG_ESPACE */ "Invalid preceding regular expression", /* REG_BADRPT */ "Premature end of regular expression", /* REG_EEND */ "Regular expression too big", /* REG_ESIZE */ "Unmatched ) or \\)", /* REG_ERPAREN */ }; char rx_slowmap [256] = { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, }; #ifdef __STDC__ RX_DECL void rx_blow_up_fastmap (struct re_pattern_buffer * rxb) #else RX_DECL void rx_blow_up_fastmap (rxb) struct re_pattern_buffer * rxb; #endif { int x; for (x = 0; x < 256; ++x) /* &&&& 3.6 % */ rxb->fastmap [x] = !!RX_bitset_member (rxb->fastset, x); rxb->fastmap_accurate = 1; } #if !defined(REGEX_MALLOC) && !defined(__GNUC__) #define RE_SEARCH_2_FN inner_re_search_2 #define RE_S2_QUAL static #else #define RE_SEARCH_2_FN re_search_2 #define RE_S2_QUAL #endif struct re_search_2_closure { __const__ char * string1; int size1; __const__ char * string2; int size2; }; static __inline__ enum rx_get_burst_return re_search_2_get_burst (pos, vclosure, stop) struct rx_string_position * pos; void * vclosure; int stop; { struct re_search_2_closure * closure; closure = (struct re_search_2_closure *)vclosure; if (!closure->string2) { int inset; inset = pos->pos - pos->string; if ((inset < -1) || (inset > closure->size1)) return rx_get_burst_no_more; else { pos->pos = (__const__ unsigned char *) closure->string1 + inset; pos->string = (__const__ unsigned char *) closure->string1; pos->size = closure->size1; pos->end = ((__const__ unsigned char *) MIN(closure->string1 + closure->size1, closure->string1 + stop)); pos->offset = 0; return ((pos->pos < pos->end) ? rx_get_burst_ok : rx_get_burst_no_more); } } else if (!closure->string1) { int inset; inset = pos->pos - pos->string; pos->pos = (__const__ unsigned char *) closure->string2 + inset; pos->string = (__const__ unsigned char *) closure->string2; pos->size = closure->size2; pos->end = ((__const__ unsigned char *) MIN(closure->string2 + closure->size2, closure->string2 + stop)); pos->offset = 0; return ((pos->pos < pos->end) ? rx_get_burst_ok : rx_get_burst_no_more); } else { int inset; inset = pos->pos - pos->string + pos->offset; if (inset < closure->size1) { pos->pos = (__const__ unsigned char *) closure->string1 + inset; pos->string = (__const__ unsigned char *) closure->string1; pos->size = closure->size1; pos->end = ((__const__ unsigned char *) MIN(closure->string1 + closure->size1, closure->string1 + stop)); pos->offset = 0; return rx_get_burst_ok; } else { pos->pos = ((__const__ unsigned char *) closure->string2 + inset - closure->size1); pos->string = (__const__ unsigned char *) closure->string2; pos->size = closure->size2; pos->end = ((__const__ unsigned char *) MIN(closure->string2 + closure->size2, closure->string2 + stop - closure->size1)); pos->offset = closure->size1; return ((pos->pos < pos->end) ? rx_get_burst_ok : rx_get_burst_no_more); } } } static __inline__ enum rx_back_check_return re_search_2_back_check (pos, lparen, rparen, translate, vclosure, stop) struct rx_string_position * pos; int lparen; int rparen; unsigned char * translate; void * vclosure; int stop; { struct rx_string_position there; struct rx_string_position past; there = *pos; there.pos = there.string + lparen - there.offset; re_search_2_get_burst (&there, vclosure, stop); past = *pos; past.pos = past.string + rparen - there.offset; re_search_2_get_burst (&past, vclosure, stop); ++pos->pos; re_search_2_get_burst (pos, vclosure, stop); while ( (there.pos != past.pos) && (pos->pos != pos->end)) if (TRANSLATE(*there.pos) != TRANSLATE(*pos->pos)) return rx_back_check_fail; else { ++there.pos; ++pos->pos; if (there.pos == there.end) re_search_2_get_burst (&there, vclosure, stop); if (pos->pos == pos->end) re_search_2_get_burst (pos, vclosure, stop); } if (there.pos != past.pos) return rx_back_check_fail; --pos->pos; re_search_2_get_burst (pos, vclosure, stop); return rx_back_check_pass; } static __inline__ int re_search_2_fetch_char (pos, offset, app_closure, stop) struct rx_string_position * pos; int offset; void * app_closure; int stop; { struct re_search_2_closure * closure; closure = (struct re_search_2_closure *)app_closure; if (offset == 0) { if (pos->pos >= pos->string) return *pos->pos; else { if ( (pos->string == (__const__ unsigned char *) closure->string2) && (closure->string1) && (closure->size1)) return closure->string1[closure->size1 - 1]; else return 0; /* sure, why not. */ } } if (pos->pos == pos->end) return *closure->string2; else return pos->pos[1]; } #ifdef __STDC__ RE_S2_QUAL int RE_SEARCH_2_FN (struct re_pattern_buffer *rxb, __const__ char * string1, int size1, __const__ char * string2, int size2, int startpos, int range, struct re_registers *regs, int stop) #else RE_S2_QUAL int RE_SEARCH_2_FN (rxb, string1, size1, string2, size2, startpos, range, regs, stop) struct re_pattern_buffer *rxb; __const__ char * string1; int size1; __const__ char * string2; int size2; int startpos; int range; struct re_registers *regs; int stop; #endif { int answer; struct re_search_2_closure closure; closure.string1 = string1; closure.size1 = size1; closure.string2 = string2; closure.size2 = size2; answer = rx_search (rxb, startpos, range, stop, size1 + size2, re_search_2_get_burst, re_search_2_back_check, re_search_2_fetch_char, (void *)&closure, regs, 0, 0); switch (answer) { case rx_search_continuation: abort (); case rx_search_error: return -2; case rx_search_soft_fail: case rx_search_fail: return -1; default: return answer; } } /* Export rx_search to callers outside this file. */ int re_rx_search (rxb, startpos, range, stop, total_size, get_burst, back_check, fetch_char, app_closure, regs, resume_state, save_state) struct re_pattern_buffer * rxb; int startpos; int range; int stop; int total_size; rx_get_burst_fn get_burst; rx_back_check_fn back_check; rx_fetch_char_fn fetch_char; void * app_closure; struct re_registers * regs; struct rx_search_state * resume_state; struct rx_search_state * save_state; { return rx_search (rxb, startpos, range, stop, total_size, get_burst, back_check, fetch_char, app_closure, regs, resume_state, save_state); } #if !defined(REGEX_MALLOC) && !defined(__GNUC__) #ifdef __STDC__ int re_search_2 (struct re_pattern_buffer *rxb, __const__ char * string1, int size1, __const__ char * string2, int size2, int startpos, int range, struct re_registers *regs, int stop) #else int re_search_2 (rxb, string1, size1, string2, size2, startpos, range, regs, stop) struct re_pattern_buffer *rxb; __const__ char * string1; int size1; __const__ char * string2; int size2; int startpos; int range; struct re_registers *regs; int stop; #endif { int ret; ret = inner_re_search_2 (rxb, string1, size1, string2, size2, startpos, range, regs, stop); alloca (0); return ret; } #endif /* Like re_search_2, above, but only one string is specified, and * doesn't let you say where to stop matching. */ #ifdef __STDC__ int re_search (struct re_pattern_buffer * rxb, __const__ char *string, int size, int startpos, int range, struct re_registers *regs) #else int re_search (rxb, string, size, startpos, range, regs) struct re_pattern_buffer * rxb; __const__ char * string; int size; int startpos; int range; struct re_registers *regs; #endif { return re_search_2 (rxb, 0, 0, string, size, startpos, range, regs, size); } #ifdef __STDC__ int re_match_2 (struct re_pattern_buffer * rxb, __const__ char * string1, int size1, __const__ char * string2, int size2, int pos, struct re_registers *regs, int stop) #else int re_match_2 (rxb, string1, size1, string2, size2, pos, regs, stop) struct re_pattern_buffer * rxb; __const__ char * string1; int size1; __const__ char * string2; int size2; int pos; struct re_registers *regs; int stop; #endif { struct re_registers some_regs; regoff_t start; regoff_t end; int srch; int save = rxb->regs_allocated; struct re_registers * regs_to_pass = regs; if (!regs) { some_regs.start = &start; some_regs.end = &end; some_regs.num_regs = 1; regs_to_pass = &some_regs; rxb->regs_allocated = REGS_FIXED; } srch = re_search_2 (rxb, string1, size1, string2, size2, pos, 1, regs_to_pass, stop); if (regs_to_pass != regs) rxb->regs_allocated = save; if (srch < 0) return srch; return regs_to_pass->end[0] - regs_to_pass->start[0]; } /* re_match is like re_match_2 except it takes only a single string. */ #ifdef __STDC__ int re_match (struct re_pattern_buffer * rxb, __const__ char * string, int size, int pos, struct re_registers *regs) #else int re_match (rxb, string, size, pos, regs) struct re_pattern_buffer * rxb; __const__ char *string; int size; int pos; struct re_registers *regs; #endif { return re_match_2 (rxb, string, size, 0, 0, pos, regs, size); } /* Set by `re_set_syntax' to the current regexp syntax to recognize. Can also be assigned to arbitrarily: each pattern buffer stores its own syntax, so it can be changed between regex compilations. */ reg_syntax_t re_syntax_options = RE_SYNTAX_EMACS; /* Specify the precise syntax of regexps for compilation. This provides for compatibility for various utilities which historically have different, incompatible syntaxes. The argument SYNTAX is a bit mask comprised of the various bits defined in regex.h. We return the old syntax. */ #ifdef __STDC__ reg_syntax_t re_set_syntax (reg_syntax_t syntax) #else reg_syntax_t re_set_syntax (syntax) reg_syntax_t syntax; #endif { reg_syntax_t ret = re_syntax_options; re_syntax_options = syntax; return ret; } /* Set REGS to hold NUM_REGS registers, storing them in STARTS and ENDS. Subsequent matches using PATTERN_BUFFER and REGS will use this memory for recording register information. STARTS and ENDS must be allocated using the malloc library routine, and must each be at least NUM_REGS * sizeof (regoff_t) bytes long. If NUM_REGS == 0, then subsequent matches should allocate their own register data. Unless this function is called, the first search or match using PATTERN_BUFFER will allocate its own register data, without freeing the old data. */ #ifdef __STDC__ void re_set_registers (struct re_pattern_buffer *bufp, struct re_registers *regs, unsigned num_regs, regoff_t * starts, regoff_t * ends) #else void re_set_registers (bufp, regs, num_regs, starts, ends) struct re_pattern_buffer *bufp; struct re_registers *regs; unsigned num_regs; regoff_t * starts; regoff_t * ends; #endif { if (num_regs) { bufp->regs_allocated = REGS_REALLOCATE; regs->num_regs = num_regs; regs->start = starts; regs->end = ends; } else { bufp->regs_allocated = REGS_UNALLOCATED; regs->num_regs = 0; regs->start = regs->end = (regoff_t) 0; } } #ifdef __STDC__ static int cplx_se_sublist_len (struct rx_se_list * list) #else static int cplx_se_sublist_len (list) struct rx_se_list * list; #endif { int x = 0; while (list) { if ((long)list->car >= 0) ++x; list = list->cdr; } return x; } /* For rx->se_list_cmp */ #ifdef __STDC__ static int posix_se_list_order (struct rx * rx, struct rx_se_list * a, struct rx_se_list * b) #else static int posix_se_list_order (rx, a, b) struct rx * rx; struct rx_se_list * a; struct rx_se_list * b; #endif { int al = cplx_se_sublist_len (a); int bl = cplx_se_sublist_len (b); if (!al && !bl) return ((a == b) ? 0 : ((a < b) ? -1 : 1)); else if (!al) return -1; else if (!bl) return 1; else { rx_side_effect * av = ((rx_side_effect *) alloca (sizeof (rx_side_effect) * (al + 1))); rx_side_effect * bv = ((rx_side_effect *) alloca (sizeof (rx_side_effect) * (bl + 1))); struct rx_se_list * ap = a; struct rx_se_list * bp = b; int ai, bi; for (ai = al - 1; ai >= 0; --ai) { while ((long)ap->car < 0) ap = ap->cdr; av[ai] = ap->car; ap = ap->cdr; } av[al] = (rx_side_effect)-2; for (bi = bl - 1; bi >= 0; --bi) { while ((long)bp->car < 0) bp = bp->cdr; bv[bi] = bp->car; bp = bp->cdr; } bv[bl] = (rx_side_effect)-1; { int ret; int x = 0; while (av[x] == bv[x]) ++x; ret = (((unsigned *)(av[x]) < (unsigned *)(bv[x])) ? -1 : 1); return ret; } } } /* re_compile_pattern is the GNU regular expression compiler: it compiles PATTERN (of length SIZE) and puts the result in RXB. Returns 0 if the pattern was valid, otherwise an error string. Assumes the `allocated' (and perhaps `buffer') and `translate' fields are set in RXB on entry. We call rx_compile to do the actual compilation. */ #ifdef __STDC__ __const__ char * re_compile_pattern (__const__ char *pattern, int length, struct re_pattern_buffer * rxb) #else __const__ char * re_compile_pattern (pattern, length, rxb) __const__ char *pattern; int length; struct re_pattern_buffer * rxb; #endif { reg_errcode_t ret; /* GNU code is written to assume at least RE_NREGS registers will be set (and at least one extra will be -1). */ rxb->regs_allocated = REGS_UNALLOCATED; /* And GNU code determines whether or not to get register information by passing null for the REGS argument to re_match, etc., not by setting no_sub. */ rxb->no_sub = 0; rxb->rx.local_cset_size = 256; /* Match anchors at newline. */ rxb->newline_anchor = 1; rxb->re_nsub = 0; rxb->start = 0; rxb->se_params = 0; rxb->rx.nodec = 0; rxb->rx.epsnodec = 0; rxb->rx.instruction_table = 0; rxb->rx.nfa_states = 0; rxb->rx.se_list_cmp = posix_se_list_order; rxb->rx.start_set = 0; ret = rx_compile (pattern, length, re_syntax_options, rxb); alloca (0); return rx_error_msg[(int) ret]; } #ifdef __STDC__ int re_compile_fastmap (struct re_pattern_buffer * rxb) #else int re_compile_fastmap (rxb) struct re_pattern_buffer * rxb; #endif { rx_blow_up_fastmap (rxb); return 0; } /* Entry points compatible with 4.2 BSD regex library. We don't define them if this is an Emacs or POSIX compilation. */ #if (!defined (emacs) && !defined (_POSIX_SOURCE)) || defined(USE_BSD_REGEX) /* BSD has one and only one pattern buffer. */ static struct re_pattern_buffer rx_comp_buf; #ifdef __STDC__ char * re_comp (__const__ char *s) #else char * re_comp (s) __const__ char *s; #endif { reg_errcode_t ret; if (!s || (*s == '\0')) { if (!rx_comp_buf.buffer) return "No previous regular expression"; return 0; } if (!rx_comp_buf.fastmap) { rx_comp_buf.fastmap = (char *) malloc (1 << CHARBITS); if (!rx_comp_buf.fastmap) return "Memory exhausted"; } /* Since `rx_exec' always passes NULL for the `regs' argument, we don't need to initialize the pattern buffer fields which affect it. */ /* Match anchors at newlines. */ rx_comp_buf.newline_anchor = 1; rx_comp_buf.re_nsub = 0; rx_comp_buf.start = 0; rx_comp_buf.se_params = 0; rx_comp_buf.rx.nodec = 0; rx_comp_buf.rx.epsnodec = 0; rx_comp_buf.rx.instruction_table = 0; rx_comp_buf.rx.nfa_states = 0; rx_comp_buf.rx.start = 0; rx_comp_buf.rx.se_list_cmp = posix_se_list_order; rx_comp_buf.rx.local_cset_size = 256; ret = rx_compile (s, strlen (s), re_syntax_options, &rx_comp_buf); alloca (0); /* Yes, we're discarding `__const__' here. */ return (char *) rx_error_msg[(int) ret]; } #ifdef __STDC__ int re_exec (__const__ char *s) #else int re_exec (s) __const__ char *s; #endif { __const__ int len = strlen (s); return 0 <= re_search (&rx_comp_buf, s, len, 0, len, (struct re_registers *) 0); } #endif /* not emacs and not _POSIX_SOURCE */ /* POSIX.2 functions. Don't define these for Emacs. */ #if !defined(emacs) /* regcomp takes a regular expression as a string and compiles it. PREG is a regex_t *. We do not expect any fields to be initialized, since POSIX says we shouldn't. Thus, we set `buffer' to the compiled pattern; `used' to the length of the compiled pattern; `syntax' to RE_SYNTAX_POSIX_EXTENDED if the REG_EXTENDED bit in CFLAGS is set; otherwise, to RE_SYNTAX_POSIX_BASIC; `newline_anchor' to REG_NEWLINE being set in CFLAGS; `fastmap' and `fastmap_accurate' to zero; `re_nsub' to the number of subexpressions in PATTERN. PATTERN is the address of the pattern string. CFLAGS is a series of bits which affect compilation. If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we use POSIX basic syntax. If REG_NEWLINE is set, then . and [^...] don't match newline. Also, regexec will try a match beginning after every newline. If REG_ICASE is set, then we considers upper- and lowercase versions of letters to be equivalent when matching. If REG_NOSUB is set, then when PREG is passed to regexec, that routine will report only success or failure, and nothing about the registers. It returns 0 if it succeeds, nonzero if it doesn't. (See regex.h for the return codes and their meanings.) */ #ifdef __STDC__ int regcomp (regex_t * preg, __const__ char * pattern, int cflags) #else int regcomp (preg, pattern, cflags) regex_t * preg; __const__ char * pattern; int cflags; #endif { reg_errcode_t ret; unsigned syntax = cflags & REG_EXTENDED ? RE_SYNTAX_POSIX_EXTENDED : RE_SYNTAX_POSIX_BASIC; /* regex_compile will allocate the space for the compiled pattern. */ preg->buffer = 0; preg->allocated = 0; preg->fastmap = malloc (256); if (!preg->fastmap) return REG_ESPACE; preg->fastmap_accurate = 0; if (cflags & REG_ICASE) { unsigned i; preg->translate = (unsigned char *) malloc (256); if (!preg->translate) return (int) REG_ESPACE; /* Map uppercase characters to corresponding lowercase ones. */ for (i = 0; i < CHAR_SET_SIZE; i++) preg->translate[i] = isupper (i) ? tolower (i) : i; } else preg->translate = 0; /* If REG_NEWLINE is set, newlines are treated differently. */ if (cflags & REG_NEWLINE) { /* REG_NEWLINE implies neither . nor [^...] match newline. */ syntax &= ~RE_DOT_NEWLINE; syntax |= RE_HAT_LISTS_NOT_NEWLINE; /* It also changes the matching behavior. */ preg->newline_anchor = 1; } else preg->newline_anchor = 0; preg->no_sub = !!(cflags & REG_NOSUB); /* POSIX says a null character in the pattern terminates it, so we can use strlen here in compiling the pattern. */ preg->re_nsub = 0; preg->start = 0; preg->se_params = 0; preg->syntax_parens = 0; preg->rx.nodec = 0; preg->rx.epsnodec = 0; preg->rx.instruction_table = 0; preg->rx.nfa_states = 0; preg->rx.local_cset_size = 256; preg->rx.start = 0; preg->rx.se_list_cmp = posix_se_list_order; preg->rx.start_set = 0; ret = rx_compile (pattern, strlen (pattern), syntax, preg); alloca (0); /* POSIX doesn't distinguish between an unmatched open-group and an unmatched close-group: both are REG_EPAREN. */ if (ret == REG_ERPAREN) ret = REG_EPAREN; return (int) ret; } /* regexec searches for a given pattern, specified by PREG, in the string STRING. If NMATCH is zero or REG_NOSUB was set in the cflags argument to `regcomp', we ignore PMATCH. Otherwise, we assume PMATCH has at least NMATCH elements, and we set them to the offsets of the corresponding matched substrings. EFLAGS specifies `execution flags' which affect matching: if REG_NOTBOL is set, then ^ does not match at the beginning of the string; if REG_NOTEOL is set, then $ does not match at the end. We return 0 if we find a match and REG_NOMATCH if not. */ #ifdef __STDC__ int regexec (__const__ regex_t *preg, __const__ char *string, size_t nmatch, regmatch_t pmatch[], int eflags) #else int regexec (preg, string, nmatch, pmatch, eflags) __const__ regex_t *preg; __const__ char *string; size_t nmatch; regmatch_t pmatch[]; int eflags; #endif { int ret; struct re_registers regs; regex_t private_preg; int len = strlen (string); boolean want_reg_info = !preg->no_sub && nmatch > 0; private_preg = *preg; private_preg.not_bol = !!(eflags & REG_NOTBOL); private_preg.not_eol = !!(eflags & REG_NOTEOL); /* The user has told us exactly how many registers to return * information about, via `nmatch'. We have to pass that on to the * matching routines. */ private_preg.regs_allocated = REGS_FIXED; if (want_reg_info) { regs.num_regs = nmatch; regs.start = (( regoff_t *) malloc ((nmatch) * sizeof ( regoff_t))); regs.end = (( regoff_t *) malloc ((nmatch) * sizeof ( regoff_t))); if (regs.start == 0 || regs.end == 0) return (int) REG_NOMATCH; } /* Perform the searching operation. */ ret = re_search (&private_preg, string, len, /* start: */ 0, /* range: */ len, want_reg_info ? ®s : (struct re_registers *) 0); /* Copy the register information to the POSIX structure. */ if (want_reg_info) { if (ret >= 0) { unsigned r; for (r = 0; r < nmatch; r++) { pmatch[r].rm_so = regs.start[r]; pmatch[r].rm_eo = regs.end[r]; } } /* If we needed the temporary register info, free the space now. */ free (regs.start); free (regs.end); } /* We want zero return to mean success, unlike `re_search'. */ return ret >= 0 ? (int) REG_NOERROR : (int) REG_NOMATCH; } /* Returns a message corresponding to an error code, ERRCODE, returned from either regcomp or regexec. */ #ifdef __STDC__ size_t regerror (int errcode, __const__ regex_t *preg, char *errbuf, size_t errbuf_size) #else size_t regerror (errcode, preg, errbuf, errbuf_size) int errcode; __const__ regex_t *preg; char *errbuf; size_t errbuf_size; #endif { __const__ char *msg = rx_error_msg[errcode] == 0 ? "Success" : rx_error_msg[errcode]; size_t msg_size = strlen (msg) + 1; /* Includes the 0. */ if (errbuf_size != 0) { if (msg_size > errbuf_size) { strncpy (errbuf, msg, errbuf_size - 1); errbuf[errbuf_size - 1] = 0; } else strcpy (errbuf, msg); } return msg_size; } /* Free dynamically allocated space used by PREG. */ #ifdef __STDC__ void regfree (regex_t *preg) #else void regfree (preg) regex_t *preg; #endif { if (preg->buffer != 0) free (preg->buffer); preg->buffer = 0; preg->allocated = 0; if (preg->fastmap != 0) free (preg->fastmap); preg->fastmap = 0; preg->fastmap_accurate = 0; if (preg->translate != 0) free (preg->translate); preg->translate = 0; } #endif /* not emacs */ tar-1.11.8/lib/strstr.c 444 625 1 2326 5650505357 7663 /* strstr.c -- return the offset of one string within another Copyright (C) 1989, 1990 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Written by Mike Rendell . */ /* Return the starting address of string S2 in S1; return 0 if it is not found. */ char * strstr (s1, s2) char *s1; char *s2; { int i; char *p1; char *p2; char *s = s1; for (p2 = s2, i = 0; *s; p2 = s2, i++, s++) { for (p1 = s; *p1 && *p2 && *p1 == *p2; p1++, p2++) ; if (!*p2) break; } if (!*p2) return s1 + i; return 0; } tar-1.11.8/lib/error.c 664 625 1 5756 5647126114 7465 /* error.c -- error handler for noninteractive utilities Copyright (C) 1990, 91, 92, 93, 94 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Written by David MacKenzie . */ #ifdef HAVE_CONFIG_H #include #endif #include #if HAVE_VPRINTF || HAVE_DOPRNT # if __STDC__ # include # define VA_START(args, lastarg) va_start(args, lastarg) # else # include # define VA_START(args, lastarg) va_start(args) # endif #else # define va_alist a1, a2, a3, a4, a5, a6, a7, a8 # define va_dcl char *a1, *a2, *a3, *a4, *a5, *a6, *a7, *a8; #endif #if STDC_HEADERS # include # include #else void exit (); #endif /* If NULL, error will flush stdout, then print on stderr the program name, a colon and a space. Otherwise, error will call this function without parameters instead. */ void (*error_print_progname) () = NULL; /* The calling program should define program_name and set it to the name of the executing program. */ extern char *program_name; #if HAVE_STRERROR char *strerror (); #else static char * private_strerror (errnum) int errnum; { extern char *sys_errlist[]; extern int sys_nerr; if (errnum > 0 && errnum <= sys_nerr) return sys_errlist[errnum]; return "Unknown system error"; } #define strerror private_strerror #endif /* Print the program name and error message MESSAGE, which is a printf-style format string with optional args. If ERRNUM is nonzero, print its corresponding system error message. Exit with status STATUS if it is nonzero. */ /* VARARGS */ void #if defined(VA_START) && __STDC__ error (int status, int errnum, const char *message, ...) #else error (status, errnum, message, va_alist) int status; int errnum; char *message; va_dcl #endif { #ifdef VA_START va_list args; #endif if (error_print_progname) (*error_print_progname) (); else { fflush (stdout); fprintf (stderr, "%s: ", program_name); } #ifdef VA_START VA_START (args, message); # if HAVE_VPRINTF vfprintf (stderr, message, args); # else _doprnt (message, args, stderr); # endif va_end (args); #else fprintf (stderr, message, a1, a2, a3, a4, a5, a6, a7, a8); #endif if (errnum) fprintf (stderr, ": %s", strerror (errnum)); putc ('\n', stderr); fflush (stderr); if (status) exit (status); } tar-1.11.8/lib/getdate.y 644 625 1 60032 5704525210 7773 %{ /* ** Originally written by Steven M. Bellovin while ** at the University of North Carolina at Chapel Hill. Later tweaked by ** a couple of people on Usenet. Completely overhauled by Rich $alz ** and Jim Berets in August, 1990; ** send any email to Rich. ** ** This grammar has 10 shift/reduce conflicts. ** ** This code is in the public domain and has no copyright. */ /* SUPPRESS 287 on yaccpar_sccsid *//* Unused static variable */ /* SUPPRESS 288 on yyerrlab *//* Label unused */ #ifdef HAVE_CONFIG_H #include #endif /* Since the code of getdate.y is not included in the Emacs executable itself, there is no need to #define static in this file. Even if the code were included in the Emacs executable, it probably wouldn't do any harm to #undef it here; this will only cause problems if we try to write to a static variable, which I don't think this code needs to do. */ #ifdef emacs #undef static #endif #include #include #if defined (STDC_HEADERS) || !defined (isascii) #define ISASCII(c) 1 #else #define ISASCII(c) isascii(c) #endif #define ISSPACE(c) (ISASCII (c) && isspace (c)) #define ISALPHA(c) (ISASCII (c) && isalpha (c)) #define ISUPPER(c) (ISASCII (c) && isupper (c)) #define ISDIGIT(c) (ISASCII (c) && isdigit (c)) /* The code at the top of get_date which figures out the offset of the current time zone checks various CPP symbols to see if special tricks are need, but defaults to using the gettimeofday system call. Include if that will be used. */ #if defined (vms) #include #include #else #include #ifdef TIME_WITH_SYS_TIME #include #include #else #ifdef HAVE_SYS_TIME_H #include #else #include #endif #endif #ifdef timezone #undef timezone /* needed for sgi */ #endif #if defined (HAVE_SYS_TIMEB_H) #include #else /* ** We use the obsolete `struct timeb' as part of our interface! ** Since the system doesn't have it, we define it here; ** our callers must do likewise. */ struct timeb { time_t time; /* Seconds since the epoch */ unsigned short millitm; /* Field not used */ short timezone; /* Minutes west of GMT */ short dstflag; /* Field not used */ }; #endif /* defined (HAVE_SYS_TIMEB_H) */ #endif /* defined (vms) */ #if defined (STDC_HEADERS) || defined (USG) #include #endif /* Some old versions of bison generate parsers that use bcopy. That loses on systems that don't provide the function, so we have to redefine it here. */ #if !defined (HAVE_BCOPY) && defined (HAVE_MEMCPY) && !defined (bcopy) #define bcopy(from, to, len) memcpy ((to), (from), (len)) #endif extern struct tm *gmtime (); extern struct tm *localtime (); #define yyparse getdate_yyparse #define yylex getdate_yylex #define yyerror getdate_yyerror static int yylex (); static int yyerror (); #define EPOCH 1970 #define HOUR(x) ((time_t)(x) * 60) #define SECSPERDAY (24L * 60L * 60L) #define MAX_BUFF_LEN 128 /* size of buffer to read the date into */ /* ** An entry in the lexical lookup table. */ typedef struct _TABLE { const char *name; int type; time_t value; } TABLE; /* ** Daylight-savings mode: on, off, or not yet known. */ typedef enum _DSTMODE { DSTon, DSToff, DSTmaybe } DSTMODE; /* ** Meridian: am, pm, or 24-hour style. */ typedef enum _MERIDIAN { MERam, MERpm, MER24 } MERIDIAN; /* ** Global variables. We could get rid of most of these by using a good ** union as the yacc stack. (This routine was originally written before ** yacc had the %union construct.) Maybe someday; right now we only use ** the %union very rarely. */ static char *yyInput; static DSTMODE yyDSTmode; static time_t yyDayOrdinal; static time_t yyDayNumber; static int yyHaveDate; static int yyHaveDay; static int yyHaveRel; static int yyHaveTime; static int yyHaveZone; static time_t yyTimezone; static time_t yyDay; static time_t yyHour; static time_t yyMinutes; static time_t yyMonth; static time_t yySeconds; static time_t yyYear; static MERIDIAN yyMeridian; static time_t yyRelMonth; static time_t yyRelSeconds; %} %union { time_t Number; enum _MERIDIAN Meridian; } %token tAGO tDAY tDAYZONE tID tMERIDIAN tMINUTE_UNIT tMONTH tMONTH_UNIT %token tSEC_UNIT tSNUMBER tUNUMBER tZONE tDST %type tDAY tDAYZONE tMINUTE_UNIT tMONTH tMONTH_UNIT %type tSEC_UNIT tSNUMBER tUNUMBER tZONE %type tMERIDIAN o_merid %% spec : /* NULL */ | spec item ; item : time { yyHaveTime++; } | zone { yyHaveZone++; } | date { yyHaveDate++; } | day { yyHaveDay++; } | rel { yyHaveRel++; } | number ; time : tUNUMBER tMERIDIAN { yyHour = $1; yyMinutes = 0; yySeconds = 0; yyMeridian = $2; } | tUNUMBER ':' tUNUMBER o_merid { yyHour = $1; yyMinutes = $3; yySeconds = 0; yyMeridian = $4; } | tUNUMBER ':' tUNUMBER tSNUMBER { yyHour = $1; yyMinutes = $3; yyMeridian = MER24; yyDSTmode = DSToff; yyTimezone = - ($4 % 100 + ($4 / 100) * 60); } | tUNUMBER ':' tUNUMBER ':' tUNUMBER o_merid { yyHour = $1; yyMinutes = $3; yySeconds = $5; yyMeridian = $6; } | tUNUMBER ':' tUNUMBER ':' tUNUMBER tSNUMBER { yyHour = $1; yyMinutes = $3; yySeconds = $5; yyMeridian = MER24; yyDSTmode = DSToff; yyTimezone = - ($6 % 100 + ($6 / 100) * 60); } ; zone : tZONE { yyTimezone = $1; yyDSTmode = DSToff; } | tDAYZONE { yyTimezone = $1; yyDSTmode = DSTon; } | tZONE tDST { yyTimezone = $1; yyDSTmode = DSTon; } ; day : tDAY { yyDayOrdinal = 1; yyDayNumber = $1; } | tDAY ',' { yyDayOrdinal = 1; yyDayNumber = $1; } | tUNUMBER tDAY { yyDayOrdinal = $1; yyDayNumber = $2; } ; date : tUNUMBER '/' tUNUMBER { yyMonth = $1; yyDay = $3; } | tUNUMBER '/' tUNUMBER '/' tUNUMBER { yyMonth = $1; yyDay = $3; yyYear = $5; } | tUNUMBER tSNUMBER tSNUMBER { /* ISO 8601 format. yyyy-mm-dd. */ yyYear = $1; yyMonth = -$2; yyDay = -$3; } | tUNUMBER tMONTH tSNUMBER { /* e.g. 17-JUN-1992. */ yyDay = $1; yyMonth = $2; yyYear = -$3; } | tMONTH tUNUMBER { yyMonth = $1; yyDay = $2; } | tMONTH tUNUMBER ',' tUNUMBER { yyMonth = $1; yyDay = $2; yyYear = $4; } | tUNUMBER tMONTH { yyMonth = $2; yyDay = $1; } | tUNUMBER tMONTH tUNUMBER { yyMonth = $2; yyDay = $1; yyYear = $3; } ; rel : relunit tAGO { yyRelSeconds = -yyRelSeconds; yyRelMonth = -yyRelMonth; } | relunit ; relunit : tUNUMBER tMINUTE_UNIT { yyRelSeconds += $1 * $2 * 60L; } | tSNUMBER tMINUTE_UNIT { yyRelSeconds += $1 * $2 * 60L; } | tMINUTE_UNIT { yyRelSeconds += $1 * 60L; } | tSNUMBER tSEC_UNIT { yyRelSeconds += $1; } | tUNUMBER tSEC_UNIT { yyRelSeconds += $1; } | tSEC_UNIT { yyRelSeconds++; } | tSNUMBER tMONTH_UNIT { yyRelMonth += $1 * $2; } | tUNUMBER tMONTH_UNIT { yyRelMonth += $1 * $2; } | tMONTH_UNIT { yyRelMonth += $1; } ; number : tUNUMBER { if (yyHaveTime && yyHaveDate && !yyHaveRel) yyYear = $1; else { if ($1>10000) { yyHaveDate++; yyDay= ($1)%100; yyMonth= ($1/100)%100; yyYear = $1/10000; } else { yyHaveTime++; if ($1 < 100) { yyHour = $1; yyMinutes = 0; } else { yyHour = $1 / 100; yyMinutes = $1 % 100; } yySeconds = 0; yyMeridian = MER24; } } } ; o_merid : /* NULL */ { $$ = MER24; } | tMERIDIAN { $$ = $1; } ; %% /* Month and day table. */ static TABLE const MonthDayTable[] = { { "january", tMONTH, 1 }, { "february", tMONTH, 2 }, { "march", tMONTH, 3 }, { "april", tMONTH, 4 }, { "may", tMONTH, 5 }, { "june", tMONTH, 6 }, { "july", tMONTH, 7 }, { "august", tMONTH, 8 }, { "september", tMONTH, 9 }, { "sept", tMONTH, 9 }, { "october", tMONTH, 10 }, { "november", tMONTH, 11 }, { "december", tMONTH, 12 }, { "sunday", tDAY, 0 }, { "monday", tDAY, 1 }, { "tuesday", tDAY, 2 }, { "tues", tDAY, 2 }, { "wednesday", tDAY, 3 }, { "wednes", tDAY, 3 }, { "thursday", tDAY, 4 }, { "thur", tDAY, 4 }, { "thurs", tDAY, 4 }, { "friday", tDAY, 5 }, { "saturday", tDAY, 6 }, { NULL } }; /* Time units table. */ static TABLE const UnitsTable[] = { { "year", tMONTH_UNIT, 12 }, { "month", tMONTH_UNIT, 1 }, { "fortnight", tMINUTE_UNIT, 14 * 24 * 60 }, { "week", tMINUTE_UNIT, 7 * 24 * 60 }, { "day", tMINUTE_UNIT, 1 * 24 * 60 }, { "hour", tMINUTE_UNIT, 60 }, { "minute", tMINUTE_UNIT, 1 }, { "min", tMINUTE_UNIT, 1 }, { "second", tSEC_UNIT, 1 }, { "sec", tSEC_UNIT, 1 }, { NULL } }; /* Assorted relative-time words. */ static TABLE const OtherTable[] = { { "tomorrow", tMINUTE_UNIT, 1 * 24 * 60 }, { "yesterday", tMINUTE_UNIT, -1 * 24 * 60 }, { "today", tMINUTE_UNIT, 0 }, { "now", tMINUTE_UNIT, 0 }, { "last", tUNUMBER, -1 }, { "this", tMINUTE_UNIT, 0 }, { "next", tUNUMBER, 2 }, { "first", tUNUMBER, 1 }, /* { "second", tUNUMBER, 2 }, */ { "third", tUNUMBER, 3 }, { "fourth", tUNUMBER, 4 }, { "fifth", tUNUMBER, 5 }, { "sixth", tUNUMBER, 6 }, { "seventh", tUNUMBER, 7 }, { "eighth", tUNUMBER, 8 }, { "ninth", tUNUMBER, 9 }, { "tenth", tUNUMBER, 10 }, { "eleventh", tUNUMBER, 11 }, { "twelfth", tUNUMBER, 12 }, { "ago", tAGO, 1 }, { NULL } }; /* The timezone table. */ /* Some of these are commented out because a time_t can't store a float. */ static TABLE const TimezoneTable[] = { { "gmt", tZONE, HOUR ( 0) }, /* Greenwich Mean */ { "ut", tZONE, HOUR ( 0) }, /* Universal (Coordinated) */ { "utc", tZONE, HOUR ( 0) }, { "wet", tZONE, HOUR ( 0) }, /* Western European */ { "bst", tDAYZONE, HOUR ( 0) }, /* British Summer */ { "wat", tZONE, HOUR ( 1) }, /* West Africa */ { "at", tZONE, HOUR ( 2) }, /* Azores */ #if 0 /* For completeness. BST is also British Summer, and GST is * also Guam Standard. */ { "bst", tZONE, HOUR ( 3) }, /* Brazil Standard */ { "gst", tZONE, HOUR ( 3) }, /* Greenland Standard */ #endif #if 0 { "nft", tZONE, HOUR (3.5) }, /* Newfoundland */ { "nst", tZONE, HOUR (3.5) }, /* Newfoundland Standard */ { "ndt", tDAYZONE, HOUR (3.5) }, /* Newfoundland Daylight */ #endif { "ast", tZONE, HOUR ( 4) }, /* Atlantic Standard */ { "adt", tDAYZONE, HOUR ( 4) }, /* Atlantic Daylight */ { "est", tZONE, HOUR ( 5) }, /* Eastern Standard */ { "edt", tDAYZONE, HOUR ( 5) }, /* Eastern Daylight */ { "cst", tZONE, HOUR ( 6) }, /* Central Standard */ { "cdt", tDAYZONE, HOUR ( 6) }, /* Central Daylight */ { "mst", tZONE, HOUR ( 7) }, /* Mountain Standard */ { "mdt", tDAYZONE, HOUR ( 7) }, /* Mountain Daylight */ { "pst", tZONE, HOUR ( 8) }, /* Pacific Standard */ { "pdt", tDAYZONE, HOUR ( 8) }, /* Pacific Daylight */ { "yst", tZONE, HOUR ( 9) }, /* Yukon Standard */ { "ydt", tDAYZONE, HOUR ( 9) }, /* Yukon Daylight */ { "hst", tZONE, HOUR (10) }, /* Hawaii Standard */ { "hdt", tDAYZONE, HOUR (10) }, /* Hawaii Daylight */ { "cat", tZONE, HOUR (10) }, /* Central Alaska */ { "ahst", tZONE, HOUR (10) }, /* Alaska-Hawaii Standard */ { "nt", tZONE, HOUR (11) }, /* Nome */ { "idlw", tZONE, HOUR (12) }, /* International Date Line West */ { "cet", tZONE, -HOUR (1) }, /* Central European */ { "met", tZONE, -HOUR (1) }, /* Middle European */ { "mewt", tZONE, -HOUR (1) }, /* Middle European Winter */ { "mest", tDAYZONE, -HOUR (1) }, /* Middle European Summer */ { "mesz", tDAYZONE, -HOUR (1) }, /* Middle European Summer */ { "swt", tZONE, -HOUR (1) }, /* Swedish Winter */ { "sst", tDAYZONE, -HOUR (1) }, /* Swedish Summer */ { "fwt", tZONE, -HOUR (1) }, /* French Winter */ { "fst", tDAYZONE, -HOUR (1) }, /* French Summer */ { "eet", tZONE, -HOUR (2) }, /* Eastern Europe, USSR Zone 1 */ { "bt", tZONE, -HOUR (3) }, /* Baghdad, USSR Zone 2 */ #if 0 { "it", tZONE, -HOUR (3.5) },/* Iran */ #endif { "zp4", tZONE, -HOUR (4) }, /* USSR Zone 3 */ { "zp5", tZONE, -HOUR (5) }, /* USSR Zone 4 */ #if 0 { "ist", tZONE, -HOUR (5.5) },/* Indian Standard */ #endif { "zp6", tZONE, -HOUR (6) }, /* USSR Zone 5 */ #if 0 /* For completeness. NST is also Newfoundland Standard, and SST is * also Swedish Summer. */ { "nst", tZONE, -HOUR (6.5) },/* North Sumatra */ { "sst", tZONE, -HOUR (7) }, /* South Sumatra, USSR Zone 6 */ #endif /* 0 */ { "wast", tZONE, -HOUR (7) }, /* West Australian Standard */ { "wadt", tDAYZONE, -HOUR (7) }, /* West Australian Daylight */ #if 0 { "jt", tZONE, -HOUR (7.5) },/* Java (3pm in Cronusland!) */ #endif { "cct", tZONE, -HOUR (8) }, /* China Coast, USSR Zone 7 */ { "jst", tZONE, -HOUR (9) }, /* Japan Standard, USSR Zone 8 */ #if 0 { "cast", tZONE, -HOUR (9.5) },/* Central Australian Standard */ { "cadt", tDAYZONE, -HOUR (9.5) },/* Central Australian Daylight */ #endif { "east", tZONE, -HOUR (10) }, /* Eastern Australian Standard */ { "eadt", tDAYZONE, -HOUR (10) }, /* Eastern Australian Daylight */ { "gst", tZONE, -HOUR (10) }, /* Guam Standard, USSR Zone 9 */ { "nzt", tZONE, -HOUR (12) }, /* New Zealand */ { "nzst", tZONE, -HOUR (12) }, /* New Zealand Standard */ { "nzdt", tDAYZONE, -HOUR (12) }, /* New Zealand Daylight */ { "idle", tZONE, -HOUR (12) }, /* International Date Line East */ { NULL } }; /* Military timezone table. */ static TABLE const MilitaryTable[] = { { "a", tZONE, HOUR ( 1) }, { "b", tZONE, HOUR ( 2) }, { "c", tZONE, HOUR ( 3) }, { "d", tZONE, HOUR ( 4) }, { "e", tZONE, HOUR ( 5) }, { "f", tZONE, HOUR ( 6) }, { "g", tZONE, HOUR ( 7) }, { "h", tZONE, HOUR ( 8) }, { "i", tZONE, HOUR ( 9) }, { "k", tZONE, HOUR ( 10) }, { "l", tZONE, HOUR ( 11) }, { "m", tZONE, HOUR ( 12) }, { "n", tZONE, HOUR (- 1) }, { "o", tZONE, HOUR (- 2) }, { "p", tZONE, HOUR (- 3) }, { "q", tZONE, HOUR (- 4) }, { "r", tZONE, HOUR (- 5) }, { "s", tZONE, HOUR (- 6) }, { "t", tZONE, HOUR (- 7) }, { "u", tZONE, HOUR (- 8) }, { "v", tZONE, HOUR (- 9) }, { "w", tZONE, HOUR (-10) }, { "x", tZONE, HOUR (-11) }, { "y", tZONE, HOUR (-12) }, { "z", tZONE, HOUR ( 0) }, { NULL } }; /* ARGSUSED */ static int yyerror (s) char *s; { return 0; } static time_t ToSeconds (Hours, Minutes, Seconds, Meridian) time_t Hours; time_t Minutes; time_t Seconds; MERIDIAN Meridian; { if (Minutes < 0 || Minutes > 59 || Seconds < 0 || Seconds > 59) return -1; switch (Meridian) { case MER24: if (Hours < 0 || Hours > 23) return -1; return (Hours * 60L + Minutes) * 60L + Seconds; case MERam: if (Hours < 1 || Hours > 12) return -1; if (Hours == 12) Hours = 0; return (Hours * 60L + Minutes) * 60L + Seconds; case MERpm: if (Hours < 1 || Hours > 12) return -1; if (Hours == 12) Hours = 0; return ((Hours + 12) * 60L + Minutes) * 60L + Seconds; default: abort (); } /* NOTREACHED */ } static time_t Convert (Month, Day, Year, Hours, Minutes, Seconds, Meridian, DSTmode) time_t Month; time_t Day; time_t Year; time_t Hours; time_t Minutes; time_t Seconds; MERIDIAN Meridian; DSTMODE DSTmode; { static int DaysInMonth[12] = { 31, 0, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }; time_t tod; time_t Julian; int i; if (Year < 0) Year = -Year; if (Year < 100) Year += 1900; DaysInMonth[1] = Year % 4 == 0 && (Year % 100 != 0 || Year % 400 == 0) ? 29 : 28; if (Year < EPOCH || Year > 1999 || Month < 1 || Month > 12 /* Lint fluff: "conversion from long may lose accuracy" */ || Day < 1 || Day > DaysInMonth[(int)--Month]) return -1; for (Julian = Day - 1, i = 0; i < Month; i++) Julian += DaysInMonth[i]; for (i = EPOCH; i < Year; i++) Julian += 365 + (i % 4 == 0); Julian *= SECSPERDAY; /* Some tz.tz_minuteswest are given in seconds! Considering a timezone correction is at least 30 minutes, this system bug is easy to avoid. */ if (yyTimezone > -1800 && yyTimezone < 1800) Julian += yyTimezone * 60L; else Julian += yyTimezone; if ((tod = ToSeconds (Hours, Minutes, Seconds, Meridian)) < 0) return -1; Julian += tod; if (DSTmode == DSTon || (DSTmode == DSTmaybe && localtime (&Julian)->tm_isdst)) Julian -= 60 * 60; return Julian; } static time_t DSTcorrect (Start, Future) time_t Start; time_t Future; { time_t StartDay; time_t FutureDay; StartDay = (localtime (&Start)->tm_hour + 1) % 24; FutureDay = (localtime (&Future)->tm_hour + 1) % 24; return (Future - Start) + (StartDay - FutureDay) * 60L * 60L; } static time_t RelativeDate (Start, DayOrdinal, DayNumber) time_t Start; time_t DayOrdinal; time_t DayNumber; { struct tm *tm; time_t now; now = Start; tm = localtime (&now); now += SECSPERDAY * ((DayNumber - tm->tm_wday + 7) % 7); now += 7 * SECSPERDAY * (DayOrdinal <= 0 ? DayOrdinal : DayOrdinal - 1); return DSTcorrect (Start, now); } static time_t RelativeMonth (Start, RelMonth) time_t Start; time_t RelMonth; { struct tm *tm; time_t Month; time_t Year; if (RelMonth == 0) return 0; tm = localtime (&Start); Month = 12 * tm->tm_year + tm->tm_mon + RelMonth; Year = Month / 12; Month = Month % 12 + 1; return DSTcorrect (Start, Convert (Month, (time_t)tm->tm_mday, Year, (time_t)tm->tm_hour, (time_t)tm->tm_min, (time_t)tm->tm_sec, MER24, DSTmaybe)); } static int LookupWord (buff) char *buff; { register char *p; register char *q; register const TABLE *tp; int i; int abbrev; /* Make it lowercase. */ for (p = buff; *p; p++) if (ISUPPER (*p)) *p = tolower (*p); if (strcmp (buff, "am") == 0 || strcmp (buff, "a.m.") == 0) { yylval.Meridian = MERam; return tMERIDIAN; } if (strcmp (buff, "pm") == 0 || strcmp (buff, "p.m.") == 0) { yylval.Meridian = MERpm; return tMERIDIAN; } /* See if we have an abbreviation for a month. */ if (strlen (buff) == 3) abbrev = 1; else if (strlen (buff) == 4 && buff[3] == '.') { abbrev = 1; buff[3] = '\0'; } else abbrev = 0; for (tp = MonthDayTable; tp->name; tp++) { if (abbrev) { if (strncmp (buff, tp->name, 3) == 0) { yylval.Number = tp->value; return tp->type; } } else if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } } for (tp = TimezoneTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } if (strcmp (buff, "dst") == 0) return tDST; for (tp = UnitsTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } /* Strip off any plural and try the units table again. */ i = strlen (buff) - 1; if (buff[i] == 's') { buff[i] = '\0'; for (tp = UnitsTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } buff[i] = 's'; /* Put back for "this" in OtherTable. */ } for (tp = OtherTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } /* Military timezones. */ if (buff[1] == '\0' && ISALPHA (*buff)) { for (tp = MilitaryTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } } /* Drop out any periods and try the timezone table again. */ for (i = 0, p = q = buff; *q; q++) if (*q != '.') *p++ = *q; else i++; *p = '\0'; if (i) for (tp = TimezoneTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } return tID; } static int yylex () { register char c; register char *p; char buff[20]; int Count; int sign; for ( ; ; ) { while (ISSPACE (*yyInput)) yyInput++; if (ISDIGIT (c = *yyInput) || c == '-' || c == '+') { if (c == '-' || c == '+') { sign = c == '-' ? -1 : 1; ++yyInput; if (!ISDIGIT (*yyInput)) /* skip the '-' sign */ continue; } else sign = 0; for (yylval.Number = 0; c = *yyInput++, ISDIGIT (c); ) yylval.Number = 10 * yylval.Number + c - '0'; yyInput--; if (sign < 0) yylval.Number = -yylval.Number; return sign ? tSNUMBER : tUNUMBER; } if (ISALPHA (c)) { for (p = buff; c = *yyInput++, ISALPHA (c) || c == '.'; ) if (p < &buff[sizeof buff - 1]) *p++ = c; *p = '\0'; yyInput--; return LookupWord (buff); } if (c != '(') return *yyInput++; Count = 0; do { c = *yyInput++; if (c == '\0') return c; if (c == '(') Count++; else if (c == ')') Count--; } while (Count > 0); } } #define TM_YEAR_ORIGIN 1900 /* Yield A - B, measured in seconds. */ static long difftm (a, b) struct tm *a, *b; { int ay = a->tm_year + (TM_YEAR_ORIGIN - 1); int by = b->tm_year + (TM_YEAR_ORIGIN - 1); long days = ( /* difference in day of year */ a->tm_yday - b->tm_yday /* + intervening leap days */ + ((ay >> 2) - (by >> 2)) - (ay/100 - by/100) + ((ay/100 >> 2) - (by/100 >> 2)) /* + difference in years * 365 */ + (long)(ay-by) * 365 ); return (60*(60*(24*days + (a->tm_hour - b->tm_hour)) + (a->tm_min - b->tm_min)) + (a->tm_sec - b->tm_sec)); } time_t get_date (p, now) char *p; struct timeb *now; { struct tm *tm, gmt; struct timeb ftz; time_t Start; time_t tod; yyInput = p; if (now == NULL) { now = &ftz; (void)time (&ftz.time); if (! (tm = gmtime (&ftz.time))) return -1; gmt = *tm; /* Make a copy, in case localtime modifies *tm. */ if (! (tm = localtime (&ftz.time))) return -1; ftz.timezone = difftm (&gmt, tm) / 60; if (tm->tm_isdst) ftz.timezone += 60; } tm = localtime (&now->time); yyYear = tm->tm_year; yyMonth = tm->tm_mon + 1; yyDay = tm->tm_mday; yyTimezone = now->timezone; yyDSTmode = DSTmaybe; yyHour = 0; yyMinutes = 0; yySeconds = 0; yyMeridian = MER24; yyRelSeconds = 0; yyRelMonth = 0; yyHaveDate = 0; yyHaveDay = 0; yyHaveRel = 0; yyHaveTime = 0; yyHaveZone = 0; if (yyparse () || yyHaveTime > 1 || yyHaveZone > 1 || yyHaveDate > 1 || yyHaveDay > 1) return -1; if (yyHaveDate || yyHaveTime || yyHaveDay) { Start = Convert (yyMonth, yyDay, yyYear, yyHour, yyMinutes, yySeconds, yyMeridian, yyDSTmode); if (Start < 0) return -1; } else { Start = now->time; if (!yyHaveRel) Start -= ((tm->tm_hour * 60L + tm->tm_min) * 60L) + tm->tm_sec; } Start += yyRelSeconds; Start += RelativeMonth (Start, yyRelMonth); if (yyHaveDay && !yyHaveDate) { tod = RelativeDate (Start, yyDayOrdinal, yyDayNumber); Start += tod; } /* Have to do *something* with a legitimate -1 so it's distinguishable * from the error return value. (Alternately could set errno on error.) */ return Start == -1 ? 0 : Start; } #if defined (TEST) /* ARGSUSED */ int main (ac, av) int ac; char *av[]; { char buff[MAX_BUFF_LEN + 1]; time_t d; (void)printf ("Enter date, or blank line to exit.\n\t> "); (void)fflush (stdout); buff[MAX_BUFF_LEN] = 0; while (fgets (buff, MAX_BUFF_LEN, stdin) && buff[0]) { d = get_date (buff, (struct timeb *)NULL); if (d == -1) (void)printf ("Bad format - couldn't convert.\n"); else (void)printf ("%s", ctime (&d)); (void)printf ("\t> "); (void)fflush (stdout); } exit (0); /* NOTREACHED */ } #endif /* defined (TEST) */ tar-1.11.8/lib/getopt.c 444 625 1 53123 5666652164 7653 /* Getopt for GNU. NOTE: getopt is now part of the C library, so if you don't know what "Keep this file name-space clean" means, talk to roland@gnu.ai.mit.edu before changing it! Copyright (C) 1987, 88, 89, 90, 91, 92, 93, 94 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* This tells Alpha OSF/1 not to define a getopt prototype in . Ditto for AIX 3.2 and . */ #ifndef _NO_PROTO #define _NO_PROTO #endif #ifdef HAVE_CONFIG_H #include #endif #if !defined (__STDC__) || !__STDC__ /* This is a separate conditional since some stdc systems reject `defined (const)'. */ #ifndef const #define const #endif #endif #include /* Comment out all this code if we are using the GNU C Library, and are not actually compiling the library itself. This code is part of the GNU C Library, but also included in many other GNU distributions. Compiling and linking in this code is a waste when using the GNU C library (especially if it is a shared library). Rather than having every GNU program understand `configure --with-gnu-libc' and omit the object files, it is simpler to just do this in the source for each such file. */ #if defined (_LIBC) || !defined (__GNU_LIBRARY__) /* This needs to come after some library #include to get __GNU_LIBRARY__ defined. */ #ifdef __GNU_LIBRARY__ /* Don't include stdlib.h for non-GNU C libraries because some of them contain conflicting prototypes for getopt. */ #include #endif /* GNU C library. */ /* This is for other GNU distributions with internationalized messages. The GNU C Library itself does not yet support such messages. */ #if HAVE_LIBINTL_H # include #else # define gettext(msgid) (msgid) #endif /* This version of `getopt' appears to the caller like standard Unix `getopt' but it behaves differently for the user, since it allows the user to intersperse the options with the other arguments. As `getopt' works, it permutes the elements of ARGV so that, when it is done, all the options precede everything else. Thus all application programs are extended to handle flexible argument order. Setting the environment variable POSIXLY_CORRECT disables permutation. Then the behavior is completely standard. GNU application programs can use a third alternative mode in which they can distinguish the relative order of options and other arguments. */ #include "getopt.h" /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ char *optarg = NULL; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns EOF, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ /* XXX 1003.2 says this must be 1 before any call. */ int optind = 0; /* The next char to be scanned in the option-element in which the last option character we returned was found. This allows us to pick up the scan where we left off. If this is zero, or a null string, it means resume the scan by advancing to the next ARGV-element. */ static char *nextchar; /* Callers store zero here to inhibit the error message for unrecognized options. */ int opterr = 1; /* Set to an option character which was unrecognized. This must be initialized on some systems to avoid linking in the system's own getopt implementation. */ int optopt = '?'; /* Describe how to deal with options that follow non-option ARGV-elements. If the caller did not specify anything, the default is REQUIRE_ORDER if the environment variable POSIXLY_CORRECT is defined, PERMUTE otherwise. REQUIRE_ORDER means don't recognize them as options; stop option processing when the first non-option is seen. This is what Unix does. This mode of operation is selected by either setting the environment variable POSIXLY_CORRECT, or using `+' as the first character of the list of option characters. PERMUTE is the default. We permute the contents of ARGV as we scan, so that eventually all the non-options are at the end. This allows options to be given in any order, even with programs that were not written to expect this. RETURN_IN_ORDER is an option available to programs that were written to expect options and other ARGV-elements in any order and that care about the ordering of the two. We describe each non-option ARGV-element as if it were the argument of an option with character code 1. Using `-' as the first character of the list of option characters selects this mode of operation. The special argument `--' forces an end of option-scanning regardless of the value of `ordering'. In the case of RETURN_IN_ORDER, only `--' can cause `getopt' to return EOF with `optind' != ARGC. */ static enum { REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER } ordering; /* Value of POSIXLY_CORRECT environment variable. */ static char *posixly_correct; #ifdef __GNU_LIBRARY__ /* We want to avoid inclusion of string.h with non-GNU libraries because there are many ways it can cause trouble. On some systems, it contains special magic macros that don't work in GCC. */ #include #define my_index strchr #else /* Avoid depending on library functions or files whose names are inconsistent. */ char *getenv (); static char * my_index (str, chr) const char *str; int chr; { while (*str) { if (*str == chr) return (char *) str; str++; } return 0; } /* If using GCC, we can safely declare strlen this way. If not using GCC, it is ok not to declare it. */ #ifdef __GNUC__ /* Note that Motorola Delta 68k R3V7 comes with GCC but not stddef.h. That was relevant to code that was here before. */ #if !defined (__STDC__) || !__STDC__ /* gcc with -traditional declares the built-in strlen to return int, and has done so at least since version 2.4.5. -- rms. */ extern int strlen (const char *); #endif /* not __STDC__ */ #endif /* __GNUC__ */ #endif /* not __GNU_LIBRARY__ */ /* Handle permutation of arguments. */ /* Describe the part of ARGV that contains non-options that have been skipped. `first_nonopt' is the index in ARGV of the first of them; `last_nonopt' is the index after the last of them. */ static int first_nonopt; static int last_nonopt; /* Exchange two adjacent subsequences of ARGV. One subsequence is elements [first_nonopt,last_nonopt) which contains all the non-options that have been skipped so far. The other is elements [last_nonopt,optind), which contains all the options processed since those non-options were skipped. `first_nonopt' and `last_nonopt' are relocated so that they describe the new indices of the non-options in ARGV after they are moved. */ static void exchange (argv) char **argv; { int bottom = first_nonopt; int middle = last_nonopt; int top = optind; char *tem; /* Exchange the shorter segment with the far end of the longer segment. That puts the shorter segment into the right place. It leaves the longer segment in the right place overall, but it consists of two parts that need to be swapped next. */ while (top > middle && middle > bottom) { if (top - middle > middle - bottom) { /* Bottom segment is the short one. */ int len = middle - bottom; register int i; /* Swap it with the top part of the top segment. */ for (i = 0; i < len; i++) { tem = argv[bottom + i]; argv[bottom + i] = argv[top - (middle - bottom) + i]; argv[top - (middle - bottom) + i] = tem; } /* Exclude the moved bottom segment from further swapping. */ top -= len; } else { /* Top segment is the short one. */ int len = top - middle; register int i; /* Swap it with the bottom part of the bottom segment. */ for (i = 0; i < len; i++) { tem = argv[bottom + i]; argv[bottom + i] = argv[middle + i]; argv[middle + i] = tem; } /* Exclude the moved top segment from further swapping. */ bottom += len; } } /* Update records for the slots the non-options now occupy. */ first_nonopt += (optind - last_nonopt); last_nonopt = optind; } /* Initialize the internal data when the first call is made. */ static const char * _getopt_initialize (optstring) const char *optstring; { /* Start processing options with ARGV-element 1 (since ARGV-element 0 is the program name); the sequence of previously skipped non-option ARGV-elements is empty. */ first_nonopt = last_nonopt = optind = 1; nextchar = NULL; posixly_correct = getenv ("POSIXLY_CORRECT"); /* Determine how to handle the ordering of options and nonoptions. */ if (optstring[0] == '-') { ordering = RETURN_IN_ORDER; ++optstring; } else if (optstring[0] == '+') { ordering = REQUIRE_ORDER; ++optstring; } else if (posixly_correct != NULL) ordering = REQUIRE_ORDER; else ordering = PERMUTE; return optstring; } /* Scan elements of ARGV (whose length is ARGC) for option characters given in OPTSTRING. If an element of ARGV starts with '-', and is not exactly "-" or "--", then it is an option element. The characters of this element (aside from the initial '-') are option characters. If `getopt' is called repeatedly, it returns successively each of the option characters from each of the option elements. If `getopt' finds another option character, it returns that character, updating `optind' and `nextchar' so that the next call to `getopt' can resume the scan with the following option character or ARGV-element. If there are no more option characters, `getopt' returns `EOF'. Then `optind' is the index in ARGV of the first ARGV-element that is not an option. (The ARGV-elements have been permuted so that those that are not options now come last.) OPTSTRING is a string containing the legitimate option characters. If an option character is seen that is not listed in OPTSTRING, return '?' after printing an error message. If you set `opterr' to zero, the error message is suppressed but we still return '?'. If a char in OPTSTRING is followed by a colon, that means it wants an arg, so the following text in the same ARGV-element, or the text of the following ARGV-element, is returned in `optarg'. Two colons mean an option that wants an optional arg; if there is text in the current ARGV-element, it is returned in `optarg', otherwise `optarg' is set to zero. If OPTSTRING starts with `-' or `+', it requests different methods of handling the non-option ARGV-elements. See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above. Long-named options begin with `--' instead of `-'. Their names may be abbreviated as long as the abbreviation is unique or is an exact match for some defined option. If they have an argument, it follows the option name in the same ARGV-element, separated from the option name by a `=', or else the in next ARGV-element. When `getopt' finds a long-named option, it returns 0 if that option's `flag' field is nonzero, the value of the option's `val' field if the `flag' field is zero. The elements of ARGV aren't really const, because we permute them. But we pretend they're const in the prototype to be compatible with other systems. LONGOPTS is a vector of `struct option' terminated by an element containing a name which is zero. LONGIND returns the index in LONGOPT of the long-named option found. It is only valid when a long-named option has been found by the most recent call. If LONG_ONLY is nonzero, '-' as well as '--' can introduce long-named options. */ int _getopt_internal (argc, argv, optstring, longopts, longind, long_only) int argc; char *const *argv; const char *optstring; const struct option *longopts; int *longind; int long_only; { optarg = NULL; if (optind == 0) optstring = _getopt_initialize (optstring); if (nextchar == NULL || *nextchar == '\0') { /* Advance to the next ARGV-element. */ if (ordering == PERMUTE) { /* If we have just processed some options following some non-options, exchange them so that the options come first. */ if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (last_nonopt != optind) first_nonopt = optind; /* Skip any additional non-options and extend the range of non-options previously skipped. */ while (optind < argc && (argv[optind][0] != '-' || argv[optind][1] == '\0')) optind++; last_nonopt = optind; } /* The special ARGV-element `--' means premature end of options. Skip it like a null option, then exchange with previous non-options as if it were an option, then skip everything else like a non-option. */ if (optind != argc && !strcmp (argv[optind], "--")) { optind++; if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (first_nonopt == last_nonopt) first_nonopt = optind; last_nonopt = argc; optind = argc; } /* If we have done all the ARGV-elements, stop the scan and back over any non-options that we skipped and permuted. */ if (optind == argc) { /* Set the next-arg-index to point at the non-options that we previously skipped, so the caller will digest them. */ if (first_nonopt != last_nonopt) optind = first_nonopt; return EOF; } /* If we have come to a non-option and did not permute it, either stop the scan or describe it to the caller and pass it by. */ if ((argv[optind][0] != '-' || argv[optind][1] == '\0')) { if (ordering == REQUIRE_ORDER) return EOF; optarg = argv[optind++]; return 1; } /* We have found another option-ARGV-element. Skip the initial punctuation. */ nextchar = (argv[optind] + 1 + (longopts != NULL && argv[optind][1] == '-')); } /* Decode the current option-ARGV-element. */ /* Check whether the ARGV-element is a long option. If long_only and the ARGV-element has the form "-f", where f is a valid short option, don't consider it an abbreviated form of a long option that starts with f. Otherwise there would be no way to give the -f short option. On the other hand, if there's a long option "fubar" and the ARGV-element is "-fu", do consider that an abbreviation of the long option, just like "--fu", and not "-f" with arg "u". This distinction seems to be the most useful approach. */ if (longopts != NULL && (argv[optind][1] == '-' || (long_only && (argv[optind][2] || !my_index (optstring, argv[optind][1]))))) { char *nameend; const struct option *p; const struct option *pfound = NULL; int exact = 0; int ambig = 0; int indfound; int option_index; for (nameend = nextchar; *nameend && *nameend != '='; nameend++) /* Do nothing. */ ; /* Test all long options for either exact match or abbreviated matches. */ for (p = longopts, option_index = 0; p->name; p++, option_index++) if (!strncmp (p->name, nextchar, nameend - nextchar)) { if (nameend - nextchar == strlen (p->name)) { /* Exact match found. */ pfound = p; indfound = option_index; exact = 1; break; } else if (pfound == NULL) { /* First nonexact match found. */ pfound = p; indfound = option_index; } else /* Second or later nonexact match found. */ ambig = 1; } if (ambig && !exact) { if (opterr) fprintf (stderr, gettext ("%s: option `%s' is ambiguous\n"), argv[0], argv[optind]); nextchar += strlen (nextchar); optind++; return '?'; } if (pfound != NULL) { option_index = indfound; optind++; if (*nameend) { /* Don't test has_arg with >, because some C compilers don't allow it to be used on enums. */ if (pfound->has_arg) optarg = nameend + 1; else { if (opterr) if (argv[optind - 1][1] == '-') /* --option */ fprintf (stderr, gettext ("%s: option `--%s' doesn't allow an argument\n"), argv[0], pfound->name); else /* +option or -option */ fprintf (stderr, gettext ("%s: option `%c%s' doesn't allow an argument\n"), argv[0], argv[optind - 1][0], pfound->name); nextchar += strlen (nextchar); return '?'; } } else if (pfound->has_arg == 1) { if (optind < argc) optarg = argv[optind++]; else { if (opterr) fprintf (stderr, gettext ("%s: option `%s' requires an argument\n"), argv[0], argv[optind - 1]); nextchar += strlen (nextchar); return optstring[0] == ':' ? ':' : '?'; } } nextchar += strlen (nextchar); if (longind != NULL) *longind = option_index; if (pfound->flag) { *(pfound->flag) = pfound->val; return 0; } return pfound->val; } /* Can't find it as a long option. If this is not getopt_long_only, or the option starts with '--' or is not a valid short option, then it's an error. Otherwise interpret it as a short option. */ if (!long_only || argv[optind][1] == '-' || my_index (optstring, *nextchar) == NULL) { if (opterr) { if (argv[optind][1] == '-') /* --option */ fprintf (stderr, gettext ("%s: unrecognized option `--%s'\n"), argv[0], nextchar); else /* +option or -option */ fprintf (stderr, gettext ("%s: unrecognized option `%c%s'\n"), argv[0], argv[optind][0], nextchar); } nextchar = (char *) ""; optind++; return '?'; } } /* Look at and handle the next short option-character. */ { char c = *nextchar++; char *temp = my_index (optstring, c); /* Increment `optind' when we start to process its last character. */ if (*nextchar == '\0') ++optind; if (temp == NULL || c == ':') { if (opterr) { if (posixly_correct) /* 1003.2 specifies the format of this message. */ fprintf (stderr, gettext ("%s: illegal option -- %c\n"), argv[0], c); else fprintf (stderr, gettext ("%s: invalid option -- %c\n"), argv[0], c); } optopt = c; return '?'; } if (temp[1] == ':') { if (temp[2] == ':') { /* This is an option that accepts an argument optionally. */ if (*nextchar != '\0') { optarg = nextchar; optind++; } else optarg = NULL; nextchar = NULL; } else { /* This is an option that requires an argument. */ if (*nextchar != '\0') { optarg = nextchar; /* If we end this ARGV-element by taking the rest as an arg, we must advance to the next element now. */ optind++; } else if (optind == argc) { if (opterr) { /* 1003.2 specifies the format of this message. */ fprintf (stderr, gettext ("%s: option requires an argument -- %c\n"), argv[0], c); } optopt = c; if (optstring[0] == ':') c = ':'; else c = '?'; } else /* We already incremented `optind' once; increment it again when taking next ARGV-elt as argument. */ optarg = argv[optind++]; nextchar = NULL; } } return c; } } int getopt (argc, argv, optstring) int argc; char *const *argv; const char *optstring; { return _getopt_internal (argc, argv, optstring, (const struct option *) 0, (int *) 0, 0); } #endif /* _LIBC or not __GNU_LIBRARY__. */ #ifdef TEST /* Compile with -DTEST to make an executable for use in testing the above definition of `getopt'. */ int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; c = getopt (argc, argv, "abc:d:0123456789"); if (c == EOF) break; switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ tar-1.11.8/lib/getopt1.c 644 625 1 10236 5655157105 7725 /* getopt_long and getopt_long_only entry points for GNU getopt. Copyright (C) 1987, 88, 89, 90, 91, 92, 1993, 1994 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include #endif #include "getopt.h" #if !defined (__STDC__) || !__STDC__ /* This is a separate conditional since some stdc systems reject `defined (const)'. */ #ifndef const #define const #endif #endif #include /* Comment out all this code if we are using the GNU C Library, and are not actually compiling the library itself. This code is part of the GNU C Library, but also included in many other GNU distributions. Compiling and linking in this code is a waste when using the GNU C library (especially if it is a shared library). Rather than having every GNU program understand `configure --with-gnu-libc' and omit the object files, it is simpler to just do this in the source for each such file. */ #if defined (_LIBC) || !defined (__GNU_LIBRARY__) /* This needs to come after some library #include to get __GNU_LIBRARY__ defined. */ #ifdef __GNU_LIBRARY__ #include #else char *getenv (); #endif #ifndef NULL #define NULL 0 #endif int getopt_long (argc, argv, options, long_options, opt_index) int argc; char *const *argv; const char *options; const struct option *long_options; int *opt_index; { return _getopt_internal (argc, argv, options, long_options, opt_index, 0); } /* Like getopt_long, but '-' as well as '--' can indicate a long option. If an option that starts with '-' (not '--') doesn't match a long option, but does match a short option, it is parsed as a short option instead. */ int getopt_long_only (argc, argv, options, long_options, opt_index) int argc; char *const *argv; const char *options; const struct option *long_options; int *opt_index; { return _getopt_internal (argc, argv, options, long_options, opt_index, 1); } #endif /* _LIBC or not __GNU_LIBRARY__. */ #ifdef TEST #include int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; int option_index = 0; static struct option long_options[] = { {"add", 1, 0, 0}, {"append", 0, 0, 0}, {"delete", 1, 0, 0}, {"verbose", 0, 0, 0}, {"create", 0, 0, 0}, {"file", 1, 0, 0}, {0, 0, 0, 0} }; c = getopt_long (argc, argv, "abc:d:0123456789", long_options, &option_index); if (c == EOF) break; switch (c) { case 0: printf ("option %s", long_options[option_index].name); if (optarg) printf (" with arg %s", optarg); printf ("\n"); break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case 'd': printf ("option d with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ tar-1.11.8/lib/stpcpy.c 444 625 1 2111 5747005172 7631 /* stpcpy.c -- copy a string and return pointer to end of new string Copyright (C) 1989, 1990 Free Software Foundation. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include #endif /* Copy SRC to DEST, returning the address of the terminating '\0' in DEST. */ char * stpcpy (dest, src) char *dest; const char *src; { while ((*dest++ = *src++) != '\0') /* Do nothing. */ ; return dest - 1; } tar-1.11.8/lib/xgetcwd.c 444 625 1 3541 5642013766 7766 /* xgetcwd.c -- return current directory with unlimited length Copyright (C) 1992 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Written by David MacKenzie . */ #ifdef HAVE_CONFIG_H #include #endif #include #include #ifndef errno extern int errno; #endif #include #include "pathmax.h" #ifndef HAVE_GETCWD char *getwd (); #define getcwd(buf, max) getwd (buf) #else char *getcwd (); #endif /* Amount to increase buffer size by in each try. */ #define PATH_INCR 32 char *xmalloc (); char *xrealloc (); void free (); /* Return the current directory, newly allocated, arbitrarily long. Return NULL and set errno on error. */ char * xgetcwd () { char *cwd; char *ret; unsigned path_max; errno = 0; path_max = (unsigned) PATH_MAX; path_max += 2; /* The getcwd docs say to do this. */ cwd = xmalloc (path_max); errno = 0; while ((ret = getcwd (cwd, path_max)) == NULL && errno == ERANGE) { path_max += PATH_INCR; cwd = xrealloc (cwd, path_max); errno = 0; } if (ret == NULL) { int save_errno = errno; free (cwd); errno = save_errno; return NULL; } return cwd; } tar-1.11.8/lib/xmalloc.c 444 625 1 4372 5666652164 7772 /* xmalloc.c -- malloc with out of memory checking Copyright (C) 1990, 91, 92, 93, 94 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include #endif #if __STDC__ #define VOID void #else #define VOID char #endif #include #if STDC_HEADERS #include #else VOID *malloc (); VOID *realloc (); void free (); #endif /* This is for other GNU distributions with internationalized messages. The GNU C Library itself does not yet support such messages. */ #if HAVE_LIBINTL_H # include #else # define gettext(msgid) (msgid) #endif #ifndef EXIT_FAILURE #define EXIT_FAILURE 1 #endif /* Exit value when the requested amount of memory is not available. The caller may set it to some other value. */ int xmalloc_exit_failure = EXIT_FAILURE; #if __STDC__ && (HAVE_VPRINTF || HAVE_DOPRNT) void error (int, int, const char *, ...); #else void error (); #endif static VOID * fixup_null_alloc (n) size_t n; { VOID *p; p = 0; if (n == 0) p = malloc ((size_t) 1); if (p == 0) error (xmalloc_exit_failure, 0, gettext ("Memory exhausted")); return p; } /* Allocate N bytes of memory dynamically, with error checking. */ VOID * xmalloc (n) size_t n; { VOID *p; p = malloc (n); if (p == 0) p = fixup_null_alloc (n); return p; } /* Change the size of an allocated block of memory P to N bytes, with error checking. If P is NULL, run xmalloc. */ VOID * xrealloc (p, n) VOID *p; size_t n; { if (p == 0) return xmalloc (n); p = realloc (p, n); if (p == 0) p = fixup_null_alloc (n); return p; } tar-1.11.8/lib/xstrdup.c 644 625 1 2142 5641640007 10021 /* xstrdup.c -- copy a string with out of memory checking Copyright (C) 1990 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include #endif #if defined(STDC_HEADERS) || defined(HAVE_STRING_H) #include #else #include #endif char *xmalloc (); /* Return a newly allocated copy of STRING. */ char * xstrdup (string) char *string; { return strcpy (xmalloc (strlen (string) + 1), string); } tar-1.11.8/lib/getdate.c 644 625 1 140457 5727256766 10025 /* A Bison parser, made from getdate.y with Bison version GNU Bison version 1.22 */ #define YYBISON 1 /* Identify Bison output. */ #define tAGO 258 #define tDAY 259 #define tDAYZONE 260 #define tID 261 #define tMERIDIAN 262 #define tMINUTE_UNIT 263 #define tMONTH 264 #define tMONTH_UNIT 265 #define tSEC_UNIT 266 #define tSNUMBER 267 #define tUNUMBER 268 #define tZONE 269 #define tDST 270 #line 1 "getdate.y" /* ** Originally written by Steven M. Bellovin while ** at the University of North Carolina at Chapel Hill. Later tweaked by ** a couple of people on Usenet. Completely overhauled by Rich $alz ** and Jim Berets in August, 1990; ** send any email to Rich. ** ** This grammar has 10 shift/reduce conflicts. ** ** This code is in the public domain and has no copyright. */ /* SUPPRESS 287 on yaccpar_sccsid *//* Unused static variable */ /* SUPPRESS 288 on yyerrlab *//* Label unused */ #ifdef HAVE_CONFIG_H #include #endif /* Since the code of getdate.y is not included in the Emacs executable itself, there is no need to #define static in this file. Even if the code were included in the Emacs executable, it probably wouldn't do any harm to #undef it here; this will only cause problems if we try to write to a static variable, which I don't think this code needs to do. */ #ifdef emacs #undef static #endif #include #include #if defined (STDC_HEADERS) || !defined (isascii) #define ISASCII(c) 1 #else #define ISASCII(c) isascii(c) #endif #define ISSPACE(c) (ISASCII (c) && isspace (c)) #define ISALPHA(c) (ISASCII (c) && isalpha (c)) #define ISUPPER(c) (ISASCII (c) && isupper (c)) #define ISDIGIT(c) (ISASCII (c) && isdigit (c)) /* The code at the top of get_date which figures out the offset of the current time zone checks various CPP symbols to see if special tricks are need, but defaults to using the gettimeofday system call. Include if that will be used. */ #if defined (vms) #include #include #else #include #ifdef TIME_WITH_SYS_TIME #include #include #else #ifdef HAVE_SYS_TIME_H #include #else #include #endif #endif #ifdef timezone #undef timezone /* needed for sgi */ #endif #if defined (HAVE_SYS_TIMEB_H) #include #else /* ** We use the obsolete `struct timeb' as part of our interface! ** Since the system doesn't have it, we define it here; ** our callers must do likewise. */ struct timeb { time_t time; /* Seconds since the epoch */ unsigned short millitm; /* Field not used */ short timezone; /* Minutes west of GMT */ short dstflag; /* Field not used */ }; #endif /* defined (HAVE_SYS_TIMEB_H) */ #endif /* defined (vms) */ #if defined (STDC_HEADERS) || defined (USG) #include #endif /* Some old versions of bison generate parsers that use bcopy. That loses on systems that don't provide the function, so we have to redefine it here. */ #if !defined (HAVE_BCOPY) && defined (HAVE_MEMCPY) && !defined (bcopy) #define bcopy(from, to, len) memcpy ((to), (from), (len)) #endif extern struct tm *gmtime (); extern struct tm *localtime (); #define yyparse getdate_yyparse #define yylex getdate_yylex #define yyerror getdate_yyerror static int yylex (); static int yyerror (); #define EPOCH 1970 #define HOUR(x) ((time_t)(x) * 60) #define SECSPERDAY (24L * 60L * 60L) #define MAX_BUFF_LEN 128 /* size of buffer to read the date into */ /* ** An entry in the lexical lookup table. */ typedef struct _TABLE { const char *name; int type; time_t value; } TABLE; /* ** Daylight-savings mode: on, off, or not yet known. */ typedef enum _DSTMODE { DSTon, DSToff, DSTmaybe } DSTMODE; /* ** Meridian: am, pm, or 24-hour style. */ typedef enum _MERIDIAN { MERam, MERpm, MER24 } MERIDIAN; /* ** Global variables. We could get rid of most of these by using a good ** union as the yacc stack. (This routine was originally written before ** yacc had the %union construct.) Maybe someday; right now we only use ** the %union very rarely. */ static char *yyInput; static DSTMODE yyDSTmode; static time_t yyDayOrdinal; static time_t yyDayNumber; static int yyHaveDate; static int yyHaveDay; static int yyHaveRel; static int yyHaveTime; static int yyHaveZone; static time_t yyTimezone; static time_t yyDay; static time_t yyHour; static time_t yyMinutes; static time_t yyMonth; static time_t yySeconds; static time_t yyYear; static MERIDIAN yyMeridian; static time_t yyRelMonth; static time_t yyRelSeconds; #line 171 "getdate.y" typedef union { time_t Number; enum _MERIDIAN Meridian; } YYSTYPE; #ifndef YYLTYPE typedef struct yyltype { int timestamp; int first_line; int first_column; int last_line; int last_column; char *text; } yyltype; #define YYLTYPE yyltype #endif #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 52 #define YYFLAG -32768 #define YYNTBASE 19 #define YYTRANSLATE(x) ((unsigned)(x) <= 270 ? yytranslate[x] : 29) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 17, 2, 2, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 1, 4, 6, 8, 10, 12, 14, 16, 19, 24, 29, 36, 43, 45, 47, 50, 52, 55, 58, 62, 68, 72, 76, 79, 84, 87, 91, 94, 96, 99, 102, 104, 107, 110, 112, 115, 118, 120, 122, 123 }; static const short yyrhs[] = { -1, 19, 20, 0, 21, 0, 22, 0, 24, 0, 23, 0, 25, 0, 27, 0, 13, 7, 0, 13, 16, 13, 28, 0, 13, 16, 13, 12, 0, 13, 16, 13, 16, 13, 28, 0, 13, 16, 13, 16, 13, 12, 0, 14, 0, 5, 0, 14, 15, 0, 4, 0, 4, 17, 0, 13, 4, 0, 13, 18, 13, 0, 13, 18, 13, 18, 13, 0, 13, 12, 12, 0, 13, 9, 12, 0, 9, 13, 0, 9, 13, 17, 13, 0, 13, 9, 0, 13, 9, 13, 0, 26, 3, 0, 26, 0, 13, 8, 0, 12, 8, 0, 8, 0, 12, 11, 0, 13, 11, 0, 11, 0, 12, 10, 0, 13, 10, 0, 10, 0, 13, 0, 0, 7, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 185, 186, 189, 192, 195, 198, 201, 204, 207, 213, 219, 226, 232, 242, 246, 250, 257, 261, 265, 271, 275, 280, 286, 292, 296, 301, 305, 312, 316, 319, 322, 325, 328, 331, 334, 337, 340, 343, 348, 375, 378 }; static const char * const yytname[] = { "$","error","$illegal.","tAGO","tDAY", "tDAYZONE","tID","tMERIDIAN","tMINUTE_UNIT","tMONTH","tMONTH_UNIT","tSEC_UNIT", "tSNUMBER","tUNUMBER","tZONE","tDST","':'","','","'/'","spec","item","time", "zone","day","date","rel","relunit","number","o_merid","" }; #endif static const short yyr1[] = { 0, 19, 19, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 28, 28 }; static const short yyr2[] = { 0, 0, 2, 1, 1, 1, 1, 1, 1, 2, 4, 4, 6, 6, 1, 1, 2, 1, 2, 2, 3, 5, 3, 3, 2, 4, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 1, 0, 1 }; static const short yydefact[] = { 1, 0, 17, 15, 32, 0, 38, 35, 0, 39, 14, 2, 3, 4, 6, 5, 7, 29, 8, 18, 24, 31, 36, 33, 19, 9, 30, 26, 37, 34, 0, 0, 0, 16, 28, 0, 23, 27, 22, 40, 20, 25, 41, 11, 0, 10, 0, 40, 21, 13, 12, 0, 0 }; static const short yydefgoto[] = { 1, 11, 12, 13, 14, 15, 16, 17, 18, 45 }; static const short yypact[] = {-32768, 0, -1,-32768,-32768, 4,-32768,-32768, 25, 11, -8, -32768,-32768,-32768,-32768,-32768,-32768, 21,-32768,-32768, 9, -32768,-32768,-32768,-32768,-32768,-32768, -10,-32768,-32768, 16, 19, 24,-32768,-32768, 26,-32768,-32768,-32768, 18, 13, -32768,-32768,-32768, 27,-32768, 28, -6,-32768,-32768,-32768, 38,-32768 }; static const short yypgoto[] = {-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -5 }; #define YYLAST 42 static const short yytable[] = { 51, 42, 36, 37, 2, 3, 49, 33, 4, 5, 6, 7, 8, 9, 10, 24, 19, 20, 25, 26, 27, 28, 29, 30, 34, 42, 35, 31, 38, 32, 43, 46, 39, 21, 44, 22, 23, 40, 52, 41, 47, 48, 50 }; static const short yycheck[] = { 0, 7, 12, 13, 4, 5, 12, 15, 8, 9, 10, 11, 12, 13, 14, 4, 17, 13, 7, 8, 9, 10, 11, 12, 3, 7, 17, 16, 12, 18, 12, 18, 13, 8, 16, 10, 11, 13, 0, 13, 13, 13, 47 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/lib/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) #include #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include #pragma alloca #else /* not MSDOS, __TURBOC__, or _AIX */ #ifdef __hpux #ifdef __cplusplus extern "C" { void *alloca (unsigned int); }; #else /* not __cplusplus */ void *alloca (); #endif /* not __cplusplus */ #endif /* __hpux */ #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc. */ #endif /* not GNU C. */ #endif /* alloca not defined. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT return(0) #define YYABORT return(1) #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(token, value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { yychar = (token), yylval = (value); \ yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) #define YYTERROR 1 #define YYERRCODE 256 #ifndef YYPURE #define YYLEX yylex() #endif #ifdef YYPURE #ifdef YYLSP_NEEDED #define YYLEX yylex(&yylval, &yylloc) #else #define YYLEX yylex(&yylval) #endif #endif /* If nonreentrant, generate the variables here */ #ifndef YYPURE int yychar; /* the lookahead symbol */ YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */ #ifdef YYLSP_NEEDED YYLTYPE yylloc; /* location data for the lookahead */ /* symbol */ #endif int yynerrs; /* number of parse errors so far */ #endif /* not YYPURE */ #if YYDEBUG != 0 int yydebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* YYINITDEPTH indicates the initial size of the parser's stacks */ #ifndef YYINITDEPTH #define YYINITDEPTH 200 #endif /* YYMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if YYMAXDEPTH == 0 #undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH #define YYMAXDEPTH 10000 #endif /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ int yyparse (void); #endif #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ #define __yy_bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT) #else /* not GNU C or C++ */ #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (from, to, count) char *from; char *to; int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (char *from, char *to, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 184 "/usr/lib/bison.simple" int yyparse() { register int yystate; register int yyn; register short *yyssp; register YYSTYPE *yyvsp; int yyerrstatus; /* number of tokens to shift before error messages enabled */ int yychar1 = 0; /* lookahead token as an internal (translated) token number */ short yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ short *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) #else #define YYPOPSTACK (yyvsp--, yyssp--) #endif int yystacksize = YYINITDEPTH; #ifdef YYPURE int yychar; YYSTYPE yylval; int yynerrs; #ifdef YYLSP_NEEDED YYLTYPE yylloc; #endif #endif YYSTYPE yyval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int yylen; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Starting parse\n"); #endif yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss - 1; yyvsp = yyvs; #ifdef YYLSP_NEEDED yylsp = yyls; #endif /* Push a new state, which is found in yystate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yynewstate: *++yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Give user a chance to reallocate the stack */ /* Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE *yyls1 = yyls; #endif /* Get the current used size of the three stacks, in elements. */ int size = yyssp - yyss + 1; #ifdef yyoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ #ifdef YYLSP_NEEDED /* This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yyls1, size * sizeof (*yylsp), &yystacksize); #else yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yystacksize); #endif yyss = yyss1; yyvs = yyvs1; #ifdef YYLSP_NEEDED yyls = yyls1; #endif #else /* no yyoverflow */ /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) { yyerror("parser stack overflow"); return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; yyss = (short *) alloca (yystacksize * sizeof (*yyssp)); __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp)); #endif #endif /* no yyoverflow */ yyssp = yyss + size - 1; yyvsp = yyvs + size - 1; #ifdef YYLSP_NEEDED yylsp = yyls + size - 1; #endif #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Stack size increased to %d\n", yystacksize); #endif if (yyssp >= yyss + yystacksize - 1) YYABORT; } #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Entering state %d\n", yystate); #endif goto yybackup; yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* yychar is either YYEMPTY or YYEOF or a valid token in external form. */ if (yychar == YYEMPTY) { #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Reading a token: "); #endif yychar = YYLEX; } /* Convert token to internal form (in yychar1) for indexing tables with */ if (yychar <= 0) /* This means end of input. */ { yychar1 = 0; yychar = YYEOF; /* Don't call YYLEX any more */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { yychar1 = YYTRANSLATE(yychar); #if YYDEBUG != 0 if (yydebug) { fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); /* Give the individual parser a way to print the precise meaning of a token, for further debugging info. */ #ifdef YYPRINT YYPRINT (stderr, yychar, yylval); #endif fprintf (stderr, ")\n"); } #endif } yyn += yychar1; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; yyn = yytable[yyn]; /* yyn is what to do for this token type in this state. Negative => reduce, -yyn is rule number. Positive => shift, yyn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (yyn < 0) { if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); #endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /* Do the default action for the current state. */ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; /* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: yylen = yyr2[yyn]; if (yylen > 0) yyval = yyvsp[1-yylen]; /* implement default value of the action */ #if YYDEBUG != 0 if (yydebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symbols being reduced, and their result. */ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) fprintf (stderr, "%s ", yytname[yyrhs[i]]); fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 3: #line 189 "getdate.y" { yyHaveTime++; ; break;} case 4: #line 192 "getdate.y" { yyHaveZone++; ; break;} case 5: #line 195 "getdate.y" { yyHaveDate++; ; break;} case 6: #line 198 "getdate.y" { yyHaveDay++; ; break;} case 7: #line 201 "getdate.y" { yyHaveRel++; ; break;} case 9: #line 207 "getdate.y" { yyHour = yyvsp[-1].Number; yyMinutes = 0; yySeconds = 0; yyMeridian = yyvsp[0].Meridian; ; break;} case 10: #line 213 "getdate.y" { yyHour = yyvsp[-3].Number; yyMinutes = yyvsp[-1].Number; yySeconds = 0; yyMeridian = yyvsp[0].Meridian; ; break;} case 11: #line 219 "getdate.y" { yyHour = yyvsp[-3].Number; yyMinutes = yyvsp[-1].Number; yyMeridian = MER24; yyDSTmode = DSToff; yyTimezone = - (yyvsp[0].Number % 100 + (yyvsp[0].Number / 100) * 60); ; break;} case 12: #line 226 "getdate.y" { yyHour = yyvsp[-5].Number; yyMinutes = yyvsp[-3].Number; yySeconds = yyvsp[-1].Number; yyMeridian = yyvsp[0].Meridian; ; break;} case 13: #line 232 "getdate.y" { yyHour = yyvsp[-5].Number; yyMinutes = yyvsp[-3].Number; yySeconds = yyvsp[-1].Number; yyMeridian = MER24; yyDSTmode = DSToff; yyTimezone = - (yyvsp[0].Number % 100 + (yyvsp[0].Number / 100) * 60); ; break;} case 14: #line 242 "getdate.y" { yyTimezone = yyvsp[0].Number; yyDSTmode = DSToff; ; break;} case 15: #line 246 "getdate.y" { yyTimezone = yyvsp[0].Number; yyDSTmode = DSTon; ; break;} case 16: #line 251 "getdate.y" { yyTimezone = yyvsp[-1].Number; yyDSTmode = DSTon; ; break;} case 17: #line 257 "getdate.y" { yyDayOrdinal = 1; yyDayNumber = yyvsp[0].Number; ; break;} case 18: #line 261 "getdate.y" { yyDayOrdinal = 1; yyDayNumber = yyvsp[-1].Number; ; break;} case 19: #line 265 "getdate.y" { yyDayOrdinal = yyvsp[-1].Number; yyDayNumber = yyvsp[0].Number; ; break;} case 20: #line 271 "getdate.y" { yyMonth = yyvsp[-2].Number; yyDay = yyvsp[0].Number; ; break;} case 21: #line 275 "getdate.y" { yyMonth = yyvsp[-4].Number; yyDay = yyvsp[-2].Number; yyYear = yyvsp[0].Number; ; break;} case 22: #line 280 "getdate.y" { /* ISO 8601 format. yyyy-mm-dd. */ yyYear = yyvsp[-2].Number; yyMonth = -yyvsp[-1].Number; yyDay = -yyvsp[0].Number; ; break;} case 23: #line 286 "getdate.y" { /* e.g. 17-JUN-1992. */ yyDay = yyvsp[-2].Number; yyMonth = yyvsp[-1].Number; yyYear = -yyvsp[0].Number; ; break;} case 24: #line 292 "getdate.y" { yyMonth = yyvsp[-1].Number; yyDay = yyvsp[0].Number; ; break;} case 25: #line 296 "getdate.y" { yyMonth = yyvsp[-3].Number; yyDay = yyvsp[-2].Number; yyYear = yyvsp[0].Number; ; break;} case 26: #line 301 "getdate.y" { yyMonth = yyvsp[0].Number; yyDay = yyvsp[-1].Number; ; break;} case 27: #line 305 "getdate.y" { yyMonth = yyvsp[-1].Number; yyDay = yyvsp[-2].Number; yyYear = yyvsp[0].Number; ; break;} case 28: #line 312 "getdate.y" { yyRelSeconds = -yyRelSeconds; yyRelMonth = -yyRelMonth; ; break;} case 30: #line 319 "getdate.y" { yyRelSeconds += yyvsp[-1].Number * yyvsp[0].Number * 60L; ; break;} case 31: #line 322 "getdate.y" { yyRelSeconds += yyvsp[-1].Number * yyvsp[0].Number * 60L; ; break;} case 32: #line 325 "getdate.y" { yyRelSeconds += yyvsp[0].Number * 60L; ; break;} case 33: #line 328 "getdate.y" { yyRelSeconds += yyvsp[-1].Number; ; break;} case 34: #line 331 "getdate.y" { yyRelSeconds += yyvsp[-1].Number; ; break;} case 35: #line 334 "getdate.y" { yyRelSeconds++; ; break;} case 36: #line 337 "getdate.y" { yyRelMonth += yyvsp[-1].Number * yyvsp[0].Number; ; break;} case 37: #line 340 "getdate.y" { yyRelMonth += yyvsp[-1].Number * yyvsp[0].Number; ; break;} case 38: #line 343 "getdate.y" { yyRelMonth += yyvsp[0].Number; ; break;} case 39: #line 348 "getdate.y" { if (yyHaveTime && yyHaveDate && !yyHaveRel) yyYear = yyvsp[0].Number; else { if (yyvsp[0].Number>10000) { yyHaveDate++; yyDay= (yyvsp[0].Number)%100; yyMonth= (yyvsp[0].Number/100)%100; yyYear = yyvsp[0].Number/10000; } else { yyHaveTime++; if (yyvsp[0].Number < 100) { yyHour = yyvsp[0].Number; yyMinutes = 0; } else { yyHour = yyvsp[0].Number / 100; yyMinutes = yyvsp[0].Number % 100; } yySeconds = 0; yyMeridian = MER24; } } ; break;} case 40: #line 375 "getdate.y" { yyval.Meridian = MER24; ; break;} case 41: #line 378 "getdate.y" { yyval.Meridian = yyvsp[0].Meridian; ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 465 "/usr/lib/bison.simple" yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++yyvsp = yyval; #ifdef YYLSP_NEEDED yylsp++; if (yylen == 0) { yylsp->first_line = yylloc.first_line; yylsp->first_column = yylloc.first_column; yylsp->last_line = (yylsp-1)->last_line; yylsp->last_column = (yylsp-1)->last_column; yylsp->text = 0; } else { yylsp->last_line = (yylsp+yylen-1)->last_line; yylsp->last_column = (yylsp+yylen-1)->last_column; } #endif /* Now "shift" the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTBASE] + *yyssp; if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; yyerrlab: /* here on detecting error */ if (! yyerrstatus) /* If not already recovering from an error, report this error. */ { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { int size = 0; char *msg; int x, count; count = 0; /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) size += strlen(yytname[x]) + 15, count++; msg = (char *) malloc(size + 15); if (msg != 0) { strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, yytname[x]); strcat(msg, "'"); count++; } } yyerror(msg); free(msg); } else yyerror ("parse error; also virtual memory exceeded"); } else #endif /* YYERROR_VERBOSE */ yyerror("parse error"); } goto yyerrlab1; yyerrlab1: /* here on error raised explicitly by an action */ if (yyerrstatus == 3) { /* if just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (yychar == YYEOF) YYABORT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); #endif yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ yyerrstatus = 3; /* Each real token shifted decrements this */ goto yyerrhandle; yyerrdefault: /* current state does not do anything special for the error token. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (yyn) goto yydefault; #endif yyerrpop: /* pop the current state because it cannot handle the error token */ if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #ifdef YYLSP_NEEDED yylsp--; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif yyerrhandle: yyn = yypact[yystate]; if (yyn == YYFLAG) goto yyerrdefault; yyn += YYTERROR; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) goto yyerrdefault; yyn = yytable[yyn]; if (yyn < 0) { if (yyn == YYFLAG) goto yyerrpop; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting error token, "); #endif *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; } #line 383 "getdate.y" /* Month and day table. */ static TABLE const MonthDayTable[] = { { "january", tMONTH, 1 }, { "february", tMONTH, 2 }, { "march", tMONTH, 3 }, { "april", tMONTH, 4 }, { "may", tMONTH, 5 }, { "june", tMONTH, 6 }, { "july", tMONTH, 7 }, { "august", tMONTH, 8 }, { "september", tMONTH, 9 }, { "sept", tMONTH, 9 }, { "october", tMONTH, 10 }, { "november", tMONTH, 11 }, { "december", tMONTH, 12 }, { "sunday", tDAY, 0 }, { "monday", tDAY, 1 }, { "tuesday", tDAY, 2 }, { "tues", tDAY, 2 }, { "wednesday", tDAY, 3 }, { "wednes", tDAY, 3 }, { "thursday", tDAY, 4 }, { "thur", tDAY, 4 }, { "thurs", tDAY, 4 }, { "friday", tDAY, 5 }, { "saturday", tDAY, 6 }, { NULL } }; /* Time units table. */ static TABLE const UnitsTable[] = { { "year", tMONTH_UNIT, 12 }, { "month", tMONTH_UNIT, 1 }, { "fortnight", tMINUTE_UNIT, 14 * 24 * 60 }, { "week", tMINUTE_UNIT, 7 * 24 * 60 }, { "day", tMINUTE_UNIT, 1 * 24 * 60 }, { "hour", tMINUTE_UNIT, 60 }, { "minute", tMINUTE_UNIT, 1 }, { "min", tMINUTE_UNIT, 1 }, { "second", tSEC_UNIT, 1 }, { "sec", tSEC_UNIT, 1 }, { NULL } }; /* Assorted relative-time words. */ static TABLE const OtherTable[] = { { "tomorrow", tMINUTE_UNIT, 1 * 24 * 60 }, { "yesterday", tMINUTE_UNIT, -1 * 24 * 60 }, { "today", tMINUTE_UNIT, 0 }, { "now", tMINUTE_UNIT, 0 }, { "last", tUNUMBER, -1 }, { "this", tMINUTE_UNIT, 0 }, { "next", tUNUMBER, 2 }, { "first", tUNUMBER, 1 }, /* { "second", tUNUMBER, 2 }, */ { "third", tUNUMBER, 3 }, { "fourth", tUNUMBER, 4 }, { "fifth", tUNUMBER, 5 }, { "sixth", tUNUMBER, 6 }, { "seventh", tUNUMBER, 7 }, { "eighth", tUNUMBER, 8 }, { "ninth", tUNUMBER, 9 }, { "tenth", tUNUMBER, 10 }, { "eleventh", tUNUMBER, 11 }, { "twelfth", tUNUMBER, 12 }, { "ago", tAGO, 1 }, { NULL } }; /* The timezone table. */ /* Some of these are commented out because a time_t can't store a float. */ static TABLE const TimezoneTable[] = { { "gmt", tZONE, HOUR ( 0) }, /* Greenwich Mean */ { "ut", tZONE, HOUR ( 0) }, /* Universal (Coordinated) */ { "utc", tZONE, HOUR ( 0) }, { "wet", tZONE, HOUR ( 0) }, /* Western European */ { "bst", tDAYZONE, HOUR ( 0) }, /* British Summer */ { "wat", tZONE, HOUR ( 1) }, /* West Africa */ { "at", tZONE, HOUR ( 2) }, /* Azores */ #if 0 /* For completeness. BST is also British Summer, and GST is * also Guam Standard. */ { "bst", tZONE, HOUR ( 3) }, /* Brazil Standard */ { "gst", tZONE, HOUR ( 3) }, /* Greenland Standard */ #endif #if 0 { "nft", tZONE, HOUR (3.5) }, /* Newfoundland */ { "nst", tZONE, HOUR (3.5) }, /* Newfoundland Standard */ { "ndt", tDAYZONE, HOUR (3.5) }, /* Newfoundland Daylight */ #endif { "ast", tZONE, HOUR ( 4) }, /* Atlantic Standard */ { "adt", tDAYZONE, HOUR ( 4) }, /* Atlantic Daylight */ { "est", tZONE, HOUR ( 5) }, /* Eastern Standard */ { "edt", tDAYZONE, HOUR ( 5) }, /* Eastern Daylight */ { "cst", tZONE, HOUR ( 6) }, /* Central Standard */ { "cdt", tDAYZONE, HOUR ( 6) }, /* Central Daylight */ { "mst", tZONE, HOUR ( 7) }, /* Mountain Standard */ { "mdt", tDAYZONE, HOUR ( 7) }, /* Mountain Daylight */ { "pst", tZONE, HOUR ( 8) }, /* Pacific Standard */ { "pdt", tDAYZONE, HOUR ( 8) }, /* Pacific Daylight */ { "yst", tZONE, HOUR ( 9) }, /* Yukon Standard */ { "ydt", tDAYZONE, HOUR ( 9) }, /* Yukon Daylight */ { "hst", tZONE, HOUR (10) }, /* Hawaii Standard */ { "hdt", tDAYZONE, HOUR (10) }, /* Hawaii Daylight */ { "cat", tZONE, HOUR (10) }, /* Central Alaska */ { "ahst", tZONE, HOUR (10) }, /* Alaska-Hawaii Standard */ { "nt", tZONE, HOUR (11) }, /* Nome */ { "idlw", tZONE, HOUR (12) }, /* International Date Line West */ { "cet", tZONE, -HOUR (1) }, /* Central European */ { "met", tZONE, -HOUR (1) }, /* Middle European */ { "mewt", tZONE, -HOUR (1) }, /* Middle European Winter */ { "mest", tDAYZONE, -HOUR (1) }, /* Middle European Summer */ { "mesz", tDAYZONE, -HOUR (1) }, /* Middle European Summer */ { "swt", tZONE, -HOUR (1) }, /* Swedish Winter */ { "sst", tDAYZONE, -HOUR (1) }, /* Swedish Summer */ { "fwt", tZONE, -HOUR (1) }, /* French Winter */ { "fst", tDAYZONE, -HOUR (1) }, /* French Summer */ { "eet", tZONE, -HOUR (2) }, /* Eastern Europe, USSR Zone 1 */ { "bt", tZONE, -HOUR (3) }, /* Baghdad, USSR Zone 2 */ #if 0 { "it", tZONE, -HOUR (3.5) },/* Iran */ #endif { "zp4", tZONE, -HOUR (4) }, /* USSR Zone 3 */ { "zp5", tZONE, -HOUR (5) }, /* USSR Zone 4 */ #if 0 { "ist", tZONE, -HOUR (5.5) },/* Indian Standard */ #endif { "zp6", tZONE, -HOUR (6) }, /* USSR Zone 5 */ #if 0 /* For completeness. NST is also Newfoundland Standard, and SST is * also Swedish Summer. */ { "nst", tZONE, -HOUR (6.5) },/* North Sumatra */ { "sst", tZONE, -HOUR (7) }, /* South Sumatra, USSR Zone 6 */ #endif /* 0 */ { "wast", tZONE, -HOUR (7) }, /* West Australian Standard */ { "wadt", tDAYZONE, -HOUR (7) }, /* West Australian Daylight */ #if 0 { "jt", tZONE, -HOUR (7.5) },/* Java (3pm in Cronusland!) */ #endif { "cct", tZONE, -HOUR (8) }, /* China Coast, USSR Zone 7 */ { "jst", tZONE, -HOUR (9) }, /* Japan Standard, USSR Zone 8 */ #if 0 { "cast", tZONE, -HOUR (9.5) },/* Central Australian Standard */ { "cadt", tDAYZONE, -HOUR (9.5) },/* Central Australian Daylight */ #endif { "east", tZONE, -HOUR (10) }, /* Eastern Australian Standard */ { "eadt", tDAYZONE, -HOUR (10) }, /* Eastern Australian Daylight */ { "gst", tZONE, -HOUR (10) }, /* Guam Standard, USSR Zone 9 */ { "nzt", tZONE, -HOUR (12) }, /* New Zealand */ { "nzst", tZONE, -HOUR (12) }, /* New Zealand Standard */ { "nzdt", tDAYZONE, -HOUR (12) }, /* New Zealand Daylight */ { "idle", tZONE, -HOUR (12) }, /* International Date Line East */ { NULL } }; /* Military timezone table. */ static TABLE const MilitaryTable[] = { { "a", tZONE, HOUR ( 1) }, { "b", tZONE, HOUR ( 2) }, { "c", tZONE, HOUR ( 3) }, { "d", tZONE, HOUR ( 4) }, { "e", tZONE, HOUR ( 5) }, { "f", tZONE, HOUR ( 6) }, { "g", tZONE, HOUR ( 7) }, { "h", tZONE, HOUR ( 8) }, { "i", tZONE, HOUR ( 9) }, { "k", tZONE, HOUR ( 10) }, { "l", tZONE, HOUR ( 11) }, { "m", tZONE, HOUR ( 12) }, { "n", tZONE, HOUR (- 1) }, { "o", tZONE, HOUR (- 2) }, { "p", tZONE, HOUR (- 3) }, { "q", tZONE, HOUR (- 4) }, { "r", tZONE, HOUR (- 5) }, { "s", tZONE, HOUR (- 6) }, { "t", tZONE, HOUR (- 7) }, { "u", tZONE, HOUR (- 8) }, { "v", tZONE, HOUR (- 9) }, { "w", tZONE, HOUR (-10) }, { "x", tZONE, HOUR (-11) }, { "y", tZONE, HOUR (-12) }, { "z", tZONE, HOUR ( 0) }, { NULL } }; /* ARGSUSED */ static int yyerror (s) char *s; { return 0; } static time_t ToSeconds (Hours, Minutes, Seconds, Meridian) time_t Hours; time_t Minutes; time_t Seconds; MERIDIAN Meridian; { if (Minutes < 0 || Minutes > 59 || Seconds < 0 || Seconds > 59) return -1; switch (Meridian) { case MER24: if (Hours < 0 || Hours > 23) return -1; return (Hours * 60L + Minutes) * 60L + Seconds; case MERam: if (Hours < 1 || Hours > 12) return -1; if (Hours == 12) Hours = 0; return (Hours * 60L + Minutes) * 60L + Seconds; case MERpm: if (Hours < 1 || Hours > 12) return -1; if (Hours == 12) Hours = 0; return ((Hours + 12) * 60L + Minutes) * 60L + Seconds; default: abort (); } /* NOTREACHED */ } static time_t Convert (Month, Day, Year, Hours, Minutes, Seconds, Meridian, DSTmode) time_t Month; time_t Day; time_t Year; time_t Hours; time_t Minutes; time_t Seconds; MERIDIAN Meridian; DSTMODE DSTmode; { static int DaysInMonth[12] = { 31, 0, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }; time_t tod; time_t Julian; int i; if (Year < 0) Year = -Year; if (Year < 100) Year += 1900; DaysInMonth[1] = Year % 4 == 0 && (Year % 100 != 0 || Year % 400 == 0) ? 29 : 28; if (Year < EPOCH || Year > 1999 || Month < 1 || Month > 12 /* Lint fluff: "conversion from long may lose accuracy" */ || Day < 1 || Day > DaysInMonth[(int)--Month]) return -1; for (Julian = Day - 1, i = 0; i < Month; i++) Julian += DaysInMonth[i]; for (i = EPOCH; i < Year; i++) Julian += 365 + (i % 4 == 0); Julian *= SECSPERDAY; /* Some tz.tz_minuteswest are given in seconds! Considering a timezone correction is at least 30 minutes, this system bug is easy to avoid. */ if (yyTimezone > -1800 && yyTimezone < 1800) Julian += yyTimezone * 60L; else Julian += yyTimezone; if ((tod = ToSeconds (Hours, Minutes, Seconds, Meridian)) < 0) return -1; Julian += tod; if (DSTmode == DSTon || (DSTmode == DSTmaybe && localtime (&Julian)->tm_isdst)) Julian -= 60 * 60; return Julian; } static time_t DSTcorrect (Start, Future) time_t Start; time_t Future; { time_t StartDay; time_t FutureDay; StartDay = (localtime (&Start)->tm_hour + 1) % 24; FutureDay = (localtime (&Future)->tm_hour + 1) % 24; return (Future - Start) + (StartDay - FutureDay) * 60L * 60L; } static time_t RelativeDate (Start, DayOrdinal, DayNumber) time_t Start; time_t DayOrdinal; time_t DayNumber; { struct tm *tm; time_t now; now = Start; tm = localtime (&now); now += SECSPERDAY * ((DayNumber - tm->tm_wday + 7) % 7); now += 7 * SECSPERDAY * (DayOrdinal <= 0 ? DayOrdinal : DayOrdinal - 1); return DSTcorrect (Start, now); } static time_t RelativeMonth (Start, RelMonth) time_t Start; time_t RelMonth; { struct tm *tm; time_t Month; time_t Year; if (RelMonth == 0) return 0; tm = localtime (&Start); Month = 12 * tm->tm_year + tm->tm_mon + RelMonth; Year = Month / 12; Month = Month % 12 + 1; return DSTcorrect (Start, Convert (Month, (time_t)tm->tm_mday, Year, (time_t)tm->tm_hour, (time_t)tm->tm_min, (time_t)tm->tm_sec, MER24, DSTmaybe)); } static int LookupWord (buff) char *buff; { register char *p; register char *q; register const TABLE *tp; int i; int abbrev; /* Make it lowercase. */ for (p = buff; *p; p++) if (ISUPPER (*p)) *p = tolower (*p); if (strcmp (buff, "am") == 0 || strcmp (buff, "a.m.") == 0) { yylval.Meridian = MERam; return tMERIDIAN; } if (strcmp (buff, "pm") == 0 || strcmp (buff, "p.m.") == 0) { yylval.Meridian = MERpm; return tMERIDIAN; } /* See if we have an abbreviation for a month. */ if (strlen (buff) == 3) abbrev = 1; else if (strlen (buff) == 4 && buff[3] == '.') { abbrev = 1; buff[3] = '\0'; } else abbrev = 0; for (tp = MonthDayTable; tp->name; tp++) { if (abbrev) { if (strncmp (buff, tp->name, 3) == 0) { yylval.Number = tp->value; return tp->type; } } else if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } } for (tp = TimezoneTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } if (strcmp (buff, "dst") == 0) return tDST; for (tp = UnitsTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } /* Strip off any plural and try the units table again. */ i = strlen (buff) - 1; if (buff[i] == 's') { buff[i] = '\0'; for (tp = UnitsTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } buff[i] = 's'; /* Put back for "this" in OtherTable. */ } for (tp = OtherTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } /* Military timezones. */ if (buff[1] == '\0' && ISALPHA (*buff)) { for (tp = MilitaryTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } } /* Drop out any periods and try the timezone table again. */ for (i = 0, p = q = buff; *q; q++) if (*q != '.') *p++ = *q; else i++; *p = '\0'; if (i) for (tp = TimezoneTable; tp->name; tp++) if (strcmp (buff, tp->name) == 0) { yylval.Number = tp->value; return tp->type; } return tID; } static int yylex () { register char c; register char *p; char buff[20]; int Count; int sign; for ( ; ; ) { while (ISSPACE (*yyInput)) yyInput++; if (ISDIGIT (c = *yyInput) || c == '-' || c == '+') { if (c == '-' || c == '+') { sign = c == '-' ? -1 : 1; ++yyInput; if (!ISDIGIT (*yyInput)) /* skip the '-' sign */ continue; } else sign = 0; for (yylval.Number = 0; c = *yyInput++, ISDIGIT (c); ) yylval.Number = 10 * yylval.Number + c - '0'; yyInput--; if (sign < 0) yylval.Number = -yylval.Number; return sign ? tSNUMBER : tUNUMBER; } if (ISALPHA (c)) { for (p = buff; c = *yyInput++, ISALPHA (c) || c == '.'; ) if (p < &buff[sizeof buff - 1]) *p++ = c; *p = '\0'; yyInput--; return LookupWord (buff); } if (c != '(') return *yyInput++; Count = 0; do { c = *yyInput++; if (c == '\0') return c; if (c == '(') Count++; else if (c == ')') Count--; } while (Count > 0); } } #define TM_YEAR_ORIGIN 1900 /* Yield A - B, measured in seconds. */ static long difftm (a, b) struct tm *a, *b; { int ay = a->tm_year + (TM_YEAR_ORIGIN - 1); int by = b->tm_year + (TM_YEAR_ORIGIN - 1); long days = ( /* difference in day of year */ a->tm_yday - b->tm_yday /* + intervening leap days */ + ((ay >> 2) - (by >> 2)) - (ay/100 - by/100) + ((ay/100 >> 2) - (by/100 >> 2)) /* + difference in years * 365 */ + (long)(ay-by) * 365 ); return (60*(60*(24*days + (a->tm_hour - b->tm_hour)) + (a->tm_min - b->tm_min)) + (a->tm_sec - b->tm_sec)); } time_t get_date (p, now) char *p; struct timeb *now; { struct tm *tm, gmt; struct timeb ftz; time_t Start; time_t tod; yyInput = p; if (now == NULL) { now = &ftz; (void)time (&ftz.time); if (! (tm = gmtime (&ftz.time))) return -1; gmt = *tm; /* Make a copy, in case localtime modifies *tm. */ if (! (tm = localtime (&ftz.time))) return -1; ftz.timezone = difftm (&gmt, tm) / 60; if (tm->tm_isdst) ftz.timezone += 60; } tm = localtime (&now->time); yyYear = tm->tm_year; yyMonth = tm->tm_mon + 1; yyDay = tm->tm_mday; yyTimezone = now->timezone; yyDSTmode = DSTmaybe; yyHour = 0; yyMinutes = 0; yySeconds = 0; yyMeridian = MER24; yyRelSeconds = 0; yyRelMonth = 0; yyHaveDate = 0; yyHaveDay = 0; yyHaveRel = 0; yyHaveTime = 0; yyHaveZone = 0; if (yyparse () || yyHaveTime > 1 || yyHaveZone > 1 || yyHaveDate > 1 || yyHaveDay > 1) return -1; if (yyHaveDate || yyHaveTime || yyHaveDay) { Start = Convert (yyMonth, yyDay, yyYear, yyHour, yyMinutes, yySeconds, yyMeridian, yyDSTmode); if (Start < 0) return -1; } else { Start = now->time; if (!yyHaveRel) Start -= ((tm->tm_hour * 60L + tm->tm_min) * 60L) + tm->tm_sec; } Start += yyRelSeconds; Start += RelativeMonth (Start, yyRelMonth); if (yyHaveDay && !yyHaveDate) { tod = RelativeDate (Start, yyDayOrdinal, yyDayNumber); Start += tod; } /* Have to do *something* with a legitimate -1 so it's distinguishable * from the error return value. (Alternately could set errno on error.) */ return Start == -1 ? 0 : Start; } #if defined (TEST) /* ARGSUSED */ int main (ac, av) int ac; char *av[]; { char buff[MAX_BUFF_LEN + 1]; time_t d; (void)printf ("Enter date, or blank line to exit.\n\t> "); (void)fflush (stdout); buff[MAX_BUFF_LEN] = 0; while (fgets (buff, MAX_BUFF_LEN, stdin) && buff[0]) { d = get_date (buff, (struct timeb *)NULL); if (d == -1) (void)printf ("Bad format - couldn't convert.\n"); else (void)printf ("%s", ctime (&d)); (void)printf ("\t> "); (void)fflush (stdout); } exit (0); /* NOTREACHED */ } #endif /* defined (TEST) */ tar-1.11.8/intl/Makefile.in 644 625 1 6645 5770623242 10432 # Makefile for directory with message catalog handling in GNU NLS Utilities. # Copyright (C) 1995 Free Software Foundation, Inc. # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. PACKAGE = @PACKAGE@ VERSION = @VERSION@ SHELL = /bin/sh VPATH = @srcdir@ srcdir = @srcdir@ top_srcdir = @top_srcdir@ prefix = @prefix@ exec_prefix = @exec_prefix@ transform = @program_transform_name@ datadir = $(prefix)/@DATADIRNAME@ localedir = $(datadir)/locale subdir = intl AR = ar CC = @CC@ RANLIB = @RANLIB@ DEFS = -DDEF_MSG_DOM_DIR=\"$(localedir)\" @DEFS@ CFLAGS = @CFLAGS@ COMPILE = $(CC) -c $(DEFS) $(INCLUDES) $(CPPFLAGS) $(CFLAGS) SCRIPTS = linux-msg.sed po-to-tbl.sed xopen-msg.sed HEADERS = gettext.h gettextP.h hash-string.h libgettext.h SOURCES = bindtextdom.c dcgettext.c dgettext.c gettext.c \ finddomain.c loadmsgcat.c textdomain.c cat-compat.c OBJECTS = @INTLOBJS@ CATOBJS = cat-compat.o cat-id-tbl.o GETTOBJS= bindtextdom.o dcgettext.o dgettext.o gettext.o \ finddomain.o loadmsgcat.o textdomain.o DISTFILES = Makefile.in combine-sh $(SCRIPTS) $(HEADERS) $(SOURCES) \ stamp-cat-id cat-id-tbl.c .SUFFIXES: .SUFFIXES: .c .o .c.o: $(COMPILE) $< INCLUDES = -I.. -I$(srcdir)/.. -I. -I$(srcdir)/../intl \ -I../lib -I$(srcdir)/../lib all: libintl.a libintl.a: $(OBJECTS) rm -f libintl.a $(AR) cru libintl.a $(OBJECTS) $(RANLIB) libintl.a cat-id-tbl.c: stamp-cat-id stamp-cat-id: po-to-tbl.sed $(top_srcdir)/po/$(PACKAGE).pot sed -f $(srcdir)/po-to-tbl.sed $(top_srcdir)/po/$(PACKAGE).pot \ | sed -e "s/@PACKAGE NAME@/$(PACKAGE)/" > table.tmp if cmp -s table.tmp $(srcdir)/cat-id-tbl.c; then rm table.tmp; \ else mv table.tmp $(srcdir)/cat-id-tbl.c; fi rm -f $(srcdir)/stamp-cat-id && echo timestamp > $(srcdir)/stamp-cat-id install install-exec install-data: all $(OBJECTS): ../config.h libgettext.h bindtextdom.o finddomain.o loadmsgcat.o: gettextP.h gettext.h cat-id-tbl.o: libgettext.h dcgettext.o: gettextP.h gettext.h hash-string.h tags: TAGS TAGS: $(HEADERS) $(SOURCES) cd $(srcdir)/../intl && etags $(HEADERS) $(SOURCES) $(LIBHDRS) $(LIBSRCS) mostlyclean: rm -f *.aux *.cp *.cps *.dvi *.fn *.fns *.ky *.log *.pg *.toc *.tp *.vr rm -f *.a *.o core core.* rm -f *.tmp clean: mostlyclean distclean: clean rm -f Makefile maintainer-clean: distclean @echo "This command is intended for maintainers to use;" @echo "it deletes files that may require special tools to rebuild." rm -f TAGS distdir = ../$(PACKAGE)-$(VERSION)/$(subdir) dist: $(DISTFILES) for file in $(DISTFILES); do \ ln $(srcdir)/$$file $(distdir) 2> /dev/null \ || cp -p $(srcdir)/$$file $(distdir); \ done Makefile: Makefile.in ../config.status cd .. && CONFIG_FILES=$(subdir)/$@ CONFIG_HEADERS= ./config.status # Tell versions [3.59,3.63) of GNU make not to export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: tar-1.11.8/intl/combine-sh 555 625 1 6356 5764065360 10340 #!/bin/sh TMPDIR=/tmp TMPNAME=/tmp/combine1.$$.sed trap 'rm -fr $TMPNAME combine; exit 1' 1 2 15 rm -f $TMPNAME cat > $TMPNAME < combine/libintl.c < #endif #define USE_COMBINED_HEADER 1 #include "libintlP.h" #if HAVE_CATGETS #include #ifdef HAVE_LOCALE_H # include #endif #ifdef HAVE_NL_TYPES_H # include #endif EOF CATCFILES=cat-compat.c GETCFILES="bindtextdom.c dcgettext.c dgettext.c finddomain.c gettext.c \ loadmsgcat.c textdomain.c" for file in $CATCFILES; do sed -f $TMPNAME < $file \ | sed -e '1s/.*/#line & "'$file'"/' >> combine/libintl.c done cat >> combine/libintl.c < #include #include #include #include #include #ifdef HAVE_LOCALE_H # include #endif #ifdef HAVE_UNISTD_H # include #endif #ifdef HAVE_MMAP # include #endif EOF for file in $GETCFILES; do sed -f $TMPNAME < $file \ | sed -e '1s/.*/#line & "'$file'"/' >> combine/libintl.c done cat >> combine/libintl.c < combine/libintlP.h <> combine/libintlP.h done cat >> combine/libintlP.h <> combine/libintlP.h done cat >> combine/libintlP.h <, 1995. # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ # # # The first directive in the .msg should be the definition of the # message set number. We use always set number 1. # 1 { i\ $set 1 # Automatically created by po-to-msg h s/.*/0/ x } # # Mitch's old catalog format does not allow comments. # # We copy the original message as a comment into the .msg file. # /^msgid/ { s/msgid[ ]*"// /"$/!s/$/ ... (more lines following)"/ x # The following nice solution is by # Bruno td # Increment a decimal number in pattern space. # First hide trailing `9' digits. :d s/9\(_*\)$/_\1/ td # Assure at least one digit is available. s/^\(_*\)$/0\1/ # Increment the last digit. s/8\(_*\)$/9\1/ s/7\(_*\)$/8\1/ s/6\(_*\)$/7\1/ s/5\(_*\)$/6\1/ s/4\(_*\)$/5\1/ s/3\(_*\)$/4\1/ s/2\(_*\)$/3\1/ s/1\(_*\)$/2\1/ s/0\(_*\)$/1\1/ # Convert the hidden `9' digits to `0's. s/_/0/g x G s/\(.*\)"\n0*\(.*\)/$ #\2 Original Message:(\1)/p } # # The .msg file contains, other then the .po file, only the translations # but each given a unique ID. Starting from 1 and incrementing by 1 for # each message we assign them to the messages. # It is important that the .po file used to generate the cat-id-tbl.c file # (with po-to-tbl) is the same as the one used here. (At least the order # of declarations must not be changed.) # /^msgstr/ { s/msgstr[ ]*"/# / # Yes, this jump IS necessary :) ta :a s/\\$/\\/ tc bb :c n s/\\$/\\/ tc :b s/\(.*\)"$/\1/ p } d tar-1.11.8/intl/po-to-tbl.sed 444 625 1 3544 5770533427 10675 # po-to-tbl.sed - Convert Uniforum style .po file to lookup table for catgets # Copyright (C) 1995 Free Software Foundation, Inc. # Ulrich Drepper , 1995. # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ # # 1 { i\ /* Automatically generated by po-to-tbl from @PACKAGE NAME@.po. */\ \ #if HAVE_CONFIG_H\ # include \ #endif\ \ #include "libgettext.h"\ \ const struct _msg_ent _msg_tbl[] = { h s/.*/0/ x } # # Write msgstr entries to C array form. # /^msgid/ { s/msgid[ ]*/ {/ # This jump is necessary, yes :). tc :c s/\\$/\\/ ta bb :a n s/\\$/\\/ ta :b x # The following nice solution is by # Bruno td # Increment a decimal number in pattern space. # First hide trailing `9' digits. :d s/9\(_*\)$/_\1/ td # Assure at least one digit is available. s/^\(_*\)$/0\1/ # Increment the last digit. s/8\(_*\)$/9\1/ s/7\(_*\)$/8\1/ s/6\(_*\)$/7\1/ s/5\(_*\)$/6\1/ s/4\(_*\)$/5\1/ s/3\(_*\)$/4\1/ s/2\(_*\)$/3\1/ s/1\(_*\)$/2\1/ s/0\(_*\)$/1\1/ # Convert the hidden `9' digits to `0's. s/_/0/g x G s/\(.*\)\n0*\(.*\)/\1, \2},/ s/\(.*\)"$/\1/ p } # # Last line # $ { i\ };\ g s/0*\(.*\)/int _msg_tbl_length = \1;/p } d tar-1.11.8/intl/xopen-msg.sed 444 625 1 4530 5754410744 10767 # po-to-msg.sed - Convert Uniforum style .po file to X/Open style .msg file # Copyright (C) 1995 Free Software Foundation, Inc. # Ulrich Drepper , 1995. # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ # # # The first directive in the .msg should be the definition of the # message set number. We use always set number 1. # 1 { i\ $set 1 # Automatically created by po-to-msg h s/.*/0/ x } # # We copy all comments into the .msg file. Perhaps they can help. # /^#/ s/^#[ ]*/$ /p # # We copy the original message as a comment into the .msg file. # /^msgid/ { /"$/!s/$/ ... (more lines following)"/ s/^msgid[ ]*"\(.*\)"$/$ Original Message: \1/p } # # The .msg file contains, other then the .po file, only the translations # but each given a unique ID. Starting from 1 and incrementing by 1 for # each message we assign them to the messages. # It is important that the .po file used to generate the cat-id-tbl.c file # (with po-to-tbl) is the same as the one used here. (At least the order # of declarations must not be changed.) # /^msgstr/ { s/msgstr[ ]*"// x # The following nice solution is by # Bruno td # Increment a decimal number in pattern space. # First hide trailing `9' digits. :d s/9\(_*\)$/_\1/ td # Assure at least one digit is available. s/^\(_*\)$/0\1/ # Increment the last digit. s/8\(_*\)$/9\1/ s/7\(_*\)$/8\1/ s/6\(_*\)$/7\1/ s/5\(_*\)$/6\1/ s/4\(_*\)$/5\1/ s/3\(_*\)$/4\1/ s/2\(_*\)$/3\1/ s/1\(_*\)$/2\1/ s/0\(_*\)$/1\1/ # Convert the hidden `9' digits to `0's. s/_/0/g x G s/\(.*\)\n0*\(.*\)/\2 \1/ # Yes, this jump IS necessary :) ta :a s/\\$/\\/ tc bb :c n s/\\$/\\/ tc :b s/\(.*\)"$/\1/ p } d tar-1.11.8/intl/gettext.h 444 625 1 4301 5770533427 10210 /* Copyright (C) 1995 Free Software Foundation, Inc. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with the GNU C Library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _GETTEXT_H #define _GETTEXT_H 1 #include /* @@ end of prolog @@ */ /* The magic number of the GNU message catalog format. */ #define _MAGIC 0x950412de #define _MAGIC_SWAPPED 0xde120495 /* Revision number of the currently used .mo (binary) file format. */ #define MO_REVISION_NUMBER 0 /* We need an unsigned, 32-bit data type. */ #if SIZEOF_UNSIGNED_INT == 4 typedef unsigned int nls_uint32; #elif SIZEOF_UNSIGNED_SHORT == 4 typedef unsigned short nls_uint32; #else /* The following line produces a syntax error which is intended because using #error is not portable enough. -- drepper */ "Cannot determine unsigned 32-bit data type. I'm screwed." #endif /* Header for binary .mo file format. */ struct mo_file_header { /* The magic number. */ nls_uint32 magic; /* The revision number of the file format. */ nls_uint32 revision; /* The number of strings pairs. */ nls_uint32 nstrings; /* Offset of table with start offsets of original strings. */ nls_uint32 orig_tab_offset; /* Offset of table with start offsets of translation strings. */ nls_uint32 trans_tab_offset; /* Size of hashing table. */ nls_uint32 hash_tab_size; /* Offset of first hashing entry. */ nls_uint32 hash_tab_offset; }; struct string_desc { /* Length of addressed string. */ nls_uint32 length; /* Offset of string in file. */ nls_uint32 offset; }; /* @@ begin of epilog @@ */ #endif /* gettext.h */ tar-1.11.8/intl/gettextP.h 444 625 1 3234 5764040214 10322 /* gettextP.h -- header describing internals of gettext library Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _GETTEXTP_H #define _GETTEXTP_H /* @@ end of prolog @@ */ #ifndef __P # ifdef __STDC__ # define __P(args) args # else # define __P(args) () # endif #endif #ifndef W # define W(flag, data) ((flag) ? SWAP (data) : (data)) #endif static inline nls_uint32 SWAP (i) nls_uint32 i; { return (i << 24) | ((i & 0xff00) << 8) | ((i >> 8) & 0xff00) | (i >> 24); } struct loaded_domain { struct loaded_domain *next; const char *data; const char *filename; int must_swap; nls_uint32 nstrings; struct string_desc *orig_tab; struct string_desc *trans_tab; nls_uint32 hash_size; nls_uint32 *hash_tab; }; struct binding { struct binding *next; char *domainname; char *dirname; }; struct loaded_domain *_nl_find_domain __P ((const char *domainname, int category)); struct loaded_domain *_nl_load_msg_cat __P ((const char *filename)); /* @@ begin of epilog @@ */ #endif /* gettextP.h */ tar-1.11.8/intl/hash-string.h 644 625 1 3105 5770647444 10763 /* hash-string - Implements a string hashing function. Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_VALUES_H # include #endif /* @@ end of prolog @@ */ #ifndef BITSPERBYTE # define BITSPERBYTE 8 #endif #ifndef LONGBITS # define LONGBITS (sizeof (long) * BITSPERBYTE) #endif /* LONGBITS */ /* Defines the so called `hashpjw' function by P.J. Weinberger [see Aho/Sethi/Ullman, COMPILERS: Principles, Techniques and Tools, 1986, 1987 Bell Telephone Laboratories, Inc.] */ static inline unsigned long hash_string (str_param) const char *str_param; { unsigned long hval, g; unsigned char *str = (unsigned char *) str_param; /* Compute the hash value for the given string. */ hval = 0; while (*str != '\0') { hval <<= 4; hval += *str++; g = hval & ((unsigned long) 0xf << (LONGBITS - 4)); if (g != 0) { hval ^= g >> (LONGBITS - 8); hval ^= g; } } return hval; } tar-1.11.8/intl/libgettext.h 444 625 1 7543 5764065231 10706 /* libgettext.h -- Message catalogs for internationalization. Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _LIBINTL_H #define _LIBINTL_H 1 #include /* @@ end of prolog @@ */ #ifndef __P # ifdef __STDC__ # define __P(args) args # else # define __P(args) () # endif #endif #ifndef HAVE_LC_MESSAGES /* This value determines the behaviour of the gettext() and dgettext() function. But some system does not have this defined. Define it to a default value. */ # define LC_MESSAGES (-1) #endif /* Declarations for gettext-using-catgets interface. Derived from Jim Meyering's libintl.h. */ struct _msg_ent { const char *_msg; int _msg_number; }; /* These two variables are defined in the automatically by po-to-tbl.sed generated file `cat-id-tbl.c'. */ extern const struct _msg_ent _msg_tbl[]; extern int _msg_tbl_length; /* Look up MSGID in the current default message catalog for the current LC_MESSAGES locale. If not found, returns MSGID itself (the default text). */ extern char *gettext __P ((const char *__msgid)); /* Look up MSGID in the DOMAINNAME message catalog for the current LC_MESSAGES locale. */ extern char *dgettext __P ((const char *__domainname, const char *__msgid)); /* Look up MSGID in the DOMAINNAME message catalog for the current CATEGORY locale. */ extern char *dcgettext __P ((const char *__domainname, const char *__msgid, int __category)); /* Set the current default message catalog to DOMAINNAME. If DOMAINNAME is null, return the current default. If DOMAINNAME is "", reset to the default of "messages". */ extern char *textdomain __P ((const char *__domainname)); /* Specify that the DOMAINNAME message catalog will be found in DIRNAME rather than in the system locale data base. */ extern char *bindtextdomain __P ((const char *__domainname, const char *__dirname)); #if defined ENABLE_NLS # if !defined HAVE_CATGETS # define gettext(msgid) dgettext (NULL, msgid) # define dgettext(domainname, msgid) \ dcgettext (domainname, msgid, LC_MESSAGES) # if defined __GNUC__ && __GNUC__ == 2 && __GNUC_MINOR__ >= 7 # define dcgettext(domainname, msgid, category) \ (__extension__ \ ({ \ if (__builtin_constant_p (msgid)) \ { \ extern int _nl_msg_cat_cntr; \ static char *__translation__; \ static int __catalog_counter__; \ if (! __translation__ || __catalog_counter__ != _nl_msg_cat_cntr) \ { \ __translation__ = \ (dcgettext) ((domainname), (msgid), (category)); \ __catalog_counter__ = _nl_msg_cat_cntr; \ } \ __translation__; \ } \ else \ (dcgettext) ((domainname), (msgid), (category)); \ })) # endif # endif #else # define gettext(msgid) (msgid) # define dgettext(domainname, msgid) (msgid) # define dcgettext(domainname, msgid, category) (msgid) # define textdomain(domainname) while (0) /* nothing */ # define bindtextdomain(domainname, dirname) while (0) /* nothing */ #endif /* @@ begin of epilog @@ */ #endif /* libgettext.h */ tar-1.11.8/intl/bindtextdom.c 444 625 1 6301 5764040351 11032 /* bindtextdom.c -- implementation of the bindtextdomain(3) function Copyright (C) 1995 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #include #include #include #include "gettext.h" #include "gettextP.h" /* @@ end of prolog @@ */ /* Contains the default location of the message catalogs. */ extern const char _nl_default_dirname[]; /* List with bindings of specific domains. */ extern struct binding *_nl_domain_bindings; /* Prototypes for library functions. */ void *xmalloc (); char *xstrdup (); /* Specify that the DOMAINNAME message catalog will be found in DIRNAME rather than in the system locale data base. */ char * bindtextdomain (domainname, dirname) const char *domainname; const char *dirname; { struct binding *binding; /* Some sanity checks. */ if (domainname == NULL || domainname[0] == '\0') return NULL; for (binding = _nl_domain_bindings; binding != NULL; binding = binding->next) { int compare = strcmp (domainname, binding->domainname); if (compare == 0) /* We found it! */ break; if (compare < 0) { /* It is not in the list. */ binding = NULL; break; } } if (dirname == NULL) /* The current binding has be to returned. */ return binding == NULL ? (char *) _nl_default_dirname : binding->dirname; if (binding != NULL) { /* The domain is already bound. Replace the old binding. */ char *new_dirname = strcmp (dirname, _nl_default_dirname) == 0 ? (char *) _nl_default_dirname : xstrdup (dirname); if (strcmp (binding->dirname, _nl_default_dirname) != 0) free (binding->dirname); binding->dirname = new_dirname; } else { /* We have to create a new binding. */ struct binding *new_binding = (struct binding *) xmalloc (sizeof (*new_binding)); new_binding->domainname = xstrdup (domainname); new_binding->dirname = strcmp (dirname, _nl_default_dirname) == 0 ? (char *) _nl_default_dirname : xstrdup (dirname); /* Now enqueue it. */ if (_nl_domain_bindings == NULL || strcmp (domainname, _nl_domain_bindings->domainname) < 0) { new_binding->next = _nl_domain_bindings; _nl_domain_bindings = new_binding; } else { binding = _nl_domain_bindings; while (binding->next != NULL && strcmp (domainname, binding->next->domainname) > 0) binding = binding->next; new_binding->next = binding->next; binding->next = new_binding; } binding = new_binding; } return binding->dirname; } tar-1.11.8/intl/dcgettext.c 444 625 1 10202 5764060311 10515 /* dcgettext.c -- implemenatation of the dcgettext(3) function Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #include #include #ifdef HAVE_UNISTD_H # include #endif #include "gettext.h" #include "gettextP.h" #include "libgettext.h" #include "hash-string.h" /* @@ end of prolog @@ */ /* Name of the default domain used for gettext(3) prior any call to textdomain(3). The default value for this is "messages". */ const char _nl_default_default_domain[] = "messages"; /* Value used as the default domain for gettext(3). */ const char *_nl_current_default_domain = _nl_default_default_domain; /* Look up MSGID in the DOMAINNAME message catalog for the current CATEGORY locale. */ char * dcgettext (domainname, msgid, category) const char *domainname; const char *msgid; int category; { struct loaded_domain *domain; size_t top, act, bottom; int cmp_val; /* If no real MSGID is given return NULL. */ if (msgid == NULL) return NULL; /* If DOMAINNAME is NULL, we are interested in the default domain. If CATEGORY is not LC_MESSAGES this might not make much sense but the defintion left this undefined. */ if (domainname == NULL) domainname = _nl_current_default_domain; /* Find structure describing the message catalog matching the DOMAINNAME and CATEGORY. */ domain = _nl_find_domain (domainname, category); if (domain == NULL || domain->data == NULL) /* No message catalog found. */ return (char *) msgid; /* Locate the MSGID and its translation. */ if (domain->hash_size > 0 && domain->hash_tab != NULL) { /* Use the hashing table. */ nls_uint32 len = strlen (msgid); nls_uint32 hash_val = hash_string (msgid); nls_uint32 idx = hash_val % domain->hash_size; nls_uint32 incr = 1 + (hash_val % (domain->hash_size - 2)); nls_uint32 nstr = W (domain->must_swap, domain->hash_tab[idx]); if (nstr == 0) /* Hash table entry is empty. */ return (char *) msgid; if (W (domain->must_swap, domain->orig_tab[nstr - 1].length) == len && strcmp (msgid, domain->data + W (domain->must_swap, domain->orig_tab[nstr - 1].offset)) == 0) return (char *) domain->data + W (domain->must_swap, domain->trans_tab[nstr - 1].offset); while (1) { if (idx >= W (domain->must_swap, domain->hash_size) - incr) idx -= W (domain->must_swap, domain->hash_size) - incr; else idx += incr; nstr = W (domain->must_swap, domain->hash_tab[idx]); if (nstr == 0) /* Hash table entry is empty. */ return (char *) msgid; if (W (domain->must_swap, domain->orig_tab[nstr - 1].length) == len && strcmp (msgid, domain->data + W (domain->must_swap, domain->orig_tab[nstr - 1].offset)) == 0) return (char *) domain->data + W (domain->must_swap, domain->trans_tab[nstr - 1].offset); } /* NOTREACHED */ } /* Now we try the default method: binary search in the sorted array of messages. */ bottom = 0; top = domain->nstrings; while (bottom < top) { act = (bottom + top) / 2; cmp_val = strcmp (msgid, domain->data + W (domain->must_swap, domain->orig_tab[act].offset)); if (cmp_val < 0) top = act; else if (cmp_val > 0) bottom = act + 1; else break; } return bottom >= top ? (char *) msgid : (char *) domain->data + W (domain->must_swap, domain->trans_tab[act].offset); } tar-1.11.8/intl/dgettext.c 644 625 1 2217 5770636240 10352 /* dgettext.c -- implementation of the dgettext(3) function Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #ifdef HAVE_LOCALE_H # include #endif #include "libgettext.h" /* @@ end of prolog @@ */ #undef dgettext /* Look up MSGID in the DOMAINNAME message catalog of the current LC_MESSAGES locale. */ char * dgettext (domainname, msgid) const char *domainname; const char *msgid; { return dcgettext (domainname, msgid, LC_MESSAGES); } tar-1.11.8/intl/gettext.c 444 625 1 2207 5764040400 10171 /* gettext.c -- implementation of gettext(3) function Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #include /* Just for NULL. */ #include "libgettext.h" /* @@ end of prolog @@ */ #undef gettext /* Look up MSGID in the current default message catalog for the current LC_MESSAGES locale. If not found, returns MSGID itself (the default text). */ char * gettext (msgid) const char *msgid; { return (dgettext) (NULL, msgid); } tar-1.11.8/intl/finddomain.c 444 625 1 14226 5764040373 10652 /* finddomain.c -- handle list of needed message catalogs Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #include #include #include #include #include "gettext.h" #include "gettextP.h" #include "libgettext.h" /* @@ end of prolog @@ */ /* Contains the default location of the message catalogs. */ const char _nl_default_dirname[] = DEF_MSG_DOM_DIR; /* List with bindings of specific domains created by bindtextdomain() calls. */ struct binding *_nl_domain_bindings; /* List of already loaded domains. */ extern struct loaded_domain *_nl_loaded_domains; /* Prototypes for library functions. */ char *xgetcwd (); void *xmalloc (); /* Prototypes for local functions. */ static const char *category_to_name __P((int category)); #if !defined HAVE_SETLOCALE || !defined HAVE_LC_MESSAGES static const char *guess_category_value __P((int category, const char *categoryname)); #endif /* Return a data structure describing the message catalog described by the DOMAINNAME and CATEGORY parameters with respect to the currently established bindings. */ struct loaded_domain * _nl_find_domain (domainname, category) const char *domainname; int category; { const char *categoryname; const char *categoryvalue; struct binding *binding; char *dirname; char *filename; size_t filename_len; struct loaded_domain *retval; /* Now determine the symbolic name of CATEGORY and its value. */ categoryname = category_to_name (category); #ifdef HAVE_SETLOCALE # ifndef HAVE_LC_MESSAGES if (category == LC_MESSAGES) categoryvalue = guess_category_value (category, categoryname); else # endif categoryvalue = setlocale (category, NULL); #else categoryvalue = guess_category_value (category, categoryname); #endif /* If the current locale value is C (or POSIX) we don't load a domain. The causes the calling function to return the MSGID. */ if (strcmp (categoryvalue, "C") == 0 || strcmp (categoryvalue, "POSIX") == 0) return NULL; /* First find matching binding. */ for (binding = _nl_domain_bindings; binding != NULL; binding = binding->next) { int compare = strcmp (domainname, binding->domainname); if (compare == 0) /* We found it! */ break; if (compare < 0) { /* It is not in the list. */ binding = NULL; break; } } if (binding == NULL) dirname = (char *) _nl_default_dirname; else if (binding->dirname[0] == '/') dirname = binding->dirname; else { /* We have a relative path. Make it absolute now. */ char *cwd = xgetcwd (); dirname = alloca (strlen (cwd) + strlen (binding->dirname) + 1); stpcpy (stpcpy (dirname, cwd), binding->dirname); free (cwd); } /* Now we have all components which describe the message catalog to be used. Create an absolute file name. */ filename_len = strlen (dirname) + 1 + strlen (categoryvalue) + 1 + strlen (categoryname) + 1 + strlen (domainname) + 4; filename = (char *) xmalloc (filename_len); sprintf (filename, "%s/%s/%s/%s.mo", dirname, categoryvalue, categoryname, domainname); /* Look in list of already loaded file whether it is already available. */ for (retval = _nl_loaded_domains; retval != NULL; retval = retval->next) { int compare = strcmp (retval->filename, filename); if (compare == 0) /* We found it! */ break; if (compare < 0) { /* It's not in the list. */ retval = NULL; break; } } /* If it is not in list try to load it. Free the allocated FILENAME if it is not used. */ if (retval != NULL || (retval = _nl_load_msg_cat (filename)) == NULL) free (filename); return retval; } /* Return string representation of locale CATEGORY. */ static const char *category_to_name (category) int category; { const char *retval; switch (category) { #ifdef LC_COLLATE case LC_COLLATE: retval = "LC_COLLATE"; break; #endif #ifdef LC_CTYPE case LC_CTYPE: retval = "LC_CTYPE"; break; #endif #ifdef LC_MONETARY case LC_MONETARY: retval = "LC_MONETARY"; break; #endif #ifdef LC_NUMERIC case LC_NUMERIC: retval = "LC_NUMERIC"; break; #endif #ifdef LC_TIME case LC_TIME: retval = "LC_TIME"; break; #endif #ifdef LC_MESSAGES case LC_MESSAGES: retval = "LC_MESSAGES"; break; #endif #ifdef LC_RESPONSE case LC_RESPONSE: retval = "LC_RESPONSE"; break; #endif #ifdef LC_ALL case LC_ALL: /* This might not make sense but is perhaps better than any other value. */ retval = "LC_ALL"; break; #endif default: /* If you have a better idea for a default value let me know. */ retval = "LC_XXX"; } return retval; } #if !defined HAVE_SETLOCALE || !defined HAVE_LC_MESSAGES /* Guess value of current locale from value of the environment variables. */ static const char *guess_category_value (category, categoryname) int category; const char *categoryname; { const char *retval; /* Setting of LC_ALL overwrites all other. */ retval = getenv ("LC_ALL"); if (retval != NULL && retval[0] != '\0') return retval; /* Next comes the name of the desired category. */ retval = getenv (categoryname); if (retval != NULL && retval[0] != '\0') return retval; /* Last possibility is the LANG environment variable. */ retval = getenv ("LANG"); if (retval != NULL && retval[0] != '\0') return retval; /* We use C as the default domain. POSIX says this is implementation defined. */ return "C"; } #endif tar-1.11.8/intl/loadmsgcat.c 444 625 1 12076 5764040226 10656 /* loadmsgcat.c -- load needed message catalogs Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #include #include #include #ifdef HAVE_UNISTD_H # include #endif #ifdef HAVE_MMAP # include #endif #include "gettext.h" #include "gettextP.h" /* @@ end of prolog @@ */ /* List of already loaded domains. */ struct loaded_domain *_nl_loaded_domains; /* We need a sign, whether a new catalog was loaded, which can be associated with all translations. This is important if the translations are cached by one of GCC's features. */ int _nl_msg_cat_cntr; /* Prototypes for library functions. */ void *xmalloc (); /* Load the message catalogs specified by FILENAME. If it is no valid message catalog return null. */ struct loaded_domain * _nl_load_msg_cat (filename) const char *filename; { int fd; struct stat st; struct loaded_domain *retval; struct mo_file_header *data = (struct mo_file_header *) -1; int use_mmap = 0; /* We will create an entry for each file. Those representing a non-existing or illegal file have the DATA member set to null. This helps subsequent calls to detect this situation without trying to load. */ retval = (struct loaded_domain *) xmalloc (sizeof (*retval)); /* Note: FILENAME is allocated in finddomain and can be used here. */ retval->filename = filename; retval->data = NULL; /* Show that one domain is changed. This might make some cached translation invalid. */ ++_nl_msg_cat_cntr; /* Enqueue the new entry. */ if (_nl_loaded_domains == NULL || strcmp (filename, _nl_loaded_domains->filename) < 0) { retval->next = _nl_loaded_domains; _nl_loaded_domains = retval; } else { struct loaded_domain *rp = _nl_loaded_domains; while (rp->next != NULL && strcmp (filename, rp->next->filename) > 0) rp = rp->next; retval->next = rp->next; rp->next = retval; } /* Try to open the addressed file. */ fd = open (filename, O_RDONLY); if (fd == -1) return retval; /* We must know about the size of the file. */ if (fstat (fd, &st) != 0 && st.st_size < (off_t) sizeof (struct mo_file_header)) { /* Something went wrong. */ close (fd); return retval; } #ifdef HAVE_MMAP /* Now we are ready to load the file. If mmap() is available we try this first. If not available or it failed we try to load it. */ data = (struct mo_file_header *) mmap (NULL, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0); if (data != (struct mo_file_header *) -1) { /* mmap() call was successful. */ close (fd); use_mmap = 1; } #endif /* If the data is not yet available (i.e. mmap'ed) we try to load it manually. */ if (data == (struct mo_file_header *) -1) { off_t to_read; char *read_ptr; data = (struct mo_file_header *) xmalloc (st.st_size); to_read = st.st_size; read_ptr = (char *) data; do { long int nb = (long int) read (fd, read_ptr, to_read); if (nb == -1) { close (fd); return retval; } read_ptr += nb; to_read -= nb; } while (to_read > 0); close (fd); } /* Using the magic number we can test whether it really is a message catalog file. */ if (data->magic != _MAGIC && data->magic != _MAGIC_SWAPPED) { /* The magic number is wrong: not a message catalog file. */ if (use_mmap) munmap ((caddr_t) data, st.st_size); else free (data); return retval; } retval->data = (char *) data; retval->must_swap = data->magic != _MAGIC; /* Fill in the information about the available tables. */ switch (W (retval->must_swap, data->revision)) { case 0: retval->nstrings = W (retval->must_swap, data->nstrings); retval->orig_tab = (struct string_desc *) ((char *) data + W (retval->must_swap, data->orig_tab_offset)); retval->trans_tab = (struct string_desc *) ((char *) data + W (retval->must_swap, data->trans_tab_offset)); retval->hash_size = W (retval->must_swap, data->hash_tab_size); retval->hash_tab = (nls_uint32 *) ((char *) data + W (retval->must_swap, data->hash_tab_offset)); break; default: /* This is an illegal revision. */ if (use_mmap) munmap ((caddr_t) data, st.st_size); else free (data); retval->data = NULL; } return retval; } tar-1.11.8/intl/textdomain.c 444 625 1 3767 5764040344 10704 /* textdomain.c -- implementation of the textdomain(3) function Copyright (C) 1995 Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #include #include #include "libgettext.h" /* @@ end of prolog @@ */ /* Prototypes for functions of libnlsut. */ extern char *xstrdup __P((const char *__str)); /* Name of the default text domain. */ extern const char _nl_default_default_domain[]; /* Default text domain in which entries for gettext(3) are to be found. */ extern const char *_nl_current_default_domain; /* Set the current default message catalog to DOMAINNAME. If DOMAINNAME is null, return the current default. If DOMAINNAME is "", reset to the default of "messages". */ char * textdomain (domainname) const char *domainname; { char *old; /* A NULL pointer requests the current setting. */ if (domainname == NULL) return (char *) _nl_current_default_domain; old = (char *) _nl_current_default_domain; /* If domain name is the null string set to default domain "messages". */ if (domainname[0] == '\0' || strcmp (domainname, _nl_default_default_domain) == 0) _nl_current_default_domain = _nl_default_default_domain; else _nl_current_default_domain = xstrdup (domainname); if (old != _nl_default_default_domain) free (old); return (char *) _nl_current_default_domain; } tar-1.11.8/intl/cat-compat.c 444 625 1 12671 5770533426 10577 /* Compatibility code for gettext-using-catgets interface. Copyright (C) 1995 Free Software Foundation, Inc. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with the GNU C Library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif #include #ifdef HAVE_NL_TYPES_H # include #endif #include "libgettext.h" /* @@ end of prolog @@ */ extern char *xstrdup __P ((const char *)); /* The catalog descriptor. */ static nl_catd catalog = (nl_catd) -1; /* Name of the default catalog. */ static char default_catalog_name[] = "messages"; /* Name of currently used catalog. */ static char *catalog_name = default_catalog_name; /* Get ID for given string. If not found return -1. */ static int msg_to_cat_id (const char *msg); /* Set currently used domain/catalog. */ char * textdomain (domainname) const char *domainname; { nl_catd new_catalog; char *new_name; size_t new_name_len; char *lang; #if defined HAVE_SETLOCALE && defined HAVE_LC_MESSAGES lang = setlocale (LC_MESSAGES, NULL); #else lang = getenv ("LC_MESSAGES"); if (lang == NULL || lang[0] == '\0') lang = getenv ("LANG"); #endif if (lang == NULL || lang[0] == '\0') lang = "C"; /* See whether name of currently used domain is asked. */ if (domainname == NULL) return catalog_name; if (domainname[0] == '\0') domainname = default_catalog_name; /* Compute length of added path element. */ new_name_len = sizeof (DEF_MSG_DOM_DIR) - 1 + 1 + strlen (lang) + sizeof ("/LC_MESSAGES/") - 1 + sizeof (PACKAGE) - 1 + sizeof (".cat"); new_name = (char *) xmalloc (new_name_len); sprintf (new_name, "%s/%s/LC_MESSAGES/%s.cat", DEF_MSG_DOM_DIR, lang, PACKAGE); new_catalog = catopen (new_name, 0); if (new_catalog == (nl_catd) -1) { /* The system seems not to understand an absolute file name as argument to catopen. Try now with the established NLSPATH. */ stpcpy (new_name, PACKAGE); new_catalog = catopen (new_name, 0); if (new_catalog == (nl_catd) -1) { free (new_name); return catalog_name; } } /* Close old catalog. */ if (catalog != (nl_catd) -1) catclose (catalog); if (catalog_name != default_catalog_name) free (catalog_name); catalog = new_catalog; catalog_name = new_name; return catalog_name; } char * bindtextdomain (domainname, dirname) const char *domainname; const char *dirname; { #if defined HAVE_SETENV || defined HAVE_PUTENV char *old_val = getenv ("NLSPATH"); char *new_val; size_t new_val_len; /* This does not make much sense here but to be compatible do it. */ if (domainname == NULL) return NULL; /* Compute length of added path element. If we use setenv we don't need the first byts for NLSPATH=, but why complicate the code for this peanuts. */ new_val_len = sizeof ("NLSPATH=") - 1 + sizeof (DEF_MSG_DOM_DIR) - 1 + sizeof ("/%L/LC_MESSAGES/") - 1 + sizeof (PACKAGE) - 1 + sizeof (".cat"); if (old_val != NULL && old_val[0] != '\0') new_val_len += strlen (old_val); new_val = (char *) xmalloc (new_val_len); # ifdef HAVE_SETENV # if __STDC__ stpcpy (stpcpy (stpcpy (new_val, DEF_MSG_DOM_DIR "/%L/LC_MESSAGES/" PACKAGE ".cat"), # else stpcpy (stpcpy (stpcpy (stpcpy (stpcpy (stpcpy DEF_MSG_DOM_DIR), "/%L/LC_MESSAGES/"), PACKAGE), ".cat"), # endif old_val != NULL && old_val[0] != '\0' ? ":" : ""), old_val != NULL && old_val[0] != '\0' ? old_val : ""); setenv ("NLSPATH", new_val, 1); # else # if __STDC__ stpcpy (stpcpy (stpcpy (new_val, "NLSPATH=" DEF_MSG_DOM_DIR "/%L/LC_MESSAGES/" PACKAGE ".cat"), # else stpcpy (stpcpy (stpcpy (stpcpy (stpcpy (stpcpy (stpcpy (new_val, "NLSPATH="), DEF_MSG_DOM_DIR), "/%L/LC_MESSAGES/"), PACKAGE), ".cat"), # endif old_val != NULL && old_val[0] != '\0' ? ":" : ""), old_val != NULL && old_val[0] != '\0' ? old_val : ""); putenv (new_val); # endif #endif return (char *) domainname; } #undef gettext char * gettext (msg) const char *msg; { int msgid; if (msg == NULL || catalog == (nl_catd) -1) return (char *) msg; /* Get the message from the catalog. We always use set number 1. The message ID is computed by the function `msg_to_cat_id' which works on the table generated by `po-to-tbl'. */ msgid = msg_to_cat_id (msg); if (msgid == -1) return (char *) msg; return catgets (catalog, 1, msgid, (char *) msg); } /* Look through the table `_msg_tbl' which has `_msg_tbl_length' entries for the one equal to msg. If it is found return the ID. In case when the string is not found return -1. */ static int msg_to_cat_id (const char *msg) { int cnt; for (cnt = 0; cnt < _msg_tbl_length; ++cnt) if (strcmp (msg, _msg_tbl[cnt]._msg) == 0) return _msg_tbl[cnt]._msg_number; return -1; } tar-1.11.8/intl/stamp-cat-id 644 625 1 12 5770654513 10516 timestamp tar-1.11.8/intl/cat-id-tbl.c 644 625 1 32015 5770626614 10465 /* Automatically generated by po-to-tbl from tar.po. */ #if HAVE_CONFIG_H # include #endif #include "libgettext.h" const struct _msg_ent _msg_tbl[] = { {"", 1}, {"exec/tcp: Service not available", 2}, {"Try `%s --help' for more information.\n", 3}, {"Skipping to next header", 4}, {"Size", 5}, {"Cannot seek to %ld in file %s", 6}, {"You must use a compression option (--gzip, --compress\n\ or --use-compress-program) with --block-compress", 7}, {"VERIFY FAILURE: %d invalid header(s) detected", 8}, {"Blocksize = %d records", 9}, {"%s: Deleting %s\n", 10}, {" -N, --newer=DATE only store files newer than DATE\n\ --after-date=DATE same as -N\n", 11}, {"Read checkpoint %d", 12}, {"\n\ On *this* particular tar, the defaults are -f %s and -b %d.\n", 13}, {"Cannot symlink %s to %s", 14}, {"Unknown demangling command %s", 15}, {"At beginning of tape, quitting now", 16}, {"Symlinked %s to %s", 17}, {"%s: Cannot link to %s, copying instead", 18}, {"\n\ Archive format selection:\n\ -V, --label=NAME create archive with volume name NAME\n\ -o, --old-archive, --portability write a V7 format archive (not ANSI)\n\ -z, --gzip, --ungzip filter the archive through gzip\n\ -Z, --compress, --uncompress filter the archive through compress\n\ --use-compress-program=PROG filter through PROG (must accept -d)\n", 19}, {"Options [0-7][lmh] not supported by *this* tar", 20}, {"Cannot fork", 21}, {"EOF? What does that mean?", 22}, {"Mandatory arguments to long options are mandatory for short options too.\n\ \n\ --help display this help and exit\n\ --version output version information and exit\n", 23}, {"Cannot open %s", 24}, {"Mandatory or optional arguments to long options are mandatory or optional\n\ for short options too.\n", 25}, {"This does not look like a tar archive", 26}, {"Read error at byte %ld, reading %d bytes, in file %s", 27}, {"Cannot use multi-volume compressed archives", 28}, {"File name %s%s too long", 29}, {"Volume mismatch! %s!=%s", 30}, {"Cannot use compressed or remote archives", 31}, {"%s: Data differs\n", 32}, {"\n\ Device selection and switching:\n\ -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME\n\ --force-local archive file is local even if has a colon\n\ --rsh-command=COMMAND use remote COMMAND instead of rsh\n\ -[0-7][lmh] specify drive and density\n\ -M, --multi-volume create/list/extract multi-volume archive\n\ -L, --tape-length=NUM change tape after writing NUM x 1024 bytes\n\ -F, --info-script=FILE run script at end of each tape (implies -M)\n\ --new-volume-script=FILE same as -F FILE\n", 33}, {"No archive name given, what should I do?", 34}, {" n [name] Give a new filename for the next (and subsequent) volume(s)\n\ q Abort tar\n\ ! Spawn a subshell\n\ ? Print this list\n", 35}, {"\n\ Device blocking:\n\ -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes\n\ --block-compress block the output of compression for tapes\n\ -i, --ignore-zeros ignore blocks of zeros in archive (means EOF)\n\ -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes)\n", 36}, {"Could not change access and modification times of %s", 37}, {"Could not create directory %s", 38}, {"--Continued at byte %ld--\n", 39}, {"Cannot fork!", 40}, {"Garbage command", 41}, {"Only one compression option permitted", 42}, {"Total bytes written: %d\n", 43}, {"Cannot read %s", 44}, {"Cannot open a pipe", 45}, {"\n\ Main operation mode:\n\ -t, --list list the contents of an archive\n\ -x, --extract, --get extract files from an archive\n\ -c, --create create a new archive\n\ -d, --diff, --compare find differences between archive and file system\n\ -r, --append append files to the end of an archive\n\ -u, --update only append files newer than copy in archive\n\ -A, --catenate append tar files to an archive\n\ --concatenate same as -A\n\ --delete delete from the archive (not on mag tapes!)\n", 46}, {"%s: Unknown file type; file ignored", 47}, {"Cannot read link %s", 48}, {"Archive %s EOF not on block boundary", 49}, {"Visible long name error", 50}, {"Cannot extract `%s' -- file is continued from another volume", 51}, {"Bad regular expression: %s", 52}, {"Cannot execute remote shell", 53}, {"%s: Does not exist\n", 54}, {"Invalid date format `%s'", 55}, {"Too many errors, quitting", 56}, {"Cannot exec %s", 57}, {"Invalid value for blocksize", 58}, {"Creating directory:", 59}, {"Read error on %s", 60}, {"Cannot open archive %s", 61}, {"Cannot add file %s", 62}, {"Cannot change owner of %s to uid %d gid %d", 63}, {"Cannot keep old files on this system", 64}, {"Child returned status %d", 65}, {"Added write and execute permission to directory %s", 66}, {"Missing filename after -C", 67}, {"\n\ Local file selection:\n\ -C, --directory DIR change to directory DIR\n\ -T, --files-from=NAME get names to extract or create from file NAME\n\ --null -T reads null-terminated names, disable -C\n\ --exclude=FILE exclude file FILE\n\ -X, --exclude-from=FILE exclude files listed in FILE\n\ -P, --absolute-paths don't strip leading `/'s from file names\n\ -h, --dereference dump instead the files symlinks point to\n\ -l, --one-file-system stay in local file system when creating archive\n\ -K, --starting-file=NAME begin at file NAME in the archive\n", 68}, {"Wrote %ld of %ld bytes to file %s", 69}, {"Could not make %s", 70}, {"%s: is unchanged; not dumped", 71}, {"\n\ Informative output:\n\ --help print this help, then exit\n\ --version print tar program version number, then exit\n\ -v, --verbose verbosely list files processed\n\ --checkpoint print directory names while reading the archive\n\ --totals print total bytes written while creating archive\n\ -R, --record-number show record number within archive with each message\n\ -w, --interactive ask for confirmation for every action\n\ --confirmation same as -w\n", 72}, {"Write checkpoint %d", 73}, {"Could not backspace archive file; it may be unreadable without -i", 74}, {"Removing drive spec from names in the archive", 75}, {"Verify ", 76}, {"File %s shrunk by %d bytes, padding with zeros", 77}, {"Cannot change directory to %d", 78}, {"Cannot remove %s", 79}, {"Cannot chown file %s to uid %d gid %d", 80}, {"Could not link %s to %s", 81}, {"(child) Pipe to stdin", 82}, {"%s: Mode or device-type changed\n", 83}, {"\n\ Operation mode modificators:\n\ -W, --verify attempt to verify the archive after writing it\n\ --remove-files remove files after adding them to the archive\n\ -k, --keep-old-files don't overwrite existing files from archive\n\ -S, --sparse handle sparse files efficiently\n\ -O, --to-stdout extract files to standard output\n\ -G, --incremental handle old GNU-format incremental backup\n\ -g, --listed-incremental handle new GNU-format incremental backup\n\ --ignore-failed-read do not exit with non-zero on unreadable files\n", 84}, {"Cannot exec a shell %s", 85}, {"rmtd: Premature eof\n", 86}, {"%d at %d\n", 87}, {"Amount actually written is (I hope) %d.\n", 88}, {"Cannot write to compression program", 89}, {"Cannot change to directory %s", 90}, {"Directory %s has been renamed", 91}, {"Could only write %d of %d bytes to file %s", 92}, {" unknown file type `%c'\n", 93}, {"Cannot close a file #%d", 94}, {"Directory %s is new", 95}, {"tar (child)", 96}, {"Could not rewind archive file for verify", 97}, {"\n\ Usage: %s [OPTION]...\n", 98}, {"Child died with signal %d%s", 99}, {"%s: Device numbers changed\n", 100}, {"Reading %s\n", 101}, {"Mod time", 102}, {"Could not create symlink to %s", 103}, {"Child cannot fork", 104}, {"Unknown file type '%c' for %s, extracted as normal file", 105}, {"Cannot verify multi-volume archives", 106}, {"Multiple archive files requires --multi-volume", 107}, {"Could not allocate memory for diff buffer of %d bytes", 108}, {"WARNING: Archive is incomplete", 109}, {"Cannot rename %s to %s", 110}, {" (core dumped)", 111}, {"%s: On a different filesystem; not dumped", 112}, {"rmtd: Garbage command %c\n", 113}, {"Unexpected EOF in archive", 114}, {"--Mangled file names--\n", 115}, {"%s is not continued on this volume", 116}, {"This volume is out of sequence", 117}, {"%s: Symlink differs\n", 118}, {"[child] Pipe to stdout", 119}, {"rmtd: Cannot allocate buffer space\n", 120}, {"Hmm, this doesn't look like a tar archive", 121}, {"Cannot write to %s", 122}, {"Could not get current directory: %s", 123}, {"Cannot read from compression program", 124}, {"You may not specify more than one of the r, c, t, x, or d options", 125}, {"Skipping to next file header", 126}, {"\007Prepare volume #%d for %s and hit return: ", 127}, {"Only wrote %ld of %ld bytes to file %s", 128}, {"Only read %d bytes from archive %s", 129}, {"Missing file name after -C", 130}, {"Cannot change mode of file %s to %lo", 131}, {"Cannot stat %s", 132}, {"(child) Pipe to stdout", 133}, {"%s is the wrong size (%ld != %ld + %ld)", 134}, {"No new volume; exiting.\n", 135}, {"%s is the archive; not dumped", 136}, {"Cannot verify stdin/stdout archive", 137}, {"Removing leading / from absolute links", 138}, {"Error while deleting %s", 139}, {"Unknown file type '%c' for %s, diffed as normal file", 140}, {"--Volume Header--\n", 141}, {"Cannot open directory %s", 142}, {"Could not write to file %s", 143}, {"%s: No longer a directory\n", 144}, {"rec %10ld: ", 145}, {"Archive not labelled to match %s", 146}, {"Archive to stdin", 147}, {"Premature end of file", 148}, {"%s: Not a regular file\n", 149}, {"EOF in archive file", 150}, {"%s: %s differs\n", 151}, {"%s: Not found in archive", 152}, {"Cannot allocate buffer space", 153}, {"Cannot open file %s", 154}, {"((child)) Pipe to stdin", 155}, {"Uid", 156}, {"You must specify one of the r, c, t, x, or d options", 157}, {"Gid", 158}, {"Unexpected EOF in mangled names", 159}, {"Usage: %s [OPTION]... [FILE]...\n", 160}, {"Could not allocate memory for blocking factor %d", 161}, {"Cannot read confirmation from user", 162}, {"%s: Could only read %d of %ld bytes\n", 163}, {"Omitting %s", 164}, {"((child)) Pipe to stdout", 165}, {"%s: Not linked to %s\n", 166}, {"Cannot close descriptor %d", 167}, {"Mode", 168}, {"Renamed %s to %s", 169}, {"Cannot dup %s", 170}, {"WARNING: Cannot close %s (%d, %d)", 171}, {"Cannot chdir to %s", 172}, {"%s: No such file or directory\n", 173}, {"Write to compression program short %d bytes", 174}, {"Could not get current directory", 175}, {"Error while closing %s", 176}, {" link to %s\n", 177}, {"Unexpected EOF on archive file", 178}, {"[child] Pipe to stdin", 179}, {"Cannot stat file %s", 180}, {"Cannot allocate %d bytes for restore", 181}, {"Archive to stdout", 182}, {"\n\ Handling of file attributes:\n\ --atime-preserve don't change access times on dumped files\n\ -m, --modification-time don't extract file modified time\n\ --same-owner create extracted files with the same ownership \n\ -p, --same-permissions extract all protection information\n\ --preserve-permissions same as -p\n\ -s, --same-order sort names to extract to match archive\n\ --preserve-order same as -s\n\ --preserve same as both -p and -s\n", 183}, {"Could not create file %s", 184}, {"Cannot update or verify compressed archives", 185}, {"Only wrote %u of %u bytes to %s", 186}, {"WARNING: No volume header", 187}, {"Too many args with -T option", 188}, {"Visible longname error", 189}, {"Removing leading / from absolute path names in the archive", 190}, {"Obsolete option name replaced by --absolute-names", 191}, {"File %s\n", 192}, {"Read error at byte %ld reading %d bytes in file %s", 193}, {"%s: File shrunk by %d bytes, (yark!)", 194}, {"Junk files\n", 195}, {"file %s\n", 196}, {"Skip %ld\n", 197}, {"Out of first loop\n", 198}, {"Saved %d recs, need %d more\n", 199}, {"New block\n", 200}, {"Header type %d\n", 201}, {"Deleting non-header from archive", 202}, {"File %s ", 203}, {"Flush it\n", 204}, {"Flushing %d recs from %s\n", 205}, {"Block: %d <= %d ", 206}, {"Block %d left\n", 207}, {"Final %d\n", 208}, {"Need %d kept_in %d keep %d\n", 209}, {"Flush...\n", 210}, {"Copying %d\n", 211}, {"Now new %d need %d keep %d keep_in %d rec %d/%d\n", 212}, {"Write block\n", 213}, {"Fore to %x\n", 214}, {"Could not re-position archive file", 215}, }; int _msg_tbl_length = 215; tar-1.11.8/src/Makefile.in 644 625 1 11007 5770653331 10261 # Makefile for GNU tar sources. # Copyright (C) 1994 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. PACKAGE = @PACKAGE@ VERSION = @VERSION@ PROGRAMS = @PROGRAMS@ SHELL = /bin/sh VPATH = @srcdir@ exec_prefix = @exec_prefix@ prefix = @prefix@ srcdir = @srcdir@ subdir = src top_srcdir = @top_srcdir@ transform = @program_transform_name@ CC = @CC@ CFLAGS = @CFLAGS@ CPPFLAGS = @CPPFLAGS@ DEFS = @DEFS@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INTLDEPS = @INTLDEPS@ LDFLAGS = @LDFLAGS@ LIBS = @LIBS@ TOUCH = echo timestamp > bindir = $(exec_prefix)/bin datadir = $(prefix)/share libexecdir = $(exec_prefix)/libexec localedir = $(datadir)/locale COMPILE = $(CC) -c $(DEFS) $(INCLUDES) $(CPPFLAGS) $(CFLAGS) LINK = $(CC) $(LDFLAGS) -o $@ .SUFFIXES: .SUFFIXES: .c .o .c.o: $(COMPILE) $< ANSI2KNR = @ANSI2KNR@ o = .@U@o .SUFFIXES: ._c ._o .c._c: ./ansi2knr $< > $*.tmp && mv $*.tmp $@ ._c._o: @echo $(COMPILE) $< @rm -f _$*.c @ln $< _$*.c && $(COMPILE) _$*.c && mv _$*.o $@ && rm _$*.c .c._o: ./ansi2knr $< > $*.tmp && mv $*.tmp $*._c @echo $(COMPILE) $*._c @rm -f _$*.c @ln $*._c _$*.c && $(COMPILE) _$*.c && mv _$*.o $@ && rm _$*.c INCLUDES = -I.. -I../intl -I$(srcdir) -I$(top_srcdir)/lib gen_SOURCES = genfile.c gen_OBJECTS = genfile$o rmt_SOURCES = rmt.c rmt_OBJECTS = rmt$o tar_SOURCES = buffer.c create.c diffarch.c extract.c gnu.c list.c \ mangle.c names.c port.c rtapelib.c tar.c update.c tar_OBJECTS = buffer$o create$o diffarch$o extract$o gnu$o list$o \ mangle$o names$o port$o rtapelib$o tar$o update$o HEADERS = open3.h rmt.h system.h tar.h SOURCES = $(gen_SOURCES) $(rmt_SOURCES) $(tar_SOURCES) OBJECTS = $(gen_OBJECTS) $(rmt_OBJECTS) $(tar_OBJECTS) DISTFILES = Makefile.in ansi2knr.c ansi2knr.1 checktar.sh \ $(HEADERS) $(SOURCES) all: genfile $(PROGRAMS) rmt: $(rmt_OBJECTS) $(INTLDEPS) ../lib/libtar.a $(LINK) $(rmt_OBJECTS) $(INTLDEPS) ../lib/libtar.a $(LIBS) tar: $(tar_OBJECTS) $(INTLDEPS) ../lib/libtar.a $(LINK) $(tar_OBJECTS) $(INTLDEPS) ../lib/libtar.a $(LIBS) check: tar genfile PATH=`pwd`:$$PATH $(SHELL) $(srcdir)/checktar.sh genfile: $(gen_OBJECTS) $(INTLDEPS) ../lib/libtar.a $(LINK) $(gen_OBJECTS) $(INTLDEPS) ../lib/libtar.a $(LIBS) $(OBJECTS): $(ANSI2KNR) ../config.h system.h ../intl/libgettext.h tar.h buffer$o diffarch$o rtapelib$o update$o: rmt.h buffer$o tar$o: ../lib/regex.h ../lib/rx.h tar$o: ../lib/fnmatch.h ansi2knr: ansi2knr.o $(LINK) ansi2knr.o $(LIBS) install: $(PROGRAMS) for name in $(PROGRAMS); do \ if test $$name = rmt; then dir=$(libexecdir); \ else dir=$(bindir); fi; \ $(top_srcdir)/mkinstalldirs $$dir; \ $(INSTALL_PROGRAM) $$name \ $$dir/`echo $$name | sed '$(transform)'`; \ done uninstall: for name in $(PROGRAMS); do \ if test $$name = rmt; then dir=$(libexecdir); \ else dir=$(bindir); fi; \ rm -f $(dir)/`echo $$name | sed '$(transform)'`; \ done id: ID ID: $(HEADERS) $(SOURCES) here=`pwd`; cd $(srcdir) && mkid -f$$here/ID $$here/config.h \ $(HEADERS) $(SOURCES) tags: TAGS TAGS: $(HEADERS) $(SOURCES) here=`pwd`; cd $(srcdir) && etags -o $$here/TAGS $$here/config.h \ $(HEADERS) $(SOURCES) -i ../lib/TAGS mostlyclean: rm -f *.o _*.c _*.o *._c *._o core core.* clean: mostlyclean rm -f genfile tar rmt distclean: clean rm -f ansi2knr ID TAGS rm -f Makefile maintainer-clean: distclean @echo "This command is intended only for maintainers to use;" @echo "rebuilding the deleted files may require special tools." distdir = ../$(PACKAGE)-$(VERSION)/$(subdir) dist: $(DISTFILES) for file in $(DISTFILES); do \ ln $(srcdir)/$$file $(distdir) 2> /dev/null \ || cp -p $(srcdir)/$$file $(distdir); \ done Makefile: Makefile.in ../config.status cd .. && CONFIG_FILES=$(subdir)/$@ CONFIG_HEADERS= ./config.status # Tell versions [3.59,3.63) of GNU make not to export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: tar-1.11.8/src/ansi2knr.c 644 625 1 31720 5740655173 10116 /* Copyright (C) 1989, 1991, 1993, 1994, 1995 Aladdin Enterprises. All rights reserved. */ /* ansi2knr.c */ /* Convert ANSI C function definitions to K&R ("traditional C") syntax */ /* ansi2knr is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. No author or distributor accepts responsibility to anyone for the consequences of using it or for whether it serves any particular purpose or works at all, unless he says so in writing. Refer to the GNU General Public License (the "GPL") for full details. Everyone is granted permission to copy, modify and redistribute ansi2knr, but only under the conditions described in the GPL. A copy of this license is supposed to have been given to you along with ansi2knr so you can know your rights and responsibilities. It should be in a file named COPYLEFT. Among other things, the copyright notice and this notice must be preserved on all copies. We explicitly state here what we believe is already implied by the GPL: if the ansi2knr program is distributed as a separate set of sources and a separate executable file which are aggregated on a storage medium together with another program, this in itself does not bring the other program under the GPL, nor does the mere fact that such a program or the procedures for constructing it invoke the ansi2knr executable bring any other part of the program under the GPL. */ /* * Usage: ansi2knr input_file [output_file] * If no output_file is supplied, output goes to stdout. * There are no error messages. * * ansi2knr recognizes function definitions by seeing a non-keyword * identifier at the left margin, followed by a left parenthesis, * with a right parenthesis as the last character on the line. * It will recognize a multi-line header provided that the last character * of the last line of the header is a right parenthesis, * and no intervening line ends with a left or right brace or a semicolon. * These algorithms ignore whitespace and comments, except that * the function name must be the first thing on the line. * The following constructs will confuse it: * - Any other construct that starts at the left margin and * follows the above syntax (such as a macro or function call). * - Macros that tinker with the syntax of the function header. */ /* * The original and principal author of ansi2knr is L. Peter Deutsch * . Other authors are noted in the change history * that follows (in reverse chronological order): lpd 95-04-05 changed copyright notice to make it clear that including ansi2knr in a program does not bring the entire program under the GPL lpd 94-12-18 added conditionals for systems where ctype macros don't handle 8-bit characters properly, suggested by Francois Pinard ; removed --varargs switch (this is now the default) lpd 94-10-10 removed CONFIG_BROKETS conditional lpd 94-07-16 added some conditionals to help GNU `configure', suggested by Francois Pinard ; properly erase prototype args in function parameters, contributed by Jim Avera ; correct error in writeblanks (it shouldn't erase EOLs) lpd 89-xx-xx original version */ /* Most of the conditionals here are to make ansi2knr work with */ /* the GNU configure machinery. */ #ifdef HAVE_CONFIG_H # include #endif #include #include #ifdef HAVE_CONFIG_H /* For properly autoconfiguring ansi2knr, use AC_CONFIG_HEADER(config.h). This will define HAVE_CONFIG_H and so, activate the following lines. */ # if STDC_HEADERS || HAVE_STRING_H # include # else # include # endif #else /* not HAVE_CONFIG_H */ /* Without AC_CONFIG_HEADER, merely use as in the original Ghostscript distribution. This loses on older BSD systems. */ # include #endif /* not HAVE_CONFIG_H */ #ifdef STDC_HEADERS # include #else /* malloc and free should be declared in stdlib.h, but if you've got a K&R compiler, they probably aren't. */ char *malloc(); void free(); #endif /* * The ctype macros don't always handle 8-bit characters correctly. * Compensate for this here. */ #ifndef STDC_HEADERS # define STDC_HEADERS 0 #endif #ifdef isascii # undef HAVE_ISASCII /* just in case */ # define HAVE_ISASCII 1 #else # ifndef HAVE_ISASCII # define HAVE_ISASCII 0 # endif #endif #if STDC_HEADERS || !HAVE_ISASCII # define is_ascii(c) 1 #else # define is_ascii(c) isascii(c) #endif #define is_space(c) (is_ascii(c) && isspace(c)) #define is_alpha(c) (is_ascii(c) && isalpha(c)) #define is_alnum(c) (is_ascii(c) && isalnum(c)) /* Scanning macros */ #define isidchar(ch) (is_alnum(ch) || (ch) == '_') #define isidfirstchar(ch) (is_alpha(ch) || (ch) == '_') /* Forward references */ char *skipspace(); void writeblanks(); int test1(); int convert1(); /* The main program */ int main(argc, argv) int argc; char *argv[]; { FILE *in, *out; #define bufsize 5000 /* arbitrary size */ char *buf; char *line; /* * In previous versions, ansi2knr recognized a --varargs switch. * If this switch was supplied, ansi2knr would attempt to convert * a ... argument to va_alist and va_dcl; if this switch was not * supplied, ansi2knr would simply drop any such arguments. * Now, ansi2knr always does this conversion, and we only * check for this switch for backward compatibility. */ int convert_varargs = 1; if ( argc > 1 && argv[1][0] == '-' ) { if ( !strcmp(argv[1], "--varargs") ) { convert_varargs = 1; argc--; argv++; } else { fprintf(stderr, "Unrecognized switch: %s\n", argv[1]); exit(1); } } switch ( argc ) { default: printf("Usage: ansi2knr input_file [output_file]\n"); exit(0); case 2: out = stdout; break; case 3: out = fopen(argv[2], "w"); if ( out == NULL ) { fprintf(stderr, "Cannot open output file %s\n", argv[2]); exit(1); } } in = fopen(argv[1], "r"); if ( in == NULL ) { fprintf(stderr, "Cannot open input file %s\n", argv[1]); exit(1); } fprintf(out, "#line 1 \"%s\"\n", argv[1]); buf = malloc(bufsize); line = buf; while ( fgets(line, (unsigned)(buf + bufsize - line), in) != NULL ) { switch ( test1(buf) ) { case 2: /* a function header */ convert1(buf, out, 1, convert_varargs); break; case 1: /* a function */ convert1(buf, out, 0, convert_varargs); break; case -1: /* maybe the start of a function */ line = buf + strlen(buf); if ( line != buf + (bufsize - 1) ) /* overflow check */ continue; /* falls through */ default: /* not a function */ fputs(buf, out); break; } line = buf; } if ( line != buf ) fputs(buf, out); free(buf); fclose(out); fclose(in); return 0; } /* Skip over space and comments, in either direction. */ char * skipspace(p, dir) register char *p; register int dir; /* 1 for forward, -1 for backward */ { for ( ; ; ) { while ( is_space(*p) ) p += dir; if ( !(*p == '/' && p[dir] == '*') ) break; p += dir; p += dir; while ( !(*p == '*' && p[dir] == '/') ) { if ( *p == 0 ) return p; /* multi-line comment?? */ p += dir; } p += dir; p += dir; } return p; } /* * Write blanks over part of a string. * Don't overwrite end-of-line characters. */ void writeblanks(start, end) char *start; char *end; { char *p; for ( p = start; p < end; p++ ) if ( *p != '\r' && *p != '\n' ) *p = ' '; } /* * Test whether the string in buf is a function definition. * The string may contain and/or end with a newline. * Return as follows: * 0 - definitely not a function definition; * 1 - definitely a function definition; * 2 - definitely a function prototype (NOT USED); * -1 - may be the beginning of a function definition, * append another line and look again. * The reason we don't attempt to convert function prototypes is that * Ghostscript's declaration-generating macros look too much like * prototypes, and confuse the algorithms. */ int test1(buf) char *buf; { register char *p = buf; char *bend; char *endfn; int contin; if ( !isidfirstchar(*p) ) return 0; /* no name at left margin */ bend = skipspace(buf + strlen(buf) - 1, -1); switch ( *bend ) { case ';': contin = 0 /*2*/; break; case ')': contin = 1; break; case '{': return 0; /* not a function */ case '}': return 0; /* not a function */ default: contin = -1; } while ( isidchar(*p) ) p++; endfn = p; p = skipspace(p, 1); if ( *p++ != '(' ) return 0; /* not a function */ p = skipspace(p, 1); if ( *p == ')' ) return 0; /* no parameters */ /* Check that the apparent function name isn't a keyword. */ /* We only need to check for keywords that could be followed */ /* by a left parenthesis (which, unfortunately, is most of them). */ { static char *words[] = { "asm", "auto", "case", "char", "const", "double", "extern", "float", "for", "if", "int", "long", "register", "return", "short", "signed", "sizeof", "static", "switch", "typedef", "unsigned", "void", "volatile", "while", 0 }; char **key = words; char *kp; int len = endfn - buf; while ( (kp = *key) != 0 ) { if ( strlen(kp) == len && !strncmp(kp, buf, len) ) return 0; /* name is a keyword */ key++; } } return contin; } /* Convert a recognized function definition or header to K&R syntax. */ int convert1(buf, out, header, convert_varargs) char *buf; FILE *out; int header; /* Boolean */ int convert_varargs; /* Boolean */ { char *endfn; register char *p; char **breaks; unsigned num_breaks = 2; /* for testing */ char **btop; char **bp; char **ap; char *vararg = 0; /* Pre-ANSI implementations don't agree on whether strchr */ /* is called strchr or index, so we open-code it here. */ for ( endfn = buf; *(endfn++) != '('; ) ; top: p = endfn; breaks = (char **)malloc(sizeof(char *) * num_breaks * 2); if ( breaks == 0 ) { /* Couldn't allocate break table, give up */ fprintf(stderr, "Unable to allocate break table!\n"); fputs(buf, out); return -1; } btop = breaks + num_breaks * 2 - 2; bp = breaks; /* Parse the argument list */ do { int level = 0; char *lp = NULL; char *rp; char *end = NULL; if ( bp >= btop ) { /* Filled up break table. */ /* Allocate a bigger one and start over. */ free((char *)breaks); num_breaks <<= 1; goto top; } *bp++ = p; /* Find the end of the argument */ for ( ; end == NULL; p++ ) { switch(*p) { case ',': if ( !level ) end = p; break; case '(': if ( !level ) lp = p; level++; break; case ')': if ( --level < 0 ) end = p; else rp = p; break; case '/': p = skipspace(p, 1) - 1; break; default: ; } } /* Erase any embedded prototype parameters. */ if ( lp ) writeblanks(lp + 1, rp); p--; /* back up over terminator */ /* Find the name being declared. */ /* This is complicated because of procedure and */ /* array modifiers. */ for ( ; ; ) { p = skipspace(p - 1, -1); switch ( *p ) { case ']': /* skip array dimension(s) */ case ')': /* skip procedure args OR name */ { int level = 1; while ( level ) switch ( *--p ) { case ']': case ')': level++; break; case '[': case '(': level--; break; case '/': p = skipspace(p, -1) + 1; break; default: ; } } if ( *p == '(' && *skipspace(p + 1, 1) == '*' ) { /* We found the name being declared */ while ( !isidfirstchar(*p) ) p = skipspace(p, 1) + 1; goto found; } break; default: goto found; } } found: if ( *p == '.' && p[-1] == '.' && p[-2] == '.' ) { if ( convert_varargs ) { *bp++ = "va_alist"; vararg = p-2; } else { p++; if ( bp == breaks + 1 ) /* sole argument */ writeblanks(breaks[0], p); else writeblanks(bp[-1] - 1, p); bp--; } } else { while ( isidchar(*p) ) p--; *bp++ = p+1; } p = end; } while ( *p++ == ',' ); *bp = p; /* Make a special check for 'void' arglist */ if ( bp == breaks+2 ) { p = skipspace(breaks[0], 1); if ( !strncmp(p, "void", 4) ) { p = skipspace(p+4, 1); if ( p == breaks[2] - 1 ) { bp = breaks; /* yup, pretend arglist is empty */ writeblanks(breaks[0], p + 1); } } } /* Put out the function name and left parenthesis. */ p = buf; while ( p != endfn ) putc(*p, out), p++; /* Put out the declaration. */ if ( header ) { fputs(");", out); for ( p = breaks[0]; *p; p++ ) if ( *p == '\r' || *p == '\n' ) putc(*p, out); } else { for ( ap = breaks+1; ap < bp; ap += 2 ) { p = *ap; while ( isidchar(*p) ) putc(*p, out), p++; if ( ap < bp - 1 ) fputs(", ", out); } fputs(") ", out); /* Put out the argument declarations */ for ( ap = breaks+2; ap <= bp; ap += 2 ) (*ap)[-1] = ';'; if ( vararg != 0 ) { *vararg = 0; fputs(breaks[0], out); /* any prior args */ fputs("va_dcl", out); /* the final arg */ fputs(bp[0], out); } else fputs(breaks[0], out); } free((char *)breaks); return 0; } tar-1.11.8/src/ansi2knr.1 644 625 1 1616 5603076637 10015 .TH ANSI2KNR 1 "31 December 1990" .SH NAME ansi2knr \- convert ANSI C to Kernighan & Ritchie C .SH SYNOPSIS .I ansi2knr input_file output_file .SH DESCRIPTION If no output_file is supplied, output goes to stdout. .br There are no error messages. .sp .I ansi2knr recognizes functions by seeing a non-keyword identifier at the left margin, followed by a left parenthesis, with a right parenthesis as the last character on the line. It will recognize a multi-line header if the last character on each line but the last is a left parenthesis or comma. These algorithms ignore whitespace and comments, except that the function name must be the first thing on the line. .sp The following constructs will confuse it: .br - Any other construct that starts at the left margin and follows the above syntax (such as a macro or function call). .br - Macros that tinker with the syntax of the function header. tar-1.11.8/src/checktar.sh 644 625 1 2320 5770102343 10302 # Check if tar appears to works correctly. # Copyright (C) 1995 Free Software Foundation, Inc. # François Pinard , 1995. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. # Exit on all errors. set -e ## ----------------- ## ## Initial cleanup. ## ## ----------------- ## rm -rf checkdir mkdir checkdir cd checkdir echo "Checking `tar --version`" ## --------------- ## ## No checks yet. ## ## --------------- ## echo "Useless try: no checking implemented yet" ## --------------- ## ## Final cleanup. ## ## --------------- ## echo "Check successful" cd .. rm -rf checkdir exit 0 tar-1.11.8/src/open3.h 644 625 1 5136 5636120656 7377 /* Defines for Sys V style 3-argument open call. Copyright (C) 1988, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* open3.h -- #defines for the various flags for the Sys V style 3-argument open() call. On BSD or System 5, the system already has this in an include file. This file is needed for V7 and MINIX systems for the benefit of open3() in port.c, a routine that emulates the 3-argument call using system calls available on V7/MINIX. This file is needed by PD tar even if we aren't using the emulator, since the #defines for O_WRONLY, etc. are used in a couple of places besides the open() calls, (e.g. in the assignment to openflag in extract.c). We just #include this rather than #ifdef them out. Written 6/10/87 by Richard Todd. The names have been changed by John Gilmore, 31 July 1987, since Richard called it "bsdopen", and really this change was introduced in AT&T Unix systems before BSD picked it up. */ /* Only one of the next three should be specified. */ #define O_RDONLY 0 /* only allow read */ #define O_WRONLY 1 /* only allow write */ #define O_RDWR 2 /* both are allowed */ /* The rest of these can be OR-ed in to the above. */ /* O_NDELAY isn't implemented by the emulator. It's only useful (to tar) on systems that have named pipes anyway; it prevents tar's hanging by opening a named pipe. We #ifndef it because some systems already have it defined. */ #ifndef O_NDELAY #define O_NDELAY 4 /* don't block on opening devices that would block on open -- ignored by emulator */ #endif #define O_CREAT 8 /* create file if needed */ #define O_EXCL 16 /* file cannot already exist */ #define O_TRUNC 32 /* truncate file on open */ #define O_APPEND 64 /* always write at end of file -- ignored by emul */ #ifdef EMUL_OPEN3 /* make emulation transparent to rest of file -- redirect all open() calls to our routine */ #define open open3 #endif tar-1.11.8/src/rmt.h 644 625 1 6334 5762215504 7153 /* Definitions for communicating with a remote tape drive. Copyright (C) 1988, 1992 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ extern char *__rmt_path; int __rmt_open __P ((const char *, int, int, const char *)); int __rmt_close __P ((int)); int __rmt_read __P ((int, char *, unsigned int)); int __rmt_write __P ((int, char *, unsigned int)); long __rmt_lseek __P ((int, off_t, int)); int __rmt_ioctl __P ((int, int, char *)); /* A filename is remote if it contains a colon not preceeded by a slash, to take care of `/:/' which is a shorthand for `/...//fs' on machines running OSF's Distributing Computing Environment (DCE) and Distributed File System (DFS). However, when --force-local, a filename is never remote. [Which system? What is DCE? What is DFS?] */ #define _remdev(Path) \ (!flag_force_local && (__rmt_path = strchr (Path, ':')) \ && __rmt_path > (Path) && __rmt_path[-1] != '/') #define _isrmt(Fd) \ ((Fd) >= __REM_BIAS) #define __REM_BIAS 128 #ifndef O_CREAT #define O_CREAT 01000 #endif #define rmtopen(Path, Oflag, Mode, Command) \ (_remdev (Path) ? __rmt_open (Path, Oflag, __REM_BIAS, Command) \ : open (Path, Oflag, Mode)) #define rmtaccess(Path, Amode) \ (_remdev (Path) ? 0 : access (Path, Amode)) #define rmtstat(Path, Buffer) \ (_remdev (Path) ? (errno = EOPNOTSUPP), -1 : stat (Path, Buffer)) #define rmtcreat(Path, Mode, Command) \ (_remdev (Path) \ ? __rmt_open (Path, 1 | O_CREAT, __REM_BIAS, Command) \ : creat (Path, Mode)) #define rmtlstat(Path, Buffer) \ (_remdev (Path) ? (errno = EOPNOTSUPP), -1 : lstat (Path, Buffer)) #define rmtread(Fd, Buffer, Length) \ (_isrmt (Fd) ? __rmt_read (Fd - __REM_BIAS, Buffer, Length) \ : read (Fd, Buffer, Length)) #define rmtwrite(Fd, Buffer, Length) \ (_isrmt (Fd) ? __rmt_write (Fd - __REM_BIAS, Buffer, Length) \ : write (Fd, Buffer, Length)) #define rmtlseek(Fd, Offset, Where) \ (_isrmt (Fd) ? __rmt_lseek (Fd - __REM_BIAS, Offset, Where) \ : lseek (Fd, Offset, Where)) #define rmtclose(Fd) \ (_isrmt (Fd) ? __rmt_close (Fd - __REM_BIAS) : close (Fd)) #define rmtioctl(Fd, Request, Argument) \ (_isrmt (Fd) ? __rmt_ioctl (Fd - __REM_BIAS, Request, Argument) \ : ioctl (Fd, Request, Argument)) #define rmtdup(Fd) \ (_isrmt (Fd) ? (errno = EOPNOTSUPP), -1 : dup (Fd)) #define rmtfstat(Fd, Buffer) \ (_isrmt (Fd) ? (errno = EOPNOTSUPP), -1 : fstat (Fd, Buffer)) #define rmtfcntl(Fd, Command, Argument) \ (_isrmt (Fd) ? (errno = EOPNOTSUPP), -1 : fcntl (Fd, Command, Argument)) #define rmtisatty(Fd) \ (_isrmt (Fd) ? 0 : isatty (Fd)) tar-1.11.8/src/system.h 644 625 1 24042 5770645623 7721 /* System dependent definitions for GNU tar. Copyright (C) 1994 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H # include #endif /* Declare alloca. AIX requires this to be the first thing in the file. */ #ifdef __GNUC__ # define alloca __builtin_alloca #else # if HAVE_ALLOCA_H # include # else # ifdef _AIX #pragma alloca # else # ifndef alloca char *alloca (); # endif # endif # endif #endif #include /* Declare a generic pointer type. */ #if __STDC__ || defined(__TURBOC__) # define voidstar void * #else # define voidstar char * #endif /* Declare ISASCII. */ #include #if STDC_HEADERS # define ISASCII(Char) 1 #else # ifdef isascii # define ISASCII(Char) isascii (Char) # else # if HAVE_ISASCII # define ISASCII(Char) isascii (Char) # else # define ISASCII(Char) 1 # endif # endif #endif /* Declare string and memory handling routines. Take care that an ANSI string.h and pre-ANSI memory.h might conflict, and that memory.h and strings.h conflict on some systems. */ #if STDC_HEADERS || HAVE_STRING_H # include # if !STDC_HEADERS && HAVE_MEMORY_H # include # endif #else # include # ifndef strchr # define strchr index # endif # ifndef strrchr # define strrchr rindex # endif # ifndef memcpy # define memcpy(Dst, Src, Num) bcopy (Src, Dst, Num) # endif # ifndef memcmp # define memcmp(Src1, Src2, Num) bcmp (Src1, Src2, Num) # endif #endif /* Declare errno. */ #include #ifndef errno extern int errno; #endif /* Declare open parameters. */ #ifdef HAVE_FCNTL_H # include #else # include #endif #ifndef O_BINARY # define O_BINARY 0 #endif #ifndef O_CREAT # define O_CREAT 0 #endif #ifndef O_NDELAY # define O_NDELAY 0 #endif #ifndef O_RDONLY # define O_RDONLY 0 #endif #ifndef O_RDWR # define O_RDWR 2 #endif /* Declare file status routines and bits. */ #include #ifdef STAT_MACROS_BROKEN # undef S_ISBLK # undef S_ISCHR # undef S_ISDIR # undef S_ISFIFO # undef S_ISLNK # undef S_ISMPB # undef S_ISMPC # undef S_ISNWK # undef S_ISREG # undef S_ISSOCK #endif /* On MSDOS, there are missing things from . */ #ifdef __MSDOS__ # define S_ISUID 0 # define S_ISGID 0 # define S_ISVTX 0 #endif #ifndef S_ISREG /* POSIX.1 stat stuff missing */ # define mode_t unsigned short #endif #if !defined(S_ISBLK) && defined(S_IFBLK) # define S_ISBLK(Mode) (((Mode) & S_IFMT) == S_IFBLK) #endif #if !defined(S_ISCHR) && defined(S_IFCHR) # define S_ISCHR(Mode) (((Mode) & S_IFMT) == S_IFCHR) #endif #if !defined(S_ISDIR) && defined(S_IFDIR) # define S_ISDIR(Mode) (((Mode) & S_IFMT) == S_IFDIR) #endif #if !defined(S_ISREG) && defined(S_IFREG) # define S_ISREG(Mode) (((Mode) & S_IFMT) == S_IFREG) #endif #if !defined(S_ISFIFO) && defined(S_IFIFO) # define S_ISFIFO(Mode) (((Mode) & S_IFMT) == S_IFIFO) #endif #if !defined(S_ISLNK) && defined(S_IFLNK) # define S_ISLNK(Mode) (((Mode) & S_IFMT) == S_IFLNK) #endif #if !defined(S_ISSOCK) && defined(S_IFSOCK) # define S_ISSOCK(Mode) (((Mode) & S_IFMT) == S_IFSOCK) #endif #if !defined(S_ISMPB) && defined(S_IFMPB) /* V7 */ # define S_ISMPB(Mode) (((Mode) & S_IFMT) == S_IFMPB) # define S_ISMPC(Mode) (((Mode) & S_IFMT) == S_IFMPC) #endif #if !defined(S_ISNWK) && defined(S_IFNWK) /* HP/UX */ # define S_ISNWK(Mode) (((Mode) & S_IFMT) == S_IFNWK) #endif #ifndef HAVE_MKFIFO # define mkfifo(Path, Mode) (mknod (Path, (Mode) | S_IFIFO, 0)) #endif #if !defined(S_ISCTG) && defined(S_IFCTG) /* contiguous file */ # define S_ISCTG(Mode) (((Mode) & S_IFMT) == S_IFCTG) #endif #if !defined(S_ISVTX) # define S_ISVTX 0001000 #endif #ifndef _POSIX_SOURCE # include #endif /* Include before any preprocessor test of _POSIX_VERSION. */ #ifdef HAVE_UNISTD_H # include #endif /* Declare make device, major and minor. Since major is a function on SVR4, we have to resort to GOT_MAJOR instead of just testing if major is #define'd. */ #ifdef MAJOR_IN_MKDEV # include # define GOT_MAJOR #endif #ifdef MAJOR_IN_SYSMACROS # include # define GOT_MAJOR #endif /* Some defines the macros. */ #ifdef major # define GOT_MAJOR #endif #ifndef GOT_MAJOR # ifdef __MSDOS__ # define major(Device) (Device) # define minor(Device) (Device) # define makedev(Major, Minor) (((Major) << 8) | (Minor)) # define GOT_MAJOR # endif #endif /* For HP-UX before HP-UX 8, major/minor are not in . */ #ifndef GOT_MAJOR # if defined(hpux) || defined(__hpux__) || defined(__hpux) # include # define GOT_MAJOR # endif #endif #ifndef GOT_MAJOR # define major(Device) (((Device) >> 8) & 0xff) # define minor(Device) ((Device) & 0xff) # define makedev(Major, Minor) (((Major) << 8) | (Minor)) #endif #undef GOT_MAJOR /* Declare directory reading routines and structures. */ #ifdef __MSDOS__ # include "msd_dir.h" # define NAMLEN(dirent) ((dirent)->d_namlen) #else # ifdef HAVE_DIRENT_H # include # define NAMLEN(dirent) (strlen((dirent)->d_name)) # else # define dirent direct # define NAMLEN(dirent) ((dirent)->d_namlen) # ifdef HAVE_SYS_NDIR_H # include # endif # ifdef HAVE_SYS_DIR_H # include # endif # ifdef HAVE_NDIR_H # include # endif # endif #endif /* Declare wait status. */ #ifdef HAVE_SYS_WAIT_H # include #endif #ifdef HAVE_UNION_WAIT # define WAIT_T union wait # ifndef WTERMSIG # define WTERMSIG(Status) ((Status).w_termsig) # endif # ifndef WCOREDUMP # define WCOREDUMP(Status) ((Status).w_coredump) # endif # ifndef WEXITSTATUS # define WEXITSTATUS(Status) ((Status).w_retcode) # endif #else # define WAIT_T int # ifndef WTERMSIG # define WTERMSIG(Status) ((Status) & 0x7f) # endif # ifndef WCOREDUMP # define WCOREDUMP(Status) ((Status) & 0x80) # endif # ifndef WEXITSTATUS # define WEXITSTATUS(Status) (((Status) >> 8) & 0xff) # endif #endif #ifndef WIFSTOPPED # define WIFSTOPPED(Status) (WTERMSIG(Status) == 0x7f) #endif #ifndef WIFSIGNALED # define WIFSIGNALED(Status) (WTERMSIG(Status) != 0) #endif #ifndef WIFEXITED # define WIFEXITED(Status) (WTERMSIG(Status) == 0) #endif /* It is wrong to use RECORDSIZE for buffers when the logical block size is greater than 512 bytes; so ST_BLKSIZE code below, in preparation for some cleanup in this area, later. FIXME. */ /* Get or fake the disk device blocksize. Usually defined by sys/param.h (if at all). */ #if !defined(DEV_BSIZE) && defined(BSIZE) # define DEV_BSIZE BSIZE #endif #if !defined(DEV_BSIZE) && defined(BBSIZE) /* SGI */ # define DEV_BSIZE BBSIZE #endif #ifndef DEV_BSIZE # define DEV_BSIZE 4096 #endif /* Extract or fake data from a `struct stat'. ST_BLKSIZE gives the optimal I/O blocksize for the file, in bytes. Some systems, like Sequents, return st_blksize of 0 on pipes. */ #ifndef HAVE_ST_BLKSIZE # define ST_BLKSIZE(Statbuf) DEV_BSIZE #else # define ST_BLKSIZE(Statbuf) \ ((Statbuf).st_blksize > 0 ? (Statbuf).st_blksize : DEV_BSIZE) #endif /* Extract or fake data from a `struct stat'. ST_NBLOCKS gives the number of 512-byte blocks in the file (including indirect blocks). fileblocks.c uses BSIZE. HP-UX counts st_blocks in 1024-byte units, this loses when mixing HP-UX and BSD filesystems with NFS. AIX PS/2 counts st_blocks in 4K units. */ #ifndef HAVE_ST_BLOCKS # if defined(_POSIX_SOURCE) || !defined(BSIZE) # define ST_NBLOCKS(Statbuf) (((Statbuf).st_size + 512 - 1) / 512) # else # define ST_NBLOCKS(Statbuf) (st_blocks ((Statbuf).st_size)) # endif #else # if defined(hpux) || defined(__hpux__) || defined(__hpux) # define ST_NBLOCKS(Statbuf) ((Statbuf).st_blocks * 2) # else # if defined(_AIX) && defined(_I386) # define ST_NBLOCKS(Statbuf) ((Statbuf).st_blocks * 8) # else # define ST_NBLOCKS(Statbuf) ((Statbuf).st_blocks) # endif # endif #endif #if HAVE_SYS_GENTAPE_H /* e.g., for ISC */ # include #else # if HAVE_SYS_TAPE_H /* e.g., for SCO */ # include # else # if HAVE_SYS_MTIO_H # include # if HAVE_SYS_IO_TRIOCTL_H # include # endif # include # endif # endif #endif /* Declare standard functions. */ #ifdef STDC_HEADERS # include #else voidstar malloc (); voidstar realloc (); # ifdef HAVE_GETCWD char *getcwd (); # endif char *getenv (); #endif #include #ifndef _POSIX_VERSION # ifdef __MSDOS__ # include # else off_t lseek (); # endif #endif #include /* Until getoptold function is declared in getopt.h, we need this here for struct option. */ #include #ifdef WITH_DMALLOC # undef HAVE_VALLOC # define DMALLOC_FUNC_CHECK # include #endif /* Prototypes for external functions. */ #ifndef __P # if PROTOTYPES # define __P(Args) Args # else # define __P(Args) () # endif #endif #if HAVE_LOCALE_H # include #endif #if !HAVE_SETLOCALE # define setlocale(Category, Locale) #endif #if ENABLE_NLS # include # define _(Text) gettext (Text) #else # define textdomain(Domain) # define _(Text) Text #endif /* Library modules. */ #ifdef HAVE_VPRINTF void error __P ((int, int, const char *, ...)); #else void error (); #endif #ifndef HAVE_STRSTR char *strstr __P ((const char *, const char *)); #endif #ifndef HAVE_VALLOC # define valloc(Size) malloc (Size) #endif voidstar xmalloc __P ((size_t)); voidstar xrealloc __P ((voidstar, size_t)); char *xstrdup __P ((const char *)); tar-1.11.8/src/tar.h 644 625 1 32710 5770620301 7146 /* Declarations for tar archives. Copyright (C) 1988, 1992, 1993, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Standard Archive Format - Standard TAR - USTAR. */ /* Header block on tape. We use traditional DP naming conventions here. A "block" is a big chunk of stuff that we do I/O on. A "record" is a piece of info that we care about. Typically many "record"s fit into a "block". */ #define RECORDSIZE 512 #define NAMSIZ 100 #define TUNMLEN 32 #define TGNMLEN 32 #define SPARSE_EXT_HDR 21 #define SPARSE_IN_HDR 4 struct sparse { char offset[12]; char numbytes[12]; }; union record { char charptr[RECORDSIZE]; struct header { char arch_name[NAMSIZ]; char mode[8]; char uid[8]; char gid[8]; char size[12]; char mtime[12]; char chksum[8]; char linkflag; char arch_linkname[NAMSIZ]; char magic[8]; char uname[TUNMLEN]; char gname[TGNMLEN]; char devmajor[8]; char devminor[8]; /* The following fields were added for GNU and are not standard. */ char atime[12]; char ctime[12]; char offset[12]; char longnames[4]; /* Some compilers would insert the pad themselves, so pad was once autoconfigured. It is simpler to always insert it! */ char pad; struct sparse sp[SPARSE_IN_HDR]; char isextended; char realsize[12]; /* true size of the sparse file */ #if 0 char ending_blanks[12]; /* number of nulls at the end of the file, if any */ #endif } header; struct extended_header { struct sparse sp[21]; char isextended; } ext_hdr; }; /* The checksum field is filled with this while the checksum is computed. */ #define CHKBLANKS " " /* 8 blanks, no null */ /* The magic field is filled with this value if uname and gname are valid, marking the archive as being in standard POSIX format (though GNU tar itself is not POSIX conforming). */ #define TMAGIC "ustar " /* 7 chars and a null */ /* The magic field is filled with this if this is a GNU format dump entry. But I suspect this is not true anymore. */ #define GNUMAGIC "GNUtar " /* 7 chars and a null */ /* The linkflag defines the type of file. */ #define LF_OLDNORMAL '\0' /* normal disk file, Unix compat */ #define LF_NORMAL '0' /* normal disk file */ #define LF_LINK '1' /* link to previously dumped file */ #define LF_SYMLINK '2' /* symbolic link */ #define LF_CHR '3' /* character special file */ #define LF_BLK '4' /* block special file */ #define LF_DIR '5' /* directory */ #define LF_FIFO '6' /* FIFO special file */ #define LF_CONTIG '7' /* contiguous file */ /* Further link types may be defined later. */ /* Note that the standards committee allows only capital A through capital Z for user-defined expansion. This means that defining something as, say '8' is a *bad* idea. */ /* This is a dir entry that contains the names of files that were in the dir at the time the dump was made. */ #define LF_DUMPDIR 'D' /* Identifies the NEXT file on the tape as having a long linkname. */ #define LF_LONGLINK 'K' /* Identifies the NEXT file on the tape as having a long name. */ #define LF_LONGNAME 'L' /* This is the continuation of a file that began on another volume. */ #define LF_MULTIVOL 'M' /* For storing filenames that didn't fit in 100 characters. */ #define LF_NAMES 'N' /* This is for sparse files. */ #define LF_SPARSE 'S' /* This file is a tape/volume header. Ignore it on extraction. */ #define LF_VOLHDR 'V' #if 0 /* The following two blocks of #define's are unused in GNU tar. */ /* Bits used in the mode field - values in octal */ #define TSUID 04000 /* set UID on execution */ #define TSGID 02000 /* set GID on execution */ #define TSVTX 01000 /* save text (sticky bit) */ /* File permissions */ #define TUREAD 00400 /* read by owner */ #define TUWRITE 00200 /* write by owner */ #define TUEXEC 00100 /* execute/search by owner */ #define TGREAD 00040 /* read by group */ #define TGWRITE 00020 /* write by group */ #define TGEXEC 00010 /* execute/search by group */ #define TOREAD 00004 /* read by other */ #define TOWRITE 00002 /* write by other */ #define TOEXEC 00001 /* execute/search by other */ #endif /* End of Standard Archive Format description. */ /* Kludge for handling systems that can't cope with multiple external definitions of a variable. In ONE routine (tar.c), we #define GLOBAL to null; here, we set it to "extern" if it is not already set. */ #ifndef GLOBAL # define GLOBAL extern #endif /* Exit status for GNU tar. Let's try to keep this list as simple as possible. -d option strongly invites a different status for unequal comparison and other errors. */ #define TAREXIT_SUCCESS 0 #define TAREXIT_DIFFERS 1 #define TAREXIT_FAILURE 2 /* Global variables. */ struct sp_array { off_t offset; int numbytes; }; /* Start of block of archive. */ GLOBAL union record *ar_block; /* Current record of archive. */ GLOBAL union record *ar_record; /* Last+1 record of archive block. */ GLOBAL union record *ar_last; /* 0 writing, !0 reading archive. */ GLOBAL char ar_reading; /* Size of each block, in records. */ GLOBAL int blocking; /* Size of each block, in bytes. */ GLOBAL int blocksize; /* Script to run at end of each tape change. */ GLOBAL char *info_script; /* File containing names to work on. */ GLOBAL const char *namefile_name; /* \n or \0. */ GLOBAL char filename_terminator; /* Name of this program. */ GLOBAL const char *program_name; /* Pointer to the start of the scratch space. */ GLOBAL struct sp_array *sparsearray; /* Initial size of the sparsearray. */ GLOBAL int sp_array_size; /* Total written to output. */ GLOBAL int tot_written; /* Compiled regex for extract label. */ GLOBAL struct re_pattern_buffer *label_pattern; /* List of tape drive names, number of such tape drives, allocated number, and current cursor in list. */ GLOBAL const char **archive_name_array; GLOBAL int archive_names; GLOBAL int allocated_archive_names; GLOBAL const char **archive_name_cursor; GLOBAL char *current_file_name; GLOBAL char *current_link_name; /* Flags from the command line. */ GLOBAL int command_mode; #define COMMAND_NONE 0 /* None of the following were specified */ #define COMMAND_TOO_MANY 1 /* More than one of the following were given */ #define COMMAND_CAT 2 /* -A */ #define COMMAND_CREATE 3 /* -c */ #define COMMAND_DIFF 4 /* -d */ #define COMMAND_APPEND 5 /* -r */ #define COMMAND_LIST 6 /* -t */ #define COMMAND_UPDATE 7 /* -u */ #define COMMAND_EXTRACT 8 /* -x */ #define COMMAND_DELETE 9 /* -D */ GLOBAL int flag_reblock; /* -B */ #if 0 GLOBAL char flag_dironly; /* -D */ #endif GLOBAL int flag_run_script_at_end; /* -F */ GLOBAL int flag_gnudump; /* -G */ GLOBAL int flag_follow_links; /* -h */ GLOBAL int flag_ignorez; /* -i */ GLOBAL int flag_keep; /* -k */ GLOBAL int flag_startfile; /* -K */ GLOBAL int flag_local_filesys; /* -l */ GLOBAL int tape_length; /* -L */ GLOBAL int flag_modified; /* -m */ GLOBAL int flag_multivol; /* -M */ GLOBAL int flag_new_files; /* -N */ GLOBAL int flag_oldarch; /* -o */ GLOBAL int flag_exstdout; /* -O */ GLOBAL int flag_use_protection; /* -p */ GLOBAL int flag_absolute_names; /* -P */ GLOBAL int flag_sayblock; /* -R */ GLOBAL int flag_sorted_names; /* -s */ GLOBAL int flag_sparse_files; /* -S */ GLOBAL int flag_namefile; /* -T */ GLOBAL int flag_verbose; /* -v */ GLOBAL char *flag_volhdr; /* -V */ GLOBAL int flag_confirm; /* -w */ GLOBAL int flag_verify; /* -W */ GLOBAL int flag_exclude; /* -X */ GLOBAL const char *flag_compressprog; /* -z and -Z */ GLOBAL const char *flag_rsh_command; /* --rsh-command */ GLOBAL int flag_do_chown; /* --do-chown */ GLOBAL int flag_totals; /* --totals */ GLOBAL int flag_remove_files; /* --remove-files */ GLOBAL int flag_ignore_failed_read; /* --ignore-failed-read */ GLOBAL int flag_checkpoint; /* --checkpoint */ GLOBAL int flag_show_omitted_dirs; /* --show-omitted-dirs */ GLOBAL char *flag_volno_file; /* --volno-file */ GLOBAL int flag_force_local; /* --force-local */ GLOBAL int flag_atime_preserve; /* --atime-preserve */ GLOBAL int flag_compress_block; /* --compress-block */ /* We default to Unix Standard format rather than 4.2BSD tar format. The code can actually produce all three: flag_standard ANSI standard flag_oldarch V7 neither 4.2BSD but we don't bother, since 4.2BSD can read ANSI standard format anyway. The only advantage to the "neither" option is that we can cmp our output to the output of 4.2BSD tar, for debugging. */ #define flag_standard (!flag_oldarch) /* Structure for keeping track of filenames and lists thereof. */ struct name { struct name *next; short length; /* cached strlen(name) */ char found; /* a matching file has been found */ char firstch; /* first char is literally matched */ char regexp; /* this name is a regexp, not literal */ char *change_dir; /* JF set with the -C option */ char *dir_contents; /* JF for flag_gnudump */ char fake; /* dummy entry */ char name[1]; }; GLOBAL struct name *namelist; /* points to first name in list */ GLOBAL struct name *namelast; /* points to last name in list */ GLOBAL int archive; /* file descriptor for archive file */ GLOBAL int exit_status; /* status for exit when tar finishes */ GLOBAL char *gnu_dumpfile; /* Error recovery stuff. */ GLOBAL char read_error_flag; #define WARN(Args) error Args #define ERROR(Args) (error Args, exit_status = TAREXIT_FAILURE) /* Module buffer.c. */ extern long baserec; extern FILE *stdlis; extern char *save_name; extern long save_sizeleft; extern long save_totsize; extern int write_archive_to_stdout; void close_archive __P ((void)); void closeout_volume_number __P ((void)); union record *endofrecs __P ((void)); union record *findrec __P ((void)); void fl_read __P ((void)); void fl_write __P ((void)); void flush_archive __P ((void)); void init_volume_number __P ((void)); int isfile __P ((const char *)); int no_op __P ((int, char *)); void open_archive __P ((int)); void reset_eof __P ((void)); void saverec __P ((union record **)); void userec __P ((union record *)); int wantbytes __P ((long, int (*) ())); /* Module create.c. */ void create_archive __P ((void)); void dump_file __P ((char *, int, int)); void finish_header __P ((union record *)); void to_oct __P ((long, int, char *)); void write_eot __P ((void)); /* Module diffarch.c. */ extern int now_verifying; void diff_archive __P ((void)); void diff_init __P ((void)); void verify_volume __P ((void)); /* Module extract.c. */ void extr_init __P ((void)); void extract_archive __P ((void)); void restore_saved_dir_info __P ((void)); /* Module gnu.c. */ void collect_and_sort_names __P ((void)); char *get_dir_contents __P ((char *, int)); void gnu_restore __P ((int)); int is_dot_or_dotdot __P ((char *)); void write_dir_file __P ((void)); /* Module list.c. */ extern union record *head; extern struct stat hstat; extern int head_standard; void decode_header __P ((union record *, struct stat *, int *, int)); long from_oct __P ((int, char *)); void list_archive __P ((void)); void pr_mkdir __P ((char *, int, int)); void print_header __P ((void)); void read_and __P ((void (*do_) ())); int read_header __P ((void)); void skip_extended_headers __P ((void)); void skip_file __P ((long)); /* Module mangle.c. */ void extract_mangle __P ((void)); /* Module names.c. */ int findgid __P ((char gname[TUNMLEN])); void findgname __P ((char gname[TGNMLEN], int)); int finduid __P ((char uname[TUNMLEN])); void finduname __P ((char uname[TUNMLEN], int)); /* Module port.c. */ extern char TTY_NAME[]; void add_buffer __P ((char *, const char *, int)); void ck_close __P ((int)); voidstar ck_malloc __P ((size_t)); void ck_pipe __P ((int *)); void flush_buffer __P ((char *)); char *get_buffer __P ((char *)); char *init_buffer __P ((void)); char *merge_sort __P ((char *, unsigned, int, int (*) ())); char *quote_copy_string __P ((const char *)); char *un_quote_string __P ((char *)); /* Module rtapelib.c. */ int __rmt_close __P ((int)); long __rmt_lseek __P ((int, off_t, int)); int __rmt_open __P ((const char *, int, int, const char *)); int __rmt_read __P ((int, char *, unsigned int)); int __rmt_write __P ((int, char *, unsigned int)); /* Module tar.c. */ extern time_t new_time; void addname __P ((const char *)); void assign_string __P ((char **, const char *)); void blank_name_list __P ((void)); int check_exclude __P ((const char *)); int confirm __P ((const char *, const char *)); void name_close __P ((void)); void name_expand __P ((void)); char *name_from_list __P ((void)); void name_gather __P ((void)); int name_match __P ((const char *)); char *name_next __P ((int change_)); struct name *name_scan __P ((const char *)); void names_notfound __P ((void)); char *new_name __P ((char *, char *)); /* Module update.c. */ extern char *output_start; void junk_archive __P ((void)); void update_archive __P ((void)); tar-1.11.8/src/genfile.c 644 625 1 6340 5770637467 7771 /* Generate a file containing some preset patterns. Copyright (C) 1995 Free Software Foundation, Inc. François Pinard , 1995. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "system.h" #ifndef EXIT_SUCCESS # define EXIT_SUCCESS 0 #endif #ifndef EXIT_FAILURE # define EXIT_FAILURE 1 #endif /* The name this program was run with. */ const char *program_name; /* If non-zero, display usage information and exit. */ static int show_help = 0; /* If non-zero, print the version on standard output and exit. */ static int show_version = 0; /* Length of file to generate. */ static int file_length = 0; /*-----------------------------------------------. | Explain how to use the program, then get out. | `-----------------------------------------------*/ void usage (int status) { if (status != EXIT_SUCCESS) fprintf (stderr, _("Try `%s --help' for more information.\n"), program_name); else { printf ("GNU %s %s\n", PACKAGE, VERSION); printf (_("\ \n\ Usage: %s [OPTION]...\n"), program_name); fputs (_("\ Mandatory arguments to long options are mandatory for short options too.\n\ \n\ --help display this help and exit\n\ --version output version information and exit\n"), stdout); } exit (status); } /*----------------------------------------------------------------------. | Main program. Decode ARGC arguments passed through the ARGV array of | | strings, then launch execution. | `----------------------------------------------------------------------*/ /* Long options equivalences. */ static const struct option long_options[] = { {"help", no_argument, &show_help, 1}, {"length", required_argument, NULL, 'l'}, {"version", no_argument, &show_version, 1}, {0, 0, 0, 0}, }; int main (int argc, char *const *argv) { int option_char; /* option character */ int counter; /* general purpose counter */ /* Decode command options. */ program_name = argv[0]; setlocale (LC_ALL, ""); while (option_char = getopt_long (argc, argv, "l:", long_options, NULL), option_char != EOF) switch (option_char) { default: usage (EXIT_FAILURE); case '\0': break; case 'l': file_length = atoi (optarg); break; } /* Process trivial options. */ if (show_version) { printf ("GNU %s %s\n", PACKAGE, VERSION); exit (EXIT_SUCCESS); } if (show_help) usage (EXIT_SUCCESS); if (optind < argc) usage (EXIT_FAILURE); /* Generate file. */ for (counter = 0; counter < file_length; counter++) putchar (counter & 255); exit (0); } tar-1.11.8/src/rmt.c 644 625 1 15611 5762156676 7202 /* Remote connection server. Copyright (C) 1994 Free Software Foundation, Inc. This file is part of GNU tar. GNU tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Copyright (c) 1983 Regents of the University of California. All rights reserved. Redistribution and use in source and binary forms are permitted provided that the above copyright notice and this paragraph are duplicated in all such forms and that any documentation, advertising materials, and other materials related to such distribution and use acknowledge that the software was developed by the University of California, Berkeley. The name of the University may not be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. */ #include "system.h" #ifndef lint static char copyright[] = "@(#) Copyright (c) 1983 Regents of the University of California.\n\ All rights reserved.\n"; #endif /* not lint */ #include #include #ifndef EXIT_FAILURE # define EXIT_FAILURE 1 #endif #ifndef EXIT_SUCCESS # define EXIT_SUCCESS 0 #endif int tape = -1; char *record = 0; int maxrecsize = -1; #define STRING_SIZE 64 char device[STRING_SIZE]; char count[STRING_SIZE], mode[STRING_SIZE], pos[STRING_SIZE], op[STRING_SIZE]; extern char *sys_errlist[]; char resp[BUFSIZ]; FILE *debug; #define DEBUG(File) \ if (debug) fprintf(debug, File) #define DEBUG1(File, Arg) \ if (debug) fprintf(debug, File, Arg) #define DEBUG2(File, Arg1, Arg2) \ if (debug) fprintf(debug, File, Arg1, Arg2) /*---. | ? | `---*/ static void string_error (const char *string) { DEBUG1 ("rmtd: E 0 (%s)\n", string); sprintf (resp, "E0\n%s\n", string); write (1, resp, strlen (resp)); } /*---. | ? | `---*/ static void numeric_error (int num) { DEBUG2 ("rmtd: E %d (%s)\n", num, sys_errlist[num]); sprintf (resp, "E%d\n%s\n", num, sys_errlist[num]); write (1, resp, strlen (resp)); } /*---. | ? | `---*/ static void getstring (char *bp) { int i; char *cp = bp; for (i = 0; i < STRING_SIZE; i++) { if (read (0, cp + i, 1) != 1) exit (EXIT_SUCCESS); if (cp[i] == '\n') break; } cp[i] = '\0'; } /*---. | ? | `---*/ static void checkbuf (int size) { if (size <= maxrecsize) return; if (record) free (record); record = malloc ((size_t) size); if (record == 0) { DEBUG (_("rmtd: Cannot allocate buffer space\n")); string_error (_("Cannot allocate buffer space")); exit (EXIT_FAILURE); /* status used to be 4 */ } maxrecsize = size; #ifdef SO_RCVBUF while (size > 1024 && setsockopt (0, SOL_SOCKET, SO_RCVBUF, (char *) &size, sizeof (size)) < 0) size -= 1024; #else size = 1 + ((size - 1) % 1024); #endif } /*---. | ? | `---*/ const char *program_name; int main (int argc, char *const *argv) { int rval; char c; int n, i, cc; program_name = argv[0]; setlocale (LC_ALL, ""); argc--, argv++; if (argc > 0) { debug = fopen (*argv, "w"); if (debug == 0) { numeric_error (errno); exit (EXIT_FAILURE); } setbuf (debug, (char *) 0); } top: errno = 0; rval = 0; if (read (0, &c, 1) != 1) exit (EXIT_SUCCESS); switch (c) { case 'O': if (tape >= 0) close (tape); getstring (device); getstring (mode); DEBUG2 ("rmtd: O %s %s\n", device, mode); #if defined (i386) && defined (AIX) /* This is alleged to fix a byte ordering problem. I'm quite suspicious if it's right. -- mib. */ { int oflag = atoi (mode); int nflag = 0; if ((oflag & 3) == 0) nflag |= O_RDONLY; if (oflag & 1) nflag |= O_WRONLY; if (oflag & 2) nflag |= O_RDWR; if (oflag & 0x0008) nflag |= O_APPEND; if (oflag & 0x0200) nflag |= O_CREAT; if (oflag & 0x0400) nflag |= O_TRUNC; if (oflag & 0x0800) nflag |= O_EXCL; tape = open (device, nflag, 0666); } #else tape = open (device, atoi (mode), 0666); #endif if (tape < 0) goto ioerror; goto respond; case 'C': DEBUG ("rmtd: C\n"); getstring (device); /* discard */ if (close (tape) < 0) goto ioerror; tape = -1; goto respond; case 'L': getstring (count); getstring (pos); DEBUG2 ("rmtd: L %s %s\n", count, pos); rval = lseek (tape, (off_t) atol (count), atoi (pos)); if (rval < 0) goto ioerror; goto respond; case 'W': getstring (count); n = atoi (count); DEBUG1 ("rmtd: W %s\n", count); checkbuf (n); for (i = 0; i < n; i += cc) { cc = read (0, &record[i], n - i); if (cc <= 0) { DEBUG (_("rmtd: Premature eof\n")); string_error (_("Premature end of file")); exit (EXIT_FAILURE); /* status used to be 2 */ } } rval = write (tape, record, n); if (rval < 0) goto ioerror; goto respond; case 'R': getstring (count); DEBUG1 ("rmtd: R %s\n", count); n = atoi (count); checkbuf (n); rval = read (tape, record, n); if (rval < 0) goto ioerror; sprintf (resp, "A%d\n", rval); write (1, resp, strlen (resp)); write (1, record, rval); goto top; case 'I': getstring (op); getstring (count); DEBUG2 ("rmtd: I %s %s\n", op, count); #ifdef MTIOCTOP { struct mtop mtop; mtop.mt_op = atoi (op); mtop.mt_count = atoi (count); if (ioctl (tape, MTIOCTOP, (char *) &mtop) < 0) goto ioerror; rval = mtop.mt_count; } #endif goto respond; case 'S': /* status */ DEBUG ("rmtd: S\n"); { #ifdef MTIOCGET struct mtget mtget; if (ioctl (tape, MTIOCGET, (char *) &mtget) < 0) goto ioerror; rval = sizeof (mtget); sprintf (resp, "A%d\n", rval); write (1, resp, strlen (resp)); write (1, (char *) &mtget, sizeof (mtget)); #endif goto top; } default: DEBUG1 (_("rmtd: Garbage command %c\n"), c); string_error (_("Garbage command")); exit (EXIT_FAILURE); /* status used to be 3 */ } respond: DEBUG1 ("rmtd: A %d\n", rval); sprintf (resp, "A%d\n", rval); write (1, resp, strlen (resp)); goto top; ioerror: numeric_error (errno); goto top; } tar-1.11.8/src/buffer.c 644 625 1 111034 5762212263 7646 /* Buffer management for tar. Copyright (C) 1988, 1992, 1993, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Buffer management for tar. Written by John Gilmore, on 25 August 1985. */ #include "system.h" #include #include time_t time (); #ifdef __MSDOS__ #include #endif #ifdef XENIX #include #endif #if WITH_REGEX # include #else # include #endif #include "rmt.h" #include "tar.h" /* Where we write messages (standard messages, not errors) to. Stdout unless we're writing a pipe, in which case stderr. */ FILE *stdlis; #define STDIN 0 /* standard input file descriptor */ #define STDOUT 1 /* standard output file descriptor */ #define PREAD 0 /* read file descriptor from pipe() */ #define PWRITE 1 /* write file descriptor from pipe() */ static int backspace_output __P ((void)); static int new_volume __P ((int)); static void writeerror __P ((int)); static void readerror __P ((void)); #ifndef __MSDOS__ /* Obnoxious test to see if dimwit is trying to dump the archive */ dev_t ar_dev; ino_t ar_ino; #endif /* The record pointed to by save_rec should not be overlaid when reading in a new tape block. Copy it to record_save_area first, and change the pointer in *save_rec to point to record_save_area. Saved_recno records the record number at the time of the save. This is used by annofile() to print the record number of a file's header record. */ static union record **save_rec; union record record_save_area; static long saved_recno; /* PID of child program, if flag_compress or remote archive access. */ static int childpid = 0; /* Record number of the start of this block of records */ long baserec; /* Error recovery stuff */ static int r_error_count; /* Have we hit EOF yet? */ static int hit_eof; /* Checkpointing counter */ static int checkpoint; /* JF we're reading, but we just read the last record and its time to update */ extern time_to_start_writing; int file_to_switch_to = -1; /* if remote update, close archive, and use this descriptor to write to */ static int volno = 1; /* JF which volume of a multi-volume tape we're on */ static int global_volno = 1; /* volume number to print in external messages */ char *save_name; /* name of the file we are currently writing */ long save_totsize; /* total size of file we are writing, only valid if save_name is non NULL */ long save_sizeleft; /* where we are in the file we are writing, only valid if save_name is non-zero */ int write_archive_to_stdout; /* Used by fl_read and fl_write to store the real info about saved names */ static char real_s_name[NAMSIZ]; static long real_s_totsize; static long real_s_sizeleft; /*---------------------------------------------------------. | Reset the EOF flag (if set), and re-set ar_record, etc. | `---------------------------------------------------------*/ void reset_eof (void) { if (hit_eof) { hit_eof = 0; ar_record = ar_block; ar_last = ar_block + blocking; ar_reading = 0; } } /*-------------------------------------------------------------------------. | Return the location of the next available input or output record. | | Return NULL for EOF. Once we have returned NULL, we just keep returning | | it, to avoid accidentally going on to the next file on the "tape". | `-------------------------------------------------------------------------*/ union record * findrec (void) { if (ar_record == ar_last) { if (hit_eof) return NULL; flush_archive (); if (ar_record == ar_last) { hit_eof++; return NULL; } } return ar_record; } /*----------------------------------------------------------------------. | Indicate that we have used all records up thru the argument. (should | | the arg have an off-by-1? FIXME) | `----------------------------------------------------------------------*/ void userec (union record *rec) { while (rec >= ar_record) ar_record++; /* Do *not* flush the archive here. If we do, the same argument to userec() could mean the next record (if the input block is exactly one record long), which is not what is intended. */ if (ar_record > ar_last) abort (); } /*----------------------------------------------------------------------. | Return a pointer to the end of the current records buffer. All the | | space between findrec() and endofrecs() is available for filling with | | data, or taking data from. | `----------------------------------------------------------------------*/ union record * endofrecs (void) { return ar_last; } /*--------------------------------------------------------------------. | Duplicate a file descriptor into a certain slot. Equivalent to BSD | | "dup2" with error reporting. | `--------------------------------------------------------------------*/ static void dupto (int from, int to, const char *msg) { int err; if (from != to) { err = close (to); if (err < 0 && errno != EBADF) ERROR ((TAREXIT_FAILURE, errno, _("Cannot close descriptor %d"), to)); err = dup (from); if (err != to) ERROR ((TAREXIT_FAILURE, errno, _("Cannot dup %s"), msg)); ck_close (from); } } /*---. | ? | `---*/ #ifdef __MSDOS__ static void child_open (void) { ERROR ((TAREXIT_FAILURE, 0, _("Cannot use compressed or remote archives"))) } #else static void child_open (void) { int local_pipe[2]; int err = 0; int kidpipe[2]; int kidchildpid; #define READ 0 #define WRITE 1 ck_pipe (local_pipe); childpid = fork (); if (childpid < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot fork"))); if (childpid > 0) { /* We're the parent. Clean up and be happy. This, at least, is easy. */ if (ar_reading) { flag_reblock++; archive = local_pipe[READ]; ck_close (local_pipe[WRITE]); } else { archive = local_pipe[WRITE]; ck_close (local_pipe[READ]); } return; } /* We're the kid. */ if (ar_reading) { dupto (local_pipe[WRITE], STDOUT, _("(child) Pipe to stdout")); ck_close (local_pipe[READ]); } else { dupto (local_pipe[READ], STDIN, _("(child) Pipe to stdin")); ck_close (local_pipe[WRITE]); } /* We need a child tar only if 1: we're reading/writing stdin/out (to force reblocking), 2: the file is to be accessed by rmt (compress doesn't know how), 3: the file is not a plain file. */ if (strcmp (archive_name_array[0], "-") != 0 && !_remdev (archive_name_array[0]) && isfile (archive_name_array[0])) { /* We don't need a child tar. Open the archive. */ if (ar_reading) { archive = open (archive_name_array[0], O_RDONLY | O_BINARY, 0666); if (archive < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot open archive %s"), archive_name_array[0])); dupto (archive, STDIN, _("Archive to stdin")); #if 0 close (archive); #endif } else { archive = creat (archive_name_array[0], 0666); if (archive < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot open archive %s"), archive_name_array[0])); dupto (archive, STDOUT, _("Archive to stdout")); #if 0 close (archive); #endif } } else { /* We need a child tar. */ ck_pipe (kidpipe); kidchildpid = fork (); if (kidchildpid < 0) ERROR ((TAREXIT_FAILURE, errno, _("Child cannot fork"))); if (kidchildpid > 0) { /* About to exec compress: set up the files. */ if (ar_reading) { dupto (kidpipe[READ], STDIN, _("((child)) Pipe to stdin")); ck_close (kidpipe[WRITE]); #if 0 dup2 (local_pipe[WRITE], STDOUT); #endif } else { #if 0 dup2 (local_pipe[READ], STDIN); #endif dupto (kidpipe[WRITE], STDOUT, _("((child)) Pipe to stdout")); ck_close (kidpipe[READ]); } #if 0 ck_close (local_pipe[READ]); ck_close (local_pipe[WRITE]); ck_close (kidpipe[READ]); ck_close (kidpipe[WRITE]); #endif } else { /* Grandchild. Do the right thing, namely sit here and read/write the archive, and feed stuff back to compress. */ program_name = _("tar (child)"); if (ar_reading) { dupto (kidpipe[WRITE], STDOUT, _("[child] Pipe to stdout")); ck_close (kidpipe[READ]); } else { dupto (kidpipe[READ], STDIN, _("[child] Pipe to stdin")); ck_close (kidpipe[WRITE]); } if (strcmp (archive_name_array[0], "-") == 0) { if (ar_reading) archive = STDIN; else archive = STDOUT; } else #if 0 /* This can't happen. */ if (ar_reading==2) archive = rmtopen (archive_name_array[0], O_RDWR|O_CREAT | O_BINARY, 0666, flag_rsh_command); else #endif if (ar_reading) archive = rmtopen (archive_name_array[0], O_RDONLY | O_BINARY, 0666, flag_rsh_command); else archive = rmtcreat (archive_name_array[0], 0666, flag_rsh_command); if (archive < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot open archive %s"), archive_name_array[0])); if (ar_reading) { while (1) { char *ptr; int max, count; r_error_count = 0; error_loop: err = rmtread (archive, ar_block->charptr, (unsigned int) (blocksize)); if (err < 0) { readerror (); goto error_loop; } if (err == 0) break; ptr = ar_block->charptr; max = err; while (max) { count = (max < RECORDSIZE) ? max : RECORDSIZE; err = write (STDOUT, ptr, (size_t) count); if (err < 0) ERROR ((TAREXIT_FAILURE, errno, _("\ Cannot write to compression program"))); if (err != count) { ERROR ((0, 0, _("\ Write to compression program short %d bytes"), count - err)); count = err; } ptr += count; max -= count; } } } else { while (1) { int n; char *ptr; n = blocksize; ptr = ar_block->charptr; while (n) { err = read (STDIN, ptr, (size_t) ((n < RECORDSIZE) ? n : RECORDSIZE)); if (err <= 0) break; n -= err; ptr += err; } /* EOF */ if (err == 0) { if (!flag_compress_block) blocksize -= n; else memset (ar_block->charptr + blocksize - n, 0, (size_t) n); err = rmtwrite (archive, ar_block->charptr, (unsigned int) blocksize); if (err != (blocksize)) writeerror (err); if (!flag_compress_block) blocksize += n; break; } if (n) ERROR ((TAREXIT_FAILURE, errno, _("Cannot read from compression program"))); err = rmtwrite (archive, ar_block->charptr, (unsigned int) blocksize); if (err != blocksize) writeerror (err); } } #if 0 close_archive (); #endif exit (exit_status); } } /* So we should exec compress (-d). */ if (ar_reading) execlp (flag_compressprog, flag_compressprog, "-d", (char *) 0); else execlp (flag_compressprog, flag_compressprog, (char *) 0); /* In a previous tar version, _exit was used here instead of exit. */ ERROR ((TAREXIT_FAILURE, errno, _("Cannot exec %s"), flag_compressprog)); } /*--------------------------------------------------. | Return non-zero if P is the name of a directory. | `--------------------------------------------------*/ int isfile (const char *p) { struct stat stbuf; if (stat (p, &stbuf) < 0) return 1; if (S_ISREG (stbuf.st_mode)) return 1; return 0; } #endif /*------------------------------------------------------------------------. | Open an archive file. The argument specifies whether we are reading or | | writing. | `------------------------------------------------------------------------*/ /* JF if the arg is 2, open for reading and writing. */ void open_archive (int reading) { stdlis = flag_exstdout ? stderr : stdout; if (blocksize == 0) ERROR ((TAREXIT_FAILURE, 0, _("Invalid value for blocksize"))); if (archive_names == 0) ERROR ((TAREXIT_FAILURE, 0, _("No archive name given, what should I do?"))); current_file_name = NULL; current_link_name = NULL; save_name = NULL; if (flag_multivol) { ar_block = (union record *) valloc ((unsigned) (blocksize + (2 * RECORDSIZE))); if (ar_block) ar_block += 2; } else ar_block = (union record *) valloc ((unsigned) blocksize); if (!ar_block) ERROR ((TAREXIT_FAILURE, 0, _("Could not allocate memory for blocking factor %d"), blocking)); ar_record = ar_block; ar_last = ar_block + blocking; ar_reading = reading; if (flag_multivol && flag_verify) ERROR ((TAREXIT_FAILURE, 0, _("Cannot verify multi-volume archives"))); if (flag_compressprog) { if (reading == 2 || flag_verify) ERROR ((TAREXIT_FAILURE, 0, _("Cannot update or verify compressed archives"))); if (flag_multivol) ERROR ((TAREXIT_FAILURE, 0, _("Cannot use multi-volume compressed archives"))); child_open (); if (!reading && strcmp (archive_name_array[0], "-") == 0) stdlis = stderr; #if 0 child_open (rem_host, rem_file); #endif } else if (strcmp (archive_name_array[0], "-") == 0) { flag_reblock++; /* could be a pipe, be safe */ if (flag_verify) ERROR ((TAREXIT_FAILURE, 0, _("Cannot verify stdin/stdout archive"))); if (reading == 2) { archive = STDIN; stdlis = stderr; write_archive_to_stdout++; } else if (reading) archive = STDIN; else { archive = STDOUT; stdlis = stderr; } } else if (reading == 2 || flag_verify) archive = rmtopen (archive_name_array[0], O_RDWR | O_CREAT | O_BINARY, 0666, flag_rsh_command); else if (reading) archive = rmtopen (archive_name_array[0], O_RDONLY | O_BINARY, 0666, flag_rsh_command); else archive = rmtcreat (archive_name_array[0], 0666, flag_rsh_command); if (archive < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot open %s"), archive_name_array[0])); #ifndef __MSDOS__ if (!_isrmt (archive)) { struct stat tmp_stat; fstat (archive, &tmp_stat); if (S_ISREG (tmp_stat.st_mode)) { ar_dev = tmp_stat.st_dev; ar_ino = tmp_stat.st_ino; } } #endif #ifdef __MSDOS__ setmode (archive, O_BINARY); #endif if (reading) { ar_last = ar_block; /* set up for 1st block = # 0 */ findrec (); /* read it in, check for EOF */ if (flag_volhdr) { union record *label; #if 0 char *ptr; if (flag_multivol) { ptr = xmalloc (strlen (flag_volhdr) + 20); sprintf (ptr, "%s Volume %d", flag_volhdr, 1); } else ptr = flag_volhdr; #endif label = findrec (); if (!label) ERROR ((TAREXIT_FAILURE, 0, _("Archive not labelled to match %s"), flag_volhdr)); if (re_match (label_pattern, label->header.arch_name, (int) strlen (label->header.arch_name), 0, 0) < 0) ERROR ((TAREXIT_FAILURE, 0, _("Volume mismatch! %s!=%s"), flag_volhdr, label->header.arch_name)); #if 0 if (strcmp (ptr, label->header.name)) ERROR ((TAREXIT_FAILURE, 0, _("Volume mismatch! %s!=%s"), ptr, label->header.name)); if (ptr != flag_volhdr) free (ptr); #endif } } else if (flag_volhdr) { memset ((void *) ar_block, 0, RECORDSIZE); if (flag_multivol) sprintf (ar_block->header.arch_name, "%s Volume 1", flag_volhdr); else strcpy (ar_block->header.arch_name, flag_volhdr); assign_string (¤t_file_name, ar_block->header.arch_name); ar_block->header.linkflag = LF_VOLHDR; to_oct (time (0), 1 + 12, ar_block->header.mtime); finish_header (ar_block); #if 0 ar_record++; #endif } } /*------------------------------------------------------------------------. | Remember a union record * as pointing to something that we need to keep | | when reading onward in the file. Only one such thing can be remembered | | at once, and it only works when reading an archive. | `------------------------------------------------------------------------*/ /* We calculate "offset" then add it because some compilers end up adding (baserec+ar_record), doing a 9-bit shift of baserec, then subtracting ar_block from that, shifting it back, losing the top 9 bits. */ void saverec (union record **pointer) { long offset; save_rec = pointer; offset = ar_record - ar_block; saved_recno = baserec + offset; } /*--------------------------------------. | Perform a write to flush the buffer. | `--------------------------------------*/ #if 0 send_buffer_to_file (); if (new_volume) { deal_with_new_volume_stuff (); send_buffer_to_file (); } #endif void fl_write (void) { int err; int copy_back; static long bytes_written = 0; if (flag_checkpoint && !(++checkpoint % 10)) WARN ((0, 0, _("Write checkpoint %d"), checkpoint)); if (tape_length && bytes_written >= tape_length * 1024) { errno = ENOSPC; err = 0; } else err = rmtwrite (archive, ar_block->charptr, (unsigned int) blocksize); if (err != blocksize && !flag_multivol) writeerror (err); else if (flag_totals) tot_written += blocksize; if (err > 0) bytes_written += err; if (err == blocksize) { if (flag_multivol) { char *cursor; if (!save_name) { real_s_name[0] = '\0'; real_s_totsize = 0; real_s_sizeleft = 0; return; } cursor = save_name; #ifdef __MSDOS__ if (cursor[1] == ':') cursor += 2; #endif while (*cursor == '/') cursor++; strcpy (real_s_name, cursor); real_s_totsize = save_totsize; real_s_sizeleft = save_sizeleft; } return; } /* We're multivol. Panic if we didn't get the right kind of response. */ /* ENXIO is for the UNIX PC. */ if (err < 0 && errno != ENOSPC && errno != EIO && errno != ENXIO) writeerror (err); /* If error indicates a short write, we just move to the next tape. */ if (new_volume (0) < 0) return; bytes_written = 0; if (flag_volhdr && real_s_name[0]) { copy_back = 2; ar_block -= 2; } else if (flag_volhdr || real_s_name[0]) { copy_back = 1; ar_block--; } else copy_back = 0; if (flag_volhdr) { memset ((void *) ar_block, 0, RECORDSIZE); sprintf (ar_block->header.arch_name, "%s Volume %d", flag_volhdr, volno); to_oct (time (0), 1 + 12, ar_block->header.mtime); ar_block->header.linkflag = LF_VOLHDR; finish_header (ar_block); } if (real_s_name[0]) { int tmp; if (flag_volhdr) ar_block++; memset ((void *) ar_block, 0, RECORDSIZE); strcpy (ar_block->header.arch_name, real_s_name); ar_block->header.linkflag = LF_MULTIVOL; to_oct ((long) real_s_sizeleft, 1 + 12, ar_block->header.size); to_oct ((long) real_s_totsize - real_s_sizeleft, 1 + 12, ar_block->header.offset); tmp = flag_verbose; flag_verbose = 0; finish_header (ar_block); flag_verbose = tmp; if (flag_volhdr) ar_block--; } err = rmtwrite (archive, ar_block->charptr, (unsigned int) blocksize); if (err != blocksize) writeerror (err); else if (flag_totals) tot_written += blocksize; bytes_written = blocksize; if (copy_back) { ar_block += copy_back; memcpy ((void *) ar_record, (void *) (ar_block + blocking - copy_back), (size_t) (copy_back * RECORDSIZE)); ar_record += copy_back; if (real_s_sizeleft >= copy_back * RECORDSIZE) real_s_sizeleft -= copy_back * RECORDSIZE; else if ((real_s_sizeleft + RECORDSIZE - 1) / RECORDSIZE <= copy_back) real_s_name[0] = '\0'; else { char *cursor = save_name; #ifdef __MSDOS__ if (cursor[1] == ':') cursor += 2; #endif while (*cursor == '/') cursor++; strcpy (real_s_name, cursor); real_s_sizeleft = save_sizeleft; real_s_totsize = save_totsize; } copy_back = 0; } } /*---------------------------------------------------------------------. | Handle write errors on the archive. Write errors are always fatal. | | Hitting the end of a volume does not cause a write error unless the | | write was the first block of the volume. | `---------------------------------------------------------------------*/ static void writeerror (int err) { if (err < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot write to %s"), *archive_name_cursor)); else ERROR ((TAREXIT_FAILURE, 0, _("Only wrote %u of %u bytes to %s"), err, blocksize, *archive_name_cursor)); } /*-------------------------------------------------------------------. | Handle read errors on the archive. If the read should be retried, | | readerror() returns to the caller. | `-------------------------------------------------------------------*/ static void readerror (void) { #define READ_ERROR_MAX 10 read_error_flag++; /* tell callers */ WARN ((0, errno, _("Read error on %s"), *archive_name_cursor)); if (baserec == 0) ERROR ((TAREXIT_FAILURE, 0, _("At beginning of tape, quitting now"))); /* Read error in mid archive. We retry up to READ_ERROR_MAX times and then give up on reading the archive. We set read_error_flag for our callers, so they can cope if they want. */ if (r_error_count++ > READ_ERROR_MAX) ERROR ((TAREXIT_FAILURE, 0, _("Too many errors, quitting"))); return; } /*-------------------------------------. | Perform a read to flush the buffer. | `-------------------------------------*/ void fl_read (void) { int err; /* result from system call */ int left; /* bytes left */ char *more; /* pointer to next byte to read */ if (flag_checkpoint && !(++checkpoint % 10)) WARN ((0, 0, _("Read checkpoint %d"), checkpoint)); /* Clear the count of errors. This only applies to a single call to fl_read. We leave read_error_flag alone; it is only turned off by higher level software. */ r_error_count = 0; /* clear error count */ /* If we are about to wipe out a record that somebody needs to keep, copy it out to a holding area and adjust somebody's pointer to it. */ if (save_rec && *save_rec >= ar_record && *save_rec < ar_last) { record_save_area = **save_rec; *save_rec = &record_save_area; } if (write_archive_to_stdout && baserec != 0) { err = rmtwrite (1, ar_block->charptr, (unsigned int) blocksize); if (err != blocksize) writeerror (err); } if (flag_multivol) if (save_name) { if (save_name != real_s_name) { #ifdef __MSDOS__ if (save_name[1] == ':') save_name += 2; #endif while (*save_name == '/') save_name++; strcpy (real_s_name, save_name); save_name = real_s_name; } real_s_totsize = save_totsize; real_s_sizeleft = save_sizeleft; } else { real_s_name[0] = '\0'; real_s_totsize = 0; real_s_sizeleft = 0; } error_loop: err = rmtread (archive, ar_block->charptr, (unsigned int) blocksize); if (err == blocksize) return; if ((err == 0 || (err < 0 && errno == ENOSPC) || (err > 0 && !flag_reblock)) && flag_multivol) { union record *cursor; try_volume: if (new_volume ((command_mode == COMMAND_APPEND || command_mode == COMMAND_CAT || command_mode == COMMAND_UPDATE) ? 2 : 1) < 0) return; vol_error: err = rmtread (archive, ar_block->charptr, (unsigned int) blocksize); if (err < 0) { readerror (); goto vol_error; } if (err != blocksize) goto short_read; cursor = ar_block; if (cursor->header.linkflag == LF_VOLHDR) { if (flag_volhdr) { #if 0 char *ptr; ptr = (char *) xmalloc (strlen (flag_volhdr) + 20); sprintf (ptr, "%s Volume %d", flag_volhdr, volno); #endif if (re_match (label_pattern, cursor->header.arch_name, (int) strlen (cursor->header.arch_name), 0, 0) < 0) { WARN ((0, 0, _("Volume mismatch! %s!=%s"), flag_volhdr, cursor->header.arch_name)); volno--; global_volno--; goto try_volume; } #if 0 if (strcmp (ptr, cursor->header.name)) { WARN ((0, 0, _("Volume mismatch! %s!=%s"), ptr, cursor->header.name)); volno--; global_volno--; free (ptr); goto try_volume; } free (ptr); #endif } if (flag_verbose) fprintf (stdlis, _("Reading %s\n"), cursor->header.arch_name); cursor++; } else if (flag_volhdr) WARN ((0, 0, _("WARNING: No volume header"))); if (real_s_name[0]) { if (cursor->header.linkflag != LF_MULTIVOL || strcmp (cursor->header.arch_name, real_s_name)) { WARN ((0, 0, _("%s is not continued on this volume"), real_s_name)); volno--; global_volno--; goto try_volume; } if (real_s_totsize != (from_oct (1 + 12, cursor->header.size) + from_oct (1 + 12, cursor->header.offset))) { WARN ((0, 0, _("%s is the wrong size (%ld != %ld + %ld)"), cursor->header.arch_name, save_totsize, from_oct (1 + 12, cursor->header.size), from_oct (1 + 12, cursor->header.offset))); volno--; global_volno--; goto try_volume; } if (real_s_totsize - real_s_sizeleft != from_oct (1 + 12, cursor->header.offset)) { WARN ((0, 0, _("This volume is out of sequence"))); volno--; global_volno--; goto try_volume; } cursor++; } ar_record = cursor; return; } else if (err < 0) { readerror (); goto error_loop; /* try again */ } short_read: more = ar_block->charptr + err; left = blocksize - err; again: if ((unsigned) left % RECORDSIZE == 0) { /* FIXME, for size=0, multi vol support. On the first block, warn about the problem. */ if (!flag_reblock && baserec == 0 && flag_verbose && err > 0) WARN ((0, 0, _("Blocksize = %d records"), err / RECORDSIZE)); ar_last = ar_block + ((unsigned) (blocksize - left)) / RECORDSIZE; return; } if (flag_reblock) { /* User warned us about this. Fix up. */ if (left > 0) { error2loop: err = rmtread (archive, more, (unsigned int) left); if (err < 0) { readerror (); goto error2loop; /* try again */ } if (err == 0) ERROR ((TAREXIT_FAILURE, 0, _("Archive %s EOF not on block boundary"), *archive_name_cursor)); left -= err; more += err; goto again; } } else ERROR ((TAREXIT_FAILURE, 0, _("Only read %d bytes from archive %s"), err, *archive_name_cursor)); } /*-----------------------------------------------. | Flush the current buffer to/from the archive. | `-----------------------------------------------*/ void flush_archive (void) { int c; baserec += ar_last - ar_block; /* keep track of block #s */ ar_record = ar_block; /* restore pointer to start */ ar_last = ar_block + blocking; /* restore pointer to end */ if (ar_reading) { if (time_to_start_writing) { time_to_start_writing = 0; ar_reading = 0; if (file_to_switch_to >= 0) { if (c = rmtclose (archive), c < 0) WARN ((0, errno, _("WARNING: Cannot close %s (%d, %d)"), *archive_name_cursor, archive, c)); archive = file_to_switch_to; } else backspace_output (); fl_write (); } else fl_read (); } else { fl_write (); } } /*-------------------------------------------------------------------------. | Backspace the archive descriptor by one blocks worth. If its a tape, | | MTIOCTOP will work. If its something else, we try to seek on it. If we | | can't seek, we lose! | `-------------------------------------------------------------------------*/ static int backspace_output (void) { off_t cur; #if 0 int er; #endif #ifdef MTIOCTOP struct mtop t; t.mt_op = MTBSR; t.mt_count = 1; if (rmtioctl (archive, MTIOCTOP, (char *) &t) >= 0) return 1; if (errno == EIO && rmtioctl (archive, MTIOCTOP, (char *) &t) >= 0) return 1; #endif cur = rmtlseek (archive, 0L, 1); cur -= blocksize; /* Seek back to the beginning of this block and start writing there. */ if (rmtlseek (archive, cur, 0) != cur) { /* Lseek failed. Try a different method. */ WARN ((0, 0, _("\ Could not backspace archive file; it may be unreadable without -i"))); /* Replace the first part of the block with nulls. */ if (ar_block->charptr != output_start) memset (ar_block->charptr, 0, (size_t) (output_start - ar_block->charptr)); return 2; } return 3; } /*-------------------------. | Close the archive file. | `-------------------------*/ void close_archive (void) { int child; WAIT_T status; int c; if (time_to_start_writing || !ar_reading) flush_archive (); if (command_mode == COMMAND_DELETE) { off_t pos; pos = rmtlseek (archive, 0L, 1); #ifndef __MSDOS__ ftruncate (archive, (size_t) pos); #else rmtwrite (archive, "", 0); #endif } if (flag_verify) verify_volume (); if (c = rmtclose (archive), c < 0) WARN ((0, errno, _("WARNING: Cannot close %s (%d, %d)"), *archive_name_cursor, archive, c)); #ifndef __MSDOS__ if (childpid) { /* Loop waiting for the right child to die, or for no more kids. */ while ((child = wait (&status), child != childpid) && child != -1) ; if (child != -1) if (WIFSIGNALED (status) #if 0 && !WIFSTOPPED (status) #endif ) { /* SIGPIPE is OK, everything else is a problem. */ if (WTERMSIG (status) != SIGPIPE) ERROR ((0, 0, _("Child died with signal %d%s"), WTERMSIG (status), WCOREDUMP (status) ? _(" (core dumped)") : "")); } else { /* Child voluntarily terminated -- but why? /bin/sh returns SIGPIPE + 120 if its child, then do nothing. */ if (WEXITSTATUS (status) != (SIGPIPE + 128) && WEXITSTATUS (status)) ERROR ((0, 0, _("Child returned status %d"), WEXITSTATUS (status))); } } #endif /* not __MSDOS__ */ if (current_file_name) free (current_file_name); if (current_link_name) free (current_link_name); if (save_name) free (save_name); free (flag_multivol ? ar_block - 2 : ar_block); } /*------------------------------------------------. | Called to initialize the global volume number. | `------------------------------------------------*/ void init_volume_number (void) { FILE *vf; vf = fopen (flag_volno_file, "r"); if (!vf && errno != ENOENT) ERROR ((0, errno, "%s", flag_volno_file)); if (vf) { fscanf (vf, "%d", &global_volno); fclose (vf); } } /*-------------------------------------------------------. | Called to write out the closing global volume number. | `-------------------------------------------------------*/ void closeout_volume_number (void) { FILE *vf; vf = fopen (flag_volno_file, "w"); if (!vf) ERROR ((0, errno, "%s", flag_volno_file)); else { fprintf (vf, "%d\n", global_volno); fclose (vf); } } /*---------------------------------------------------------------------. | We've hit the end of the old volume. Close it and open the next one | | Values for type: 0: writing 1: reading 2: updating | `---------------------------------------------------------------------*/ static int new_volume (int type) { int c; char inbuf[80]; const char *p; static FILE *read_file = 0; static int looped = 0; WAIT_T status; if (!read_file && !flag_run_script_at_end) read_file = (archive == 0) ? fopen (TTY_NAME, "r") : stdin; if (now_verifying) return -1; if (flag_verify) verify_volume (); if (c = rmtclose (archive), c < 0) WARN ((0, errno, _("WARNING: Cannot close %s (%d, %d)"), *archive_name_cursor, archive, c)); global_volno++; volno++; archive_name_cursor++; if (archive_name_cursor == archive_name_array + archive_names) { archive_name_cursor = archive_name_array; looped = 1; } tryagain: if (looped) { /* We have to prompt from now on. */ if (flag_run_script_at_end) { closeout_volume_number (); system (info_script); } else while (1) { fprintf (stdlis, _("\007Prepare volume #%d for %s and hit return: "), global_volno, *archive_name_cursor); fflush (stdlis); if (fgets (inbuf, sizeof (inbuf), read_file) == 0) { fprintf (stdlis, _("EOF? What does that mean?")); if (command_mode != COMMAND_EXTRACT && command_mode != COMMAND_LIST && command_mode != COMMAND_DIFF) WARN ((0, 0, _("WARNING: Archive is incomplete"))); exit (TAREXIT_FAILURE); } if (inbuf[0] == '\n' || inbuf[0] == 'y' || inbuf[0] == 'Y') break; switch (inbuf[0]) { case '?': { fprintf (stdlis, _("\ n [name] Give a new filename for the next (and subsequent) volume(s)\n\ q Abort tar\n\ ! Spawn a subshell\n\ ? Print this list\n")); } break; case 'q': /* quit */ fprintf (stdlis, _("No new volume; exiting.\n")); if (command_mode != COMMAND_EXTRACT && command_mode != COMMAND_LIST && command_mode != COMMAND_DIFF) WARN ((0, 0, _("WARNING: Archive is incomplete"))); exit (TAREXIT_FAILURE); case 'n': /* get new file name */ { char *q, *r; for (q = &inbuf[1]; *q == ' ' || *q == '\t'; q++) ; for (r = q; *r; r++) if (*r == '\n') *r = '\0'; r = (char *) xmalloc ((size_t) (strlen (q) + 2)); strcpy (r, q); p = r; *archive_name_cursor = p; } break; case '!': #ifdef __MSDOS__ spawnl (P_WAIT, getenv ("COMSPEC"), "-", 0); #else switch (fork ()) { case -1: WARN ((0, errno, _("Cannot fork!"))); break; case 0: p = getenv ("SHELL"); if (p == 0) p = "/bin/sh"; execlp (p, "-sh", "-i", 0); /* In a previous tar version, _exit was used here instead of exit. */ ERROR ((TAREXIT_FAILURE, errno, _("Cannot exec a shell %s"), p)); default: wait (&status); break; } /* FIXME: I'm not sure if that's all that has to be done here. (jk) */ #endif break; } } } if (type == 2 || flag_verify) archive = rmtopen (*archive_name_cursor, O_RDWR | O_CREAT, 0666, flag_rsh_command); else if (type == 1) archive = rmtopen (*archive_name_cursor, O_RDONLY, 0666, flag_rsh_command); else if (type == 0) archive = rmtcreat (*archive_name_cursor, 0666, flag_rsh_command); else archive = -1; if (archive < 0) { WARN ((0, errno, _("Cannot open %s"), *archive_name_cursor)); goto tryagain; } #ifdef __MSDOS__ setmode (archive, O_BINARY); #endif return 0; } /*-------------------------------------------------------------------------. | This is a useless function that takes a buffer returned by wantbytes and | | does nothing with it. If the function called by wantbytes returns an | | error indicator (non-zero), this function is called for the rest of the | | file. | `-------------------------------------------------------------------------*/ /* Yes, I know. SIZE and DATA are unused in this function, and this might even trigger some compiler warnings. That's OK! Relax. */ int no_op (int size, char *data) { return 0; } /*-----------------------------------------------------------------------. | Some other routine wants SIZE bytes in the archive. For each chunk of | | the archive, call FUNC with the size of the chunk, and the address of | | the chunk it can work with. | `-----------------------------------------------------------------------*/ int wantbytes (long size, int (*func) ()) { char *data; long data_size; if (flag_multivol) save_sizeleft = size; while (size) { data = findrec ()->charptr; if (data == NULL) { /* Check it. */ ERROR ((0, 0, _("Unexpected EOF on archive file"))); return -1; } data_size = endofrecs ()->charptr - data; if (data_size > size) data_size = size; if ((*func) (data_size, data)) func = no_op; userec ((union record *) (data + data_size - 1)); size -= data_size; if (flag_multivol) save_sizeleft -= data_size; } return 0; } tar-1.11.8/src/create.c 644 625 1 103045 5770642075 7652 /* Create a tar archive. Copyright (C) 1985, 1992, 1993, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Create a tar archive. Written 25 Aug 1985 by John Gilmore. */ #include "system.h" #ifndef __MSDOS__ #include #include #endif #ifdef HAVE_UTIME_H #include #else struct utimbuf { long actime; long modtime; }; #endif #include "tar.h" extern struct stat hstat; /* stat struct corresponding */ #ifndef __MSDOS__ extern dev_t ar_dev; extern ino_t ar_ino; #endif /* JF */ extern struct name *gnu_list_name; /* If there are no symbolic links, there is no lstat(). Use stat(). */ #ifndef S_ISLNK #define lstat stat #endif /* This module is the only one that cares about `struct link's. */ struct link { struct link *next; dev_t dev; ino_t ino; short linkcount; char name[1]; }; struct link *linklist; /* points to first link in list */ /*-------------------------------------------------------------------------. | Quick and dirty octal conversion. Converts long "value" into a | | "digs"-digit field at "where", including a trailing space and room for a | | null. "digs"==3 means 1 digit, a space, and room for a null. | | | | We assume the trailing null is already there and don't fill it in. This | | fact is used by start_header and finish_header, so don't change it! | `-------------------------------------------------------------------------*/ /* This should be equivalent to: sprintf (where, "%*lo ", digs-2, value); except that sprintf fills in the trailing null and we don't. */ void to_oct (register long value, register int digs, register char *where) { --digs; /* Trailing null slot is left alone */ where[--digs] = ' '; /* put in the space, though */ /* Produce the digits -- at least one. */ do { where[--digs] = '0' + (char) (value & 7); /* one octal digit */ value >>= 3; } while (digs > 0 && value != 0); /* Leading spaces, if necessary. */ while (digs > 0) where[--digs] = ' '; } /* Writing routines. */ /*-----------------------------------------------------------------------. | Just zeroes out the buffer so we don't confuse ourselves with leftover | | data. | `-----------------------------------------------------------------------*/ static void clear_buffer (char *buf) { register int i; for (i = 0; i < RECORDSIZE; i++) buf[i] = '\0'; } /*------------------------------------------------------------------------. | Write the EOT record(s). We actually zero at least one record, through | | the end of the block. Old tar writes garbage after two zeroed records | | -- and PDtar used to. | `------------------------------------------------------------------------*/ void write_eot (void) { union record *p; int bufsize; p = findrec (); if (p) { bufsize = endofrecs ()->charptr - p->charptr; memset (p->charptr, 0, (size_t) bufsize); userec (p); } } /*--------------------------------------------. | Write a LF_LONGLINK or LF_LONGNAME record. | `--------------------------------------------*/ /* FIXME: Cross recursion between start_header and write_long! */ static union record *start_header __P ((const char *, register struct stat *)); #if 0 static void write_long (const char *, char); #endif static void write_long (const char *p, char type) { int size = strlen (p) + 1; int bufsize; union record *header; struct stat foo; memset (&foo, 0, sizeof foo); foo.st_size = size; header = start_header ("././@LongLink", &foo); header->header.linkflag = type; finish_header (header); header = findrec (); bufsize = endofrecs ()->charptr - header->charptr; while (bufsize < size) { memcpy (header->charptr, p, (size_t) bufsize); p += bufsize; size -= bufsize; userec (header + (bufsize - 1) / RECORDSIZE); header = findrec (); bufsize = endofrecs ()->charptr - header->charptr; } memcpy (header->charptr, p, (size_t) size); memset (header->charptr + size, 0, (size_t) (bufsize - size)); userec (header + (size - 1) / RECORDSIZE); } /* Header handling. */ /*---------------------------------------------------------------------. | Make a header block for the file name whose stat info is st. Return | | header pointer for success, NULL if the name is too long. | `---------------------------------------------------------------------*/ static union record * start_header (const char *name, register struct stat *st) { register union record *header; if (strlen (name) >= (size_t) NAMSIZ) write_long (name, LF_LONGNAME); header = (union record *) findrec (); memset (header->charptr, 0, sizeof (*header)); /* FIXME: speed up */ /* Check the file name and put it in the record. */ if (!flag_absolute_names) { static int warned_once = 0; #ifdef __MSDOS__ if (name[1] == ':') { name += 2; if (!warned_once++) WARN ((0, 0, _("Removing drive spec from names in the archive"))); } #endif while (*name == '/') { name++; /* force relative path */ if (!warned_once++) WARN ((0, 0, _("\ Removing leading / from absolute path names in the archive"))); } } assign_string (¤t_file_name, name); strncpy (header->header.arch_name, name, NAMSIZ); header->header.arch_name[NAMSIZ - 1] = '\0'; /* Paul Eggert tried the trivial test ($WRITER cf a b; $READER tvf a) for a few tars and came up with the following interoperability matrix: WRITER 1 2 3 4 5 6 7 8 9 READER . . . . . . . . . 1 = SunOS 4.2 tar # . . # # . . # # 2 = NEC SVR4.0.2 tar . . . # # . . # . 3 = Solaris 2.1 tar . . . . . . . . . 4 = GNU tar 1.11.1 . . . . . . . . . 5 = HP-UX 8.07 tar . . . . . . . . . 6 = Ultrix 4.1 . . . . . . . . . 7 = AIX 3.2 . . . . . . . . . 8 = Hitachi HI-UX 1.03 . . . . . . . . . 9 = Omron UNIOS-B 4.3BSD 1.60Beta . = works # = ``impossible file type'' The following mask for old archive removes the `#'s in column 4 above, thus making GNU tar both a universal donor and a universal acceptor for Paul's test. */ to_oct ((long) (flag_oldarch ? (st->st_mode & 07777) : st->st_mode), 8, header->header.mode); to_oct ((long) st->st_uid, 8, header->header.uid); to_oct ((long) st->st_gid, 8, header->header.gid); to_oct ((long) st->st_size, 1 + 12, header->header.size); to_oct ((long) st->st_mtime, 1 + 12, header->header.mtime); /* header->header.linkflag is left as null. */ if (flag_gnudump) { to_oct ((long) st->st_atime, 1 + 12, header->header.atime); to_oct ((long) st->st_ctime, 1 + 12, header->header.ctime); } #ifndef NONAMES /* Fill in new Unix Standard fields if desired. */ if (flag_standard) { header->header.linkflag = LF_NORMAL; /* new default */ strcpy (header->header.magic, TMAGIC); /* mark as Unix Std */ finduname (header->header.uname, st->st_uid); findgname (header->header.gname, st->st_gid); } #endif return header; } /*-------------------------------------------------------------------------. | Finish off a filled-in header block and write it out. We also print the | | file name and/or full info if verbose is on. | `-------------------------------------------------------------------------*/ void finish_header (register union record *header) { register int i, sum; register char *p; memcpy (header->header.chksum, CHKBLANKS, sizeof (header->header.chksum)); sum = 0; p = header->charptr; for (i = sizeof (*header); --i >= 0; ) /* We can't use unsigned char here because of old compilers, e.g. V7. */ sum += 0xFF & *p++; /* Fill in the checksum field. It's formatted differently from the other fields: it has [6] digits, a null, then a space -- rather than digits, a space, then a null. We use to_oct then write the null in over to_oct's space. The final space is already there, from checksumming, and to_oct doesn't modify it. This is a fast way to do: sprintf(header->header.chksum, "%6o", sum); */ to_oct ((long) sum, 8, header->header.chksum); header->header.chksum[6] = '\0'; /* zap the space */ userec (header); if (flag_verbose) { /* These globals are parameters to print_header, sigh. */ head = header; /* hstat is already set up. */ head_standard = flag_standard; print_header (); } return; } /* Sparse file processing. */ /*---------------------------------------------------------------------. | Takes a recordful of data and basically cruises through it to see if | | it's made *entirely* of zeros, returning a 0 the instant it finds | | something that is a non-zero, i.e., useful data. | `---------------------------------------------------------------------*/ static int zero_record (char *buffer) { register int i; for (i = 0; i < RECORDSIZE; i++) if (buffer[i] != '\0') return 0; return 1; } /*---. | ? | `---*/ static void init_sparsearray (void) { register int i; sp_array_size = 10; /* Make room for our scratch space -- initially is 10 elts long. */ sparsearray = (struct sp_array *) xmalloc (sp_array_size * sizeof (struct sp_array)); for (i = 0; i < sp_array_size; i++) { sparsearray[i].offset = 0; sparsearray[i].numbytes = 0; } } /*---. | ? | `---*/ static void find_new_file_size (int *filesize, int highest_index) { register int i; *filesize = 0; for (i = 0; sparsearray[i].numbytes && i <= highest_index; i++) *filesize += sparsearray[i].numbytes; } /*-------------------------------------------------------------------------. | Okay, we've got a sparse file on our hands -- now, what we need to do is | | make a pass through the file and carefully note where any data is, i.e., | | we want to find how far into the file each instance of data is, and how | | many bytes are there. We store this information in the sparsearray, | | which will later be translated into header information. For now, we use | | the sparsearray as convenient storage. | `-------------------------------------------------------------------------*/ /* As a side note, this routine is a mess. If I could have found a cleaner way to do it, I would have. If anyone wants to find a nicer way to do this, feel free. There is little point in trimming small amounts of null data at the head and tail of blocks -- it's ok if we only avoid dumping blocks of complete null data. */ static int deal_with_sparse (char *name, union record *header) { long numbytes = 0; long offset = 0; #if 0 long save_offset; #endif int fd; #if 0 int current_size = hstat.st_size; #endif int sparse_ind = 0, cc; char buf[RECORDSIZE]; #if 0 int read_last_data = 0; /* did we just read the last record? */ #endif int amidst_data = 0; header->header.isextended = 0; /* Cannot open the file -- this problem will be caught later on, so just return. */ if (fd = open (name, O_RDONLY), fd < 0) return 0; init_sparsearray (); clear_buffer (buf); while (cc = read (fd, buf, sizeof buf), cc != 0) { if (sparse_ind > sp_array_size - 1) { /* Realloc the scratch area, since we've run out of room. */ sparsearray = (struct sp_array *) xrealloc (sparsearray, 2 * sp_array_size * sizeof (struct sp_array)); sp_array_size *= 2; } if (cc == sizeof buf) { if (zero_record (buf)) { if (amidst_data) { sparsearray[sparse_ind++].numbytes = numbytes; amidst_data = 0; } } else if (amidst_data) numbytes += cc; else { amidst_data = 1; numbytes = cc; sparsearray[sparse_ind].offset = offset; } } else if (cc < sizeof buf) { /* This has to be the last bit of the file, so this is somewhat shorter than the above. */ if (!zero_record (buf)) { if (amidst_data) numbytes += cc; else { amidst_data = 1; numbytes = cc; sparsearray[sparse_ind].offset = offset; } } } offset += cc; clear_buffer (buf); } if (amidst_data) sparsearray[sparse_ind++].numbytes = numbytes; else { sparsearray[sparse_ind].offset = offset - 1; sparsearray[sparse_ind++].numbytes = 1; } close (fd); return sparse_ind - 1; } /*---. | ? | `---*/ static int finish_sparse_file (int fd, long *sizeleft, long fullsize, char *name) { union record *start; char tempbuf[RECORDSIZE]; int bufsize, sparse_ind = 0, count; long pos; long nwritten = 0; while (*sizeleft > 0) { start = findrec (); memset (start->charptr, 0, RECORDSIZE); bufsize = sparsearray[sparse_ind].numbytes; if (!bufsize) { /* We blew it, maybe. */ ERROR ((0, 0, _("Wrote %ld of %ld bytes to file %s"), fullsize - *sizeleft, fullsize, name)); break; } pos = lseek (fd, sparsearray[sparse_ind++].offset, 0); /* If the number of bytes to be written here exceeds the size of the temporary buffer, do it in steps. */ while (bufsize > RECORDSIZE) { #if 0 if (amt_read) { count = read (fd, start->charptr+amt_read, RECORDSIZE-amt_read); bufsize -= RECORDSIZE - amt_read; amt_read = 0; userec (start); start = findrec (); memset (start->charptr, 0, RECORDSIZE); } #endif /* Store the data. */ count = read (fd, start->charptr, RECORDSIZE); if (count < 0) { ERROR ((0, errno, _("\ Read error at byte %ld, reading %d bytes, in file %s"), fullsize - *sizeleft, bufsize, name)); return 1; } bufsize -= count; *sizeleft -= count; userec (start); nwritten += RECORDSIZE; /* FIXME */ start = findrec (); memset (start->charptr, 0, RECORDSIZE); } clear_buffer (tempbuf); count = read (fd, tempbuf, (size_t) bufsize); memcpy (start->charptr, tempbuf, RECORDSIZE); if (count < 0) { ERROR ((0, errno, _("Read error at byte %ld, reading %d bytes, in file %s"), fullsize - *sizeleft, bufsize, name)); return 1; } #if 0 if (amt_read >= RECORDSIZE) { amt_read = 0; userec (start + (count - 1) / RECORDSIZE); if (count != bufsize) { ERROR ((0, 0, _("File %s shrunk by %d bytes, padding with zeros"), name, sizeleft)); return 1; } start = findrec (); } else amt_read += bufsize; #endif nwritten += count; /* FIXME */ *sizeleft -= count; userec (start); } free (sparsearray); #if 0 printf (_("Amount actually written is (I hope) %d.\n"), nwritten); userec (start + (count - 1) / RECORDSIZE); #endif return 0; } /* Main functions of this module. */ /*---. | ? | `---*/ void create_archive (void) { register char *p; open_archive (0); /* open for writing */ if (flag_gnudump) { char *buf = xmalloc (PATH_MAX); char *q, *bufp; collect_and_sort_names (); while (p = name_from_list (), p) dump_file (p, -1, 1); #if 0 if (!flag_dironly) { #endif blank_name_list (); while (p = name_from_list (), p) { strcpy (buf, p); if (p[strlen (p) - 1] != '/') strcat (buf, "/"); bufp = buf + strlen (buf); for (q = gnu_list_name->dir_contents; q && *q; q += strlen (q) + 1) { if (*q == 'Y') { strcpy (bufp, q + 1); dump_file (buf, -1, 1); } } } #if 0 } #endif free (buf); } else { while (p = name_next (1), p) dump_file (p, -1, 1); } write_eot (); close_archive (); if (flag_gnudump && gnu_dumpfile) write_dir_file (); name_close (); } /*-------------------------------------------------------------------------. | Dump a single file. If it's a directory, recurse. Result is 1 for | | success, 0 for failure. Sets global "hstat" to stat() output for this | | file. P is file name to dump. CURDEV is device our parent dir was on. | | TOPLEVEL tells wether we are a toplevel call. | `-------------------------------------------------------------------------*/ void dump_file (char *p, int curdev, int toplevel) { union record *header; char type; union record *exhdr; char save_linkflag; int critical_error = 0; struct utimbuf restore_times; #if 0 int sparse_ind = 0; #endif /* FIXME: `header' might be used uninitialized in this function. Reported by Bruno Haible. */ /* FIXME: `upperbound' might be used uninitialized in this function. Reported by Bruno Haible. */ if (flag_confirm && !confirm ("add", p)) return; /* Use stat if following (rather than dumping) 4.2BSD's symbolic links. Otherwise, use lstat (which, on non-4.2 systems, is #define'd to stat anyway. */ #ifdef STX_HIDDEN /* AIX */ if (flag_follow_links != 0 ? statx (p, &hstat, STATSIZE, STX_HIDDEN) : statx (p, &hstat, STATSIZE, STX_HIDDEN | STX_LINK)) #else if (flag_follow_links != 0 ? stat (p, &hstat) : lstat (p, &hstat)) #endif { badperror: WARN ((0, errno, _("Cannot add file %s"), p)); /* Fall through. */ badfile: if (!flag_ignore_failed_read || critical_error) exit_status = TAREXIT_FAILURE; return; } restore_times.actime = hstat.st_atime; restore_times.modtime = hstat.st_mtime; #ifdef S_ISHIDDEN if (S_ISHIDDEN (hstat.st_mode)) { char *new = (char *) alloca (strlen (p) + 2); if (new) { strcpy (new, p); strcat (new, "@"); p = new; } } #endif /* See if we only want new files, and check if this one is too old to put in the archive. */ if (flag_new_files && !flag_gnudump && new_time > hstat.st_mtime && !S_ISDIR (hstat.st_mode) && (flag_new_files > 1 || new_time > hstat.st_ctime)) { if (curdev == -1) WARN ((0, 0, _("%s: is unchanged; not dumped"), p)); return; } #ifndef __MSDOS__ /* See if we are trying to dump the archive. */ if (ar_dev && hstat.st_dev == ar_dev && hstat.st_ino == ar_ino) { WARN ((0, 0, _("%s is the archive; not dumped"), p)); return; } #endif /* Check for multiple links. We maintain a list of all such files that we've written so far. Any time we see another, we check the list and avoid dumping the data again if we've done it once already. */ if (hstat.st_nlink > 1 && (S_ISREG (hstat.st_mode) #ifdef S_ISCTG || S_ISCTG (hstat.st_mode) #endif #ifdef S_ISCHR || S_ISCHR (hstat.st_mode) #endif #ifdef S_ISBLK || S_ISBLK (hstat.st_mode) #endif #ifdef S_ISFIFO || S_ISFIFO (hstat.st_mode) #endif )) { register struct link *lp; /* First quick and dirty. Hashing, etc later. FIXME. */ for (lp = linklist; lp; lp = lp->next) if (lp->ino == hstat.st_ino && lp->dev == hstat.st_dev) { char *link_name = lp->name; /* We found a link. */ while (!flag_absolute_names && *link_name == '/') { static int link_warn = 0; if (!link_warn) { WARN ((0, 0, _("Removing leading / from absolute links"))); link_warn++; } link_name++; } if (link_name - lp->name >= NAMSIZ) write_long (link_name, LF_LONGLINK); assign_string (¤t_link_name, link_name); hstat.st_size = 0; header = start_header (p, &hstat); if (header == NULL) { critical_error = 1; goto badfile; } strncpy (header->header.arch_linkname, link_name, NAMSIZ); /* Force null truncated. */ header->header.arch_linkname[NAMSIZ - 1] = 0; header->header.linkflag = LF_LINK; finish_header (header); /* FIXME: Maybe remove from list after all links found? */ if (flag_remove_files) { if (unlink (p) == -1) ERROR ((0, errno, _("Cannot remove %s"), p)); } return; /* we dumped it */ } /* Not found. Add it to the list of possible links. */ lp = (struct link *) xmalloc ((size_t) (sizeof (struct link) + strlen (p))); lp->ino = hstat.st_ino; lp->dev = hstat.st_dev; strcpy (lp->name, p); lp->next = linklist; linklist = lp; } /* This is not a link to a previously dumped file, so dump it. */ if (S_ISREG (hstat.st_mode) #ifdef S_ISCTG || S_ISCTG (hstat.st_mode) #endif ) { int f; /* file descriptor */ long bufsize, count; long sizeleft; register union record *start; int header_moved; char isextended = 0; int upperbound; #if 0 int end_nulls = 0; #endif #if 0 static int cried_once = 0; #endif header_moved = 0; if (flag_sparse_files) { /* Check the size of the file against the number of blocks allocated for it, counting both data and indirect blocks. If there is a smaller number of blocks that would be necessary to accommodate a file of this size, this is safe to say that we have a sparse file: at least one of those records in the file is just a useless hole. For sparse files not having more hole blocks than indirect blocks, the sparseness will go undetected. */ /* tar.h defines ST_NBLOCKS in term of 512 byte sectors, even for HP-UX's which count in 1024 byte units and AIX's which count in 4096 byte units. So this should work... */ /* Bruno Haible sent me these statistics for Linux. It seems that some filesystems count indirect blocks in st_blocks, while others do not seem to: minix-fs tar: size=7205, st_blocks=18 and ST_NBLOCKS=18 extfs tar: size=7205, st_blocks=18 and ST_NBLOCKS=18 ext2fs tar: size=7205, st_blocks=16 and ST_NBLOCKS=16 msdos-fs tar: size=7205, st_blocks=16 and ST_NBLOCKS=16 */ if (hstat.st_size > ST_NBLOCKS (hstat) * RECORDSIZE) { int filesize = hstat.st_size; register int i; header = start_header (p, &hstat); if (header == NULL) { critical_error = 1; goto badfile; } header->header.linkflag = LF_SPARSE; header_moved++; /* Call the routine that figures out the layout of the sparse file in question. UPPERBOUND is the index of the last element of the "sparsearray," i.e., the number of elements it needed to describe the file. */ upperbound = deal_with_sparse (p, header); /* See if we'll need an extended header later. */ if (upperbound > SPARSE_IN_HDR - 1) header->header.isextended++; /* We store the "real" file size so we can show that in case someone wants to list the archive, i.e., tar tvf . It might be kind of disconcerting if the shrunken file size was the one that showed up. */ to_oct ((long) hstat.st_size, 1 + 12, header->header.realsize); /* This will be the new "size" of the file, i.e., the size of the file minus the records of holes that we're skipping over. */ find_new_file_size (&filesize, upperbound); hstat.st_size = filesize; to_oct ((long) filesize, 1 + 12, header->header.size); #if 0 to_oct ((long) end_nulls, 1 + 12, header->header.ending_blanks); #endif for (i = 0; i < SPARSE_IN_HDR; i++) { if (!sparsearray[i].numbytes) break; to_oct (sparsearray[i].offset, 1 + 12, header->header.sp[i].offset); to_oct (sparsearray[i].numbytes, 1 + 12, header->header.sp[i].numbytes); } } } else upperbound = SPARSE_IN_HDR - 1; sizeleft = hstat.st_size; /* Don't bother opening empty, world readable files. */ if (sizeleft > 0 || 0444 != (0444 & hstat.st_mode)) { f = open (p, O_RDONLY | O_BINARY); if (f < 0) goto badperror; } else f = -1; /* If the file is sparse, we've already taken care of this. */ if (!header_moved) { header = start_header (p, &hstat); if (header == NULL) { if (f >= 0) close (f); critical_error = 1; goto badfile; } } #ifdef S_ISCTG /* Mark contiguous files, if we support them. */ if (flag_standard && S_ISCTG (hstat.st_mode)) header->header.linkflag = LF_CONTIG; #endif isextended = header->header.isextended; save_linkflag = header->header.linkflag; finish_header (header); if (isextended) { #if 0 int sum = 0; #endif register int i; #if 0 register union record *exhdr; int arraybound = SPARSE_EXT_HDR; #endif /* static */ int index_offset = SPARSE_IN_HDR; extend: exhdr = findrec (); if (exhdr == NULL) { critical_error = 1; goto badfile; } memset (exhdr->charptr, 0, RECORDSIZE); for (i = 0; i < SPARSE_EXT_HDR; i++) { if (i + index_offset > upperbound) break; to_oct ((long) sparsearray[i + index_offset].numbytes, 1 + 12, exhdr->ext_hdr.sp[i].numbytes); to_oct ((long) sparsearray[i + index_offset].offset, 1 + 12, exhdr->ext_hdr.sp[i].offset); } userec (exhdr); #if 0 sum += i; if (sum < upperbound) goto extend; #endif if (index_offset + i <= upperbound) { index_offset += i; exhdr->ext_hdr.isextended++; goto extend; } } if (save_linkflag == LF_SPARSE) { if (finish_sparse_file (f, &sizeleft, hstat.st_size, p)) goto padit; } else while (sizeleft > 0) { if (flag_multivol) { assign_string (&save_name, p); save_sizeleft = sizeleft; save_totsize = hstat.st_size; } start = findrec (); bufsize = endofrecs ()->charptr - start->charptr; if (sizeleft < bufsize) { /* Last read -- zero out area beyond. */ bufsize = (int) sizeleft; count = bufsize % RECORDSIZE; if (count) memset (start->charptr + sizeleft, 0, (size_t) (RECORDSIZE - count)); } count = read (f, start->charptr, (size_t) bufsize); if (count < 0) { ERROR ((0, errno, _("\ Read error at byte %ld, reading %d bytes, in file %s"), hstat.st_size - sizeleft, bufsize, p)); goto padit; } sizeleft -= count; /* This is nonportable (the type of userec's arg). */ userec (start + (count - 1) / RECORDSIZE); if (count == bufsize) continue; ERROR ((0, 0, _("File %s shrunk by %d bytes, padding with zeros"), p, sizeleft)); goto padit; /* short read */ } if (flag_multivol) assign_string (&save_name, NULL); if (f >= 0) close (f); if (flag_remove_files) { if (unlink (p) == -1) ERROR ((0, errno, _("Cannot remove %s"), p)); } if (flag_atime_preserve) utime (p, &restore_times); return; /* File shrunk or gave error, pad out tape to match the size we specified in the header. */ padit: while (sizeleft > 0) { save_sizeleft = sizeleft; start = findrec (); memset (start->charptr, 0, RECORDSIZE); userec (start); sizeleft -= RECORDSIZE; } if (flag_multivol) assign_string (&save_name, NULL); if (f >= 0) close (f); if (flag_atime_preserve) utime (p, &restore_times); return; } #ifdef S_ISLNK else if (S_ISLNK (hstat.st_mode)) { int size; char *buf = (char *) alloca (PATH_MAX + 1); size = readlink (p, buf, PATH_MAX + 1); if (size < 0) goto badperror; buf[size] = '\0'; if (size >= NAMSIZ) write_long (buf, LF_LONGLINK); assign_string (¤t_link_name, buf); hstat.st_size = 0; /* force 0 size on symlink */ header = start_header (p, &hstat); if (header == NULL) { critical_error = 1; goto badfile; } strncpy (header->header.arch_linkname, buf, NAMSIZ); header->header.arch_linkname[NAMSIZ - 1] = '\0'; header->header.linkflag = LF_SYMLINK; finish_header (header); /* nothing more to do to it */ if (flag_remove_files) { if (unlink (p) == -1) ERROR ((0, errno, _("Cannot remove %s"), p)); } return; } #endif /* S_ISLNK */ else if (S_ISDIR (hstat.st_mode)) { register DIR *dirp; register struct dirent *d; char *namebuf; int buflen; register int len; int our_device = hstat.st_dev; /* Build new prototype name. */ len = strlen (p); buflen = len + NAMSIZ; namebuf = xmalloc ((size_t) (buflen + 1)); strncpy (namebuf, p, (size_t) buflen); while (len >= 1 && namebuf[len - 1] == '/') len--; /* delete trailing slashes */ namebuf[len++] = '/'; /* now add exactly one back */ namebuf[len] = '\0'; /* make sure null-terminated */ /* Output directory header record with permissions FIXME, do this AFTER files, to avoid R/O dir problems? If old archive format, don't write record at all. */ if (!flag_oldarch) { hstat.st_size = 0; /* force 0 size on dir */ /* If people could really read standard archives, this should be: (FIXME) header = start_header (flag_standard ? p : namebuf, &hstat); but since they'd interpret LF_DIR records as regular files, we'd better put the / on the name. */ header = start_header (namebuf, &hstat); if (header == NULL) { critical_error = 1; goto badfile; /* eg name too long */ } if (flag_gnudump) header->header.linkflag = LF_DUMPDIR; else if (flag_standard) header->header.linkflag = LF_DIR; /* If we're gnudumping, we aren't done yet so don't close it. */ if (!flag_gnudump) finish_header (header); /* done with directory header */ } if (flag_gnudump && gnu_list_name->dir_contents) { int sizeleft; int totsize; int bufsize; union record *start; int count; char *buf, *p_buf; buf = gnu_list_name->dir_contents; /* FOO */ totsize = 0; for (p_buf = buf; p_buf && *p_buf;) { int tmp; tmp = strlen (p_buf) + 1; totsize += tmp; p_buf += tmp; } totsize++; to_oct ((long) totsize, 1 + 12, header->header.size); finish_header (header); p_buf = buf; sizeleft = totsize; while (sizeleft > 0) { if (flag_multivol) { assign_string (&save_name, p); save_sizeleft = sizeleft; save_totsize = totsize; } start = findrec (); bufsize = endofrecs ()->charptr - start->charptr; if (sizeleft < bufsize) { bufsize = sizeleft; count = bufsize % RECORDSIZE; if (count) memset (start->charptr + sizeleft, 0, (size_t) (RECORDSIZE - count)); } memcpy (start->charptr, p_buf, (size_t) bufsize); sizeleft -= bufsize; p_buf += bufsize; userec (start + (bufsize - 1) / RECORDSIZE); } if (flag_multivol) assign_string (&save_name, NULL); if (flag_atime_preserve) utime (p, &restore_times); return; } /* Now output all the files in the directory. */ #if 0 if (flag_dironly) return; /* unless the cmdline said not to */ #endif /* See if we are crossing from one file system to another, and avoid doing so if the user only wants to dump one file system. */ if (flag_local_filesys && !toplevel && curdev != hstat.st_dev) { if (flag_verbose) WARN ((0, 0, _("%s: On a different filesystem; not dumped"), p)); return; } errno = 0; dirp = opendir (p); if (!dirp) { ERROR ((0, errno, _("Cannot open directory %s"), p)); return; } /* Hack to remove "./" from the front of all the file names. */ if (len == 2 && namebuf[0] == '.' && namebuf[1] == '/') len = 0; /* Should speed this up by cd-ing into the dir, FIXME. */ while (d = readdir (dirp), d) { /* Skip `.' and `..'. */ if (is_dot_or_dotdot (d->d_name)) continue; if ((int) NAMLEN (d) + len >= buflen) { buflen = len + NAMLEN (d); namebuf = (char *) xrealloc (namebuf, (size_t) (buflen + 1)); #if 0 namebuf[len] = '\0'; ERROR ((0, 0, _("File name %s%s too long"), namebuf, d->d_name)); continue; #endif } strcpy (namebuf + len, d->d_name); if (flag_exclude && check_exclude (namebuf)) continue; dump_file (namebuf, our_device, 0); } closedir (dirp); free (namebuf); if (flag_atime_preserve) utime (p, &restore_times); return; } #ifdef S_ISCHR else if (S_ISCHR (hstat.st_mode)) type = LF_CHR; #endif #ifdef S_ISBLK else if (S_ISBLK (hstat.st_mode)) type = LF_BLK; #endif /* Avoid screwy apollo lossage where S_IFIFO == S_IFSOCK. */ #if (_ISP__M68K == 0) && (_ISP__A88K == 0) && defined(S_ISFIFO) else if (S_ISFIFO (hstat.st_mode)) type = LF_FIFO; #endif #ifdef S_ISSOCK else if (S_ISSOCK (hstat.st_mode)) type = LF_FIFO; #endif else goto unknown; if (!flag_standard) goto unknown; hstat.st_size = 0; /* force 0 size */ header = start_header (p, &hstat); if (header == NULL) { critical_error = 1; goto badfile; /* eg name too long */ } header->header.linkflag = type; #if defined(S_IFBLK) || defined(S_IFCHR) if (type != LF_FIFO) { to_oct ((long) major (hstat.st_rdev), 8, header->header.devmajor); to_oct ((long) minor (hstat.st_rdev), 8, header->header.devminor); } #endif finish_header (header); if (flag_remove_files) { if (unlink (p) == -1) ERROR ((0, errno, _("Cannot remove %s"), p)); } return; unknown: ERROR ((0, 0, _("%s: Unknown file type; file ignored"), p)); } tar-1.11.8/src/diffarch.c 644 625 1 42417 5766571061 10143 /* Diff files from a tar archive. Copyright (C) 1988, 1992, 1993, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Diff files from a tar archive. Written 30 April 1987 by John Gilmore. */ #include "system.h" #ifndef S_ISLNK #define lstat stat #endif #include "tar.h" #include "rmt.h" static int compare_chunk __P ((long, char *)); static int compare_dir __P ((long, char *)); static void diff_sparse_files __P ((int)); static int do_stat __P ((struct stat *)); static void fill_in_sparse_array __P ((void)); int now_verifying = 0; /* are we verifying at the moment? */ /* Four tried statics! */ static int diff_fd; /* descriptor of file we're diffing */ static char *diff_buf = 0; /* pointer to area for reading file contents into */ static char *diff_dir; /* directory contents for LF_DUMPDIR */ static int different = 0; #if 0 struct sp_array *sparsearray; int sp_ar_size = 10; #endif /*------------------------------------. | Sigh about something that differs. | `------------------------------------*/ static void sigh (const char *what) { fprintf (stdlis, _("%s: %s differs\n"), current_file_name, what); if (exit_status == TAREXIT_SUCCESS) exit_status = TAREXIT_DIFFERS; } /*--------------------------------. | Initialize for a diff operation | `--------------------------------*/ void diff_init (void) { diff_buf = (char *) valloc ((unsigned) blocksize); if (!diff_buf) ERROR ((TAREXIT_FAILURE, 0, _("Could not allocate memory for diff buffer of %d bytes"), blocksize)); } /*----------------------------------. | Diff a file against the archive. | `----------------------------------*/ void diff_archive (void) { register char *data; int check, namelen; int err; off_t offset; struct stat filestat; #ifndef __MSDOS__ dev_t dev; ino_t ino; #endif errno = EPIPE; /* FIXME, remove perrors */ saverec (&head); /* make sure it sticks around */ userec (head); /* and go past it in the archive */ decode_header (head, &hstat, &head_standard, 1); /* snarf fields */ /* Print the record from `head' and `hstat'. */ if (flag_verbose) { if (now_verifying) fprintf (stdlis, _("Verify ")); print_header (); } switch (head->header.linkflag) { default: WARN ((0, 0, _("Unknown file type '%c' for %s, diffed as normal file"), head->header.linkflag, current_file_name)); /* Fall through. */ case LF_OLDNORMAL: case LF_NORMAL: case LF_SPARSE: case LF_CONTIG: /* Appears to be a file. See if it's really a directory. */ namelen = strlen (current_file_name) - 1; if (current_file_name[namelen] == '/') goto really_dir; if (do_stat (&filestat)) { if (head->header.isextended) skip_extended_headers (); skip_file ((long) hstat.st_size); different++; goto quit; } if (!S_ISREG (filestat.st_mode)) { fprintf (stdlis, _("%s: Not a regular file\n"), current_file_name); skip_file ((long) hstat.st_size); different++; goto quit; } filestat.st_mode &= 07777; if (filestat.st_mode != hstat.st_mode) sigh (_("Mode")); if (filestat.st_uid != hstat.st_uid) sigh (_("Uid")); if (filestat.st_gid != hstat.st_gid) sigh (_("Gid")); if (filestat.st_mtime != hstat.st_mtime) sigh (_("Mod time")); if (head->header.linkflag != LF_SPARSE && filestat.st_size != hstat.st_size) { sigh (_("Size")); skip_file ((long) hstat.st_size); goto quit; } diff_fd = open (current_file_name, O_NDELAY | O_RDONLY | O_BINARY); if (diff_fd < 0 && !flag_absolute_names) { char *tmpbuf = xmalloc (strlen (current_file_name) + 2); *tmpbuf = '/'; strcpy (tmpbuf + 1, current_file_name); diff_fd = open (tmpbuf, O_NDELAY | O_RDONLY); free (tmpbuf); } if (diff_fd < 0) { ERROR ((0, errno, _("Cannot open %s"), current_file_name)); if (head->header.isextended) skip_extended_headers (); skip_file ((long) hstat.st_size); different++; goto quit; } /* Need to treat sparse files completely differently here. */ if (head->header.linkflag == LF_SPARSE) diff_sparse_files (hstat.st_size); else { if (flag_multivol) { assign_string (&save_name, current_file_name); save_totsize = hstat.st_size; /* save_size is set in wantbytes (). */ } wantbytes ((long) (hstat.st_size), compare_chunk); if (flag_multivol) assign_string (&save_name, NULL); } check = close (diff_fd); if (check < 0) ERROR ((0, errno, _("Error while closing %s"), current_file_name)); quit: break; #ifndef __MSDOS__ case LF_LINK: if (do_stat (&filestat)) break; dev = filestat.st_dev; ino = filestat.st_ino; err = stat (current_link_name, &filestat); if (err < 0) { if (errno == ENOENT) fprintf (stdlis, _("%s: Does not exist\n"), current_file_name); else WARN ((0, errno, _("Cannot stat file %s"), current_file_name)); different++; break; } if (filestat.st_dev != dev || filestat.st_ino != ino) { fprintf (stdlis, _("%s: Not linked to %s\n"), current_file_name, current_link_name); break; } break; #endif #ifdef S_ISLNK case LF_SYMLINK: { char linkbuf[NAMSIZ + 3]; /* FIXME: may be too short. */ check = readlink (current_file_name, linkbuf, (sizeof linkbuf) - 1); if (check < 0) { if (errno == ENOENT) fprintf (stdlis, _("%s: No such file or directory\n"), current_file_name); else WARN ((0, errno, _("Cannot read link %s"), current_file_name)); different++; break; } linkbuf[check] = '\0'; /* null-terminate it */ if (strncmp (current_link_name, linkbuf, (size_t) check) != 0) { fprintf (stdlis, _("%s: Symlink differs\n"), current_link_name); different++; } } break; #endif #ifdef S_IFCHR case LF_CHR: hstat.st_mode |= S_IFCHR; goto check_node; #endif #ifdef S_IFBLK /* If local system doesn't support block devices, use default case. */ case LF_BLK: hstat.st_mode |= S_IFBLK; goto check_node; #endif #ifdef S_ISFIFO /* If local system doesn't support FIFOs, use default case. */ case LF_FIFO: #ifdef S_IFIFO hstat.st_mode |= S_IFIFO; #endif hstat.st_rdev = 0; /* FIXME, do we need this? */ goto check_node; #endif check_node: /* FIXME, deal with umask. */ if (do_stat (&filestat)) break; if (hstat.st_rdev != filestat.st_rdev) { fprintf (stdlis, _("%s: Device numbers changed\n"), current_file_name); different++; break; } if ( #ifdef S_IFMT hstat.st_mode != filestat.st_mode #else /* POSIX lossage */ (hstat.st_mode & 07777) != (filestat.st_mode & 07777) #endif ) { fprintf (stdlis, _("%s: Mode or device-type changed\n"), current_file_name); different++; break; } break; case LF_DUMPDIR: data = diff_dir = get_dir_contents (current_file_name, 0); if (flag_multivol) { assign_string (&save_name, current_file_name); save_totsize = hstat.st_size; /* save_size is set in wantbytes (). */ } if (data) { wantbytes ((long) (hstat.st_size), compare_dir); free (data); } else wantbytes ((long) (hstat.st_size), no_op); if (flag_multivol) assign_string (&save_name, NULL); /* Fall through. */ case LF_DIR: /* Check for trailing /. */ namelen = strlen (current_file_name) - 1; really_dir: while (namelen && current_file_name[namelen] == '/') current_file_name[namelen--] = '\0'; /* zap / */ if (do_stat (&filestat)) break; if (!S_ISDIR (filestat.st_mode)) { fprintf (stdlis, _("%s: No longer a directory\n"), current_file_name); different++; break; } if ((filestat.st_mode & 07777) != (hstat.st_mode & 07777)) sigh (_("Mode")); break; case LF_VOLHDR: break; case LF_MULTIVOL: namelen = strlen (current_file_name) - 1; if (current_file_name[namelen] == '/') goto really_dir; if (do_stat (&filestat)) break; if (!S_ISREG (filestat.st_mode)) { fprintf (stdlis, _("%s: Not a regular file\n"), current_file_name); skip_file ((long) hstat.st_size); different++; break; } filestat.st_mode &= 07777; offset = from_oct (1 + 12, head->header.offset); if (filestat.st_size != hstat.st_size + offset) { sigh (_("Size")); skip_file ((long) hstat.st_size); different++; break; } diff_fd = open (current_file_name, O_NDELAY | O_RDONLY | O_BINARY); if (diff_fd < 0) { WARN ((0, errno, _("Cannot open file %s"), current_file_name)); skip_file ((long) hstat.st_size); different++; break; } err = lseek (diff_fd, offset, 0); if (err != offset) { WARN ((0, errno, _("Cannot seek to %ld in file %s"), offset, current_file_name)); different++; break; } if (flag_multivol) { assign_string (&save_name, current_file_name); save_totsize = filestat.st_size; /* save_size is set in wantbytes (). */ } wantbytes ((long) (hstat.st_size), compare_chunk); if (flag_multivol) assign_string (&save_name, NULL); check = close (diff_fd); if (check < 0) ERROR ((0, errno, _("Error while closing %s"), current_file_name)); break; } /* We don't need to save it any longer. */ saverec ((union record **) 0); /* unsave it */ } /*---. | ? | `---*/ static int compare_chunk (long bytes, char *buffer) { int err; err = read (diff_fd, diff_buf, (size_t) bytes); if (err != bytes) { if (err < 0) WARN ((0, errno, _("Cannot read %s"), current_file_name)); else fprintf (stdlis, _("%s: Could only read %d of %ld bytes\n"), current_file_name, err, bytes); different++; return -1; } if (memcmp (buffer, diff_buf, (size_t) bytes)) { fprintf (stdlis, _("%s: Data differs\n"), current_file_name); different++; return -1; } return 0; } /*---. | ? | `---*/ static int compare_dir (long bytes, char *buffer) { if (memcmp (buffer, diff_dir, (size_t) bytes)) { fprintf (stdlis, _("%s: Data differs\n"), current_file_name); different++; return -1; } diff_dir += bytes; return 0; } /*---. | ? | `---*/ void verify_volume (void) { int status; #ifdef MTIOCTOP struct mtop t; int er; #endif if (!diff_buf) diff_init (); #ifdef MTIOCTOP t.mt_op = MTBSF; t.mt_count = 1; if (er = rmtioctl (archive, MTIOCTOP, (char *) &t), er < 0) { if (errno != EIO || (er = rmtioctl (archive, MTIOCTOP, (char *) &t), er < 0)) { #endif if (rmtlseek (archive, 0L, 0) != 0) { /* Lseek failed. Try a different method. */ WARN ((0, errno, _("Could not rewind archive file for verify"))); return; } #ifdef MTIOCTOP } } #endif ar_reading = 1; now_verifying = 1; fl_read (); while (1) { status = read_header (); if (status == 0) { unsigned n; n = 0; do { n++; status = read_header (); } while (status == 0); ERROR ((0, 0, _("VERIFY FAILURE: %d invalid header(s) detected"), n)); } if (status == 2 || status == EOF) break; diff_archive (); } ar_reading = 0; now_verifying = 0; } /*---. | ? | `---*/ static int do_stat (struct stat *statp) { int err; err = (flag_follow_links ? stat (current_file_name, statp) : lstat (current_file_name, statp)); if (err < 0) { if (errno == ENOENT) fprintf (stdlis, _("%s: Does not exist\n"), current_file_name); else ERROR ((0, errno, _("Cannot stat file %s"), current_file_name)); #if 0 skip_file ((long) hstat.st_size); different++; #endif return 1; } else return 0; } /*---. | ? | `---*/ /* JK Diff'ing a sparse file with its counterpart on the tar file is a bit of a different story than a normal file. First, we must know what areas of the file to skip through, i.e., we need to contruct a sparsearray, which will hold all the information we need. We must compare small amounts of data at a time as we find it. */ static void diff_sparse_files (int filesize) { int sparse_ind = 0; char *buf; int buf_size = RECORDSIZE; union record *datarec; int err; long numbytes; #if 0 int amt_read = 0; #endif int size = filesize; /* FIXME: `datarec' might be used uninitialized in this function. Reported by Bruno Haible. */ buf = (char *) xmalloc (buf_size * sizeof (char)); fill_in_sparse_array (); while (size > 0) { datarec = findrec (); if (!sparsearray[sparse_ind].numbytes) break; /* `numbytes' is nicer to write than `sparsearray[sparse_ind].numbytes' all the time... */ numbytes = sparsearray[sparse_ind].numbytes; lseek (diff_fd, sparsearray[sparse_ind].offset, 0); /* Take care to not run out of room in our buffer. */ while (buf_size < numbytes) { buf_size *= 2; buf = (char *) xrealloc (buf, buf_size * sizeof (char)); } while (numbytes > RECORDSIZE) { if (err = read (diff_fd, buf, RECORDSIZE), err != RECORDSIZE) { if (err < 0) WARN ((0, errno, _("Cannot read %s"), current_file_name)); else fprintf (stdlis, _("%s: Could only read %d of %ld bytes\n"), current_file_name, err, numbytes); break; } if (memcmp (buf, datarec->charptr, RECORDSIZE)) { different++; break; } numbytes -= err; size -= err; userec (datarec); datarec = findrec (); } if (err = read (diff_fd, buf, (size_t) numbytes), err != numbytes) { if (err < 0) WARN ((0, errno, _("Cannot read %s"), current_file_name)); else fprintf (stdlis, _("%s: Could only read %d of %ld bytes\n"), current_file_name, err, numbytes); break; } if (memcmp (buf, datarec->charptr, (size_t) numbytes)) { different++; break; } #if 0 amt_read += numbytes; if (amt_read >= RECORDSIZE) { amt_read = 0; userec (datarec); datarec = findrec (); } #endif userec (datarec); sparse_ind++; size -= numbytes; } /* If the number of bytes read isn't the number of bytes supposedly in the file, they're different. */ #if 0 if (amt_read != filesize) different++; #endif userec (datarec); free (sparsearray); if (different) { fprintf (stdlis, _("%s: Data differs\n"), current_file_name); if (exit_status == TAREXIT_SUCCESS) exit_status = TAREXIT_DIFFERS; } } /*---. | ? | `---*/ /* JK This routine should be used more often than it is ... look into that. Anyhow, what it does is translate the sparse information on the header, and in any subsequent extended headers, into an array of structures with true numbers, as opposed to character strings. It simply makes our life much easier, doing so many comparisong and such. */ static void fill_in_sparse_array (void) { int ind; /* Allocate space for our scratch space; it's initially 10 elements long, but can change in this routine if necessary. */ sp_array_size = 10; sparsearray = (struct sp_array *) xmalloc (sp_array_size * sizeof (struct sp_array)); /* There are at most five of these structures in the header itself; read these in first. */ for (ind = 0; ind < SPARSE_IN_HDR; ind++) { /* Compare to 0, or use !(int)..., for Pyramid's dumb compiler. */ if (head->header.sp[ind].numbytes == 0) break; sparsearray[ind].offset = from_oct (1 + 12, head->header.sp[ind].offset); sparsearray[ind].numbytes = from_oct (1 + 12, head->header.sp[ind].numbytes); } /* If the header's extended, we gotta read in exhdr's till we're done. */ if (head->header.isextended) { /* How far into the sparsearray we are `so far'. */ static int so_far_ind = SPARSE_IN_HDR; union record *exhdr; while (1) { exhdr = findrec (); for (ind = 0; ind < SPARSE_EXT_HDR; ind++) { if (ind + so_far_ind > sp_array_size - 1) { /* We just ran out of room in our scratch area - realloc it. */ sp_array_size *= 2; sparsearray = (struct sp_array *) xrealloc (sparsearray, sp_array_size * sizeof (struct sp_array)); } /* Convert the character strings into longs. */ sparsearray[ind + so_far_ind].offset = from_oct (1 + 12, exhdr->ext_hdr.sp[ind].offset); sparsearray[ind + so_far_ind].numbytes = from_oct (1 + 12, exhdr->ext_hdr.sp[ind].numbytes); } /* If this is the last extended header for this file, we can stop. */ if (!exhdr->ext_hdr.isextended) break; else { so_far_ind += SPARSE_EXT_HDR; userec (exhdr); } } /* Be sure to skip past the last one. */ userec (exhdr); } } tar-1.11.8/src/extract.c 644 625 1 56641 5766571105 10052 /* Extract files from a tar archive. Copyright (C) 1988, 1992, 1993, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Extract files from a tar archive. Written 19 Nov 1985 by John Gilmore. */ #include "system.h" #include time_t time (); /* We need the #define's even though we don't use them. */ #if NO_OPEN3 # include "open3.h" #endif /* Simulated 3-argument open for systems that don't have it */ #if EMUL_OPEN3 # include "open3.h" #endif #if HAVE_UTIME_H # include #else struct utimbuf { long actime; long modtime; }; #endif #include "tar.h" extern union record *head; /* points to current tape header */ extern struct stat hstat; /* stat struct corresponding */ extern int head_standard; /* tape header is in ANSI format */ static void extract_sparse_file __P ((int, long *, long, char *)); static int make_dirs __P ((char *)); static time_t now = 0; /* current time */ static we_are_root = 0; /* true if our effective uid == 0 */ static int notumask = ~0; /* masks out bits user doesn't want */ #if 0 /* "Scratch" space to store the information about a sparse file before writing the info into the header or extended header. */ struct sp_array *sparsearray; /* Number of elts storable in the sparsearray. */ int sp_array_size = 10; #endif struct saved_dir_info { char *path; int mode; int atime; int mtime; uid_t uid; gid_t gid; struct saved_dir_info *next; }; struct saved_dir_info *saved_dir_info_head; /*--------------------------. | Set up to extract files. | `--------------------------*/ void extr_init (void) { int ourmask; now = time ((time_t *) 0); if (geteuid () == 0) we_are_root = 1; /* We need to know our umask. But if flag_use_protection is set, leave our kernel umask at 0, and our "notumask" at ~0. */ ourmask = umask (0); /* read it */ if (!flag_use_protection) { umask (ourmask); /* set it back how it was */ notumask = ~ourmask; /* make umask override permissions */ } } /*----------------------------------. | Extract a file from the archive. | `----------------------------------*/ void extract_archive (void) { register char *data; int fd, check, namelen, written, openflag; long size; struct utimbuf acc_upd_times; register int skipcrud; register int i; #if 0 int sparse_ind = 0; #endif union record *exhdr; struct saved_dir_info *tmp; #if 0 int end_nulls; #endif #ifdef O_CTG /* FIXME: Dirty kludge so the code compile on Masscomp's. I do not know what longname is supposed to be. NULL makes it unused. */ char *longname = NULL; #endif #define CURRENT_FILE_NAME (skipcrud + current_file_name) saverec (&head); /* make sure it sticks around */ userec (head); /* and go past it in the archive */ decode_header (head, &hstat, &head_standard, 1); if (flag_confirm && !confirm ("extract", current_file_name)) { if (head->header.isextended) skip_extended_headers (); skip_file ((long) hstat.st_size); saverec ((union record **) 0); return; } /* Print the record from `head' and `hstat'. */ if (flag_verbose) print_header (); /* Check for fully specified pathnames and other atrocities. Note, we can't just make a pointer to the new file name, since saverec() might move the header and adjust "head". We have to start from "head" every time we want to touch the header record. */ skipcrud = 0; while (!flag_absolute_names && CURRENT_FILE_NAME[0] == '/') { static int warned_once = 0; skipcrud++; /* force relative path */ if (!warned_once++) WARN ((0, 0, _("\ Removing leading / from absolute path names in the archive"))); } switch (head->header.linkflag) { default: WARN ((0, 0, _("Unknown file type '%c' for %s, extracted as normal file"), head->header.linkflag, CURRENT_FILE_NAME)); /* Fall through. */ /* JK - What we want to do if the file is sparse is loop through the array of sparse structures in the header and read in and translate the character strings representing 1) the offset at which to write and 2) how many bytes to write into numbers, which we store into the scratch array, "sparsearray". This array makes our life easier the same way it did in creating the tar file that had to deal with a sparse file. After we read in the first five (at most) sparse structures, we check to see if the file has an extended header, i.e., if more sparse structures are needed to describe the contents of the new file. If so, we read in the extended headers and continue to store their contents into the sparsearray. */ case LF_SPARSE: sp_array_size = 10; sparsearray = (struct sp_array *) xmalloc (sp_array_size * sizeof (struct sp_array)); for (i = 0; i < SPARSE_IN_HDR; i++) { sparsearray[i].offset = from_oct (1 + 12, head->header.sp[i].offset); sparsearray[i].numbytes = from_oct (1 + 12, head->header.sp[i].numbytes); if (!sparsearray[i].numbytes) break; } #if 0 end_nulls = from_oct (1 + 12, head->header.ending_blanks); #endif if (head->header.isextended) { /* Read in the list of extended headers and translate them into the sparsearray as before. */ /* static */ int ind = SPARSE_IN_HDR; while (1) { exhdr = findrec (); for (i = 0; i < SPARSE_EXT_HDR; i++) { if (i + ind > sp_array_size - 1) { /* Realloc the scratch area since we've run out of room. */ sp_array_size *= 2; sparsearray = (struct sp_array *) xrealloc (sparsearray, sp_array_size * (sizeof (struct sp_array))); } /* Compare to 0, or use !(int)..., for Pyramid's dumb compiler. */ if (exhdr->ext_hdr.sp[i].numbytes == 0) break; sparsearray[i + ind].offset = from_oct (1 + 12, exhdr->ext_hdr.sp[i].offset); sparsearray[i + ind].numbytes = from_oct (1 + 12, exhdr->ext_hdr.sp[i].numbytes); } if (!exhdr->ext_hdr.isextended) break; else { ind += SPARSE_EXT_HDR; userec (exhdr); } } userec (exhdr); } /* Fall through. */ case LF_OLDNORMAL: case LF_NORMAL: case LF_CONTIG: /* Appears to be a file. See if it's really a directory. */ namelen = strlen (CURRENT_FILE_NAME) - 1; if (CURRENT_FILE_NAME[namelen] == '/') goto really_dir; /* FIXME, deal with protection issues. */ again_file: openflag = (flag_keep ? O_BINARY | O_NDELAY | O_WRONLY | O_CREAT | O_EXCL : O_BINARY | O_NDELAY | O_WRONLY | O_CREAT | O_TRUNC) | ((head->header.linkflag == LF_SPARSE) ? 0 : O_APPEND); /* JK - The last | is a kludge to solve the problem the O_APPEND flag causes with files we are trying to make sparse: when a file is opened with O_APPEND, it writes to the last place that something was written, thereby ignoring any lseeks that we have done. We add this extra condition to make it able to lseek when a file is sparse, i.e., we don't open the new file with this flag. (Grump -- this bug caused me to waste a good deal of time, I might add) */ if (flag_exstdout) { fd = 1; goto extract_file; } #ifdef O_CTG /* Contiguous files (on the Masscomp) have to specify the size in the open call that creates them. */ if (head->header.linkflag == LF_CONTIG) fd = open ((longname ? longname : head->header.name) + skipcrud, openflag | O_CTG, hstat.st_mode, hstat.st_size); else #endif { #ifdef NO_OPEN3 /* On raw V7 we won't let them specify -k (flag_keep), but we just bull ahead and create the files. */ fd = creat ((longname ? longname : head->header.name) + skipcrud, hstat.st_mode); #else /* With 3-arg open(), we can do this up right. */ fd = open (CURRENT_FILE_NAME, openflag, hstat.st_mode); #endif } if (fd < 0) { if (make_dirs (CURRENT_FILE_NAME)) goto again_file; ERROR ((0, errno, _("Could not create file %s"), CURRENT_FILE_NAME)); if (head->header.isextended) skip_extended_headers (); skip_file ((long) hstat.st_size); goto quit; } extract_file: if (head->header.linkflag == LF_SPARSE) { char *name; int namelen_bis; /* Kludge alert. NAME is assigned to header.name because during the extraction, the space that contains the header will get scribbled on, and the name will get munged, so any error messages that happen to contain the filename will look REAL interesting unless we do this. */ namelen_bis = strlen (CURRENT_FILE_NAME) + 1; name = (char *) xmalloc ((sizeof (char)) * namelen_bis); memcpy (name, CURRENT_FILE_NAME, (size_t) namelen_bis); size = hstat.st_size; extract_sparse_file (fd, &size, hstat.st_size, name); } else for (size = hstat.st_size; size > 0; size -= written) { #if 0 long offset, numbytes; #endif if (flag_multivol) { assign_string (&save_name, current_file_name); save_totsize = hstat.st_size; save_sizeleft = size; } /* Locate data, determine max length writeable, write it, record that we have used the data, then check if the write worked. */ data = findrec ()->charptr; if (data == NULL) { /* Check it. */ ERROR ((0, 0, _("Unexpected EOF on archive file"))); break; } /* JK - If the file is sparse, use the sparsearray that we created before to lseek into the new file the proper amount, and to see how many bytes we want to write at that position. */ #if 0 if (head->header.linkflag == LF_SPARSE) { off_t pos; pos = lseek (fd, (off_t) sparsearray[sparse_ind].offset, 0); fprintf (msg_file, _("%d at %d\n"), (int) pos, sparse_ind); written = sparsearray[sparse_ind++].numbytes; } else #endif written = endofrecs ()->charptr - data; if (written > size) written = size; errno = 0; check = write (fd, data, (size_t) written); /* The following is in violation of strict typing, since the arg to userec should be a struct rec *. FIXME. */ userec ((union record *) (data + written - 1)); if (check == written) continue; /* Error in writing to file. Print it, skip to next file in archive. */ if (check < 0) ERROR ((0, errno, _("Could not write to file %s"), CURRENT_FILE_NAME)); else ERROR ((0, 0, _("Could only write %d of %d bytes to file %s"), check, written, CURRENT_FILE_NAME)); skip_file ((long) (size - written)); break; /* still do the close, mod time, chmod, etc */ } if (flag_multivol) assign_string (&save_name, NULL); /* If writing to stdout, don't try to do anything to the filename; it doesn't exist, or we don't want to touch it anyway. */ if (flag_exstdout) break; #if 0 if (head->header.isextended) { register union record *exhdr; register int i; for (i = 0; i < 21; i++) { off_t offset; if (!exhdr->ext_hdr.sp[i].numbytes) break; offset = from_oct (1 + 12, exhdr->ext_hdr.sp[i].offset); written = from_oct (1 + 12, exhdr->ext_hdr.sp[i].numbytes); lseek (fd, offset, 0); check = write (fd, data, written); if (check == written) continue; } } #endif check = close (fd); if (check < 0) ERROR ((0, errno, _("Error while closing %s"), CURRENT_FILE_NAME)); set_filestat: /* Set the modified time of the file. Note that we set the accessed time to "now", which is really "the time we started extracting files". unless flag_gnudump is used, in which case .st_atime is used */ if (!flag_modified) { /* FIXME. If flag_gnudump should set ctime too, but how? */ if (flag_gnudump) acc_upd_times.actime = hstat.st_atime; else acc_upd_times.actime = now; /* accessed now */ acc_upd_times.modtime = hstat.st_mtime; /* mod'd */ if (utime (CURRENT_FILE_NAME, &acc_upd_times) < 0) ERROR ((0, errno, _("Could not change access and modification times of %s"), CURRENT_FILE_NAME)); } /* We do the utime before the chmod because some versions of utime are broken and trash the modes of the file. Since we then change the mode anyway, we don't care. */ /* If we are root, set the owner and group of the extracted file. This does what is wanted both on real Unix and on System V. If we are running as a user, we extract as that user; if running as root, we extract as the original owner. */ if (we_are_root || flag_do_chown) if (chown (CURRENT_FILE_NAME, hstat.st_uid, hstat.st_gid) < 0) ERROR ((0, errno, _("Cannot chown file %s to uid %d gid %d"), CURRENT_FILE_NAME, hstat.st_uid, hstat.st_gid)); /* If '-k' is not set, open() or creat() could have saved the permission bits from a previously created file, ignoring the ones we specified. Even if -k is set, if the file has abnormal mode bits, we must chmod since writing or chown() has probably reset them. If -k is set, we know *we* created this file, so the mode bits were set by our open(). If the file is "normal", we skip the chmod. This works because we did umask(0) if -p is set, so umask will have left the specified mode alone. */ if ((!flag_keep) || (hstat.st_mode & (S_ISUID | S_ISGID | S_ISVTX))) if (chmod (CURRENT_FILE_NAME, notumask & (int) hstat.st_mode) < 0) ERROR ((0, errno, _("Cannot change mode of file %s to %lo"), CURRENT_FILE_NAME, notumask & (int) hstat.st_mode)); quit: break; case LF_LINK: again_link: { struct stat st1, st2; check = link (current_link_name, CURRENT_FILE_NAME); if (check == 0) break; if (make_dirs (CURRENT_FILE_NAME)) goto again_link; if (flag_gnudump && errno == EEXIST) break; if (stat (current_link_name, &st1) == 0 && stat (CURRENT_FILE_NAME, &st2) == 0 && st1.st_dev == st2.st_dev && st1.st_ino == st2.st_ino) break; ERROR ((0, errno, _("Could not link %s to %s"), CURRENT_FILE_NAME, current_link_name)); } break; #ifdef S_ISLNK case LF_SYMLINK: again_symlink: check = symlink (current_link_name, CURRENT_FILE_NAME); /* FIXME, don't worry uid, gid, etc. */ if (check == 0) break; if (make_dirs (CURRENT_FILE_NAME)) goto again_symlink; ERROR ((0, errno, _("Could not create symlink to %s"), current_link_name)); break; #endif #ifdef S_IFCHR case LF_CHR: hstat.st_mode |= S_IFCHR; goto make_node; #endif #ifdef S_IFBLK case LF_BLK: hstat.st_mode |= S_IFBLK; #endif #if defined(S_IFCHR) || defined(S_IFBLK) make_node: check = mknod (CURRENT_FILE_NAME, (int) hstat.st_mode, (int) hstat.st_rdev); if (check != 0) { if (make_dirs (CURRENT_FILE_NAME)) goto make_node; ERROR ((0, errno, _("Could not make %s"), CURRENT_FILE_NAME)); break; }; goto set_filestat; #endif #ifdef S_ISFIFO /* If local system doesn't support FIFOs, use default case. */ case LF_FIFO: make_fifo: check = mkfifo (CURRENT_FILE_NAME, (int) hstat.st_mode); if (check != 0) { if (make_dirs (CURRENT_FILE_NAME)) goto make_fifo; ERROR ((0, errno, _("Could not make %s"), CURRENT_FILE_NAME)); break; }; goto set_filestat; #endif case LF_DIR: case LF_DUMPDIR: namelen = strlen (CURRENT_FILE_NAME) - 1; really_dir: /* Check for trailing /, and zap as many as we find. */ while (namelen && CURRENT_FILE_NAME[namelen] == '/') CURRENT_FILE_NAME[namelen--] = '\0'; if (flag_gnudump) { /* Read the entry and delete files that aren't listed in the archive. */ gnu_restore (skipcrud); } else if (head->header.linkflag == LF_DUMPDIR) skip_file ((long) (hstat.st_size)); again_dir: check = mkdir (CURRENT_FILE_NAME, (we_are_root ? 0 : 0300) | (int) hstat.st_mode); if (check != 0) { struct stat st1; if (make_dirs (CURRENT_FILE_NAME)) goto again_dir; /* If we're trying to create '.', let it be. */ if (CURRENT_FILE_NAME[namelen] == '.' && (namelen == 0 || CURRENT_FILE_NAME[namelen - 1] == '/')) goto check_perms; if (errno == EEXIST && stat (CURRENT_FILE_NAME, &st1) == 0 && (S_ISDIR (st1.st_mode))) break; ERROR ((0, errno, _("Could not create directory %s"), CURRENT_FILE_NAME)); break; } check_perms: if (!we_are_root && 0300 != (0300 & (int) hstat.st_mode)) { hstat.st_mode |= 0300; WARN ((0, 0, _("Added write and execute permission to directory %s"), CURRENT_FILE_NAME)); } if (!flag_modified) { tmp = ((struct saved_dir_info *) xmalloc (sizeof (struct saved_dir_info))); tmp->path = xstrdup (CURRENT_FILE_NAME); tmp->mode = hstat.st_mode; tmp->atime = hstat.st_atime; tmp->mtime = hstat.st_mtime; tmp->uid = hstat.st_uid; tmp->gid = hstat.st_gid; tmp->next = saved_dir_info_head; saved_dir_info_head = tmp; } else { /* This functions exactly as the code for set_filestat above. */ if (!flag_keep || (hstat.st_mode & (S_ISUID | S_ISGID | S_ISVTX))) if (chmod (CURRENT_FILE_NAME, notumask & (int) hstat.st_mode) < 0) ERROR ((0, errno, _("Cannot change mode of file %s to %lo"), CURRENT_FILE_NAME, notumask & (int) hstat.st_mode)); } break; case LF_VOLHDR: if (flag_verbose) fprintf (stdlis, _("Reading %s\n"), current_file_name); break; case LF_NAMES: extract_mangle (); break; case LF_MULTIVOL: ERROR ((0, 0, _("\ Cannot extract `%s' -- file is continued from another volume"), current_file_name)); skip_file ((long) hstat.st_size); break; case LF_LONGNAME: case LF_LONGLINK: ERROR ((0, 0, _("Visible long name error"))); skip_file ((long) hstat.st_size); break; } /* We don't need to save it any longer. */ saverec (NULL); /* unsave it */ #undef CURRENT_FILE_NAME } /*------------------------------------------------------------------------. | After a file/link/symlink/dir creation has failed, see if it's because | | some required directory was not present, and if so, create all required | | dirs. | `------------------------------------------------------------------------*/ static int make_dirs (char *pathname) { char *p; /* points into path */ int madeone = 0; /* did we do anything yet? */ int save_errno = errno; /* remember caller's errno */ int check; if (errno != ENOENT) return 0; /* not our problem */ for (p = strchr (pathname, '/'); p != NULL; p = strchr (p + 1, '/')) { /* Avoid mkdir of empty string, if leading or double '/'. */ if (p == pathname || p[-1] == '/') continue; /* Avoid mkdir where last part of path is '.'. */ if (p[-1] == '.' && (p == pathname + 1 || p[-2] == '/')) continue; *p = 0; /* truncate the path there */ check = mkdir (pathname, 0777); /* try to create it as a dir */ if (check == 0) { /* Fix ownership. */ if (we_are_root) if (chown (pathname, hstat.st_uid, hstat.st_gid) < 0) ERROR ((0, errno, _("Cannot change owner of %s to uid %d gid %d"), pathname, hstat.st_uid, hstat.st_gid)); pr_mkdir (pathname, p - pathname, notumask & 0777); madeone++; /* remember if we made one */ *p = '/'; continue; } *p = '/'; if (errno == EEXIST #ifdef MSDOS /* Turbo C mkdir gives a funny errno. */ || errno == EACCES #endif ) /* Directory already exists. */ continue; /* Some other error in the mkdir. We return to the caller. */ break; } errno = save_errno; /* restore caller's errno */ return madeone; /* tell them to retry if we made one */ } /*---. | ? | `---*/ static void extract_sparse_file (int fd, long *sizeleft, long totalsize, char *name) { #if 0 register char *data; #endif union record *datarec; int sparse_ind = 0; int written, count; /* FIXME: `datarec' might be used uninitialized in this function. Reported by Bruno Haible. */ /* assuming sizeleft is initially totalsize */ while (*sizeleft > 0) { datarec = findrec (); if (datarec == NULL) { ERROR ((0, 0, _("Unexpected EOF on archive file"))); return; } lseek (fd, sparsearray[sparse_ind].offset, 0); written = sparsearray[sparse_ind++].numbytes; while (written > RECORDSIZE) { count = write (fd, datarec->charptr, RECORDSIZE); if (count < 0) ERROR ((0, errno, _("Could not write to file %s"), name)); written -= count; *sizeleft -= count; userec (datarec); datarec = findrec (); } count = write (fd, datarec->charptr, (size_t) written); if (count < 0) ERROR ((0, errno, _("Could not write to file %s"), name)); else if (count != written) { ERROR ((0, 0, _("Could only write %d of %d bytes to file %s"), count, totalsize, name)); skip_file ((long) (*sizeleft)); } written -= count; *sizeleft -= count; userec (datarec); } free (sparsearray); #if 0 if (end_nulls) { register int i; fprintf (stdlis, "%d\n", (int) end_nulls); for (i = 0; i < end_nulls; i++) write (fd, "\000", 1); } #endif userec (datarec); } /*----------------------------------------------------------------. | Set back the utime and mode for all the extracted directories. | `----------------------------------------------------------------*/ void restore_saved_dir_info (void) { struct utimbuf acc_upd_times; while (saved_dir_info_head != NULL) { /* FIXME, if flag_gnudump should set ctime too, but how? */ if (flag_gnudump) acc_upd_times.actime = saved_dir_info_head->atime; else acc_upd_times.actime = now; /* accessed now */ acc_upd_times.modtime = saved_dir_info_head->mtime; /* mod'd */ if (utime (saved_dir_info_head->path, &acc_upd_times) < 0) ERROR ((0, errno, _("Could not change access and modification times of %s"), saved_dir_info_head->path)); /* If we are root, set the owner and group of the extracted file. This does what is wanted both on real Unix and on System V. If we are running as a user, we extract as that user; if running as root, we extract as the original owner. */ if (we_are_root || flag_do_chown) if (chown (saved_dir_info_head->path, saved_dir_info_head->uid, saved_dir_info_head->gid) < 0) ERROR ((0, errno, _("Cannot chown file %s to uid %d gid %d"), saved_dir_info_head->path, saved_dir_info_head->uid, saved_dir_info_head->gid)); if ((!flag_keep) || (saved_dir_info_head->mode & (S_ISUID | S_ISGID | S_ISVTX))) if (chmod (saved_dir_info_head->path, notumask & saved_dir_info_head->mode) < 0) ERROR ((0, errno, _("Cannot change mode of file %s to %lo"), saved_dir_info_head->path, notumask & saved_dir_info_head->mode)); saved_dir_info_head = saved_dir_info_head->next; } } tar-1.11.8/src/gnu.c 644 625 1 34531 5770641576 7170 /* GNU dump extensions to tar. Copyright (C) 1988, 1992, 1993, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "system.h" #include time_t time (); #define ISDIGIT(Char) (ISASCII (Char) && isdigit (Char)) #define ISSPACE(Char) (ISASCII (Char) && isspace (Char)) #ifndef S_ISLNK #define lstat stat #endif #include "tar.h" extern time_t new_time; static void add_dir __P ((char *, dev_t, ino_t, const char *)); static void add_dir_name __P ((char *, int)); static int dirent_cmp __P ((const voidstar, const voidstar)); static int name_cmp __P ((struct name *, struct name *)); static int recursively_delete __P ((char *)); struct dirname { struct dirname *next; const char *name; const char *dir_text; int dev; int ino; int allnew; }; static struct dirname *dir_list; static time_t this_time; /*---. | ? | `---*/ static void add_dir (char *name, dev_t dev, ino_t ino, const char *text) { struct dirname *dp; dp = (struct dirname *) xmalloc (sizeof (struct dirname)); dp->next = dir_list; dir_list = dp; dp->dev = dev; dp->ino = ino; dp->name = xstrdup (name); dp->dir_text = text; dp->allnew = 0; } /*---. | ? | `---*/ static void read_dir_file (void) { dev_t dev; ino_t ino; char *strp; FILE *fp; char buf[512]; static char *path = 0; if (path == 0) path = xmalloc (PATH_MAX); time (&this_time); if (gnu_dumpfile[0] != '/') { #ifdef HAVE_GETCWD if (!getcwd (path, PATH_MAX)) ERROR ((TAREXIT_FAILURE, 0, _("Could not get current directory"))); #else char *getwd (); if (!getwd (path)) ERROR ((TAREXIT_FAILURE, 0, _("Could not get current directory: %s"), path)); #endif /* If this doesn't fit, we're in serious trouble. */ strcat (path, "/"); strcat (path, gnu_dumpfile); gnu_dumpfile = path; } fp = fopen (gnu_dumpfile, "r"); if (fp == 0 && errno != ENOENT) { ERROR ((0, errno, _("Cannot open %s"), gnu_dumpfile)); return; } if (!fp) return; fgets (buf, sizeof (buf), fp); if (!flag_new_files) { flag_new_files++; new_time = atol (buf); } while (fgets (buf, sizeof (buf), fp)) { strp = &buf[strlen (buf)]; if (strp[-1] == '\n') strp[-1] = '\0'; strp = buf; dev = atol (strp); while (ISDIGIT (*strp)) strp++; ino = atol (strp); while (ISSPACE (*strp)) strp++; while (ISDIGIT (*strp)) strp++; strp++; add_dir (un_quote_string (strp), dev, ino, (char *) 0); } fclose (fp); } /*---. | ? | `---*/ void write_dir_file (void) { FILE *fp; struct dirname *dp; char *str; fp = fopen (gnu_dumpfile, "w"); if (fp == 0) { ERROR ((0, errno, _("Cannot write to %s"), gnu_dumpfile)); return; } fprintf (fp, "%lu\n", this_time); for (dp = dir_list; dp; dp = dp->next) { if (!dp->dir_text) continue; str = quote_copy_string (dp->name); if (str) { fprintf (fp, "%u %u %s\n", dp->dev, dp->ino, str); free (str); } else fprintf (fp, "%u %u %s\n", dp->dev, dp->ino, dp->name); } fclose (fp); } /*---. | ? | `---*/ static struct dirname * get_dir (char *name) { struct dirname *dp; for (dp = dir_list; dp; dp = dp->next) { if (!strcmp (dp->name, name)) return dp; } return 0; } /*-------------------------------------------------------------------------. | Collect all the names from argv[] (or whatever), then expand them into a | | directory tree, and put all the directories at the beginning. | `-------------------------------------------------------------------------*/ void collect_and_sort_names (void) { struct name *n, *n_next; int num_names; struct stat statbuf; name_gather (); if (gnu_dumpfile) read_dir_file (); if (!namelist) addname ("."); for (n = namelist; n; n = n_next) { n_next = n->next; if (n->found || n->dir_contents) continue; if (n->regexp) /* FIXME just skip regexps for now */ continue; if (n->change_dir) if (chdir (n->change_dir) < 0) { ERROR ((0, errno, _("Cannot chdir to %s"), n->change_dir)); continue; } if ( #ifdef AIX statx (n->name, &statbuf, STATSIZE, STX_HIDDEN | STX_LINK) #else lstat (n->name, &statbuf) < 0 #endif ) { ERROR ((0, errno, _("Cannot stat %s"), n->name)); continue; } if (S_ISDIR (statbuf.st_mode)) { n->found++; add_dir_name (n->name, statbuf.st_dev); } } num_names = 0; for (n = namelist; n; n = n->next) num_names++; namelist = (struct name *) merge_sort ((voidstar) namelist, (unsigned) num_names, (char *) (&(namelist->next)) - (char *) namelist, name_cmp); for (n = namelist; n; n = n->next) { n->found = 0; } if (gnu_dumpfile) write_dir_file (); } /*---. | ? | `---*/ static int name_cmp (struct name *n1, struct name *n2) { if (n1->found) { if (n2->found) return strcmp (n1->name, n2->name); else return -1; } else if (n2->found) return 1; else return strcmp (n1->name, n2->name); } /*---. | ? | `---*/ static int dirent_cmp (const voidstar p1, const voidstar p2) { char const *frst, *scnd; frst = (*(char *const *) p1) + 1; scnd = (*(char *const *) p2) + 1; return strcmp (frst, scnd); } /*---. | ? | `---*/ char * get_dir_contents (char *p, int device) { DIR *dirp; register struct dirent *d; char *new_buf; char *namebuf; int bufsiz; int len; voidstar the_buffer; char *buf; size_t n_strs; #if 0 int n_size; #endif char *p_buf; char **vec, **p_vec; errno = 0; dirp = opendir (p); bufsiz = strlen (p) + NAMSIZ; namebuf = xmalloc ((size_t) (bufsiz + 2)); if (!dirp) { ERROR ((0, errno, _("Cannot open directory %s"), p)); new_buf = NULL; } else { struct dirname *dp; int all_children; dp = get_dir (p); all_children = dp ? dp->allnew : 0; strcpy (namebuf, p); if (p[strlen (p) - 1] != '/') strcat (namebuf, "/"); len = strlen (namebuf); the_buffer = init_buffer (); while (d = readdir (dirp), d) { struct stat hs; /* Skip `.' and `..'. */ if (is_dot_or_dotdot (d->d_name)) continue; if ((int) NAMLEN (d) + len >= bufsiz) { bufsiz += NAMSIZ; namebuf = (char *) xrealloc (namebuf, (size_t) (bufsiz + 2)); } strcpy (namebuf + len, d->d_name); #ifdef AIX if (flag_follow_links ? statx (namebuf, &hs, STATSIZE, STX_HIDDEN) : statx (namebuf, &hs, STATSIZE, STX_HIDDEN | STX_LINK)) #else if (flag_follow_links ? stat (namebuf, &hs) : lstat (namebuf, &hs)) #endif { ERROR ((0, errno, _("Cannot stat %s"), namebuf)); continue; } if ((flag_local_filesys && device != hs.st_dev) || (flag_exclude && check_exclude (namebuf))) add_buffer (the_buffer, "N", 1); #ifdef AIX else if (S_ISHIDDEN (hs.st_mode)) { add_buffer (the_buffer, "D", 1); strcat (d->d_name, "A"); d->d_namlen++; } #endif /* AIX */ else if (S_ISDIR (hs.st_mode)) { if (dp = get_dir (namebuf), dp) { if (dp->dev != hs.st_dev || dp->ino != hs.st_ino) { if (flag_verbose) WARN ((0, 0, _("Directory %s has been renamed"), namebuf)); dp->allnew = 1; dp->dev = hs.st_dev; dp->ino = hs.st_ino; } dp->dir_text = ""; } else { if (flag_verbose) WARN ((0, 0, _("Directory %s is new"), namebuf)); add_dir (namebuf, hs.st_dev, hs.st_ino, ""); dp = get_dir (namebuf); dp->allnew = 1; } if (all_children && dp) dp->allnew = 1; add_buffer (the_buffer, "D", 1); } else if (!all_children && flag_new_files && new_time > hs.st_mtime && (flag_new_files > 1 || new_time > hs.st_ctime)) add_buffer (the_buffer, "N", 1); else add_buffer (the_buffer, "Y", 1); add_buffer (the_buffer, d->d_name, (int) (NAMLEN (d) + 1)); } add_buffer (the_buffer, "\000\000", 2); closedir (dirp); /* Well, we've read in the contents of the dir, now sort them. */ buf = get_buffer (the_buffer); if (buf[0] == '\0') { flush_buffer (the_buffer); new_buf = NULL; } else { n_strs = 0; for (p_buf = buf; *p_buf;) { int tmp; tmp = strlen (p_buf) + 1; n_strs++; p_buf += tmp; } vec = (char **) xmalloc (sizeof (char *) * (n_strs + 1)); for (p_vec = vec, p_buf = buf; *p_buf; p_buf += strlen (p_buf) + 1) *p_vec++ = p_buf; *p_vec = 0; qsort ((voidstar) vec, n_strs, sizeof (char *), dirent_cmp); new_buf = (char *) xmalloc ((size_t) (p_buf - buf + 2)); for (p_vec = vec, p_buf = new_buf; *p_vec; p_vec++) { char *p_tmp; for (p_tmp = *p_vec; (*p_buf++ = *p_tmp++); ) ; } *p_buf++ = '\0'; free (vec); flush_buffer (the_buffer); } } free (namebuf); return new_buf; } /*----------------------------------------------------------------------. | P is a directory. Add all the files in P to the namelist. If any of | | the files is a directory, recurse on the subdirectory. | `----------------------------------------------------------------------*/ static void add_dir_name (char *p, int device) { char *new_buf; char *p_buf; char *namebuf; int buflen; register int len; int sublen; #if 0 voidstar the_buffer; char *buf; char **vec,**p_vec; int n_strs,n_size; #endif struct name *n; new_buf = get_dir_contents (p, device); for (n = namelist; n; n = n->next) { if (!strcmp (n->name, p)) { n->dir_contents = new_buf ? new_buf : "\0\0\0\0"; break; } } if (new_buf) { len = strlen (p); buflen = NAMSIZ <= len ? len + NAMSIZ : NAMSIZ; namebuf = xmalloc ((size_t) (buflen + 1)); strcpy (namebuf, p); if (namebuf[len - 1] != '/') { namebuf[len++] = '/'; namebuf[len] = '\0'; } for (p_buf = new_buf; p_buf && *p_buf; p_buf += sublen + 1) { sublen = strlen (p_buf); if (*p_buf == 'D') { if (len + sublen >= buflen) { buflen += NAMSIZ; namebuf = (char *) xrealloc (namebuf, (size_t) (buflen + 1)); } strcpy (namebuf + len, p_buf + 1); addname (namebuf); add_dir_name (namebuf, device); } } free (namebuf); } } /*-------------------------------------------------------------------------. | Returns non-zero if p is `.' or `..'. This could be a macro for speed. | `-------------------------------------------------------------------------*/ /* Early Solaris 2.4 readdir may return d->d_name as `' in NFS-mounted directories. The workaround here skips `' just like `.'. Without it, GNU tar would then treat `' much like `.' and loop endlessly. */ int is_dot_or_dotdot (char *p) { return (p[0] == '\0' || (p[0] == '.' && (p[1] == '\0' || (p[1] == '.' && p[2] == '\0')))); } /*---. | ? | `---*/ void gnu_restore (int skipcrud) { char *current_dir; #if 0 int current_dir_length; #endif char *archive_dir; #if 0 int archive_dir_length; #endif voidstar the_buffer; char *p; DIR *dirp; struct dirent *d; char *cur, *arc; long size, copied; char *from, *to; #define CURRENT_FILE_NAME (skipcrud + current_file_name) dirp = opendir (CURRENT_FILE_NAME); if (!dirp) { /* The directory doesn't exist now. It'll be created. In any case, we don't have to delete any files out of it. */ skip_file ((long) hstat.st_size); return; } the_buffer = init_buffer (); while (d = readdir (dirp), d) { if (is_dot_or_dotdot (d->d_name)) continue; add_buffer (the_buffer, d->d_name, (int) (NAMLEN (d) + 1)); } closedir (dirp); add_buffer (the_buffer, "", 1); current_dir = get_buffer (the_buffer); archive_dir = (char *) ck_malloc ((size_t) hstat.st_size); if (archive_dir == 0) { ERROR ((0, 0, _("Cannot allocate %d bytes for restore"), hstat.st_size)); skip_file ((long) hstat.st_size); return; } to = archive_dir; for (size = hstat.st_size; size > 0; size -= copied) { from = findrec ()->charptr; if (!from) { ERROR ((0, 0, _("Unexpected EOF in archive"))); break; } copied = endofrecs ()->charptr - from; if (copied > size) copied = size; memcpy ((voidstar) to, (voidstar) from, (size_t) copied); to += copied; userec ((union record *) (from + copied - 1)); } for (cur = current_dir; *cur; cur += strlen (cur) + 1) { for (arc = archive_dir; *arc; arc += strlen (arc) + 1) { arc++; if (!strcmp (arc, cur)) break; } if (*arc == '\0') { p = new_name (CURRENT_FILE_NAME, cur); if (flag_confirm && !confirm ("delete", p)) { free (p); continue; } if (flag_verbose) fprintf (stdlis, _("%s: Deleting %s\n"), program_name, p); if (recursively_delete (p)) ERROR ((0, 0, _("Error while deleting %s"), p)); free (p); } } flush_buffer (the_buffer); free (archive_dir); #undef CURRENT_FILE_NAME } /*---. | ? | `---*/ static int recursively_delete (char *path) { struct stat sbuf; DIR *dirp; struct dirent *dp; char *path_buf; #if 0 int path_len; #endif if (lstat (path, &sbuf) < 0) return 1; if (S_ISDIR (sbuf.st_mode)) { #if 0 path_len = strlen (path); #endif dirp = opendir (path); if (dirp == 0) return 1; while (dp = readdir (dirp), dp) { if (is_dot_or_dotdot (dp->d_name)) continue; path_buf = new_name (path, dp->d_name); if (recursively_delete (path_buf)) { free (path_buf); closedir (dirp); return 1; } free (path_buf); } closedir (dirp); if (rmdir (path) < 0) return 1; return 0; } if (unlink (path) < 0) return 1; return 0; } tar-1.11.8/src/list.c 644 625 1 51027 5751574121 7337 /* List a tar archive. Copyright (C) 1988, 1992, 1993, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* List a tar archive. Also includes support routines for reading a tar archive. Written 26 Aug 1985 by John Gilmore. */ #include "system.h" #include #include #define ISODIGIT(Char) \ ((unsigned char) (Char) >= '0' && (unsigned char) (Char) <= '7') #define ISSPACE(Char) (ISASCII (Char) && isspace (Char)) #include "tar.h" static void demode __P ((unsigned, char *)); union record *head; /* points to current archive header */ struct stat hstat; /* stat struct corresponding */ int head_standard; /* tape header is in ANSI format */ /*-----------------------------------. | Main loop for reading an archive. | `-----------------------------------*/ void read_and (void (*do_something) ()) { int status = 3; /* initial status at start of archive */ int prev_status; char save_linkflag; name_gather (); /* gather all the names */ open_archive (1); /* open for reading */ while (1) { prev_status = status; status = read_header (); switch (status) { case 1: /* Valid header. We should decode next field (mode) first. Ensure incoming names are null terminated. */ if (!name_match (current_file_name) || (flag_new_files && hstat.st_mtime < new_time) || (flag_exclude && check_exclude (current_file_name))) { int isextended = 0; if (head->header.linkflag == LF_VOLHDR || head->header.linkflag == LF_MULTIVOL || head->header.linkflag == LF_NAMES) { (*do_something) (); continue; } if (flag_show_omitted_dirs && head->header.linkflag == LF_DIR) WARN ((0, 0, _("Omitting %s"), current_file_name)); /* Skip past it in the archive. */ if (head->header.isextended) isextended = 1; save_linkflag = head->header.linkflag; userec (head); if (isextended) { #if 0 register union record *exhdr; while (1) { exhdr = findrec (); if (!exhdr->ext_hdr.isextended) { userec (exhdr); break; } } userec (exhdr); #endif skip_extended_headers (); } /* Skip to the next header on the archive. */ if (save_linkflag != LF_DIR) skip_file ((long) hstat.st_size); continue; } (*do_something) (); continue; /* If the previous header was good, tell them that we are skipping bad ones. */ case 0: /* invalid header */ userec (head); switch (prev_status) { case 3: /* error on first record */ WARN ((0, 0, _("Hmm, this doesn't look like a tar archive"))); /* Fall through. */ case 2: /* error after record of zeroes */ case 1: /* error after header rec */ WARN ((0, 0, _("Skipping to next file header"))); case 0: /* error after error */ break; } continue; case 2: /* record of zeroes */ userec (head); status = prev_status; /* if error after 0's */ if (flag_ignorez) continue; /* Fall through. */ case EOF: /* end of archive */ break; } break; }; restore_saved_dir_info (); close_archive (); names_notfound (); /* print names not found */ } /*----------------------------------------------. | Print a header record, based on tar options. | `----------------------------------------------*/ void list_archive (void) { int isextended = 0; /* flag to remember if head is extended */ /* Save the record. */ saverec (&head); /* Print the header record. */ if (flag_verbose) { if (flag_verbose > 1) decode_header (head, &hstat, &head_standard, 0); print_header (); } if (flag_gnudump && head->header.linkflag == LF_DUMPDIR) { size_t size, written, check; char *data; userec (head); if (flag_multivol) { assign_string (&save_name, current_file_name); save_totsize = hstat.st_size; } for (size = hstat.st_size; size > 0; size -= written) { if (flag_multivol) save_sizeleft = size; data = findrec ()->charptr; if (data == NULL) { ERROR ((0, 0, _("EOF in archive file"))); break; } written = endofrecs ()->charptr - data; if (written > size) written = size; errno = 0; check = fwrite (data, sizeof (char), written, stdlis); userec ((union record *) (data + written - 1)); if (check != written) { ERROR ((0, errno, _("Only wrote %ld of %ld bytes to file %s"), check, written, current_file_name)); skip_file ((long) (size - written)); break; } } if (flag_multivol) assign_string (&save_name, NULL); saverec (NULL); /* unsave it */ fputc ('\n', stdlis); fflush (stdlis); return; } saverec ((union record **) 0); /* unsave it */ /* Check to see if we have an extended header to skip over also. */ if (head->header.isextended) isextended = 1; /* Skip past the header in the archive. */ userec (head); /* If we needed to skip any extended headers, do so now, by reading extended headers and skipping past them in the archive. */ if (isextended) { #if 0 register union record *exhdr; while (1) { exhdr = findrec (); if (!exhdr->ext_hdr.isextended) { userec (exhdr); break; } userec (exhdr); } #endif skip_extended_headers (); } if (flag_multivol) assign_string (&save_name, current_file_name); /* Skip to the next header on the archive. */ skip_file ((long) hstat.st_size); if (flag_multivol) assign_string (&save_name, NULL); } /*-------------------------------------------------------------------------. | Read a record that's supposed to be a header record. Return its address | | in "head", and if it is good, the file's size in hstat.st_size. | | | | Return 1 for success, 0 if the checksum is bad, EOF on eof, 2 for a | | record full of zeros (EOF marker). | | | | You must always userec(head) to skip past the header which this routine | | reads. | `-------------------------------------------------------------------------*/ /* The standard BSD tar sources create the checksum by adding up the bytes in the header as type char. I think the type char was unsigned on the PDP-11, but it's signed on the Next and Sun. It looks like the sources to BSD tar were never changed to compute the checksum currectly, so both the Sun and Next add the bytes of the header as signed chars. This doesn't cause a problem until you get a file with a name containing characters with the high bit set. So read_header computes two checksums -- signed and unsigned. */ int read_header (void) { register int i; register long sum, signed_sum, recsum; register char *p; register union record *header; char **longp; char *bp, *data; int size, written; static char *next_long_name, *next_long_link; while (1) { header = findrec (); head = header; /* this is our current header */ if (!header) return EOF; recsum = from_oct (8, header->header.chksum); sum = 0; signed_sum = 0; p = header->charptr; for (i = sizeof (*header); --i >= 0;) { /* We can't use unsigned char here because of old compilers, e.g. V7. */ sum += 0xFF & *p; signed_sum += *p++; } /* Adjust checksum to count the "chksum" field as blanks. */ for (i = sizeof (header->header.chksum); --i >= 0;) { sum -= 0xFF & header->header.chksum[i]; signed_sum -= (char) header->header.chksum[i]; } sum += ' ' * sizeof header->header.chksum; signed_sum += ' ' * sizeof header->header.chksum; if (sum == 8 * ' ') { /* This is a zeroed record...whole record is 0's except for the 8 blanks we faked for the checksum field. */ return 2; } if (sum != recsum && signed_sum != recsum) return 0; /* Good record. Decode file size and return. */ if (header->header.linkflag == LF_LINK) hstat.st_size = 0; /* links 0 size on tape */ else hstat.st_size = from_oct (1 + 12, header->header.size); header->header.arch_name[NAMSIZ - 1] = '\0'; if (header->header.linkflag == LF_LONGNAME || header->header.linkflag == LF_LONGLINK) { longp = ((header->header.linkflag == LF_LONGNAME) ? &next_long_name : &next_long_link); userec (header); if (*longp) free (*longp); bp = *longp = (char *) ck_malloc ((size_t) hstat.st_size); for (size = hstat.st_size; size > 0; size -= written) { data = findrec ()->charptr; if (data == NULL) { ERROR ((0, 0, _("Unexpected EOF on archive file"))); break; } written = endofrecs ()->charptr - data; if (written > size) written = size; memcpy (bp, data, (size_t) written); bp += written; userec ((union record *) (data + written - 1)); } /* Loop! */ } else { assign_string (¤t_file_name, (next_long_name ? next_long_name : head->header.arch_name)); assign_string (¤t_link_name, (next_long_link ? next_long_link : head->header.arch_linkname)); next_long_link = next_long_name = 0; return 1; } } } /*-------------------------------------------------------------------------. | Decode things from a file header record into a "struct stat". Also set | | "*stdp" to !=0 or ==0 depending whether header record is "Unix Standard" | | tar format or regular old tar format. | | | | read_header() has already decoded the checksum and length, so we don't. | | | | If wantug != 0, we want the uid/group info decoded from Unix Standard | | tapes (for extraction). If == 0, we are just printing anyway, so save | | time. | | | | decode_header should NOT be called twice for the same record, since the | | two calls might use different "wantug" values and thus might end up with | | different uid/gid for the two calls. If anybody wants the uid/gid they | | should decode it first, and other callers should decode it without | | uid/gid before calling a routine, e.g. print_header, that assumes | | decoded data. | `-------------------------------------------------------------------------*/ void decode_header (register union record *header, register struct stat *st, int *stdp, int wantug) { st->st_mode = from_oct (8, header->header.mode); st->st_mode &= 07777; st->st_mtime = from_oct (1 + 12, header->header.mtime); if (flag_gnudump) { st->st_atime = from_oct (1 + 12, header->header.atime); st->st_ctime = from_oct (1 + 12, header->header.ctime); } if (strcmp (header->header.magic, TMAGIC) == 0) { /* Unix Standard tar archive. */ *stdp = 1; if (wantug) { #ifdef NONAMES st->st_uid = from_oct (8, header->header.uid); st->st_gid = from_oct (8, header->header.gid); #else st->st_uid = (*header->header.uname ? finduid (header->header.uname) : from_oct (8, header->header.uid)); st->st_gid = (*header->header.gname ? findgid (header->header.gname) : from_oct (8, header->header.gid)); #endif } #if defined(S_IFBLK) || defined(S_IFCHR) switch (header->header.linkflag) { case LF_BLK: case LF_CHR: st->st_rdev = makedev (from_oct (8, header->header.devmajor), from_oct (8, header->header.devminor)); } #endif } else { /* Old fashioned tar archive. */ *stdp = 0; st->st_uid = from_oct (8, header->header.uid); st->st_gid = from_oct (8, header->header.gid); st->st_rdev = 0; } } /*------------------------------------------------------------------------. | Quick and dirty octal conversion. Result is -1 if the field is invalid | | (all blank, or nonoctal). | `------------------------------------------------------------------------*/ long from_oct (register int digs, register char *where) { register long value; while (ISSPACE (*where)) { /* skip spaces */ where++; if (--digs <= 0) return -1; /* all blank field */ } value = 0; while (digs > 0 && ISODIGIT (*where)) { /* Scan til nonoctal. */ value = (value << 3) | (*where++ - '0'); --digs; } if (digs > 0 && *where && !ISSPACE (*where)) return -1; /* ended on non-space/nul */ return value; } /*-------------------------------------------------------------------------. | Actually print it. | | | | Plain and fancy file header block logging. Non-verbose just prints the | | name, e.g. for "tar t" or "tar x". This should just contain file names, | | so it can be fed back into tar with xargs or the "-T" option. The | | verbose option can give a bunch of info, one line per file. I doubt | | anybody tries to parse its format, or if they do, they shouldn't. Unix | | tar is pretty random here anyway. | `-------------------------------------------------------------------------*/ /* Note that print_header uses the globals , , and , which must be set up in advance. This is not very clean and should be cleaned up. FIXME. */ #define UGSWIDTH 18 /* min width of User, group, size */ /* UGSWIDTH of 18 means that with user and group names <= 8 chars the columns never shift during the listing. */ #define DATEWIDTH 19 /* last mod date */ static int ugswidth = UGSWIDTH; /* max width encountered so far */ void print_header (void) { char modes[11]; char *timestamp; char uform[11], gform[11]; /* these hold formatted ints */ char *user, *group; char size[24]; /* holds a formatted long or maj, min */ time_t longie; /* to make ctime() call portable */ int pad; char *name; if (flag_sayblock) fprintf (stdlis, _("rec %10ld: "), baserec + (ar_record - ar_block)); #if 0 annofile (stdlis, (char *) NULL); #endif if (flag_verbose <= 1) { /* Just the fax, mam. */ char *quoted_name = quote_copy_string (current_file_name); if (quoted_name) { fprintf (stdlis, "%s\n", quoted_name); free (quoted_name); } else fprintf (stdlis, "%s\n", current_file_name); } else { /* File type and modes. */ modes[0] = '?'; switch (head->header.linkflag) { case LF_VOLHDR: modes[0] = 'V'; break; case LF_MULTIVOL: modes[0] = 'M'; break; case LF_NAMES: modes[0] = 'N'; break; case LF_LONGNAME: case LF_LONGLINK: ERROR ((0, 0, _("Visible longname error"))); break; case LF_SPARSE: case LF_NORMAL: case LF_OLDNORMAL: case LF_LINK: modes[0] = '-'; if (current_file_name[strlen (current_file_name) - 1] == '/') modes[0] = 'd'; break; case LF_DUMPDIR: modes[0] = 'd'; break; case LF_DIR: modes[0] = 'd'; break; case LF_SYMLINK: modes[0] = 'l'; break; case LF_BLK: modes[0] = 'b'; break; case LF_CHR: modes[0] = 'c'; break; case LF_FIFO: modes[0] = 'p'; break; case LF_CONTIG: modes[0] = 'C'; break; } demode ((unsigned) hstat.st_mode, modes + 1); /* Timestamp. */ longie = hstat.st_mtime; timestamp = ctime (&longie); timestamp[16] = '\0'; timestamp[24] = '\0'; /* User and group names. */ if (*head->header.uname && head_standard) { user = head->header.uname; } else { user = uform; sprintf (uform, "%ld", from_oct (8, head->header.uid)); } if (*head->header.gname && head_standard) { group = head->header.gname; } else { group = gform; sprintf (gform, "%ld", from_oct (8, head->header.gid)); } /* Format the file size or major/minor device numbers. */ switch (head->header.linkflag) { #if defined(S_IFBLK) || defined(S_IFCHR) case LF_CHR: case LF_BLK: sprintf (size, "%d,%d", major (hstat.st_rdev), minor (hstat.st_rdev)); break; #endif case LF_SPARSE: sprintf (size, "%ld", from_oct (1 + 12, head->header.realsize)); break; default: sprintf (size, "%ld", (long) hstat.st_size); } /* Figure out padding and print the whole line. */ pad = strlen (user) + strlen (group) + strlen (size) + 1; if (pad > ugswidth) ugswidth = pad; fprintf (stdlis, "%s %s/%s %*s%s %s %s", modes, user, group, ugswidth - pad, "", size, timestamp + 4, timestamp + 20); name = quote_copy_string (current_file_name); if (name) { fprintf (stdlis, " %s", name); free (name); } else fprintf (stdlis, " %s", current_file_name); switch (head->header.linkflag) { case LF_SYMLINK: name = quote_copy_string (current_link_name); if (name) { fprintf (stdlis, " -> %s\n", name); free (name); } else fprintf (stdlis, " -> %s\n", current_link_name); break; case LF_LINK: name = quote_copy_string (current_link_name); if (name) { fprintf (stdlis, _(" link to %s\n"), name); free (name); } else fprintf (stdlis, _(" link to %s\n"), current_link_name); break; default: fprintf (stdlis, _(" unknown file type `%c'\n"), head->header.linkflag); break; case LF_OLDNORMAL: case LF_NORMAL: case LF_SPARSE: case LF_CHR: case LF_BLK: case LF_DIR: case LF_FIFO: case LF_CONTIG: case LF_DUMPDIR: putc ('\n', stdlis); break; case LF_VOLHDR: fprintf (stdlis, _("--Volume Header--\n")); break; case LF_MULTIVOL: fprintf (stdlis, _("--Continued at byte %ld--\n"), from_oct (1 + 12, head->header.offset)); break; case LF_NAMES: fprintf (stdlis, _("--Mangled file names--\n")); break; } } fflush (stdlis); } /*--------------------------------------------------------------. | Print a similar line when we make a directory automatically. | `--------------------------------------------------------------*/ void pr_mkdir (char *pathname, int length, int mode) { char modes[11]; char *name; if (flag_verbose > 1) { /* File type and modes. */ modes[0] = 'd'; demode ((unsigned) mode, modes + 1); if (flag_sayblock) fprintf (stdlis, _("rec %10ld: "), baserec + (ar_record - ar_block)); #if 0 annofile (stdlis, (char *) NULL); #endif name = quote_copy_string (pathname); if (!name) name = pathname; fprintf (stdlis, "%s %*s %.*s\n", modes, ugswidth + DATEWIDTH, _("Creating directory:"), length, pathname); if (name != pathname) free (name); } } /*-----------------------------------------------------------. | Skip over bytes of data in records in the archive. | `-----------------------------------------------------------*/ void skip_file (register long size) { union record *x; if (flag_multivol) { save_totsize = size; save_sizeleft = size; } while (size > 0) { x = findrec (); if (x == NULL) ERROR ((TAREXIT_FAILURE, 0, _("Unexpected EOF on archive file"))); userec (x); size -= RECORDSIZE; if (flag_multivol) save_sizeleft -= RECORDSIZE; } } /*---. | ? | `---*/ void skip_extended_headers (void) { register union record *exhdr; while (1) { exhdr = findrec (); if (!exhdr->ext_hdr.isextended) { userec (exhdr); break; } userec (exhdr); } } /*--------------------------------------------------------------------. | Decode the mode string from a stat entry into a 9-char string and a | | null. | `--------------------------------------------------------------------*/ static void demode (register unsigned mode, register char *string) { register unsigned mask; register const char *rwx = "rwxrwxrwx"; for (mask = 0400; mask != 0; mask >>= 1) { if (mode & mask) *string++ = *rwx++; else { *string++ = '-'; rwx++; } } if (mode & S_ISUID) if (string[-7] == 'x') string[-7] = 's'; else string[-7] = 'S'; if (mode & S_ISGID) if (string[-4] == 'x') string[-4] = 's'; else string[-4] = 'S'; if (mode & S_ISVTX) if (string[-1] == 'x') string[-1] = 't'; else string[-1] = 'T'; *string = '\0'; } tar-1.11.8/src/mangle.c 644 625 1 6054 5702136443 7604 /* mangle.c -- encode long filenames Copyright (C) 1988, 1992, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "system.h" #include time_t time (); #include "tar.h" extern struct stat hstat; /* stat struct corresponding */ struct mangled { struct mangled *next; int type; char mangled[NAMSIZ]; char *linked_to; char normal[1]; }; /* Should use a hash table, etc. . */ struct mangled *first_mangle; int mangled_num = 0; /*---. | ? | `---*/ void extract_mangle (void) { char *buf; char *fromtape; char *to; char *ptr, *ptrend; char *nam1, *nam1end; int size; int copied; size = hstat.st_size; buf = to = xmalloc ((size_t) (size + 1)); buf[size] = '\0'; while (size > 0) { fromtape = findrec ()->charptr; if (fromtape == 0) { ERROR ((0, 0, _("Unexpected EOF in mangled names"))); return; } copied = endofrecs ()->charptr - fromtape; if (copied > size) copied = size; memcpy (to, fromtape, (size_t) copied); to += copied; size -= copied; userec ((union record *) (fromtape + copied - 1)); } for (ptr = buf; *ptr; ptr = ptrend) { ptrend = strchr (ptr, '\n'); *ptrend++ = '\0'; if (!strncmp (ptr, "Rename ", 7)) { nam1 = ptr + 7; nam1end = strchr (nam1, ' '); while (strncmp (nam1end, " to ", 4)) { nam1end++; nam1end = strchr (nam1end, ' '); } *nam1end = '\0'; if (ptrend[-2] == '/') ptrend[-2] = '\0'; un_quote_string (nam1end + 4); if (rename (nam1, nam1end + 4)) ERROR ((0, errno, _("Cannot rename %s to %s"), nam1, nam1end + 4)); else if (flag_verbose) WARN ((0, 0, _("Renamed %s to %s"), nam1, nam1end + 4)); } #ifdef S_ISLNK else if (!strncmp (ptr, "Symlink ", 8)) { nam1 = ptr + 8; nam1end = strchr (nam1, ' '); while (strncmp (nam1end, " to ", 4)) { nam1end++; nam1end = strchr (nam1end, ' '); } *nam1end = '\0'; un_quote_string (nam1); un_quote_string (nam1end + 4); if (symlink (nam1, nam1end + 4) && (unlink (nam1end + 4) || symlink (nam1, nam1end + 4))) ERROR ((0, errno, _("Cannot symlink %s to %s"), nam1, nam1end + 4)); else if (flag_verbose) WARN ((0, 0, _("Symlinked %s to %s"), nam1, nam1end + 4)); } #endif else ERROR ((0, 0, _("Unknown demangling command %s"), ptr)); } } tar-1.11.8/src/names.c 644 625 1 6542 5702136475 7453 /* Look up user and/or group names. Copyright (C) 1988, 1992, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Look up user and/or group names. This file should be modified for non-unix systems to do something reasonable. */ #include "system.h" #ifndef NONAMES /* Whole module goes away if NONAMES defined. Otherwise... */ #include #include extern struct group *getgrnam (); extern struct passwd *getpwnam (); #ifndef HAVE_GETPWUID extern struct passwd *getpwuid (); #endif #include "tar.h" static int saveuid = -993; static char saveuname[TUNMLEN]; static int my_uid = -993; static int savegid = -993; static char savegname[TGNMLEN]; static int my_gid = -993; #define myuid ( my_uid < 0? (my_uid = getuid()): my_uid ) #define mygid ( my_gid < 0? (my_gid = getgid()): my_gid ) /*-------------------------------------------------------------------. | Look up a user or group name from a uid/gid, maintaining a cache. | `-------------------------------------------------------------------*/ /* FIXME, for now it's a one-entry cache. FIXME2, the "-993" is to reduce the chance of a hit on the first lookup. This is ifdef'd because on Suns, it drags in about 38K of "yellow pages" code, roughly doubling the program size. Thanks guys. */ void finduname (char uname[TUNMLEN], int uid) { struct passwd *pw; if (uid != saveuid) { saveuid = uid; saveuname[0] = '\0'; pw = getpwuid (uid); if (pw) strncpy (saveuname, pw->pw_name, TUNMLEN); } strncpy (uname, saveuname, TUNMLEN); } /*---. | ? | `---*/ int finduid (char uname[TUNMLEN]) { struct passwd *pw; if (uname[0] != saveuname[0] /* quick test w/o proc call */ || strncmp (uname, saveuname, TUNMLEN) != 0) { strncpy (saveuname, uname, TUNMLEN); pw = getpwnam (uname); if (pw) { saveuid = pw->pw_uid; } else { saveuid = myuid; } } return saveuid; } /*---. | ? | `---*/ void findgname (char gname[TGNMLEN], int gid) { struct group *gr; #ifndef HAVE_GETGRGID extern struct group *getgrgid (); #endif if (gid != savegid) { savegid = gid; savegname[0] = '\0'; setgrent (); gr = getgrgid (gid); if (gr) strncpy (savegname, gr->gr_name, TGNMLEN); } strncpy (gname, savegname, TGNMLEN); } /*---. | ? | `---*/ int findgid (char gname[TUNMLEN]) { struct group *gr; if (gname[0] != savegname[0] /* quick test w/o proc call */ || strncmp (gname, savegname, TUNMLEN) != 0) { strncpy (savegname, gname, TUNMLEN); gr = getgrnam (gname); if (gr) { savegid = gr->gr_gid; } else { savegid = mygid; } } return savegid; } #endif tar-1.11.8/src/port.c 644 625 1 42573 5751574440 7362 /* Supporting routines which may sometimes be missing. Copyright (C) 1988, 1992, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "system.h" #include #define ISPRINT(Char) (ISASCII (Char) && isprint (Char)) extern long baserec; /* All machine-dependent #ifdefs should appear here, instead of being scattered through the file. For UN*X systems, it is better to figure out what is needed in the configure script, for most of the features. */ #ifdef __MSDOS__ char TTY_NAME[] = "con"; #define HAVE_STRSTR #define HAVE_RENAME #define HAVE_MKDIR #else char TTY_NAME[] = "/dev/tty"; #endif /* End of system-dependent #ifdefs */ /* I'm not sure the following inclusion is useful... */ #include "tar.h" #ifdef minix /*-------------------------------------------------------------------------. | Groan, Minix doesn't have execlp either! | | | | execlp(file,arg0,arg1...argn,(char *)NULL) | | | | exec a program, automatically searching for the program through all the | | directories on the PATH. | | | | This version is naive about variable argument lists, it assumes a | | straightforward C calling sequence. If your system has odd stacks *and* | | doesn't have execlp, YOU get to fix it. | `-------------------------------------------------------------------------*/ int execlp (char *filename, char *arg0) { register char *p, *path; register char *fnbuffer; char **argstart = &arg0; struct stat statbuf; extern char **environ; if (p = getenv ("PATH"), p == NULL) { /* Could not find path variable -- try to exec given filename. */ return execve (filename, argstart, environ); } /* Make a place to build the filename. We malloc larger than we need, but we know it will fit in this. */ fnbuffer = malloc (strlen (p) + 1 + strlen (filename)); if (fnbuffer == NULL) { errno = ENOMEM; return -1; } /* Try each component of the path to see if the file's there and executable. */ for (path = p; path; path = p) { /* Construct full path name to try. */ if (p = strchr (path, ':'), !p) strcpy (fnbuffer, path); else { strncpy (fnbuffer, path, p - path); fnbuffer[p - path] = '\0'; p++; /* skip : for next time */ } if (strlen (fnbuffer) != 0) strcat (fnbuffer, "/"); strcat (fnbuffer, filename); /* Check to see if file is there and is a normal file. */ if (stat (fnbuffer, &statbuf) < 0) { if (errno == ENOENT) continue; /* file not there,keep on looking */ else goto fail; /* failed for some reason, return */ } if (!S_ISREG (statbuf.st_mode)) continue; if (execve (fnbuffer, argstart, environ) < 0 && errno != ENOENT && errno != ENOEXEC) { /* Failed, for some other reason besides "file. */ goto fail; } /* If we got error ENOEXEC, the file is executable but is not an object file. Try to execute it as a shell script, returning error if we can't execute /bin/sh. FIXME, this code is broken in several ways. Shell scripts should not in general be executed by the user's SHELL variable program. On more mature systems, the script can specify with #!/bin/whatever. Also, this code clobbers argstart[-1] if the exec of the shell fails. */ if (errno == ENOEXEC) { char *shell; /* Try to execute command "sh arg0 arg1 ...". */ if (shell = getenv ("SHELL"), shell == NULL) shell = "/bin/sh"; argstart[-1] = shell; argstart[0] = fnbuffer; execve (shell, &argstart[-1], environ); goto fail; /* exec didn't work */ } /* If we succeeded, the execve() doesn't return, so we can only be here is if the file hasn't been found yet. Try the next place on the path. */ } /* All attempts failed to locate the file. Give up. */ errno = ENOENT; fail: free (fnbuffer); return -1; } #endif /* minix */ #ifdef EMUL_OPEN3 #include "open3.h" /*-----------------------------------------------------------------------. | open3 -- routine to emulate the 3-argument open system. | | | | open3 (path, flag, mode); | | | | Attempts to open the file specified by the given pathname. The | | following flag bits specify options to the routine. Needless to say, | | you should only specify one of the first three. Function returns file | | descriptor if successful, -1 and errno if not. | `-----------------------------------------------------------------------*/ /* The following symbols should #defined in system.h... Are they? FIXME O_RDONLY file open for read only O_WRONLY file open for write only O_RDWR file open for both read & write O_CREAT file is created with specified mode if it needs to be O_TRUNC if file exists, it is truncated to 0 bytes O_EXCL used with O_CREAT--routine returns error if file exists */ /* Call that if present in most modern Unix systems. This version attempts to support all the flag bits except for O_NDELAY and O_APPEND, which are silently ignored. The emulation is not as efficient as the real thing (at worst, 4 system calls instead of one), but there's not much I can do about that. Written 6/10/87 by Richard Todd. */ /* array to give arguments to access for various modes FIXME, this table depends on the specific integer values of O_*, and also contains integers (args to 'access') that should be #define's. */ static int modes[] = { 04, /* O_RDONLY */ 02, /* O_WRONLY */ 06, /* O_RDWR */ 06, /* invalid but we'd better cope -- O_WRONLY+O_RDWR */ }; /* Shut off the automatic emulation of open(), we'll need it. */ #undef open int open3 (char *path, int flags, int mode) { int exists = 1; int call_creat = 0; int fd; /* We actually do the work by calling the open() or creat() system call, depending on the flags. Call_creat is true if we will use creat(), false if we will use open(). */ /* See if the file exists and is accessible in the requested mode. Strictly speaking we shouldn't be using access, since access checks against real uid, and the open call should check against euid. Most cases real uid == euid, so it won't matter. FIXME. FIXME, the construction "flags & 3" and the modes table depends on the specific integer values of the O_* #define's. Foo! */ if (access (path, modes[flags & 3]) < 0) { if (errno == ENOENT) { /* The file does not exist. */ exists = 0; } else { /* Probably permission violation. */ if (flags & O_EXCL) { /* Oops, the file exists, we didn't want it. No matter what the error, claim EEXIST. */ errno = EEXIST; } return -1; } } /* If we have the O_CREAT bit set, check for O_EXCL. */ if (flags & O_CREAT) { if ((flags & O_EXCL) && exists) { /* Oops, the file exists and we didn't want it to. */ errno = EEXIST; return -1; } /* If the file doesn't exist, be sure to call creat() so that it will be created with the proper mode. */ if (!exists) call_creat = 1; } else { /* If O_CREAT isn't set and the file doesn't exist, error. */ if (!exists) { errno = ENOENT; return -1; } } /* If the O_TRUNC flag is set and the file exists, we want to call creat() anyway, since creat() guarantees that the file will be truncated and open()-for-writing doesn't. (If the file doesn't exist, we're calling creat() anyway and the file will be created with zero length.) */ if ((flags & O_TRUNC) && exists) call_creat = 1; /* Actually do the call. */ if (call_creat) { /* Call creat. May have to close and reopen the file if we want O_RDONLY or O_RDWR access -- creat() only gives O_WRONLY. */ fd = creat (path, mode); if (fd < 0 || (flags & O_WRONLY)) return fd; if (close (fd) < 0) return -1; /* Fall out to reopen the file we've created. */ } /* Calling old open, we strip most of the new flags just in case. */ return open (path, flags & (O_RDONLY | O_WRONLY | O_RDWR | O_BINARY)); } #endif /* EMUL_OPEN3 */ #ifndef HAVE_MKNOD #ifdef __MSDOS__ typedef int dev_t; #endif /*----------------------------. | Fake mknod by complaining. | `----------------------------*/ int mknod (char *path, unsigned short mode, dev_t dev) { int fd; errno = ENXIO; /* no such device or address */ return -1; /* just give an error */ } /*------------------------. | Fake links by copying. | `------------------------*/ int link (char *path1, char *path2) { char buf[256]; int ifd, ofd; int nrbytes; int nwbytes; WARN ((0, 0, _("%s: Cannot link to %s, copying instead"), path1, path2)); if (ifd = open (path1, O_RDONLY | O_BINARY), ifd < 0) return -1; if (ofd = creat (path2, 0666), ofd < 0) return -1; #ifdef __MSDOS__ setmode (ofd, O_BINARY); #endif while (nrbytes = read (ifd, buf, sizeof (buf)), nrbytes > 0) { if (nwbytes = write (ofd, buf, nrbytes), nwbytes != nrbytes) { nrbytes = -1; break; } } /* Note use of "|" rather than "||" below: we want to close. */ if ((nrbytes < 0) | (close (ifd) != 0) | (close (ofd) != 0)) { unlink (path2); return -1; } return 0; } /* Everyone owns everything on MS-DOS (or is it no one owns anything?). */ /*---. | ? | `---*/ static int chown (char *path, int uid, int gid) { return 0; } /*---. | ? | `---*/ int geteuid (void) { return 0; } #endif /* !HAVE_MKNOD */ #ifdef __TURBOC__ #include #include #include struct utimbuf { time_t actime; /* access time */ time_t modtime; /* modification time */ }; /*---. | ? | `---*/ int utime (char *filename, struct utimbuf *utb) { struct tm *tm; struct ftime filetime; time_t when; int fd; int status; if (utb == 0) when = time (0); else when = utb->modtime; fd = _open (filename, O_RDWR); if (fd == -1) return -1; tm = localtime (&when); if (tm->tm_year < 80) filetime.ft_year = 0; else filetime.ft_year = tm->tm_year - 80; filetime.ft_month = tm->tm_mon + 1; filetime.ft_day = tm->tm_mday; if (tm->tm_hour < 0) filetime.ft_hour = 0; else filetime.ft_hour = tm->tm_hour; filetime.ft_min = tm->tm_min; filetime.ft_tsec = tm->tm_sec / 2; status = setftime (fd, &filetime); _close (fd); return status; } #endif /* __TURBOC__ */ /*---. | ? | `---*/ voidstar ck_malloc (size_t size) { if (!size) size++; return xmalloc (size); } /* Implement a variable sized buffer of 'stuff'. We don't know what it is, nor do we care, as long as it doesn't mind being aligned on a char boundry. */ struct buffer { int allocated; int length; char *b; }; /*---. | ? | `---*/ #define MIN_ALLOCATE 50 char * init_buffer (void) { struct buffer *b; b = (struct buffer *) xmalloc (sizeof (struct buffer)); b->allocated = MIN_ALLOCATE; b->b = (char *) xmalloc (MIN_ALLOCATE); b->length = 0; return (char *) b; } /*---. | ? | `---*/ void flush_buffer (char *bb) { struct buffer *b; b = (struct buffer *) bb; free (b->b); b->b = 0; b->allocated = 0; b->length = 0; free ((void *) b); } /*---. | ? | `---*/ void add_buffer (char *bb, const char *p, int n) { struct buffer *b; b = (struct buffer *) bb; if (b->length + n > b->allocated) { b->allocated = b->length + n + MIN_ALLOCATE; b->b = (char *) xrealloc (b->b, (size_t) b->allocated); } memcpy (b->b + b->length, p, (size_t) n); b->length += n; } /*---. | ? | `---*/ char * get_buffer (char *bb) { struct buffer *b; b = (struct buffer *) bb; return b->b; } /*---. | ? | `---*/ char * merge_sort (char *list, unsigned n, int off, int (*cmp) ()) { char *ret; char *alist, *blist; unsigned alength, blength; char *tptr; int tmp; char **prev; #define NEXTOF(Ptr) (* ((char **)(((char *)(Ptr))+off) ) ) if (n == 1) return list; if (n == 2) { if ((*cmp) (list, NEXTOF (list)) > 0) { ret = NEXTOF (list); NEXTOF (ret) = list; NEXTOF (list) = 0; return ret; } return list; } alist = list; alength = (n + 1) / 2; blength = n / 2; for (tptr = list, tmp = (n - 1) / 2; tmp; tptr = NEXTOF (tptr), tmp--) ; blist = NEXTOF (tptr); NEXTOF (tptr) = 0; alist = merge_sort (alist, alength, off, cmp); blist = merge_sort (blist, blength, off, cmp); prev = &ret; for (; alist && blist;) { if ((*cmp) (alist, blist) < 0) { tptr = NEXTOF (alist); *prev = alist; prev = &(NEXTOF (alist)); alist = tptr; } else { tptr = NEXTOF (blist); *prev = blist; prev = &(NEXTOF (blist)); blist = tptr; } } if (alist) *prev = alist; else *prev = blist; return ret; } /*---. | ? | `---*/ void ck_close (int fd) { if (close (fd) < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot close a file #%d"), fd)); } #include /*-------------------------------------------------------------------------. | Quote_copy_string is like quote_string, but instead of modifying the | | string in place, it malloc-s a copy of the string, and returns that. If | | the string does not have to be quoted, it returns the NULL string. The | | allocated copy can, of course, be freed with free() after the caller is | | done with it. | `-------------------------------------------------------------------------*/ char * quote_copy_string (const char *string) { const char *from_here; char *to_there = NULL; char *copy_buf = NULL; int c; int copying = 0; from_here = string; while (*from_here) { c = (unsigned char) *from_here++; if (c == '\\') { if (!copying) { int n; n = (from_here - string) - 1; copying++; copy_buf = (char *) xmalloc (n + 5 + strlen (from_here) * 4); memcpy (copy_buf, string, (size_t) n); to_there = copy_buf + n; } *to_there++ = '\\'; *to_there++ = '\\'; } else if (ISPRINT (c)) { if (copying) *to_there++ = c; } else { if (!copying) { int n; n = (from_here - string) - 1; copying++; copy_buf = (char *) xmalloc (n + 5 + strlen (from_here) * 4); memcpy (copy_buf, string, (size_t) n); to_there = copy_buf + n; } *to_there++ = '\\'; if (c == '\n') *to_there++ = 'n'; else if (c == '\t') *to_there++ = 't'; else if (c == '\f') *to_there++ = 'f'; else if (c == '\b') *to_there++ = 'b'; else if (c == '\r') *to_there++ = 'r'; else if (c == '\177') *to_there++ = '?'; else { to_there[0] = (c >> 6) + '0'; to_there[1] = ((c >> 3) & 07) + '0'; to_there[2] = (c & 07) + '0'; to_there += 3; } } } if (copying) { *to_there = '\0'; return copy_buf; } return NULL; } /*-----------------------------------------------------------------------. | Un_quote_string takes a quoted c-string (like those produced by | | quote_string or quote_copy_string and turns it back into the un-quoted | | original. This is done in place. | `-----------------------------------------------------------------------*/ /* There is no un-quote-copy-string. Write it yourself */ char * un_quote_string (char *string) { char *ret; char *from_here; char *to_there; int tmp; ret = string; to_there = string; from_here = string; while (*from_here) { if (*from_here != '\\') { if (from_here != to_there) *to_there++ = *from_here++; else from_here++, to_there++; continue; } switch (*++from_here) { case '\\': *to_there++ = *from_here++; break; case 'n': *to_there++ = '\n'; from_here++; break; case 't': *to_there++ = '\t'; from_here++; break; case 'f': *to_there++ = '\f'; from_here++; break; case 'b': *to_there++ = '\b'; from_here++; break; case 'r': *to_there++ = '\r'; from_here++; break; case '?': *to_there++ = 0177; from_here++; break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': tmp = *from_here - '0'; from_here++; if (*from_here < '0' || *from_here > '7') { *to_there++ = tmp; break; } tmp = tmp * 8 + *from_here - '0'; from_here++; if (*from_here < '0' || *from_here > '7') { *to_there++ = tmp; break; } tmp = tmp * 8 + *from_here - '0'; from_here++; *to_there++ = tmp; break; default: ret = 0; *to_there++ = '\\'; *to_there++ = *from_here++; break; } } if (*to_there) *to_there++ = '\0'; return ret; } #ifndef __MSDOS__ /*---. | ? | `---*/ void ck_pipe (int *pipes) { if (pipe (pipes) < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot open a pipe"))); } #endif /* !__MSDOS__ */ tar-1.11.8/src/rtapelib.c 644 625 1 37642 5731466444 10203 /* Functions for communicating with a remote tape drive. Copyright (C) 1988, 1992, 1994 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The man page rmt(8) for /etc/rmt documents the remote mag tape protocol which rdump and rrestore use. Unfortunately, the man page is *WRONG*. The author of the routines I'm including originally wrote his code just based on the man page, and it didn't work, so he went to the rdump source to figure out why. The only thing he had to change was to check for the 'F' return code in addition to the 'E', and to separate the various arguments with \n instead of a space. I personally don't think that this is much of a problem, but I wanted to point it out. -- Arnold Robbins Originally written by Jeff Lee, modified some by Arnold Robbins. Redone as a library that can replace open, read, write, etc., by Fred Fish, with some additional work by Arnold Robbins. Modified to make all rmt* calls into macros for speed by Jay Fenlason. Use -DHAVE_NETDB_H for rexec code, courtesy of Dan Kegel. */ #include "system.h" #include #ifdef HAVE_NETDB_H # include #endif #include #include "rmt.h" /* Just to shut up -Wall. FIXME. */ int rexec (); /* Exit status if exec errors. */ #define EXIT_ON_EXEC_ERROR 128 /* Size of buffers for reading and writing commands to rmt. FIXME. */ #define CMDBUFSIZE 64 #ifndef RETSIGTYPE #define RETSIGTYPE void #endif /* Maximum number of simultaneous remote tape connections. FIXME. */ #define MAXUNIT 4 /* Return the parent's read side of remote tape connection Fd. */ #define READ(Fd) (from_remote[Fd][0]) /* Return the parent's write side of remote tape connection Fd. */ #define WRITE(Fd) (to_remote[Fd][1]) /* The pipes for receiving data from remote tape drives. */ static int from_remote[MAXUNIT][2] = {{-1, -1}, {-1, -1}, {-1, -1}, {-1, -1}}; /* The pipes for sending data to remote tape drives. */ static int to_remote[MAXUNIT][2] = {{-1, -1}, {-1, -1}, {-1, -1}, {-1, -1}}; /* Temporary variable used by macros in rmt.h. */ char *__rmt_path; /*-----------------------------------------------. | Close remote tape connection FILE_DESCRIPTOR. | `-----------------------------------------------*/ static void _rmt_shutdown (int file_descriptor) { close (READ (file_descriptor)); close (WRITE (file_descriptor)); READ (file_descriptor) = -1; WRITE (file_descriptor) = -1; } /*------------------------------------------------------------------------. | Attempt to perform the remote tape command specified in BUF on remote | | tape connection FILE_DESCRIPTOR. Return 0 if successful, -1 on error. | `------------------------------------------------------------------------*/ static int do_command (int file_descriptor, const char *buf) { register int buflen; RETSIGTYPE (*pipe_handler) (); /* Save the current pipe handler and try to make the request. */ pipe_handler = signal (SIGPIPE, SIG_IGN); buflen = strlen (buf); if (write (WRITE (file_descriptor), buf, (size_t) buflen) == buflen) { signal (SIGPIPE, pipe_handler); return 0; } /* Something went wrong. Close down and go home. */ signal (SIGPIPE, pipe_handler); _rmt_shutdown (file_descriptor); errno = EIO; return -1; } /*-------------------------------------------------------------------------. | Read and return the status from remote tape connection FILE_DESCRIPTOR. | | If an error occurred, return -1 and set errno. | `-------------------------------------------------------------------------*/ static int get_status (int file_descriptor) { int i; char c, *cp; char command_buffer[CMDBUFSIZE]; /* Read the reply command line. */ for (i = 0, cp = command_buffer; i < CMDBUFSIZE; i++, cp++) { if (read (READ (file_descriptor), cp, 1) != 1) { _rmt_shutdown (file_descriptor); errno = EIO; return -1; } if (*cp == '\n') { *cp = '\0'; break; } } if (i == CMDBUFSIZE) { _rmt_shutdown (file_descriptor); errno = EIO; return -1; } /* Check the return status. */ for (cp = command_buffer; *cp; cp++) if (*cp != ' ') break; if (*cp == 'E' || *cp == 'F') { errno = atoi (cp + 1); /* Skip the error message line. */ while (read (READ (file_descriptor), &c, 1) == 1) if (c == '\n') break; if (*cp == 'F') _rmt_shutdown (file_descriptor); return -1; } /* Check for mis-synced pipes. */ if (*cp != 'A') { _rmt_shutdown (file_descriptor); errno = EIO; return -1; } /* Got an `A' (success) response. */ return atoi (cp + 1); } #ifdef HAVE_NETDB_H /*-------------------------------------------------------------------------. | Execute /etc/rmt as user USER on remote system HOST using rexec. Return | | a file descriptor of a bidirectional socket for stdin and stdout. If | | USER is NULL, use the current username. | | | | By default, this code is not used, since it requires that the user have | | a .netrc file in his/her home directory, or that the application | | designer be willing to have rexec prompt for login and password info. | | This may be unacceptable, and .rhosts files for use with rsh are much | | more common on BSD systems. | `-------------------------------------------------------------------------*/ static int _rmt_rexec (char *host, char *user) { struct servent *rexecserv; int save_stdin = dup (fileno (stdin)); int save_stdout = dup (fileno (stdout)); int tape_fd; /* return value */ /* When using cpio -o < filename, stdin is no longer the tty. But the rexec subroutine reads the login and the passwd on stdin, to allow remote execution of the command. So, reopen stdin and stdout on /dev/tty before the rexec and give them back their original value after. */ if (freopen ("/dev/tty", "r", stdin) == NULL) freopen ("/dev/null", "r", stdin); if (freopen ("/dev/tty", "w", stdout) == NULL) freopen ("/dev/null", "w", stdout); if (rexecserv = getservbyname ("exec", "tcp"), !rexecserv) error (EXIT_ON_EXEC_ERROR, 0, _("exec/tcp: Service not available")); tape_fd = rexec (&host, rexecserv->s_port, user, NULL, "/etc/rmt", (int *) NULL); fclose (stdin); fdopen (save_stdin, "r"); fclose (stdout); fdopen (save_stdout, "w"); return tape_fd; } #endif /* HAVE_NETDB_H */ /*-------------------------------------------------------------------------. | Open a file (some magnetic tape device?) on the system specified in | | PATH, as the given user. PATH has the form `[USER@]HOST:FILE'. OFLAG | | is O_RDONLY, O_WRONLY, etc. If successful, return the remote pipe | | number plus BIAS. REMOTE_SHELL may be overriden. On error, return -1. | `-------------------------------------------------------------------------*/ int __rmt_open (const char *path, int oflag, int bias, const char *remote_shell) { int remote_pipe_number; /* pseudo, biased file descriptor */ char *path_copy; /* copy of path string */ char *cursor; /* cursor in path_copy */ char *remote_host; /* remote host name */ char *remote_file; /* remote file name (often a device) */ char *remote_user; /* remote user name */ char command_buffer[CMDBUFSIZE]; #ifndef HAVE_NETDB_H const char *remote_shell_basename; int status; #endif /* Find an unused pair of file descriptors. */ for (remote_pipe_number = 0; remote_pipe_number < MAXUNIT; remote_pipe_number++) if (READ (remote_pipe_number) == -1 && WRITE (remote_pipe_number) == -1) break; if (remote_pipe_number == MAXUNIT) { errno = EMFILE; return -1; } /* Pull apart the system and device, and optional user. */ path_copy = xstrdup (path); remote_host = path_copy; remote_user = NULL; remote_file = NULL; for (cursor = path_copy; *cursor; cursor++) switch (*cursor) { default: break; case '@': if (!remote_user) { remote_user = remote_host; *cursor = '\0'; remote_host = cursor + 1; } break; case ':': if (!remote_file) { *cursor = '\0'; remote_file = cursor + 1; } break; } /* FIXME: Should somewhat validate the decoding, here. */ if (*remote_user == '\0') remote_user = NULL; #ifdef HAVE_NETDB_H /* Execute the remote command using rexec. */ READ (remote_pipe_number) = _rmt_rexec (remote_host, remote_user); if (READ (remote_pipe_number) < 0) { free (path_copy); return -1; } WRITE (remote_pipe_number) = READ (remote_pipe_number); #else /* not HAVE_NETDB_H */ /* Identify the remote command to be executed. */ if (!remote_shell) { #ifdef REMOTE_SHELL remote_shell = REMOTE_SHELL; #else errno = EIO; free (path_copy); return -1; #endif } remote_shell_basename = strrchr (remote_shell, '/'); if (remote_shell_basename) remote_shell_basename++; else remote_shell_basename = remote_shell; /* Set up the pipes for the `rsh' command, and fork. */ if (pipe (to_remote[remote_pipe_number]) == -1 || pipe (from_remote[remote_pipe_number]) == -1) { free (path_copy); return -1; } status = fork (); if (status == -1) { free (path_copy); return -1; } if (status == 0) { /* Child. */ close (0); dup (to_remote[remote_pipe_number][0]); close (to_remote[remote_pipe_number][0]); close (to_remote[remote_pipe_number][1]); close (1); dup (from_remote[remote_pipe_number][1]); close (from_remote[remote_pipe_number][0]); close (from_remote[remote_pipe_number][1]); setuid (getuid ()); setgid (getgid ()); if (remote_user) execl (remote_shell, remote_shell_basename, remote_host, "-l", remote_user, "/etc/rmt", (char *) 0); else execl (remote_shell, remote_shell_basename, remote_host, "/etc/rmt", (char *) 0); /* Bad problems if we get here. */ /* In a previous version, _exit was used here instead of exit. */ error (EXIT_ON_EXEC_ERROR, errno, _("Cannot execute remote shell")); } /* Parent. */ close (from_remote[remote_pipe_number][1]); close (to_remote[remote_pipe_number][0]); #endif /* not HAVE_NETDB_H */ /* Attempt to open the tape device. */ sprintf (command_buffer, "O%s\n%d\n", remote_file, oflag); if (do_command (remote_pipe_number, command_buffer) == -1 || get_status (remote_pipe_number) == -1) { free (path_copy); return -1; } free (path_copy); return remote_pipe_number + bias; } /*-------------------------------------------------------------------------. | Close remote tape connection FILE_DESCRIPTOR and shut down. Return 0 if | | successful, -1 on error. | `-------------------------------------------------------------------------*/ int __rmt_close (int file_descriptor) { int status; if (do_command (file_descriptor, "C\n") == -1) return -1; status = get_status (file_descriptor); _rmt_shutdown (file_descriptor); return status; } /*--------------------------------------------------------------------. | Read up to NBYTE bytes into BUF from remote tape connection | | FILE_DESCRIPTOR. Return the number of bytes read on success, -1 on | | error. | `--------------------------------------------------------------------*/ int __rmt_read (int file_descriptor, char *buf, unsigned int nbyte) { int status, i; char command_buffer[CMDBUFSIZE]; sprintf (command_buffer, "R%d\n", nbyte); if (do_command (file_descriptor, command_buffer) == -1 || (status = get_status (file_descriptor)) == -1) return -1; for (i = 0; i < status; i += nbyte, buf += nbyte) { nbyte = read (READ (file_descriptor), buf, (size_t) (status - i)); if (nbyte <= 0) { _rmt_shutdown (file_descriptor); errno = EIO; return -1; } } return status; } /*-----------------------------------------------------------------------. | Write NBYTE bytes from BUF to remote tape connection FILE_DESCRIPTOR. | | Return the number of bytes written on success, -1 on error. | `-----------------------------------------------------------------------*/ int __rmt_write (int file_descriptor, char *buf, unsigned int nbyte) { char command_buffer[CMDBUFSIZE]; RETSIGTYPE (*pipe_handler) (); sprintf (command_buffer, "W%d\n", nbyte); if (do_command (file_descriptor, command_buffer) == -1) return -1; pipe_handler = signal (SIGPIPE, SIG_IGN); if (write (WRITE (file_descriptor), buf, nbyte) == nbyte) { signal (SIGPIPE, pipe_handler); return get_status (file_descriptor); } /* Write error. */ signal (SIGPIPE, pipe_handler); _rmt_shutdown (file_descriptor); errno = EIO; return -1; } /*---------------------------------------------------------------------. | Perform an imitation lseek operation on remote tape connection | | FILE_DESCRIPTOR. Return the new file offset if successful, -1 if on | | error. | `---------------------------------------------------------------------*/ long __rmt_lseek (int file_descriptor, off_t offset, int whence) { char command_buffer[CMDBUFSIZE]; sprintf (command_buffer, "L%ld\n%d\n", offset, whence); if (do_command (file_descriptor, command_buffer) == -1) return -1; return get_status (file_descriptor); } /*-------------------------------------------------------------------------. | Perform a raw tape operation on remote tape connection FILE_DESCRIPTOR. | | Return the results of the ioctl, or -1 on error. | `-------------------------------------------------------------------------*/ int __rmt_ioctl (int file_descriptor, int op, char *arg) { char c; int status, cnt; char command_buffer[CMDBUFSIZE]; switch (op) { default: errno = EOPNOTSUPP; return -1; #ifdef MTIOCTOP case MTIOCTOP: /* MTIOCTOP is the easy one. Nothing is transfered in binary. */ sprintf (command_buffer, "I%d\n%d\n", ((struct mtop *) arg)->mt_op, ((struct mtop *) arg)->mt_count); if (do_command (file_descriptor, command_buffer) == -1) return -1; /* Return the count. */ return get_status (file_descriptor); #endif /* MTIOCTOP */ #ifdef MTIOCGET case MTIOCGET: /* Grab the status and read it directly into the structure. This assumes that the status buffer is not padded and that 2 shorts fit in a long without any word alignment problems; i.e., the whole struct is contiguous. NOTE - this is probably NOT a good assumption. */ if (do_command (file_descriptor, "S") == -1 || (status = get_status (file_descriptor), status == -1)) return -1; for (; status > 0; status -= cnt, arg += cnt) { cnt = read (READ (file_descriptor), arg, (size_t) status); if (cnt <= 0) { _rmt_shutdown (file_descriptor); errno = EIO; return -1; } } /* Check for byte position. mt_type (or mt_model) is a small integer field (normally) so we will check its magnitude. If it is larger than 256, we will assume that the bytes are swapped and go through and reverse all the bytes. */ if (((struct mtget *) arg)->MTIO_CHECK_FIELD < 256) return 0; for (cnt = 0; cnt < status; cnt += 2) { c = arg[cnt]; arg[cnt] = arg[cnt + 1]; arg[cnt + 1] = c; } return 0; #endif /* MTIOCGET */ } } tar-1.11.8/src/tar.c 644 625 1 125621 5770637640 7203 /* Tar -- a tape archiver. Copyright (C) 1988, 1992, 1993, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* A tar (tape archiver) program. Written by John Gilmore, starting 25 Aug 85. */ #include "system.h" #ifndef FNM_LEADING_DIR # include #endif #ifndef S_ISLNK # define lstat stat #endif #if WITH_REGEX # include #else # include #endif /* The following causes "tar.h" to produce definitions of all the global variables, rather than just "extern" declarations of them. */ #define GLOBAL #include "tar.h" /* We should use a conversion routine that does reasonable error checking -- atoi doesn't. For now, punt. FIXME. */ #define intconv atoi time_t get_date (); /* Local declarations. */ #ifndef DEFAULT_ARCHIVE # define DEFAULT_ARCHIVE "tar.out" #endif #ifndef DEFAULT_BLOCKING # define DEFAULT_BLOCKING 20 #endif time_t new_time; /* Miscellaneous. */ /*-------------------------------------------------------------------------. | Assign STRING to a copy of VALUE if not NULL, or to NULL. If STRING was | | not NULL, it is freed first. | `-------------------------------------------------------------------------*/ void assign_string (char **string, const char *value) { if (*string) free (*string); *string = value ? xstrdup (value) : NULL; } /*-----------------------------------------------------------------. | Returns non-zero if the luser typed 'y' or 'Y', zero otherwise. | `-----------------------------------------------------------------*/ int confirm (const char *action, const char *file) { int c, nl; static FILE *confirm_file = 0; fprintf (stdlis, "%s %s?", action, file); fflush (stdlis); if (!confirm_file) { confirm_file = (archive == 0) ? fopen (TTY_NAME, "r") : stdin; if (!confirm_file) ERROR ((TAREXIT_FAILURE, 0, _("Cannot read confirmation from user"))); } c = getc (confirm_file); for (nl = c; nl != '\n' && nl != EOF; nl = getc (confirm_file)) ; return c == 'y' || c == 'Y'; } /* Names from the command call. */ static const char **name_array; /* store an array of names */ static int allocated_names; /* how big is the array? */ static int names; /* how many entries does it have? */ static int name_index = 0; /* how many of the entries have we scanned? */ /*--------------------------------------------------------------. | Add NAME at end of name_array, reallocating it as necessary. | `--------------------------------------------------------------*/ static void name_add (const char *name) { if (names == allocated_names) { allocated_names *= 2; name_array = (const char **) xrealloc (name_array, sizeof (const char *) * allocated_names); } name_array[names++] = name; } /* Names from external name file. */ static FILE *name_file; /* file to read names from */ static char *const *names_argv; /* argv used by name routines */ static int names_argc; /* argc used by name routines */ static char *name_buffer; /* buffer to hold the current file name */ static size_t name_buffer_length; /* allocated length of name_buffer */ /*-------------------------------------------------------------------------. | Set up to gather file names for tar. They can either come from stdin or | | from argv. | `-------------------------------------------------------------------------*/ static void name_init (int argc, char *const *argv) { if (flag_namefile) { if (optind < argc) ERROR ((TAREXIT_FAILURE, 0, _("Too many args with -T option"))); if (!strcmp (namefile_name, "-")) name_file = stdin; else if (name_file = fopen (namefile_name, "r"), !name_file) ERROR ((TAREXIT_FAILURE, errno, _("Cannot open file %s"), name_file)); } else { /* Get file names from argv, after options. */ names_argc = argc; names_argv = argv; } } /*---------------------------------------------------------------------. | Read the next filename from name_file and null-terminate it. Put it | | into name_buffer, reallocating and adjusting name_buffer_length if | | necessary. Return 0 at end of file, 1 otherwise. | `---------------------------------------------------------------------*/ static int read_name_from_file (void) { register int c; register int counter = 0; /* FIXME: getc may be called even if c was EOF the last time here. */ /* FIXME: This + 2 allocation might serve no purpose. */ while (c = getc (name_file), c != EOF && c != filename_terminator) { if (counter == name_buffer_length) { name_buffer_length += NAMSIZ; name_buffer = xrealloc (name_buffer, name_buffer_length + 2); } name_buffer[counter++] = c; } if (counter == 0 && c == EOF) return 0; if (counter == name_buffer_length) { name_buffer_length += NAMSIZ; name_buffer = xrealloc (name_buffer, name_buffer_length + 2); } name_buffer[counter] = '\0'; return 1; } /*-------------------------------------------------------------------------. | Get the next name from argv or the name file. Result is in static | | storage and can't be relied upon across two calls. | | | | If CHANGE_DIRS is non-zero, treat a filename of the form "-C" as meaning | | that the next filename is the name of a directory to change to. If | | `filename_terminator' is '\0', CHANGE_DIRS is effectively always 0. | `-------------------------------------------------------------------------*/ char * name_next (int change_dirs) { const char *source; char *cursor; int chdir_flag = 0; if (filename_terminator == '\0') change_dirs = 0; if (name_file) { /* Read from file. */ while (read_name_from_file ()) if (*name_buffer) /* ignore emtpy lines */ { /* Zap trailing slashes. */ cursor = name_buffer + strlen (name_buffer) - 1; while (cursor > name_buffer && *cursor == '/') *cursor-- = '\0'; if (chdir_flag) { if (chdir (name_buffer) < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot change to directory %s"), name_buffer)); chdir_flag = 0; } else if (change_dirs && strcmp (name_buffer, "-C") == 0) chdir_flag = 1; else #if 0 if (!flag_exclude || !check_exclude (name_buffer)) #endif return un_quote_string (name_buffer); } /* No more names in file. */ } else { /* Read from argv, after options. */ while (1) { if (name_index < names) source = name_array[name_index++]; else if (optind < names_argc) source = names_argv[optind++]; else break; if (strlen (source) > name_buffer_length) { free (name_buffer); name_buffer_length = strlen (source); name_buffer = xmalloc (name_buffer_length + 2); } strcpy (name_buffer, source); /* Zap trailing slashes. */ cursor = name_buffer + strlen (name_buffer) - 1; while (cursor > name_buffer && *cursor == '/') *cursor-- = '\0'; if (chdir_flag) { if (chdir (name_buffer) < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot chdir to %s"), name_buffer)); chdir_flag = 0; } else if (change_dirs && strcmp (name_buffer, "-C") == 0) chdir_flag = 1; else #if 0 if (!flag_exclude || !check_exclude (name_buffer)) #endif return un_quote_string (name_buffer); } } if (chdir_flag) ERROR ((TAREXIT_FAILURE, 0, _("Missing filename after -C"))); return NULL; } /*------------------------------. | Close the name file, if any. | `------------------------------*/ void name_close (void) { if (name_file != NULL && name_file != stdin) fclose (name_file); } /*-------------------------------------------------------------------------. | Gather names in a list for scanning. Could hash them later if we really | | care. | | | | If the names are already sorted to match the archive, we just read them | | one by one. name_gather reads the first one, and it is called by | | name_match as appropriate to read the next ones. At EOF, the last name | | read is just left in the buffer. This option lets users of small | | machines extract an arbitrary number of files by doing "tar t" and | | editing down the list of files. | `-------------------------------------------------------------------------*/ void name_gather (void) { register char *p; static struct name *namebuf; /* one-name buffer */ static namelen; static char *chdir_name = NULL; if (flag_sorted_names) { if (!namelen) { namelen = NAMSIZ; namebuf = (struct name *) xmalloc (sizeof (struct name) + NAMSIZ); } p = name_next (0); if (p) { if (strcmp (p, "-C") == 0) { chdir_name = xstrdup (name_next (0)); p = name_next (0); if (!p) ERROR ((TAREXIT_FAILURE, 0, _("Missing file name after -C"))); namebuf->change_dir = chdir_name; } namebuf->length = strlen (p); if (namebuf->length >= namelen) { namebuf = (struct name *) xrealloc (namebuf, sizeof (struct name) + namebuf->length); namelen = namebuf->length; } strncpy (namebuf->name, p, (size_t) namebuf->length); namebuf->name[namebuf->length] = 0; namebuf->next = (struct name *) NULL; namebuf->found = 0; namelist = namebuf; namelast = namelist; } return; } /* Non sorted names -- read them all in. */ while (p = name_next (0), p) addname (p); } /*-----------------------------. | Add a name to the namelist. | `-----------------------------*/ void addname (const char *name) { register int i; /* length of string */ register struct name *p; /* current struct pointer */ static char *chdir_name = NULL; if (strcmp (name, "-C") == 0) { chdir_name = xstrdup (name_next (0)); name = name_next (0); if (!chdir_name) ERROR ((TAREXIT_FAILURE, 0, _("Missing file name after -C"))); if (chdir_name[0] != '/') { char *path = xmalloc (PATH_MAX); #ifdef HAVE_GETCWD if (!getcwd (path, PATH_MAX)) ERROR ((TAREXIT_FAILURE, 0, _("Could not get current directory"))); #else char *getwd (); if (!getwd (path)) ERROR ((TAREXIT_FAILURE, 0, _("Could not get current directory: %s"), path)); #endif chdir_name = xstrdup (new_name (path, chdir_name)); free (path); } } i = name ? strlen (name) : 0; p = (struct name *) xmalloc ((unsigned) (sizeof (struct name) + i)); p->next = (struct name *) NULL; if (name) { p->fake = 0; p->length = i; strncpy (p->name, name, (size_t) i); p->name[i] = '\0'; /* null term */ } else p->fake = 1; p->found = 0; p->regexp = 0; /* assume not a regular expression */ p->firstch = 1; /* assume first char is literal */ p->change_dir = chdir_name; p->dir_contents = 0; /* JF */ if (name) { if (strchr (name, '*') || strchr (name, '[') || strchr (name, '?')) { p->regexp = 1; /* no, it's a regexp */ if (name[0] == '*' || name[0] == '[' || name[0] == '?') p->firstch = 0; /* not even 1st char literal */ } } if (namelast) namelast->next = p; namelast = p; if (!namelist) namelist = p; } /*---------------------------------------------------------------------. | Return nonzero if name P (from an archive) matches any name from the | | namelist, zero if not. | `---------------------------------------------------------------------*/ int name_match (register const char *p) { register struct name *nlp; register int len; again: if (nlp = namelist, !nlp) /* empty namelist is easy */ return 1; if (nlp->fake) { if (nlp->change_dir && chdir (nlp->change_dir)) ERROR ((TAREXIT_FAILURE, errno, _("Cannot change to directory %s"), nlp->change_dir)); namelist = 0; return 1; } len = strlen (p); for (; nlp != 0; nlp = nlp->next) { /* If first chars don't match, quick skip. */ if (nlp->firstch && nlp->name[0] != p[0]) continue; /* Regular expressions (shell globbing, actually). */ if (nlp->regexp) { if (fnmatch (nlp->name, p, FNM_LEADING_DIR) == 0) { nlp->found = 1; /* remember it matched */ if (flag_startfile) { free ((void *) namelist); namelist = 0; } if (nlp->change_dir && chdir (nlp->change_dir)) ERROR ((TAREXIT_FAILURE, errno, _("Cannot change to directory %s"), nlp->change_dir)); /* We got a match. */ return 1; } continue; } /* Plain Old Strings. */ if (nlp->length <= len /* archive len >= specified */ && (p[nlp->length] == '\0' || p[nlp->length] == '/') /* full match on file/dirname */ && strncmp (p, nlp->name, (size_t) nlp->length) == 0) /* name compare */ { nlp->found = 1; /* remember it matched */ if (flag_startfile) { free ((void *) namelist); namelist = 0; } if (nlp->change_dir && chdir (nlp->change_dir)) ERROR ((TAREXIT_FAILURE, errno, _("Cannot change to directory %s"), nlp->change_dir)); /* We got a match. */ return 1; } } /* Filename from archive not found in namelist. If we have the whole namelist here, just return 0. Otherwise, read the next name in and compare it. If this was the last name, namelist->found will remain on. If not, we loop to compare the newly read name. */ if (flag_sorted_names && namelist->found) { name_gather (); /* read one more */ if (!namelist->found) goto again; } return 0; } /*------------------------------------------------------------------. | Print the names of things in the namelist that were not matched. | `------------------------------------------------------------------*/ void names_notfound (void) { register struct name *nlp, *next; register char *p; for (nlp = namelist; nlp != 0; nlp = next) { next = nlp->next; if (!nlp->found) ERROR ((0, 0, _("%s: Not found in archive"), nlp->name)); /* We could free() the list, but the process is about to die anyway, so save some CPU time. Amigas and other similarly broken software will need to waste the time, though. */ #ifdef amiga if (!flag_sorted_names) free (nlp); #endif } namelist = (struct name *) NULL; namelast = (struct name *) NULL; if (flag_sorted_names) { while (p = name_next (1), p) ERROR ((0, 0, _("%s: Not found in archive"), p)); } } /* These next routines were created by JF */ /*---. | ? | `---*/ void name_expand (void) { ; } /*------------------------------------------------------------------------. | This is like name_match(), except that it returns a pointer to the name | | it matched, and doesn't set ->found The caller will have to do that if | | it wants to. Oh, and if the namelist is empty, it returns 0, unlike | | name_match(), which returns TRUE | `------------------------------------------------------------------------*/ struct name * name_scan (register const char *p) { register struct name *nlp; register int len; again: if (nlp = namelist, !nlp) /* empty namelist is easy */ return 0; len = strlen (p); for (; nlp != 0; nlp = nlp->next) { /* If first chars don't match, quick skip. */ if (nlp->firstch && nlp->name[0] != p[0]) continue; /* Regular expressions. */ if (nlp->regexp) { if (fnmatch (nlp->name, p, FNM_LEADING_DIR) == 0) return nlp; /* we got a match */ continue; } /* Plain Old Strings. */ if (nlp->length <= len /* archive len >= specified */ && (p[nlp->length] == '\0' || p[nlp->length] == '/') /* full match on file/dirname */ && strncmp (p, nlp->name, (size_t) nlp->length) == 0) /* name compare */ return nlp; /* we got a match */ } /* Filename from archive not found in namelist. If we have the whole namelist here, just return 0. Otherwise, read the next name in and compare it. If this was the last name, namelist->found will remain on. If not, we loop to compare the newly read name. */ if (flag_sorted_names && namelist->found) { name_gather (); /* read one more */ if (!namelist->found) goto again; } return NULL; } /*-----------------------------------------------------------------------. | This returns a name from the namelist which doesn't have ->found set. | | It sets ->found before returning, so successive calls will find and | | return all the non-found names in the namelist | `-----------------------------------------------------------------------*/ struct name *gnu_list_name; char * name_from_list (void) { if (!gnu_list_name) gnu_list_name = namelist; while (gnu_list_name && gnu_list_name->found) gnu_list_name = gnu_list_name->next; if (gnu_list_name) { gnu_list_name->found++; if (gnu_list_name->change_dir) if (chdir (gnu_list_name->change_dir) < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot chdir to %s"), gnu_list_name->change_dir)); return gnu_list_name->name; } return NULL; } /*---. | ? | `---*/ void blank_name_list (void) { struct name *n; gnu_list_name = 0; for (n = namelist; n; n = n->next) n->found = 0; } /*---. | ? | `---*/ char * new_name (char *path, char *name) { char *path_buf; path_buf = (char *) xmalloc (strlen (path) + strlen (name) + 2); sprintf (path_buf, "%s/%s", path, name); return path_buf; } /* Excludes. */ char *x_buffer = NULL; int size_x_buffer; int free_x_buffer; char **exclude = NULL; int size_exclude = 0; int free_exclude = 0; char **re_exclude = NULL; int size_re_exclude = 0; int free_re_exclude = 0; /*---. | ? | `---*/ static int is_regex (const char *str) { return strchr (str, '*') || strchr (str, '[') || strchr (str, '?'); } /*---. | ? | `---*/ static void add_exclude (char *name) { int size_buf; un_quote_string (name); size_buf = strlen (name); if (x_buffer == 0) { x_buffer = (char *) xmalloc ((size_t) (size_buf + 1024)); free_x_buffer = 1024; } else if (free_x_buffer <= size_buf) { char *old_x_buffer; char **tmp_ptr; old_x_buffer = x_buffer; x_buffer = (char *) xrealloc (x_buffer, (size_t) (size_x_buffer + 1024)); free_x_buffer = 1024; for (tmp_ptr = exclude; tmp_ptr < exclude + size_exclude; tmp_ptr++) *tmp_ptr = x_buffer + ((*tmp_ptr) - old_x_buffer); for (tmp_ptr = re_exclude; tmp_ptr < re_exclude + size_re_exclude; tmp_ptr++) *tmp_ptr = x_buffer + ((*tmp_ptr) - old_x_buffer); } if (is_regex (name)) { if (free_re_exclude == 0) { re_exclude = (char **) xrealloc (re_exclude, (size_re_exclude + 32) * sizeof (char *)); free_re_exclude += 32; } re_exclude[size_re_exclude] = x_buffer + size_x_buffer; size_re_exclude++; free_re_exclude--; } else { if (free_exclude == 0) { exclude = (char **) xrealloc (exclude, (size_exclude + 32) * sizeof (char *)); free_exclude += 32; } exclude[size_exclude] = x_buffer + size_x_buffer; size_exclude++; free_exclude--; } strcpy (x_buffer + size_x_buffer, name); size_x_buffer += size_buf + 1; free_x_buffer -= size_buf + 1; } /*---. | ? | `---*/ static void add_exclude_file (char *file) { FILE *fp; char buf[1024]; if (strcmp (file, "-")) fp = fopen (file, "r"); else /* Let's hope the person knows what they're doing. Using -X - -T - -f - will get you *really* strange results. */ fp = stdin; if (!fp) ERROR ((TAREXIT_FAILURE, errno, _("Cannot open %s"), file)); while (fgets (buf, 1024, fp)) { #if 0 int size_buf; #endif char *end_str; end_str = strrchr (buf, '\n'); if (end_str) *end_str = '\0'; add_exclude (buf); } fclose (fp); } /*--------------------------------------------------------------------. | Returns non-zero if the file 'name' should not be added/extracted. | `--------------------------------------------------------------------*/ int check_exclude (const char *name) { int n; char *str; for (n = 0; n < size_re_exclude; n++) { if (fnmatch (re_exclude[n], name, FNM_LEADING_DIR) == 0) return 1; } for (n = 0; n < size_exclude; n++) { /* Accept the output from strstr only if it is the last part of the string. There is certainly a faster way to do this. */ if (str = strstr (name, exclude[n]), (str && (str == name || str[-1] == '/') && str[strlen (exclude[n])] == '\0')) return 1; } return 0; } /* Options. */ /* For long options that unconditionally set a single flag, we have getopt do it. For the others, we share the code for the equivalent short named option, the name of which is stored in the otherwise-unused `val' field of the `struct option'; for long options that have no equivalent short option, we use nongraphic characters as pseudo short option characters, starting (for no particular reason) with character 10. */ #define OPTION_PRESERVE 10 #define OPTION_NEWER_MTIME 11 #define OPTION_DELETE 12 #define OPTION_EXCLUDE 13 #define OPTION_NULL 14 #define OPTION_VOLNO_FILE 15 #define OPTION_COMPRESS_PROG 16 #define OPTION_RSH_COMMAND 17 /* Some cleanup is made in GNU tar long options. Using old names will send a warning to stderr. */ #define OBSOLETE_ABSOLUTE_NAMES 20 /* take it out in 1.14 */ /* If non-zero, display usage information and exit. */ static int show_help = 0; /* If non-zero, print the version on standard output and exit. */ static int show_version = 0; struct option long_options[] = { {"absolute-names", no_argument, NULL, 'P'}, {"absolute-paths", no_argument, NULL, OBSOLETE_ABSOLUTE_NAMES}, {"after-date", required_argument, NULL, 'N'}, {"append", no_argument, NULL, 'r'}, {"atime-preserve", no_argument, &flag_atime_preserve, 1}, {"block-compress", no_argument, &flag_compress_block, 1}, {"block-size", required_argument, NULL, 'b'}, {"catenate", no_argument, NULL, 'A'}, {"checkpoint", no_argument, &flag_checkpoint, 1}, {"compare", no_argument, NULL, 'd'}, {"compress", no_argument, NULL, 'Z'}, {"concatenate", no_argument, NULL, 'A'}, {"confirmation", no_argument, NULL, 'w'}, {"create", no_argument, NULL, 'c'}, {"delete", no_argument, NULL, OPTION_DELETE}, {"dereference", no_argument, NULL, 'h'}, {"diff", no_argument, NULL, 'd'}, {"directory", required_argument, NULL, 'C'}, {"exclude", required_argument, NULL, OPTION_EXCLUDE}, {"exclude-from", required_argument, NULL, 'X'}, {"extract", no_argument, NULL, 'x'}, {"file", required_argument, NULL, 'f'}, {"files-from", required_argument, NULL, 'T'}, {"force-local", no_argument, &flag_force_local, 1}, {"get", no_argument, NULL, 'x'}, {"gunzip", no_argument, NULL, 'z'}, {"gzip", no_argument, NULL, 'z'}, {"help", no_argument, &show_help, 1}, {"ignore-failed-read", no_argument, &flag_ignore_failed_read, 1}, {"ignore-zeros", no_argument, NULL, 'i'}, {"incremental", no_argument, NULL, 'G'}, {"info-script", required_argument, NULL, 'F'}, {"interactive", no_argument, NULL, 'w'}, {"keep-old-files", no_argument, NULL, 'k'}, {"label", required_argument, NULL, 'V'}, {"list", no_argument, NULL, 't'}, {"listed-incremental", required_argument, NULL, 'g'}, {"modification-time", no_argument, NULL, 'm'}, {"multi-volume", no_argument, NULL, 'M'}, {"new-volume-script", required_argument, NULL, 'F'}, {"newer", required_argument, NULL, 'N'}, {"newer-mtime", required_argument, NULL, OPTION_NEWER_MTIME}, {"null", no_argument, NULL, OPTION_NULL}, {"old-archive", no_argument, NULL, 'o'}, {"one-file-system", no_argument, NULL, 'l'}, {"portability", no_argument, NULL, 'o'}, {"preserve", no_argument, NULL, OPTION_PRESERVE}, {"preserve-order", no_argument, NULL, 's'}, {"preserve-permissions", no_argument, NULL, 'p'}, {"read-full-blocks", no_argument, NULL, 'B'}, {"record-number", no_argument, NULL, 'R'}, {"remove-files", no_argument, &flag_remove_files, 1}, {"rsh-command", required_argument, NULL, OPTION_RSH_COMMAND}, {"same-order", no_argument, NULL, 's'}, {"same-owner", no_argument, &flag_do_chown, 1}, {"same-permissions", no_argument, NULL, 'p'}, {"show-omitted-dirs", no_argument, &flag_show_omitted_dirs, 1}, {"sparse", no_argument, NULL, 'S'}, {"starting-file", required_argument, NULL, 'K'}, {"tape-length", required_argument, NULL, 'L'}, {"to-stdout", no_argument, NULL, 'O'}, {"totals", no_argument, &flag_totals, 1}, {"uncompress", no_argument, NULL, 'Z'}, {"ungzip", no_argument, NULL, 'z'}, {"update", no_argument, NULL, 'u'}, {"use-compress-program", required_argument, NULL, OPTION_COMPRESS_PROG}, {"verbose", no_argument, NULL, 'v'}, {"verify", no_argument, NULL, 'W'}, {"version", no_argument, &show_version, 1}, {"volno-file", required_argument, NULL, OPTION_VOLNO_FILE}, {0, 0, 0, 0} }; /*---------------------------------------------. | Print a usage message and exit with STATUS. | `---------------------------------------------*/ static void usage (int status) { if (status != TAREXIT_SUCCESS) fprintf (stderr, _("Try `%s --help' for more information.\n"), program_name); else { printf (_("Usage: %s [OPTION]... [FILE]...\n"), program_name); fputs (_("\ Mandatory or optional arguments to long options are mandatory or optional\n\ for short options too.\n"), stdout); fputs(_("\ \n\ Main operation mode:\n\ -t, --list list the contents of an archive\n\ -x, --extract, --get extract files from an archive\n\ -c, --create create a new archive\n\ -d, --diff, --compare find differences between archive and file system\n\ -r, --append append files to the end of an archive\n\ -u, --update only append files newer than copy in archive\n\ -A, --catenate append tar files to an archive\n\ --concatenate same as -A\n\ --delete delete from the archive (not on mag tapes!)\n"), stdout); fputs (_("\ \n\ Operation mode modificators:\n\ -W, --verify attempt to verify the archive after writing it\n\ --remove-files remove files after adding them to the archive\n\ -k, --keep-old-files don't overwrite existing files from archive\n\ -S, --sparse handle sparse files efficiently\n\ -O, --to-stdout extract files to standard output\n\ -G, --incremental handle old GNU-format incremental backup\n\ -g, --listed-incremental handle new GNU-format incremental backup\n\ --ignore-failed-read do not exit with non-zero on unreadable files\n"), stdout); fputs (_("\ \n\ Handling of file attributes:\n\ --atime-preserve don't change access times on dumped files\n\ -m, --modification-time don't extract file modified time\n\ --same-owner create extracted files with the same ownership \n\ -p, --same-permissions extract all protection information\n\ --preserve-permissions same as -p\n\ -s, --same-order sort names to extract to match archive\n\ --preserve-order same as -s\n\ --preserve same as both -p and -s\n"), stdout); fputs (_("\ \n\ Device selection and switching:\n\ -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME\n\ --force-local archive file is local even if has a colon\n\ --rsh-command=COMMAND use remote COMMAND instead of rsh\n\ -[0-7][lmh] specify drive and density\n\ -M, --multi-volume create/list/extract multi-volume archive\n\ -L, --tape-length=NUM change tape after writing NUM x 1024 bytes\n\ -F, --info-script=FILE run script at end of each tape (implies -M)\n\ --new-volume-script=FILE same as -F FILE\n"), stdout); fputs (_("\ \n\ Device blocking:\n\ -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes\n\ --block-compress block the output of compression for tapes\n\ -i, --ignore-zeros ignore blocks of zeros in archive (means EOF)\n\ -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes)\n"), stdout); fputs (_("\ \n\ Archive format selection:\n\ -V, --label=NAME create archive with volume name NAME\n\ -o, --old-archive, --portability write a V7 format archive (not ANSI)\n\ -z, --gzip, --ungzip filter the archive through gzip\n\ -Z, --compress, --uncompress filter the archive through compress\n\ --use-compress-program=PROG filter through PROG (must accept -d)\n"), stdout); fputs (_("\ \n\ Local file selection:\n\ -C, --directory DIR change to directory DIR\n\ -T, --files-from=NAME get names to extract or create from file NAME\n\ --null -T reads null-terminated names, disable -C\n\ --exclude=FILE exclude file FILE\n\ -X, --exclude-from=FILE exclude files listed in FILE\n\ -P, --absolute-paths don't strip leading `/'s from file names\n\ -h, --dereference dump instead the files symlinks point to\n\ -l, --one-file-system stay in local file system when creating archive\n\ -K, --starting-file=NAME begin at file NAME in the archive\n"), stdout); #ifndef MSDOS fputs (_("\ -N, --newer=DATE only store files newer than DATE\n\ --after-date=DATE same as -N\n"), stdout); #endif fputs (_("\ \n\ Informative output:\n\ --help print this help, then exit\n\ --version print tar program version number, then exit\n\ -v, --verbose verbosely list files processed\n\ --checkpoint print directory names while reading the archive\n\ --totals print total bytes written while creating archive\n\ -R, --record-number show record number within archive with each message\n\ -w, --interactive ask for confirmation for every action\n\ --confirmation same as -w\n"), stdout); printf (_("\ \n\ On *this* particular tar, the defaults are -f %s and -b %d.\n"), DEFAULT_ARCHIVE, DEFAULT_BLOCKING); } exit (status); } /*----------------------------. | Parse the options for tar. | `----------------------------*/ #define OPTION_STRING \ "-01234567ABC:F:GK:L:MN:OPRST:V:WX:Zb:cdf:g:hiklmoprstuvwxz" #define SET_COMMAND_MODE(Mode) \ (command_mode = command_mode == COMMAND_NONE ? (Mode) : COMMAND_TOO_MANY) static void decode_options (int argc, char *const *argv) { int optchar; /* option letter */ /* Set some default option values. */ blocking = DEFAULT_BLOCKING; flag_rsh_command = NULL; /* Convert old-style tar call by exploding option element and rearranging options accordingly. */ if (argc > 1 && argv[1][0] != '-') { int new_argc; /* argc value for rearranged arguments */ char **new_argv; /* argv value for rearranged arguments */ char *const *in; /* cursor into original argv */ char **out; /* cursor into rearranged argv */ const char *letter; /* cursor into old option letters */ char buffer[3]; /* constructed option buffer */ const char *cursor; /* cursor in OPTION_STRING */ /* Initialize a constructed option. */ buffer[0] = '-'; buffer[2] = '\0'; /* Allocate a new argument array, and copy program name in it. */ new_argc = argc - 1 + strlen (argv[1]); new_argv = (char **) xmalloc (new_argc * sizeof (char *)); in = argv; out = new_argv; *out++ = *in++; /* Copy each old letter option as a separate option, and have the corresponding argument moved next to it. */ for (letter = *in++; *letter; letter++) { buffer[1] = *letter; *out++ = xstrdup (buffer); cursor = strchr (OPTION_STRING, *letter); if (cursor && cursor[1] == ':') *out++ = *in++; } /* Copy all remaining options. */ while (in < argv + argc) *out++ = *in++; /* Replace the old option list by the new one. */ argc = new_argc; argv = new_argv; } /* Parse all options and non-options as they appear. */ while (optchar = getopt_long (argc, argv, OPTION_STRING, long_options, NULL), optchar != EOF) switch (optchar) { case '?': usage (TAREXIT_FAILURE); case 0: break; case 'C': name_add ("-C"); /* Fall through. */ case 1: /* File name or non-parsed option, because of RETURN_IN_ORDER ordering triggerred by the leading dash in OPTION_STRING. */ name_add (optarg); break; case OPTION_PRESERVE: flag_use_protection = 1; flag_sorted_names = 1; break; #ifndef MSDOS case OPTION_NEWER_MTIME: flag_new_files++; /* Fall through. */ /* FIXME: Something is wrong here! */ case 'N': /* Only write files newer than X. */ flag_new_files++; new_time = get_date (optarg, (voidstar) 0); if (new_time == (time_t) -1) ERROR ((TAREXIT_FAILURE, 0, _("Invalid date format `%s'"), optarg)); break; #endif /* not MSDOS */ case OPTION_DELETE: SET_COMMAND_MODE (COMMAND_DELETE); break; case OPTION_EXCLUDE: flag_exclude++; add_exclude (optarg); break; case OPTION_NULL: filename_terminator = '\0'; break; case OPTION_VOLNO_FILE: flag_volno_file = optarg; break; case OPTION_COMPRESS_PROG: if (flag_compressprog) ERROR ((TAREXIT_FAILURE, 0, _("Only one compression option permitted"))); flag_compressprog = optarg; break; case OPTION_RSH_COMMAND: flag_rsh_command = optarg; break; case 'g': /* We are making a GNU dump; save directories at the beginning of the archive, and include in each directory its contents. */ if (flag_oldarch) usage (TAREXIT_FAILURE); flag_gnudump++; gnu_dumpfile = optarg; break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': #ifdef DEVICE_PREFIX { int device = optchar - '0'; int density; static char buf[sizeof DEVICE_PREFIX + 10]; char *cursor; density = getopt_long (argc, argv, "lmh", NULL, NULL); strcpy (buf, DEVICE_PREFIX); cursor = buf + strlen (buf); #ifdef DENSITY_LETTER sprintf (cursor, "%d%c", device, density); #else /* not DENSITY_LETTER */ switch (density) { case 'l': #ifdef LOW_NUM device += LOW_NUM; #endif break; case 'm': #ifdef MID_NUM device += MID_NUM; #else device += 8; #endif break; case 'h': #ifdef HGH_NUM device += HGH_NUM; #else device += 16; #endif break; default: usage (TAREXIT_FAILURE); } sprintf (cursor, "%d", device); #endif /* not DENSITY_LETTER */ if (archive_names == allocated_archive_names) { allocated_archive_names *= 2; archive_name_array = (const char **) xrealloc (archive_name_array, sizeof (const char *) * allocated_archive_names); } archive_name_array[archive_names++] = buf; /* FIXME: How comes this works for many archives when buf is not xstrdup'ed? */ } break; #else /* not DEVICE_PREFIX */ ERROR ((0, 0, _("Options [0-7][lmh] not supported by *this* tar"))); usage (TAREXIT_FAILURE); #endif /* not DEVICE_PREFIX */ case 'A': SET_COMMAND_MODE (COMMAND_CAT); break; case 'b': /* Set blocking factor. */ blocking = intconv (optarg); break; case 'B': /* Try to reblock input. For reading 4.2BSD pipes. */ flag_reblock++; break; case 'c': SET_COMMAND_MODE (COMMAND_CREATE); break; #if 0 case 'C': if (chdir (optarg) < 0) ERROR ((TAREXIT_FAILURE, errno, _("Cannot change directory to %d"), optarg)); break; #endif case 'd': SET_COMMAND_MODE (COMMAND_DIFF); break; case 'f': if (archive_names == allocated_archive_names) { allocated_archive_names *= 2; archive_name_array = (const char **) xrealloc (archive_name_array, sizeof (const char *) * allocated_archive_names); } archive_name_array[archive_names++] = optarg; break; case 'F': /* Since -F is only useful with -M, make it implied. Run this script at the end of each tape. */ flag_run_script_at_end++; info_script = optarg; flag_multivol++; break; case 'G': /* We are making a GNU dump; save directories at the beginning of the archive, and include in each directory its contents */ if (flag_oldarch) usage (TAREXIT_FAILURE); flag_gnudump++; gnu_dumpfile = 0; break; case 'h': /* Follow symbolic links. */ flag_follow_links++; break; case 'i': /* Ignore zero records (eofs). This can't be the default, because Unix tar writes two records of zeros, then pads out the block with garbage. */ flag_ignorez++; break; case 'k': /* Don't overwrite files. */ #ifdef NO_OPEN3 ERROR ((TAREXIT_FAILURE, 0, _("Cannot keep old files on this system"))); #else flag_keep++; #endif break; case 'K': flag_startfile++; addname (optarg); break; case 'l': /* When dumping directories, don't dump files/subdirectories that are on other filesystems. */ flag_local_filesys++; break; case 'L': tape_length = intconv (optarg); flag_multivol++; break; case 'm': flag_modified++; break; case 'M': /* Make multivolume archive: when we can't write any more into the archive, re-open it, and continue writing. */ flag_multivol++; break; case 'o': /* Generate old archive. */ if (flag_gnudump #if 0 || flag_dironly #endif ) usage (TAREXIT_FAILURE); flag_oldarch++; break; case 'O': flag_exstdout++; break; case 'p': flag_use_protection++; break; case OBSOLETE_ABSOLUTE_NAMES: WARN ((0, 0, _("Obsolete option name replaced by --absolute-names"))); /* Fall through. */ case 'P': flag_absolute_names++; break; case 'r': SET_COMMAND_MODE (COMMAND_APPEND); break; case 'R': /* Print block numbers for debug of bad tar archives. */ flag_sayblock++; break; case 's': /* Names to extr are sorted. */ flag_sorted_names++; break; case 'S': /* Deal with sparse files. */ flag_sparse_files++; break; case 't': SET_COMMAND_MODE (COMMAND_LIST); /* "t" output == "cv" or "xv". */ flag_verbose++; break; case 'T': namefile_name = optarg; flag_namefile++; break; case 'u': SET_COMMAND_MODE (COMMAND_UPDATE); break; case 'v': flag_verbose++; break; case 'V': flag_volhdr = optarg; break; case 'w': flag_confirm++; break; case 'W': flag_verify++; break; case 'x': SET_COMMAND_MODE (COMMAND_EXTRACT); break; case 'X': flag_exclude++; add_exclude_file (optarg); break; case 'z': if (flag_compressprog) ERROR ((TAREXIT_FAILURE, 0, _("Only one compression option permitted"))); flag_compressprog = "gzip"; break; case 'Z': if (flag_compressprog) ERROR ((TAREXIT_FAILURE, 0, _("Only one compression option permitted"))); flag_compressprog = "compress"; break; } /* Process trivial options. */ if (show_version) { printf ("GNU %s %s\n", PACKAGE, VERSION); exit (TAREXIT_SUCCESS); } if (show_help) usage (TAREXIT_SUCCESS); /* Derive option values and check option consistency. */ blocksize = blocking * RECORDSIZE; if (archive_names == 0) { /* If no archive file name given, try TAPE from the environment, or else, DEFAULT_ARCHIVE from the configuration process. */ archive_names = 1; archive_name_array[0] = getenv ("TAPE"); if (archive_name_array[0] == NULL) archive_name_array[0] = DEFAULT_ARCHIVE; } archive_name_cursor = archive_name_array; if (archive_names > 1 && !flag_multivol) ERROR ((TAREXIT_FAILURE, 0, _("Multiple archive files requires --multi-volume"))); if (flag_compress_block && !flag_compressprog) ERROR ((TAREXIT_FAILURE, 0, _("\ You must use a compression option (--gzip, --compress\n\ or --use-compress-program) with --block-compress"))); } #undef SET_COMMAND_MODE /*-----------------------. | Main routine for tar. | `-----------------------*/ void main (int argc, char *const *argv) { program_name = argv[0]; setlocale (LC_ALL, ""); textdomain (PACKAGE); exit_status = TAREXIT_SUCCESS; filename_terminator = '\n'; /* Pre-allocate a few structures. */ allocated_archive_names = 10; archive_name_array = (const char **) xmalloc (sizeof (const char *) * allocated_archive_names); archive_names = 0; allocated_names = 10; name_array = (const char **) xmalloc (sizeof (const char *) * allocated_names); names = 0; name_buffer = xmalloc (NAMSIZ + 2); name_buffer_length = NAMSIZ; /* Decode options. */ decode_options (argc, argv); if (!names_argv) name_init (argc, argv); /* Main command execution. */ if (flag_volno_file) init_volume_number (); switch (command_mode) { case COMMAND_NONE: WARN ((0, 0, _("\ You must specify one of the r, c, t, x, or d options"))); usage (TAREXIT_FAILURE); case COMMAND_TOO_MANY: WARN ((0, 0, _("\ You may not specify more than one of the r, c, t, x, or d options"))); usage (TAREXIT_FAILURE); case COMMAND_CAT: case COMMAND_UPDATE: case COMMAND_APPEND: update_archive (); break; case COMMAND_DELETE: junk_archive (); break; case COMMAND_CREATE: create_archive (); if (flag_totals) fprintf (stderr, _("Total bytes written: %d\n"), tot_written); break; case COMMAND_EXTRACT: if (flag_volhdr) { const char *err; label_pattern = (struct re_pattern_buffer *) xmalloc (sizeof *label_pattern); memset (label_pattern, 0, sizeof *label_pattern); err = re_compile_pattern (flag_volhdr, (int) strlen (flag_volhdr), label_pattern); if (err) { ERROR ((0, 0, _("Bad regular expression: %s"), err)); break; } } extr_init (); read_and (extract_archive); break; case COMMAND_LIST: if (flag_volhdr) { const char *err; label_pattern = (struct re_pattern_buffer *) xmalloc (sizeof *label_pattern); memset (label_pattern, 0, sizeof *label_pattern); err = re_compile_pattern (flag_volhdr, (int) strlen (flag_volhdr), label_pattern); if (err) { ERROR ((0, 0, _("Bad regular expression: %s"), err)); break; } } read_and (list_archive); #if 0 if (!errors) errors = different; #endif break; case COMMAND_DIFF: diff_init (); read_and (diff_archive); break; } if (flag_volno_file) closeout_volume_number (); /* Dispose of allocated memory, and return. */ free (name_buffer); free (name_array); free (archive_name_array); exit (exit_status); } tar-1.11.8/src/update.c 644 625 1 33716 5702143344 7646 /* Update a tar archive. Copyright (C) 1988, 1992, 1994 Free Software Foundation, Inc. This file is part of GNU Tar. GNU Tar is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Tar is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Tar; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* JF implement the 'r' 'u' and 'A' options for tar. */ /* The 'A' option is my own invention: It means that the file-names are tar files, and they should simply be appended to the end of the archive. No attempt is made to block the reads from the args; if they're on raw tape or something like that, it'll probably lose. . . */ #include "system.h" #ifndef __MSDOS__ # include # include #endif #define STDIN 0 #define STDOUT 1 #include "tar.h" #include "rmt.h" /* We've hit the end of the old stuff, and its time to start writing new stuff to the tape. This involves seeking back one block and re-writing the current block (which has been changed). */ int time_to_start_writing = 0; /* Pointer to where we started to write in the first block we write out. This is used if we can't backspace the output and have to null out the first part of the block. */ char *output_start; extern void skip_file (); /* FIXME */ extern void skip_extended_headers (); /* FIXME */ extern union record *head; extern struct stat hstat; static void append_file __P ((char *)); static int move_arch __P ((int)); static void write_block __P ((int)); /*-----------------------------------------------------------------------. | Implement the 'r' (add files to end of archive), and 'u' (add files to | | end of archive if they arent there, or are more up to date than the | | version in the archive.) commands. | `-----------------------------------------------------------------------*/ void update_archive (void) { int found_end = 0; int status = 3; int prev_status; char *p; struct name *name; name_gather (); if (command_mode == COMMAND_UPDATE) name_expand (); open_archive (2); /* open for updating */ do { prev_status = status; status = read_header (); switch (status) { case EOF: found_end = 1; break; case 0: /* a bad record */ userec (head); switch (prev_status) { case 3: WARN ((0, 0, _("This does not look like a tar archive"))); /* Fall through. */ case 2: case 1: ERROR ((0, 0, _("Skipping to next header"))); /* Fall through. */ case 0: break; } break; case 1: /* a good record */ #if 0 printf (_("File %s\n"), head->header.name); head->header.name[NAMSIZ-1] = '\0'; #endif if (command_mode == COMMAND_UPDATE && (name = name_scan (current_file_name), name)) { #if 0 struct stat hstat; #endif struct stat nstat; int unused; decode_header (head, &hstat, &unused, 0); if (stat (current_file_name, &nstat) < 0) ERROR ((0, errno, _("Cannot stat %s"), current_file_name)); else if (hstat.st_mtime >= nstat.st_mtime) name->found++; } userec (head); if (head->header.isextended) skip_extended_headers (); skip_file ((long) hstat.st_size); break; case 2: ar_record = head; found_end = 1; break; } } while (!found_end); reset_eof (); time_to_start_writing = 1; output_start = ar_record->charptr; while (p = name_from_list (), p) { if (flag_confirm && !confirm ("add", p)) continue; if (command_mode == COMMAND_CAT) append_file (p); else dump_file (p, -1, 1); } write_eot (); close_archive (); names_notfound (); } /*-------------------------------------------------------------------------. | Catenate file p to the archive without creating a header for it. It had | | better be a tar file or the archive is screwed. | `-------------------------------------------------------------------------*/ static void append_file (char *p) { int fd; struct stat statbuf; long bytes_left; union record *start; long bufsiz, count; if (stat (p, &statbuf) != 0 || (fd = open (p, O_RDONLY | O_BINARY), fd < 0)) { ERROR ((0, errno, _("Cannot open file %s"), p)); return; } bytes_left = statbuf.st_size; while (bytes_left > 0) { start = findrec (); bufsiz = endofrecs ()->charptr - start->charptr; if (bytes_left < bufsiz) { bufsiz = bytes_left; count = bufsiz % RECORDSIZE; if (count) memset (start->charptr + bytes_left, 0, (size_t) (RECORDSIZE - count)); } count = read (fd, start->charptr, (size_t) bufsiz); if (count < 0) ERROR ((TAREXIT_FAILURE, errno, _("Read error at byte %ld reading %d bytes in file %s"), statbuf.st_size - bytes_left, bufsiz, p)); bytes_left -= count; userec (start + (count - 1) / RECORDSIZE); if (count != bufsiz) ERROR ((TAREXIT_FAILURE, 0, _("%s: File shrunk by %d bytes, (yark!)"), p, bytes_left)); } close (fd); } #ifdef DONTDEF /*---. | ? | `---*/ static void bprint (FILE *fp, char *buf, int num) { int c; if (num == 0 || num == -1) return; fputs (" '", fp); while (num--) { c = *buf++; if (c == '\\') fputs ("\\\\", fp); else if (c >= ' ' && c <= '~') putc (c, fp); else switch (c) { case '\n': fputs ("\\n", fp); break; case '\r': fputs ("\\r", fp); break; case '\b': fputs ("\\b", fp); break; case '\0': #if 0 fputs("\\-", fp); #endif break; default: fprintf (fp, "\\%03o", c); break; } } fputs ("'\n", fp); } #endif int number_of_blocks_read = 0; int number_of_new_records = 0; int number_of_records_needed = 0; union record *new_block = 0; union record *save_block = 0; /*---. | ? | `---*/ void junk_archive (void) { int found_stuff = 0; int status = 3; int prev_status; struct name *name; #if 0 int dummy_head; #endif int number_of_records_to_skip = 0; int number_of_records_to_keep = 0; int number_of_kept_records_in_block; int sub_status; #if 0 fprintf (stderr,_("Junk files\n")); #endif name_gather (); open_archive (2); while (!found_stuff) { prev_status = status; status = read_header (); switch (status) { case EOF: found_stuff = 1; break; case 0: userec (head); switch (prev_status) { case 3: WARN ((0, 0, _("This does not look like a tar archive"))); /* Fall through. */ case 2: case 1: ERROR ((0, 0, _("Skipping to next header"))); /* Fall through. */ case 0: break; } break; case 1: #if 0 head->header.name[NAMSIZ-1] = '\0'; fprintf (stderr, _("file %s\n"), head->header.name); #endif if (name = name_scan (current_file_name), !name) { userec (head); #if 0 fprintf (stderr, _("Skip %ld\n"), (long) (hstat.st_size)); #endif if (head->header.isextended) skip_extended_headers (); skip_file ((long) (hstat.st_size)); break; } name->found = 1; found_stuff = 2; break; case 2: found_stuff = 1; break; } } #if 0 fprintf (stderr, _("Out of first loop\n")); #endif if (found_stuff != 2) { write_eot (); close_archive (); names_notfound (); return; } if (write_archive_to_stdout) write_archive_to_stdout = 0; new_block = (union record *) xmalloc ((size_t) blocksize); /* Save away records before this one in this block. */ number_of_new_records = ar_record - ar_block; number_of_records_needed = blocking - number_of_new_records; if (number_of_new_records) memcpy ((void *) new_block, (void *) ar_block, (size_t) (number_of_new_records * RECORDSIZE)); #if 0 fprintf (stderr, _("Saved %d recs, need %d more\n"), number_of_new_records, number_of_records_needed); #endif userec (head); if (head->header.isextended) skip_extended_headers (); skip_file ((long) (hstat.st_size)); found_stuff = 0; #if 0 goto flush_file; #endif while (1) { /* Fill in a block. */ /* another_file: */ if (ar_record == ar_last) { #if 0 fprintf (stderr, _("New block\n")); #endif flush_archive (); number_of_blocks_read++; } sub_status = read_header (); #if 0 fprintf (stderr, _("Header type %d\n"), sub_status); #endif if (sub_status == 2 && flag_ignorez) { userec (head); continue; } if (sub_status == EOF || sub_status == 2) { found_stuff = 1; memset (new_block[number_of_new_records].charptr, 0, (size_t) (RECORDSIZE * number_of_records_needed)); number_of_new_records += number_of_records_needed; number_of_records_needed = 0; write_block (0); break; } if (sub_status == 0) { ERROR ((0, 0, _("Deleting non-header from archive"))); userec (head); continue; } /* Found another header. Yipee! */ #if 0 head->header.name[NAMSIZ-1] = '\0'; fprintf (stderr, _("File %s "), head->header.name); #endif if (name = name_scan (current_file_name), name) { name->found = 1; #if 0 fprintf (stderr, _("Flush it\n")); flush_file: decode_header (head, &hstat,&dummy_head, 0); #endif userec (head); number_of_records_to_skip = (hstat.st_size + RECORDSIZE - 1) / RECORDSIZE; #if 0 fprintf (stderr, _("Flushing %d recs from %s\n"), number_of_records_to_skip,head->header.name); #endif while (ar_last - ar_record <= number_of_records_to_skip) { #if 0 fprintf (stderr, _("Block: %d <= %d "), ar_last-ar_record, number_of_records_to_skip); #endif number_of_records_to_skip -= (ar_last - ar_record); flush_archive (); number_of_blocks_read++; #if 0 fprintf (stderr, _("Block %d left\n"), number_of_records_to_skip); #endif } ar_record += number_of_records_to_skip; #if 0 fprintf (stderr, _("Final %d\n"), number_of_records_to_skip); #endif number_of_records_to_skip = 0; continue; } /* copy_header: */ new_block[number_of_new_records] = *head; number_of_new_records++; number_of_records_needed--; number_of_records_to_keep = (hstat.st_size + RECORDSIZE - 1) / RECORDSIZE; userec (head); if (number_of_records_needed == 0) write_block (1); /* copy_data: */ number_of_kept_records_in_block = ar_last - ar_record; if (number_of_kept_records_in_block > number_of_records_to_keep) number_of_kept_records_in_block = number_of_records_to_keep; #if 0 fprintf (stderr, _("Need %d kept_in %d keep %d\n"), blocking, number_of_kept_records_in_block, number_of_records_to_keep); #endif while (number_of_records_to_keep) { int n; if (ar_record == ar_last) { #if 0 fprintf (stderr, _("Flush...\n")); #endif fl_read (); number_of_blocks_read++; ar_record = ar_block; number_of_kept_records_in_block = blocking; if (number_of_kept_records_in_block > number_of_records_to_keep) number_of_kept_records_in_block = number_of_records_to_keep; } n = number_of_kept_records_in_block; if (n > number_of_records_needed) n = number_of_records_needed; #if 0 fprintf (stderr, _("Copying %d\n"), n); #endif memcpy ((void *) (new_block + number_of_new_records), (void *) ar_record, (size_t) (n * RECORDSIZE)); number_of_new_records += n; number_of_records_needed -= n; ar_record += n; number_of_records_to_keep -= n; number_of_kept_records_in_block -= n; #if 0 fprintf (stderr, _("Now new %d need %d keep %d keep_in %d rec %d/%d\n"), number_of_new_records, number_of_records_needed, number_of_records_to_keep, number_of_kept_records_in_block, ar_record-ar_block, ar_last-ar_block); #endif if (number_of_records_needed == 0) { write_block (1); } } } write_eot (); close_archive (); names_notfound (); } /*---. | ? | `---*/ static void write_block (int f) { #if 0 fprintf (stderr, _("Write block\n")); #endif /* We've filled out a block. Write it out. Backspace back to where we started. */ if (archive != STDIN) move_arch (-(number_of_blocks_read + 1)); save_block = ar_block; ar_block = new_block; if (archive == STDIN) archive = STDOUT; fl_write (); if (archive == STDOUT) archive = STDIN; ar_block = save_block; if (f) { /* Move the tape head back to where we were. */ if (archive != STDIN) move_arch (number_of_blocks_read); number_of_blocks_read--; } number_of_records_needed = blocking; number_of_new_records = 0; } /*-----------------------------------------------------------------------. | Move archive descriptor by n blocks worth. If n is positive we move | | forward, else we move negative. If its a tape, MTIOCTOP had better | | work. If its something else, we try to seek on it. If we can't seek, | | we lose! | `-----------------------------------------------------------------------*/ static int move_arch (int n) { off_t cur; #ifdef MTIOCTOP struct mtop t; int er; if (n > 0) { t.mt_op = MTFSR; t.mt_count = n; } else { t.mt_op = MTBSR; t.mt_count = -n; } if (er = rmtioctl (archive, MTIOCTOP, (char *) &t), er >= 0) return 1; if (errno == EIO && (er = rmtioctl (archive, MTIOCTOP, (char *) &t), er >= 0)) return 1; #endif cur = rmtlseek (archive, 0L, 1); cur += blocksize * n; #if 0 fprintf (stderr, _("Fore to %x\n"), cur); #endif if (rmtlseek (archive, cur, 0) != cur) /* Lseek failed. Try a different method. */ ERROR ((TAREXIT_FAILURE, 0, _("Could not re-position archive file"))); return 3; } tar-1.11.8/scripts/Makefile.in 644 625 1 3200 5770626034 11135 # Makefile for GNU tar scripts. # Copyright (C) 1994 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. PACKAGE = @PACKAGE@ VERSION = @VERSION@ SHELL = /bin/sh VPATH = @srcdir@ srcdir = @srcdir@ subdir = scripts .SUFFIXES: DISTFILES = Makefile.in WARNING \ backup-specs dump-remind level-0 level-1 weekly.new all: install: uninstall: mostlyclean: clean: mostlyclean distclean: clean rm -f Makefile maintainer-clean: distclean @echo "This command is intended only for maintainers to use;" @echo "rebuilding the deleted files may require special tools." distdir = ../$(PACKAGE)-$(VERSION)/$(subdir) dist: $(DISTFILES) for file in $(DISTFILES); do \ ln $(srcdir)/$$file $(distdir) 2> /dev/null \ || cp -p $(srcdir)/$$file $(distdir); \ done Makefile: Makefile.in ../config.status cd .. && CONFIG_FILES=$(subdir)/$@ CONFIG_HEADERS= ./config.status # Tell versions [3.59,3.63) of GNU make not to export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: tar-1.11.8/scripts/WARNING 644 625 1 421 5770626301 10077 Beware that GNU tar scripts have not been updated in a long while. The ChangeLog has been lost. The Makefile does not install them. But we intend to try reinstating them in some future GNU tar release. Consider this directory is provided as indicative for the time being. tar-1.11.8/scripts/backup-specs 644 625 1 5166 5372467453 11416 # site-specific parameters for file system backup. # User name of administrator of backups. ADMINISTRATOR=backup-reports # Hour at which backups are normally done. # This should be a number from 0 to 23. BACKUP_HOUR=1 # Location of GNU tar. This must be the same for all hosts. TAR=/usr/local/gnubin/tar # Device to use for dumping. It should be on the host # on which the dump scripts are run. TAPE_FILE=/dev/nrsmt0 # Command to obtain status of tape drive, including error count. # On some tape drives there may not be such a command; # then simply use `TAPE_STATUS=false'. # # Might also consider # TAPE_STATUS="mt -f ${TAPE_FILE} status" # if `mts' is missing, though this alternative is rather verbose. TAPE_STATUS="mts -t ${TAPE_FILE}" # Blocking factor to use for writing the dump. BLOCKING=124 # Name of temporary file to hold volume numbers. This needs to be accessible # by all the machines which have filesystems to be dumped. VOLNO_FILE=/home/gd2/dump/volnofile # Script to be run when it's time to insert a new tape in for the next # volume. Administrators may want to tailor this script for their site. # If this variable isn't set, tar will use some default behavior which is # probably defined in the manual. #DUMP_REMIND_SCRIPT='rsh apple-gunkies /home/gd2/dump/dump-remind' # List of file systems to be dumped. # Actually, any directory may be used, but if it has subdirectories on # other file systems, they are not included. # The host name specifies which host to run tar on. # It should normally be the host that actually has the file system. # If GNU tar is not installed on that machine, then you can specify some # other host which can access the file system through NFS. # Although these are arranged one per line, that is not mandatory. # It does not work to use # for comments within the string. BACKUP_DIRS=' albert:/fs/fsf sugar-bombs:/fs/gd albert:/fs/gd2 churchy:/fs/gd3 nutrimat:/fs/gp nutrimat:/fs/gp2 albert:/fs/mailer placebo:/archive nutrimat:/fs/dist albert:/ albert:/usr nutrimat:/ placebo:/ ernst:/usr1 ' # List of individual files to be dumped. # These should be accesible from the machine on which the dump is run. BACKUP_FILES='' # Message to display on the terminal while waiting for dump time. Usually # this will just be some literal text, preferably something more # entertaining than this. The awk script here saves some redundant # repetition, but is not really all that desirable. SLEEP_MESSAGE="`awk ' BEGIN { for (i = 0; i < 30; i++) print \" \" \ \"D O N O T T O U C H T H I S T E R M I N A L !!!!!\" }' /dev/null`" # eof tar-1.11.8/scripts/dump-remind 755 625 1 6246 5474626751 11263 #!/bin/sh # This file is included in the GNU tar distribution as an example. It is # not used by default unless the proper line is uncommented in backup-specs. # System administrators will probably want to customize this and # backup-specs for their site. # # This script should be run by tar with --info-script (-F) to inform # interested parties that a tape for the next volume of the backup needs to # be put in the tape drive. # # Include location of `sendmail' and GNU finger. PATH="/usr/lib:/usr/local/gnubin:${PATH}" export PATH # Get definition of TAPE_FILE, VOLNO_FILE, and so on. . /home/gd2/dump/backup-specs mt -f "${TAPE_FILE}" rewind mt -f "${TAPE_FILE}" offl volno="`cat \"${VOLNO_FILE}\" 2> /dev/null`" if [ $? -ne 0 ]; then volno=0 fi # Get a list of people to whom to mail a request for changing the tape. # This egregious nightmare parses the output from GNU finger which shows # which users are logged into consoles (and thus in the office and capable # of changing tapes). # # Certain users (like `root') aren't real users, and shouldn't be notified. # Neither should `zippy', `elvis', etc. (on the GNU machines) since they're # just test accounts. recipients="` finger .clients 2> /dev/null \ | sed -ne ' 1{ /clientstatus: file has not changed in/{ n;n;n;n;d } n;n;d } s/^..................................................// $!{/^$/d /^root?*$/d /^zippy$/d /^fnord$/d /^elvis$/d /^snurd$/d H } ${g : 1 s/\(\n\)\([A-Za-z0-9_][A-Za-z0-9_]*\)\(\n.*\)\2\(.*\)/\1\2\3\4/g s/\n$//g t 1 s/^\n// s/\n$//g s/\n/, /g : 2 s/, ,/,/g t 2 p }'`" # Customized behavior for FSF machines, to bring attention to the fact that # the tape needs to be changed (who looks at the terminal?) sendmail -oi -t << __EOF__ From: `basename $0` (backup tape-changing reminder) To: ${recipients} Cc: ${ADMINISTRATOR} Subject: Backup needs new tape for volume ${volno} Reply-To: ${ADMINISTRATOR} This is an automated report from the backup script running on `hostname`. Volume ${volno} of the backup needs to be put in the tape drive. Usually whoever prepared the backup leaves labeled tapes on top of the drive itself. If there aren't any more, information about where to find tapes and how to label them are posted on the wall by apple-gunkies (unhelpfully obscured by a bookshelf). An online copy (which is probably more up-to-date) can also be found in ~friedman/etc/fsf/backup.how. __EOF__ echo "Please put volume ${volno} in tape drive and press RETURN" read input echo "Writing volume ${volno}..." sendmail -oi -t << __EOF__ From: `basename $0` (backup tape-changing reminder) To: ${recipients} Cc: ${ADMINISTRATOR} Subject: Volume ${volno} for backup has been added Reply-To: ${ADMINISTRATOR} This is an automated report from the backup script running on `hostname`. The backup has been continued, so for now no further attention is required. __EOF__ exit 0 # eof tar-1.11.8/scripts/level-0 755 625 1 14611 5356411551 10306 #!/bin/sh # # Run this script as root on the machine that has the tape drive, to make a # full (level-0) dump. # # If you give `now' as an argument, the dump is done immediately. # Otherwise, it waits until 1am, or until the hour given as argument. # Specify the hour as a number from 0 to 23. # # You must edit the file `backup-specs' to set the parameters for your site. # Useful for backup-specs, in case things have to be done slightly # differently for different dump levels. DUMP_LEVEL=0 # Insure `mail' is in PATH. PATH="/usr/ucb:${PATH}" export PATH # This is not the most reliable test in the world. The following might be # more predictable: # # whoami="`whoami`" # euid="`sed -ne '/^'\"${whoami}\"':/{s/^[^:]*:[^:]*://;s/:.*//p;q;}' /etc/passwd`" # if [ "${euid}" != 0 ]; then ... # if [ ! -w / ]; then echo "The backup must be run as root or else some files will fail to be dumped." exit 1 fi # Get the values of BACKUP_DIRS, BACKUP_FILES, and other variables. . ./backup-specs # Maybe sleep until around specified or default hour. if [ "${1}" != "now" ]; then if [ "${1}x" != "x" ]; then spec="${1}" else spec="${BACKUP_HOUR}" fi pausetime="`date | awk ' { hr = substr($4, 1, 2); mn = substr($4, 4, 2); if((hr + 0) < (spec + 0)) print 3600 * (spec - hr) - 60 * mn; else print 3600 * (spec + (24 - hr)) - 60 * mn; }' spec=\"${spec}\"`" clear echo "${SLEEP_MESSAGE}" sleep "${pausetime}" fi # start doing things # Put startdate in the subject line of mailed report, since if it happens # to run longer than 24 hours (as may be the case if someone forgets to put # in the next volume of the tape in adequate time), the backup date won't # appear too misleading. startdate="`date`" here="`pwd`" # Logfile name should be in the form ``log-1993-03-18-level-0'' # They go in the subdirectory `log' of the current directory. # i.e. year-month-date. This format is useful for sorting by name, since # logfiles are intentionally kept online for future reference. LOGFILE="log/log-`date | sed -ne ' s/[^ ]* *\([^ ]*\) *\([^ ]*\).* \([^ ]*\)$/\3-\1-\2/ /-[0-9]$/s/\([0-9]\)$/0\1/ /Jan/{s/Jan/01/p;q;} /Feb/{s/Feb/02/p;q;} /Mar/{s/Mar/03/p;q;} /Apr/{s/Apr/04/p;q;} /May/{s/May/05/p;q;} /Jun/{s/Jun/06/p;q;} /Jul/{s/Jul/07/p;q;} /Aug/{s/Aug/08/p;q;} /Sep/{s/Sep/09/p;q;} /Oct/{s/Oct/10/p;q;} /Nov/{s/Nov/11/p;q;} /Dec/{s/Dec/12/p;q;}'`-level-${DUMP_LEVEL}" localhost="`hostname | sed -e 's/\..*//'`" TAR_PART1="${TAR} -c --multi-volume --one-file-system --block-size=${BLOCKING} --sparse --volno-file=${VOLNO_FILE}" # Only use --info-script if DUMP_REMIND_SCRIPT was defined in backup-specs if [ "x${DUMP_REMIND_SCRIPT}" != "x" ]; then TAR_PART1="${TAR_PART1} --info-script='${DUMP_REMIND_SCRIPT}'" fi # Make sure the log file did not already exist. Create it. if [ -f "${LOGFILE}" ] ; then echo "Log file ${LOGFILE} already exists." 1>&2 exit 1 else touch "${LOGFILE}" fi # Most everything below here is run in a subshell for which all output is # piped through `tee' to the logfile. Doing this, instead of having # multiple pipelines all over the place, is cleaner and allows access to # the exit value from various commands more easily. ( # Caveat: Some version of `mt' require `-t', not `-f'. mt -f "${TAPE_FILE}" rewind rm -f "${VOLNO_FILE}" set - ${BACKUP_DIRS} while [ $# -ne 0 ] ; do date="`date`" remotehost="`echo \"${1}\" | sed -e 's/:.*$//'`" fs="`echo \"${1}\" | sed -e 's/^.*://'`" fsname="`echo \"${1}\" | sed -e 's/\//:/g'`" # This filename must be absolute; it is opened on the machine that runs tar. TAR_PART2="--listed=/etc/tar-backup/temp.level-0" TAR_PART3="--label='Full backup of ${fs} on ${remotehost} at ${date}' -C ${fs} ." echo "Backing up ${1} at ${date}" # Actually back things up. if [ "z${localhost}" != "z${remotehost}" ] ; then rsh "${remotehost}" mkdir /etc/tar-backup > /dev/null 2>&1 rsh "${remotehost}" rm -f /etc/tar-backup/temp.level-0 rsh "${remotehost}" ${TAR_PART1} -f "${localhost}:${TAPE_FILE}" ${TAR_PART2} ${TAR_PART3} else mkdir /etc/tar-backup > /dev/null 2>&1 rm -f /etc/tar-backup/temp.level-0 # Using `sh -c exec' causes nested quoting and shell substitution # to be handled here in the same way rsh handles it. sh -c "exec ${TAR_PART1} -f \"${TAPE_FILE}\" ${TAR_PART2} ${TAR_PART3}" fi # `rsh' doesn't exit with the exit status of the remote command. What # stupid lossage. TODO: think of a reliable workaround. if [ $? -ne 0 ] ; then echo "Backup of ${1} failed." 1>&2 # I'm assuming that the tar will have written an empty # file to the tape, otherwise I should do a cat here. else if [ "z${localhost}" != "z${remotehost}" ] ; then rsh "${remotehost}" mv -f /etc/tar-backup/temp.level-0 "/etc/tar-backup/${fsname}.level-0" else mv -f /etc/tar-backup/temp.level-0 "/etc/tar-backup/${fsname}.level-0" fi fi ${TAPE_STATUS} sleep 60 shift done # Dump any individual files requested. if [ "x${BACKUP_FILES}" != "x" ] ; then date="`date`" TAR_PART2="--listed=/etc/tar-backup/temp.level-0" TAR_PART3="--label='Full backup of miscellaneous files at ${date}'" mkdir /etc/tar-backup > /dev/null 2>&1 rm -f /etc/tar-backup/temp.level-0 echo "Backing up miscellaneous files at ${date}" # Using `sh -c exec' causes nested quoting and shell substitution # to be handled here in the same way rsh handles it. sh -c "exec ${TAR_PART1} -f \"${TAPE_FILE}\" ${TAR_PART2} ${TAR_PART3} ${BACKUP_FILES}" # `rsh' doesn't exit with the exit status of the remote command. What # lossage. TODO: think of a reliable workaround. if [ $? -ne 0 ] ; then echo "Backup of miscellaneous files failed." # I'm assuming that the tar will have written an empty # file to the tape, otherwise I should do a cat here. else mv -f /etc/tar-backup/temp.level-0 /etc/tar-backup/misc.level-0 fi ${TAPE_STATUS} else echo "No miscellaneous files specified" fi # Caveat: some versions of `mt' use `-t' instead of `-f'. mt -f "${TAPE_FILE}" rewind mt -f "${TAPE_FILE}" offl ) 2>&1 | tee -a "${LOGFILE}" echo "Sending the dump log to ${ADMINISTRATOR}" mail -s "Results of backup started ${startdate}" ${ADMINISTRATOR} < "${LOGFILE}" # eof tar-1.11.8/scripts/level-1 755 625 1 15001 5356411564 10305 #!/bin/sh # # Run this script as root on the machine that has the tape drive, to make a # level-1 dump containing all files changed since the last full dump. # # If you give `now' as an argument, the dump is done immediately. # Otherwise, it waits until 1am. # # You must edit the file `backup-specs' to set the parameters for your site. # Useful for backup-specs, in case things have to be done slightly # differently for different dump levels. DUMP_LEVEL=1 # Insure `mail' is in PATH. PATH="/usr/ucb:${PATH}" export PATH # This is not the most reliable test in the world. The following might be # more predictable: # # whoami="`whoami`" # euid="`sed -ne '/^'\"${whoami}\"':/{s/^[^:]*:[^:]*://;s/:.*//p;q;}' /etc/passwd`" # if [ "${euid}" != 0 ]; then ... # if [ ! -w / ]; then echo "The backup must be run as root or else some files will fail to be dumped." exit 1 fi # Get the values of BACKUP_DIRS, BACKUP_FILES, and other variables. . ./backup-specs # Maybe sleep until around specified or default hour. if [ "z${1}" != "znow" ]; then if [ "${1}x" != "x" ]; then spec="${1}" else spec="${BACKUP_HOUR}" fi pausetime="`date | awk ' { hr = substr($4, 1, 2); mn = substr($4, 4, 2); if((hr + 0) < (spec + 0)) print 3600 * (spec - hr) - 60 * mn; else print 3600 * (spec + (24 - hr)) - 60 * mn; }' spec=\"${spec}\"`" clear echo "${SLEEP_MESSAGE}" sleep "${pausetime}" fi # start doing things # Put startdate in the subject line of mailed report, since if it happens # to run longer than 24 hours (as may be the case if someone forgets to put # in the next volume of the tape in adequate time), the backup date won't # appear too misleading. startdate="`date`" here="`pwd`" # Logfile name should be in the form ``log-1993-03-18-level-1'' # They go in the subdirectory `log' of the current directory. # i.e. year-month-date. This format is useful for sorting by name, since # logfiles are intentionally kept online for future reference. LOGFILE="log/log-`date | sed -ne ' s/[^ ]* *\([^ ]*\) *\([^ ]*\).* \([^ ]*\)$/\3-\1-\2/ /-[0-9]$/s/\([0-9]\)$/0\1/ /Jan/{s/Jan/01/p;q;} /Feb/{s/Feb/02/p;q;} /Mar/{s/Mar/03/p;q;} /Apr/{s/Apr/04/p;q;} /May/{s/May/05/p;q;} /Jun/{s/Jun/06/p;q;} /Jul/{s/Jul/07/p;q;} /Aug/{s/Aug/08/p;q;} /Sep/{s/Sep/09/p;q;} /Oct/{s/Oct/10/p;q;} /Nov/{s/Nov/11/p;q;} /Dec/{s/Dec/12/p;q;}'`-level-${DUMP_LEVEL}" localhost="`hostname | sed -e 's/\..*//'`" TAR_PART1="${TAR} -c --multi-volume --one-file-system --block-size=${BLOCKING} --sparse --volno-file=${VOLNO_FILE}" # Only use --info-script if DUMP_REMIND_SCRIPT was defined in backup-specs if [ "x${DUMP_REMIND_SCRIPT}" != "x" ]; then TAR_PART1="${TAR_PART1} --info-script='${DUMP_REMIND_SCRIPT}'" fi # Make sure the log file did not already exist. Create it. if [ -f "${LOGFILE}" ] ; then echo "Log file ${LOGFILE} already exists." 1>&2 exit 1 else touch "${LOGFILE}" fi # Most everything below here is run in a subshell for which all output is # piped through `tee' to the logfile. Doing this, instead of having # multiple pipelines all over the place, is cleaner and allows access to # the exit value from various commands more easily. ( # Caveat: Some version of `mt' require `-t', not `-f'. mt -f "${TAPE_FILE}" rewind rm -f "${VOLNO_FILE}" set - ${BACKUP_DIRS} while [ $# -ne 0 ] ; do date="`date`" remotehost="`echo \"${1}\" | sed -e 's/:.*$//'`" fs="`echo \"${1}\" | sed -e 's/^.*://'`" fsname="`echo \"${1}\" | sed -e 's/\//:/g'`" # This filename must be absolute; it is opened on the machine that runs tar. TAR_PART2="--listed=/etc/tar-backup/temp.level-1" TAR_PART3="--label='level 1 backup of ${fs} on ${remotehost} at ${date}' -C ${fs} ." echo "Backing up ${1} at ${date}" echo "Last full dump on this filesystem:" if [ "z${remotehost}" != "z${localhost}" ] ; then rsh "${remotehost}" "ls -l /etc/tar-backup/${fsname}.level-0; \ cp /etc/tar-backup/${fsname}.level-0 /etc/tar-backup/temp.level-1" else ls -l "/etc/tar-backup/${fsname}.level-0" cp "/etc/tar-backup/${fsname}.level-0" /etc/tar-backup/temp.level-1 fi # Actually back things up. if [ "z${remotehost}" != "z${localhost}" ] ; then rsh "${remotehost}" ${TAR_PART1} -f "${localhost}:${TAPE_FILE}" ${TAR_PART2} ${TAR_PART3} else # Using `sh -c exec' causes nested quoting and shell substitution # to be handled here in the same way rsh handles it. sh -c "exec ${TAR_PART1} -f \"${TAPE_FILE}\" ${TAR_PART2} ${TAR_PART3}" fi # `rsh' doesn't exit with the exit status of the remote command. What # stupid lossage. TODO: think of a reliable workaround. if [ $? -ne 0 ] ; then echo "Backup of ${1} failed." # I'm assuming that the tar will have written an empty # file to the tape, otherwise I should do a cat here. else if [ "z${localhost}" != "z${remotehost}" ] ; then rsh "${remotehost}" mv -f /etc/tar-backup/temp.level-1 "/etc/tar-backup/${fsname}.level-1" else mv -f /etc/tar-backup/temp.level-1 "/etc/tar-backup/${fsname}.level-1" fi fi ${TAPE_STATUS} sleep 60 shift done # Dump any individual files requested. if [ "x${BACKUP_FILES}" != "x" ] ; then date="`date`" TAR_PART2="--listed=/etc/tar-backup/temp.level-1" TAR_PART3="--label='Incremental backup of miscellaneous files at ${date}'" echo "Backing up miscellaneous files at ${date}" echo "Last full dump of these files:" ls -l /etc/tar-backup/misc.level-0 rm -f /etc/tar-backup/temp.level-1 cp /etc/tar-backup/misc.level-0 /etc/tar-backup/temp.level-1 # Using `sh -c exec' causes nested quoting and shell substitution # to be handled here in the same way rsh handles it. sh -c "exec ${TAR_PART1} -f \"${TAPE_FILE}\" ${TAR_PART2} ${TAR_PART3} ${BACKUP_FILES}" if [ $? -ne 0 ] ; then echo "Backup of miscellaneous files failed." 1>&2 # I'm assuming that the tar will have written an empty # file to the tape, otherwise I should do a cat here. else mv -f /etc/tar-backup/temp.level-1 /etc/tar-backup/misc.level-1 fi ${TAPE_STATUS} else echo "No miscellaneous files specified" fi # Caveat: some versions of `mt' use `-t' instead of `-f'. mt -f "${TAPE_FILE}" rewind mt -f "${TAPE_FILE}" offl ) 2>&1 | tee -a "${LOGFILE}" echo "Sending the dump log to ${ADMINISTRATOR}" mail -s "Results of backup started ${startdate}" ${ADMINISTRATOR} < "${LOGFILE}" # eof tar-1.11.8/scripts/weekly.new 644 625 1 1767 4714071513 11114 #!/bin/sh # start doing things TOBACKUP="albert:/" HOST=`hostname | sed 's/\..*//'` TAPEFILE=/dev/rfd0a LOGFILE=tar-out BLOCKING=20 TAR_PART1="/usr/local/bin/tar clbfVM $BLOCKING" rm -f $LOGFILE mt -f $TAPEFILE rewind host=`echo $TOBACKUP | sed 's/:.*$//'`; fs=`echo $TOBACKUP | sed 's/^.*://'`; date=`date`; fsname=`echo $TOBACKUP | sed 's/\//:/g'` TAR_PART2="'Weekly backup of $fs on $host at $date' -C $fs ." echo Backing up $TOBACKUP at $date | tee -a $LOGFILE # Actually back things up. if [ $HOST != $host ] ; then rsh $host $TAR_PART1 $HOST:$TAPEFILE $TAR_PART2 else sh -c "exec $TAR_PART1 $TAPEFILE $TAR_PART2" fi if [ $? -ne 0 ] ; then echo Backup of $TOBACKUP failed. | tee -a $LOGFILE echo mts at time of failure | tee -a $LOGFILE mts -t $TAPEFILE | tee -a $LOGFILE # I'm assuming that the tar will have written an empty # file to the tape, otherwise I should do a cat here. else echo $date > $fsname.lasttar fi sleep 60; mt -f $TAPEFILE rewind mt -f $TAPEFILE offl tar-1.11.8/po/Makefile.in 644 625 1 6772 5770630614 10104 # Makefile for translation files. # Copyright (C) 1995 Free Software Foundation, Inc. # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. PACKAGE = @PACKAGE@ VERSION = @VERSION@ SHELL = /bin/sh @SET_MAKE@ srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ prefix = @prefix@ exec_prefix = @exec_prefix@ datadir = $(prefix)/@DATADIRNAME@ localedir = $(datadir)/locale subdir = po INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ GENCAT = @GENCAT@ GMSGFMT = @GMSGFMT@ MSGFMT = @MSGFMT@ TUPDATE = tupdate XGETTEXT = @XGETTEXT@ POFILES = de.po fr.po pt.po sv.po MOFILES = de.gmo fr.gmo pt.gmo sv.gmo DISTFILES = Makefile.in POTFILES $(PACKAGE).pot $(POFILES) $(MOFILES) CATALOGS = @CATALOGS@ CATOBJEXT = @CATOBJEXT@ INSTOBJEXT = $(CATOBJEXT:.gmo=.mo) POTFILES = @POTFILES@ .SUFFIXES: .SUFFIXES: .po .pox .gmo .mo .msg .cat .po.pox: $(MAKE) $(PACKAGE).pot $(TUPDATE) $(srcdir)/$(PACKAGE).pot $*.po > $*.pox .po.mo: $(MSGFMT) -o $@ $< .po.gmo: $(GMSGFMT) -o $@ $< mv $@.mo $@ echo $@ | grep / >/dev/null || mv $@ $(srcdir)/$@ .po.msg: sed -f ../intl/po-to-msg.sed < $(srcdir)/$*.po > $@ .msg.cat: rm -f $@ $(GENCAT) $@ $*.msg all: $(CATALOGS) $(PACKAGE).pot: $(POTFILES) cd $(top_srcdir) && \ $(XGETTEXT) -ppo -d$(PACKAGE) -n -k -k_ `cat po/POTFILES` cd $(srcdir) && \ if cmp -s $(PACKAGE).po $(PACKAGE).pot; then rm $(PACKAGE).po; \ else rm -f $(PACKAGE).pot; mv $(PACKAGE).po $(PACKAGE).pot; fi install: install-exec install-data install-exec: install-data: all for cat in $(CATALOGS); do \ lang=`echo $$cat | sed 's|.*/||' | sed 's|$(CATOBJEXT)||'`; \ dir=$(localedir)/$$lang/LC_MESSAGES; \ $(top_srcdir)/mkinstalldirs $$dir; \ if test -f $$cat; then \ $(INSTALL_DATA) $$cat $$dir/$(PACKAGE)$(INSTOBJEXT); \ else \ $(INSTALL_DATA) $(srcdir)/$$cat $$dir/$(PACKAGE)$(INSTOBJEXT); \ fi; \ done uninstall: for cat in $(CATALOGS); do \ lang=`echo $$cat | sed 's,.*/,,' | sed s'$(CATOBJEXT)$$''`; \ rm -f $(localedir)/$$lang/LC_MESSAGES/$(PACKAGE)$(INSTOBJEXT); \ done TAGS: mostlyclean: rm -f core core.* *.pox clean: mostlyclean distclean: clean rm -f Makefile *.mo *.msg *.cat maintainer-clean: distclean @echo "This command is intended for maintainers to use;" @echo "it deletes files that may require special tools to rebuild." distdir = ../$(PACKAGE)-$(VERSION)/$(subdir) dist: $(DISTFILES) # for lang in $(CATALOGS:$(CATOBJEXT)=); do \ # mv $$lang.po $$lang.old.po; \ # $(TUPDATE) $(top_srcdir)/$(PACKAGE).pot $$lang.old.po > $$lang.po; \ # rm -f $$lang.old.po; \ # done for file in $(DISTFILES); do \ ln $(srcdir)/$$file $(distdir) 2> /dev/null \ || cp -p $(srcdir)/$$file $(distdir); \ done Makefile: Makefile.in ../config.status cd .. && CONFIG_FILES=$(subdir)/$@ CONFIG_HEADERS= ./config.status # Tell versions [3.59,3.63) of GNU make not to export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: tar-1.11.8/po/POTFILES 644 625 1 255 5770076400 7152 src/genfile.c src/rmt.c src/buffer.c src/create.c src/diffarch.c src/extract.c src/gnu.c src/list.c src/mangle.c src/port.c src/rmt.c src/rtapelib.c src/tar.c src/update.c tar-1.11.8/po/tar.pot 644 625 1 50126 5770654152 7364 msgid "" msgstr "\ Version: \n\ Date: 1995-06-17 18:34:18-0400\n\ From: =?ISO-8859-1?Q?Fran=E7ois_Pinard?= \n\ Directory: /home/pinard/tar\n\ Xgettext-Options: -ppo -dtar -n -k -k_\n\ Files: src/genfile.c src/rmt.c src/buffer.c src/create.c src/diffarch.c\n\ Files: src/extract.c src/gnu.c src/list.c src/mangle.c src/port.c src/rmt.c\n\ Files: src/rtapelib.c src/tar.c src/update.c\n" #: src/rtapelib.c:226 msgid "exec/tcp: Service not available" msgstr "" #: src/genfile.c:49 src/tar.c:959 msgid "Try `%s --help' for more information.\n" msgstr "" #: src/update.c:99 src/update.c:314 msgid "Skipping to next header" msgstr "" #: src/diffarch.c:160 src/diffarch.c:380 msgid "Size" msgstr "" #: src/diffarch.c:398 msgid "Cannot seek to %ld in file %s" msgstr "" #: src/tar.c:1557 msgid "You must use a compression option (--gzip, --compress\n\ or --use-compress-program) with --block-compress" msgstr "" #: src/diffarch.c:526 msgid "VERIFY FAILURE: %d invalid header(s) detected" msgstr "" #: src/buffer.c:1081 msgid "Blocksize = %d records" msgstr "" #: src/gnu.c:631 msgid "%s: Deleting %s\n" msgstr "" #: src/tar.c:1048 msgid " -N, --newer=DATE only store files newer than DATE\n\ --after-date=DATE same as -N\n" msgstr "" #: src/buffer.c:909 msgid "Read checkpoint %d" msgstr "" #: src/tar.c:1065 msgid "\n\ On *this* particular tar, the defaults are -f %s and -b %d.\n" msgstr "" #: src/mangle.c:114 msgid "Cannot symlink %s to %s" msgstr "" #: src/mangle.c:121 msgid "Unknown demangling command %s" msgstr "" #: src/buffer.c:886 msgid "At beginning of tape, quitting now" msgstr "" #: src/mangle.c:117 msgid "Symlinked %s to %s" msgstr "" #: src/port.c:358 msgid "%s: Cannot link to %s, copying instead" msgstr "" #: src/tar.c:1025 msgid "\n\ Archive format selection:\n\ -V, --label=NAME create archive with volume name NAME\n\ -o, --old-archive, --portability write a V7 format archive (not ANSI)\n\ -z, --gzip, --ungzip filter the archive through gzip\n\ -Z, --compress, --uncompress filter the archive through compress\n\ --use-compress-program=PROG filter through PROG (must accept -d)\n" msgstr "" #: src/tar.c:1297 msgid "Options [0-7][lmh] not supported by *this* tar" msgstr "" #: src/buffer.c:233 msgid "Cannot fork" msgstr "" #: src/buffer.c:1376 msgid "EOF? What does that mean?" msgstr "" #: src/genfile.c:57 msgid "Mandatory arguments to long options are mandatory for short options too.\n\ \n\ --help display this help and exit\n\ --version output version information and exit\n" msgstr "" #: src/buffer.c:600 src/buffer.c:1472 src/diffarch.c:178 src/gnu.c:113 src/tar.c:798 msgid "Cannot open %s" msgstr "" #: src/tar.c:964 msgid "Mandatory or optional arguments to long options are mandatory or optional\n\ for short options too.\n" msgstr "" #: src/update.c:94 src/update.c:309 msgid "This does not look like a tar archive" msgstr "" #: src/create.c:551 src/create.c:570 src/create.c:1063 msgid "Read error at byte %ld, reading %d bytes, in file %s" msgstr "" #: src/buffer.c:563 msgid "Cannot use multi-volume compressed archives" msgstr "" #: src/create.c:1305 msgid "File name %s%s too long" msgstr "" #: src/buffer.c:647 src/buffer.c:651 src/buffer.c:1001 src/buffer.c:1011 msgid "Volume mismatch! %s!=%s" msgstr "" #: src/buffer.c:213 msgid "Cannot use compressed or remote archives" msgstr "" #: src/diffarch.c:448 src/diffarch.c:464 src/diffarch.c:678 msgid "%s: Data differs\n" msgstr "" #: src/tar.c:1005 msgid "\n\ Device selection and switching:\n\ -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME\n\ --force-local archive file is local even if has a colon\n\ --rsh-command=COMMAND use remote COMMAND instead of rsh\n\ -[0-7][lmh] specify drive and density\n\ -M, --multi-volume create/list/extract multi-volume archive\n\ -L, --tape-length=NUM change tape after writing NUM x 1024 bytes\n\ -F, --info-script=FILE run script at end of each tape (implies -M)\n\ --new-volume-script=FILE same as -F FILE\n" msgstr "" #: src/buffer.c:530 msgid "No archive name given, what should I do?" msgstr "" #: src/buffer.c:1392 msgid " n [name] Give a new filename for the next (and subsequent) volume(s)\n\ q Abort tar\n\ ! Spawn a subshell\n\ ? Print this list\n" msgstr "" #: src/tar.c:1017 msgid "\n\ Device blocking:\n\ -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes\n\ --block-compress block the output of compression for tapes\n\ -i, --ignore-zeros ignore blocks of zeros in archive (means EOF)\n\ -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes)\n" msgstr "" #: src/extract.c:471 src/extract.c:854 msgid "Could not change access and modification times of %s" msgstr "" #: src/extract.c:630 msgid "Could not create directory %s" msgstr "" #: src/list.c:725 msgid "--Continued at byte %ld--\n" msgstr "" #: src/buffer.c:1433 msgid "Cannot fork!" msgstr "" #: src/rmt.c:308 src/rmt.c:308 msgid "Garbage command" msgstr "" #: src/tar.c:1207 src/tar.c:1512 src/tar.c:1519 msgid "Only one compression option permitted" msgstr "" #: src/tar.c:1631 msgid "Total bytes written: %d\n" msgstr "" #: src/diffarch.c:439 src/diffarch.c:621 src/diffarch.c:640 msgid "Cannot read %s" msgstr "" #: src/port.c:820 msgid "Cannot open a pipe" msgstr "" #: src/tar.c:968 msgid "\n\ Main operation mode:\n\ -t, --list list the contents of an archive\n\ -x, --extract, --get extract files from an archive\n\ -c, --create create a new archive\n\ -d, --diff, --compare find differences between archive and file system\n\ -r, --append append files to the end of an archive\n\ -u, --update only append files newer than copy in archive\n\ -A, --catenate append tar files to an archive\n\ --concatenate same as -A\n\ --delete delete from the archive (not on mag tapes!)\n" msgstr "" #: src/create.c:1379 msgid "%s: Unknown file type; file ignored" msgstr "" #: src/diffarch.c:248 msgid "Cannot read link %s" msgstr "" #: src/buffer.c:1102 msgid "Archive %s EOF not on block boundary" msgstr "" #: src/extract.c:686 msgid "Visible long name error" msgstr "" #: src/extract.c:678 msgid "Cannot extract `%s' -- file is continued from another volume" msgstr "" #: src/tar.c:1646 src/tar.c:1666 msgid "Bad regular expression: %s" msgstr "" #: src/rtapelib.c:391 msgid "Cannot execute remote shell" msgstr "" #: src/diffarch.c:220 src/diffarch.c:551 msgid "%s: Does not exist\n" msgstr "" #: src/tar.c:1182 msgid "Invalid date format `%s'" msgstr "" #: src/buffer.c:893 msgid "Too many errors, quitting" msgstr "" #: src/buffer.c:492 msgid "Cannot exec %s" msgstr "" #: src/buffer.c:526 msgid "Invalid value for blocksize" msgstr "" #: src/list.c:764 msgid "Creating directory:" msgstr "" #: src/buffer.c:883 msgid "Read error on %s" msgstr "" #: src/buffer.c:284 src/buffer.c:295 src/buffer.c:384 msgid "Cannot open archive %s" msgstr "" #: src/create.c:708 msgid "Cannot add file %s" msgstr "" #: src/extract.c:737 msgid "Cannot change owner of %s to uid %d gid %d" msgstr "" #: src/tar.c:1383 msgid "Cannot keep old files on this system" msgstr "" #: src/buffer.c:1267 msgid "Child returned status %d" msgstr "" #: src/extract.c:639 msgid "Added write and execute permission to directory %s" msgstr "" #: src/tar.c:297 msgid "Missing filename after -C" msgstr "" #: src/tar.c:1034 msgid "\n\ Local file selection:\n\ -C, --directory DIR change to directory DIR\n\ -T, --files-from=NAME get names to extract or create from file NAME\n\ --null -T reads null-terminated names, disable -C\n\ --exclude=FILE exclude file FILE\n\ -X, --exclude-from=FILE exclude files listed in FILE\n\ -P, --absolute-paths don't strip leading `/'s from file names\n\ -h, --dereference dump instead the files symlinks point to\n\ -l, --one-file-system stay in local file system when creating archive\n\ -K, --starting-file=NAME begin at file NAME in the archive\n" msgstr "" #: src/create.c:524 msgid "Wrote %ld of %ld bytes to file %s" msgstr "" #: src/extract.c:567 src/extract.c:583 msgid "Could not make %s" msgstr "" #: src/create.c:742 msgid "%s: is unchanged; not dumped" msgstr "" #: src/tar.c:1053 msgid "\n\ Informative output:\n\ --help print this help, then exit\n\ --version print tar program version number, then exit\n\ -v, --verbose verbosely list files processed\n\ --checkpoint print directory names while reading the archive\n\ --totals print total bytes written while creating archive\n\ -R, --record-number show record number within archive with each message\n\ -w, --interactive ask for confirmation for every action\n\ --confirmation same as -w\n" msgstr "" #: src/buffer.c:718 msgid "Write checkpoint %d" msgstr "" #: src/buffer.c:1190 msgid "Could not backspace archive file; it may be unreadable without -i" msgstr "" #: src/create.c:214 msgid "Removing drive spec from names in the archive" msgstr "" #: src/diffarch.c:108 msgid "Verify " msgstr "" #: src/create.c:582 src/create.c:1076 msgid "File %s shrunk by %d bytes, padding with zeros" msgstr "" #: src/tar.c:1326 msgid "Cannot change directory to %d" msgstr "" #: src/create.c:826 src/create.c:1090 src/create.c:1145 src/create.c:1374 msgid "Cannot remove %s" msgstr "" #: src/extract.c:486 src/extract.c:865 msgid "Cannot chown file %s to uid %d gid %d" msgstr "" #: src/extract.c:527 msgid "Could not link %s to %s" msgstr "" #: src/buffer.c:264 msgid "(child) Pipe to stdin" msgstr "" #: src/diffarch.c:309 msgid "%s: Mode or device-type changed\n" msgstr "" #: src/tar.c:981 msgid "\n\ Operation mode modificators:\n\ -W, --verify attempt to verify the archive after writing it\n\ --remove-files remove files after adding them to the archive\n\ -k, --keep-old-files don't overwrite existing files from archive\n\ -S, --sparse handle sparse files efficiently\n\ -O, --to-stdout extract files to standard output\n\ -G, --incremental handle old GNU-format incremental backup\n\ -g, --listed-incremental handle new GNU-format incremental backup\n\ --ignore-failed-read do not exit with non-zero on unreadable files\n" msgstr "" #: src/buffer.c:1444 msgid "Cannot exec a shell %s" msgstr "" #: src/rmt.c:250 src/rmt.c:250 msgid "rmtd: Premature eof\n" msgstr "" #: src/extract.c:385 msgid "%d at %d\n" msgstr "" #: src/create.c:598 msgid "Amount actually written is (I hope) %d.\n" msgstr "" #: src/buffer.c:413 msgid "Cannot write to compression program" msgstr "" #: src/tar.c:236 src/tar.c:460 src/tar.c:487 src/tar.c:511 msgid "Cannot change to directory %s" msgstr "" #: src/gnu.c:382 msgid "Directory %s has been renamed" msgstr "" #: src/extract.c:411 src/extract.c:810 msgid "Could only write %d of %d bytes to file %s" msgstr "" #: src/list.c:704 msgid " unknown file type `%c'\n" msgstr "" #: src/port.c:626 msgid "Cannot close a file #%d" msgstr "" #: src/gnu.c:393 msgid "Directory %s is new" msgstr "" #: src/buffer.c:348 msgid "tar (child)" msgstr "" #: src/diffarch.c:501 msgid "Could not rewind archive file for verify" msgstr "" #: src/genfile.c:54 msgid "\n\ Usage: %s [OPTION]...\n" msgstr "" #: src/buffer.c:1255 msgid "Child died with signal %d%s" msgstr "" #: src/diffarch.c:295 msgid "%s: Device numbers changed\n" msgstr "" #: src/buffer.c:1022 src/extract.c:670 msgid "Reading %s\n" msgstr "" #: src/diffarch.c:156 msgid "Mod time" msgstr "" #: src/extract.c:544 msgid "Could not create symlink to %s" msgstr "" #: src/buffer.c:312 msgid "Child cannot fork" msgstr "" #: src/extract.c:178 msgid "Unknown file type '%c' for %s, extracted as normal file" msgstr "" #: src/buffer.c:554 msgid "Cannot verify multi-volume archives" msgstr "" #: src/tar.c:1554 msgid "Multiple archive files requires --multi-volume" msgstr "" #: src/diffarch.c:75 msgid "Could not allocate memory for diff buffer of %d bytes" msgstr "" #: src/buffer.c:1381 src/buffer.c:1406 msgid "WARNING: Archive is incomplete" msgstr "" #: src/mangle.c:95 msgid "Cannot rename %s to %s" msgstr "" #: src/buffer.c:1257 msgid " (core dumped)" msgstr "" #: src/create.c:1272 msgid "%s: On a different filesystem; not dumped" msgstr "" #: src/rmt.c:307 src/rmt.c:307 msgid "rmtd: Garbage command %c\n" msgstr "" #: src/gnu.c:603 msgid "Unexpected EOF in archive" msgstr "" #: src/list.c:730 msgid "--Mangled file names--\n" msgstr "" #: src/buffer.c:1033 msgid "%s is not continued on this volume" msgstr "" #: src/buffer.c:1053 msgid "This volume is out of sequence" msgstr "" #: src/diffarch.c:256 msgid "%s: Symlink differs\n" msgstr "" #: src/buffer.c:351 msgid "[child] Pipe to stdout" msgstr "" #: src/rmt.c:133 src/rmt.c:133 msgid "rmtd: Cannot allocate buffer space\n" msgstr "" #: src/list.c:127 msgid "Hmm, this doesn't look like a tar archive" msgstr "" #: src/buffer.c:864 src/gnu.c:158 msgid "Cannot write to %s" msgstr "" #: src/gnu.c:100 src/tar.c:401 msgid "Could not get current directory: %s" msgstr "" #: src/buffer.c:468 msgid "Cannot read from compression program" msgstr "" #: src/tar.c:1614 msgid "You may not specify more than one of the r, c, t, x, or d options" msgstr "" #: src/list.c:132 msgid "Skipping to next file header" msgstr "" #: src/buffer.c:1371 msgid "\007Prepare volume #%d for %s and hit return: " msgstr "" #: src/list.c:207 msgid "Only wrote %ld of %ld bytes to file %s" msgstr "" #: src/buffer.c:1110 msgid "Only read %d bytes from archive %s" msgstr "" #: src/tar.c:347 src/tar.c:389 msgid "Missing file name after -C" msgstr "" #: src/extract.c:503 src/extract.c:663 src/extract.c:874 msgid "Cannot change mode of file %s to %lo" msgstr "" #: src/gnu.c:235 src/gnu.c:360 src/update.c:123 msgid "Cannot stat %s" msgstr "" #: src/buffer.c:259 msgid "(child) Pipe to stdout" msgstr "" #: src/buffer.c:1042 msgid "%s is the wrong size (%ld != %ld + %ld)" msgstr "" #: src/buffer.c:1401 msgid "No new volume; exiting.\n" msgstr "" #: src/create.c:751 msgid "%s is the archive; not dumped" msgstr "" #: src/buffer.c:575 msgid "Cannot verify stdin/stdout archive" msgstr "" #: src/create.c:795 msgid "Removing leading / from absolute links" msgstr "" #: src/gnu.c:633 msgid "Error while deleting %s" msgstr "" #: src/diffarch.c:116 msgid "Unknown file type '%c' for %s, diffed as normal file" msgstr "" #: src/list.c:721 msgid "--Volume Header--\n" msgstr "" #: src/create.c:1280 src/gnu.c:323 msgid "Cannot open directory %s" msgstr "" #: src/extract.c:408 src/extract.c:797 src/extract.c:807 msgid "Could not write to file %s" msgstr "" #: src/diffarch.c:348 msgid "%s: No longer a directory\n" msgstr "" #: src/list.c:536 src/list.c:756 msgid "rec %10ld: " msgstr "" #: src/buffer.c:642 msgid "Archive not labelled to match %s" msgstr "" #: src/buffer.c:286 msgid "Archive to stdin" msgstr "" #: src/rmt.c:251 src/rmt.c:251 msgid "Premature end of file" msgstr "" #: src/diffarch.c:142 src/diffarch.c:370 msgid "%s: Not a regular file\n" msgstr "" #: src/list.c:196 msgid "EOF in archive file" msgstr "" #: src/diffarch.c:60 msgid "%s: %s differs\n" msgstr "" #: src/tar.c:546 src/tar.c:563 msgid "%s: Not found in archive" msgstr "" #: src/rmt.c:134 src/rmt.c:134 msgid "Cannot allocate buffer space" msgstr "" #: src/diffarch.c:390 src/tar.c:150 src/update.c:176 msgid "Cannot open file %s" msgstr "" #: src/buffer.c:321 msgid "((child)) Pipe to stdin" msgstr "" #: src/diffarch.c:152 msgid "Uid" msgstr "" #: src/tar.c:1609 msgid "You must specify one of the r, c, t, x, or d options" msgstr "" #: src/diffarch.c:154 msgid "Gid" msgstr "" #: src/mangle.c:65 msgid "Unexpected EOF in mangled names" msgstr "" #: src/tar.c:963 msgid "Usage: %s [OPTION]... [FILE]...\n" msgstr "" #: src/buffer.c:547 msgid "Could not allocate memory for blocking factor %d" msgstr "" #: src/tar.c:94 msgid "Cannot read confirmation from user" msgstr "" #: src/diffarch.c:441 src/diffarch.c:623 src/diffarch.c:642 msgid "%s: Could only read %d of %ld bytes\n" msgstr "" #: src/list.c:82 msgid "Omitting %s" msgstr "" #: src/buffer.c:332 msgid "((child)) Pipe to stdout" msgstr "" #: src/diffarch.c:228 msgid "%s: Not linked to %s\n" msgstr "" #: src/buffer.c:197 msgid "Cannot close descriptor %d" msgstr "" #: src/diffarch.c:150 src/diffarch.c:354 msgid "Mode" msgstr "" #: src/mangle.c:97 msgid "Renamed %s to %s" msgstr "" #: src/buffer.c:200 msgid "Cannot dup %s" msgstr "" #: src/buffer.c:1137 src/buffer.c:1231 src/buffer.c:1344 msgid "WARNING: Cannot close %s (%d, %d)" msgstr "" #: src/gnu.c:223 src/tar.c:283 src/tar.c:657 msgid "Cannot chdir to %s" msgstr "" #: src/diffarch.c:245 msgid "%s: No such file or directory\n" msgstr "" #: src/buffer.c:418 msgid "Write to compression program short %d bytes" msgstr "" #: src/gnu.c:95 src/tar.c:395 msgid "Could not get current directory" msgstr "" #: src/diffarch.c:205 src/diffarch.c:416 src/extract.c:449 msgid "Error while closing %s" msgstr "" #: src/list.c:696 src/list.c:700 msgid " link to %s\n" msgstr "" #: src/buffer.c:1519 src/extract.c:370 src/extract.c:788 src/list.c:367 src/list.c:789 msgid "Unexpected EOF on archive file" msgstr "" #: src/buffer.c:356 msgid "[child] Pipe to stdin" msgstr "" #: src/diffarch.c:222 src/diffarch.c:553 msgid "Cannot stat file %s" msgstr "" #: src/gnu.c:593 msgid "Cannot allocate %d bytes for restore" msgstr "" #: src/buffer.c:297 msgid "Archive to stdout" msgstr "" #: src/tar.c:993 msgid "\n\ Handling of file attributes:\n\ --atime-preserve don't change access times on dumped files\n\ -m, --modification-time don't extract file modified time\n\ --same-owner create extracted files with the same ownership \n\ -p, --same-permissions extract all protection information\n\ --preserve-permissions same as -p\n\ -s, --same-order sort names to extract to match archive\n\ --preserve-order same as -s\n\ --preserve same as both -p and -s\n" msgstr "" #: src/extract.c:320 msgid "Could not create file %s" msgstr "" #: src/buffer.c:560 msgid "Cannot update or verify compressed archives" msgstr "" #: src/buffer.c:867 msgid "Only wrote %u of %u bytes to %s" msgstr "" #: src/buffer.c:1026 msgid "WARNING: No volume header" msgstr "" #: src/tar.c:145 msgid "Too many args with -T option" msgstr "" #: src/list.c:578 msgid "Visible longname error" msgstr "" #: src/create.c:222 src/extract.c:169 msgid "Removing leading / from absolute path names in the archive" msgstr "" #: src/tar.c:1438 msgid "Obsolete option name replaced by --absolute-names" msgstr "" #: src/update.c:109 msgid "File %s\n" msgstr "" #: src/update.c:197 msgid "Read error at byte %ld reading %d bytes in file %s" msgstr "" #: src/update.c:202 msgid "%s: File shrunk by %d bytes, (yark!)" msgstr "" #: src/update.c:289 msgid "Junk files\n" msgstr "" #: src/update.c:325 msgid "file %s\n" msgstr "" #: src/update.c:331 msgid "Skip %ld\n" msgstr "" #: src/update.c:348 msgid "Out of first loop\n" msgstr "" #: src/update.c:372 msgid "Saved %d recs, need %d more\n" msgstr "" #: src/update.c:394 msgid "New block\n" msgstr "" #: src/update.c:401 msgid "Header type %d\n" msgstr "" #: src/update.c:422 msgid "Deleting non-header from archive" msgstr "" #: src/update.c:431 msgid "File %s " msgstr "" #: src/update.c:437 msgid "Flush it\n" msgstr "" #: src/update.c:444 msgid "Flushing %d recs from %s\n" msgstr "" #: src/update.c:451 msgid "Block: %d <= %d " msgstr "" #: src/update.c:458 msgid "Block %d left\n" msgstr "" #: src/update.c:464 msgid "Final %d\n" msgstr "" #: src/update.c:488 msgid "Need %d kept_in %d keep %d\n" msgstr "" #: src/update.c:500 msgid "Flush...\n" msgstr "" #: src/update.c:514 msgid "Copying %d\n" msgstr "" #: src/update.c:526 msgid "Now new %d need %d keep %d keep_in %d rec %d/%d\n" msgstr "" #: src/update.c:552 msgid "Write block\n" msgstr "" #: src/update.c:623 msgid "Fore to %x\n" msgstr "" #: src/update.c:627 msgid "Could not re-position archive file" msgstr "" tar-1.11.8/po/de.po 644 625 1 102061 5770532737 7022 msgid "" msgstr "\ Version: \n\ Date: 1995-06-13 16:30:27-0400\n\ From: =?ISO-8859-1?Q?Fran=E7ois_Pinard?= \n\ Directory: /home/pinard/tar/po\n\ Xgettext-Options: -dtar -n -k -k_\n\ Files: ../src/genfile.c ../src/rmt.c ../src/buffer.c ../src/create.c\n\ Files: ../src/diffarch.c ../src/extract.c ../src/gnu.c ../src/list.c\n\ Files: ../src/mangle.c ../src/port.c ../src/rmt.c ../src/rtapelib.c\n\ Files: ../src/tar.c ../src/update.c\n\ Update on FIXME:date \n" #: ../src/rtapelib.c:226 msgid "exec/tcp: Service not available" msgstr "exec/tcp: Service nicht verfügbar" #: ../src/genfile.c:42 ../src/tar.c:959 msgid "Try `%s --help' for more information.\n" msgstr "`%s --help' gibt weitere Informationen.\n" #: ../src/update.c:99 ../src/update.c:314 msgid "Skipping to next header" msgstr "Springe zum nächsten Kopfteil" #: ../src/diffarch.c:160 ../src/diffarch.c:380 msgid "Size" msgstr "Größe" #: ../src/diffarch.c:398 msgid "Cannot seek to %ld in file %s" msgstr "Kann nicht zu Position %ld in Datei %s wechseln" #: ../src/tar.c:1557 msgid "You must use a compression option (--gzip, --compress\n\ or --use-compress-program) with --block-compress" msgstr "Sie müssen eine Option zur Komprimierung (--gzip, --compress oder\n\ --use-compress-program) bei --block-compress angeben" #: ../src/diffarch.c:526 msgid "VERIFY FAILURE: %d invalid header(s) detected" msgstr "FEHLER BEI VERIFIZIERUNG: %d ungültige(r) Kopfteil(e) erkannt" #: ../src/buffer.c:1081 msgid "Blocksize = %d records" msgstr "Blockgröße = %d Einträge" #: ../src/gnu.c:631 msgid "%s: Deleting %s\n" msgstr "%s: Lösche %s\n" #: ../src/tar.c:1048 msgid " -N, --newer=DATE only store files newer than DATE\n\ --after-date=DATE same as -N\n" msgstr " -N, --newer=DATUM sichere nur Dateien jünger als DATUM\n\ --after-date=DATUM das gleiche wie `-N'\n" #: ../src/buffer.c:909 msgid "Read checkpoint %d" msgstr "Lese Checkpoint %d" #: ../src/tar.c:1065 msgid "\n\ On *this* particular tar, the defaults are -f %s and -b %d.\n" msgstr "\n\ Dieses *spezielle* `tar' hat die Standardwert `-f %s' und `-s %d'.\n" #: ../src/mangle.c:114 msgid "Cannot symlink %s to %s" msgstr "Kann keinen symbolisches Link von %s auf %s einrichten" #: ../src/mangle.c:121 msgid "Unknown demangling command %s" msgstr "Unbekanntes Kommando %s beim Zusammensetzen von Namen" #: ../src/buffer.c:886 msgid "At beginning of tape, quitting now" msgstr "Am Anfang des Bands, stoppe jetzt" #: ../src/mangle.c:117 msgid "Symlinked %s to %s" msgstr "Symbolischer Link von %s auf %s" #: ../src/port.c:358 msgid "%s: Cannot link to %s, copying instead" msgstr "%s: Kann %s nicht linken, kopiere stattdessen" #: ../src/tar.c:1025 msgid "\n\ Archive format selection:\n\ -V, --label=NAME create archive with volume name NAME\n\ -o, --old-archive, --portability write a V7 format archive (not ANSI)\n\ -z, --gzip, --ungzip filter the archive through gzip\n\ -Z, --compress, --uncompress filter the archive through compress\n\ --use-compress-program=PROG filter through PROG (must accept -d)\n" msgstr "\n\ Auswahl des Archiv Formates:\n\ -V, --label=NAME erzeuge Archiv mit Bandnamen NAME\n\ -o, --old-archive, --portability schreibe Archiv im V7 Format (kein ANSI)\n\ -z, --gzip, --ungzip filtere Archiv durch `gzip'\n\ -Z, --compress, --uncompress filtere Archiv durch `compress'\n\ --use-compress-program=PROG filtere Archiv durch PROG\n\ (muß -d akzeptieren)\n" #: ../src/tar.c:1297 msgid "Options [0-7][lmh] not supported by *this* tar" msgstr "Die Optionen [0-7][lmh] sind bei *diesem* `tar' nicht unterstützt" #: ../src/buffer.c:233 msgid "Cannot fork" msgstr "Kann nicht `fork'en" #: ../src/buffer.c:1376 msgid "EOF? What does that mean?" msgstr "Dateiende? Was soll das bedeuten?" #: ../src/genfile.c:50 msgid "Mandatory arguments to long options are mandatory for short options too.\n\ \n\ --help display this help and exit\n\ --version output version information and exit\n" msgstr "Notwendige Argumente für Optionen in Langform sind auch für die\n\ Kurzform notwendig.\n\ \n\ --help print this help, then exit\n\ --version print tar program version number, then exit\n" #: ../src/buffer.c:600 ../src/buffer.c:1472 ../src/diffarch.c:178 ../src/gnu.c:113 ../src/tar.c:798 msgid "Cannot open %s" msgstr "Kann %s nicht öffnen" #: ../src/tar.c:964 msgid "Mandatory or optional arguments to long options are mandatory or optional\n\ for short options too.\n" msgstr "Notwendige Argumente für Optionen in Langform sind auch für die\n\ Kurzform notwendig.\n" #: ../src/update.c:94 ../src/update.c:309 msgid "This does not look like a tar archive" msgstr "Das sieht nicht wie ein `tar' Archiv aus" #: ../src/create.c:551 ../src/create.c:570 ../src/create.c:1063 msgid "Read error at byte %ld, reading %d bytes, in file %s" msgstr "Lesefehler bei Byte %ld beim Lesen von %d bytes in Datei %s" #: ../src/buffer.c:563 msgid "Cannot use multi-volume compressed archives" msgstr "Kann keine mehrteiligen komprimierten Archive verwenden" #: ../src/create.c:1305 msgid "File name %s%s too long" msgstr "Dateiname %s%s ist zu lang" #: ../src/buffer.c:647 ../src/buffer.c:651 ../src/buffer.c:1001 ../src/buffer.c:1011 msgid "Volume mismatch! %s!=%s" msgstr "Bände passen nicht zueinander! %s!=%s" #: ../src/buffer.c:213 msgid "Cannot use compressed or remote archives" msgstr "Kann keine komprimierten oder nicht-lokalen Archive verwenden" #: ../src/diffarch.c:448 ../src/diffarch.c:464 ../src/diffarch.c:678 msgid "%s: Data differs\n" msgstr "%s: unterschiedliche Daten\n" #: ../src/tar.c:1005 msgid "\n\ Device selection and switching:\n\ -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME\n\ --force-local archive file is local even if has a colon\n\ --rsh-command=COMMAND use remote COMMAND instead of rsh\n\ -[0-7][lmh] specify drive and density\n\ -M, --multi-volume create/list/extract multi-volume archive\n\ -L, --tape-length=NUM change tape after writing NUM x 1024 bytes\n\ -F, --info-script=FILE run script at end of each tape (implies -M)\n\ --new-volume-script=FILE same as -F FILE\n" msgstr "\n\ Geräteauswahl und -wechsel:\n\ -f, --file=[RECHNERNAME:]DATEI nutze Archiv oder Gerät DATEI auf RECHNERNAME\n\ --force-local Archivdatei lokal, auch wenn Name `:' enthält\n\ --rsh-command=KOMMANDO ersetze `rsh' durch KOMMANDO\n\ -[0-7][lmh] wähle Gerät und Schreibdichte\n\ -M, --multi-volume behandle mehbändige Archive\n\ -L, --tape-length=NUMMER wechsle Band nach NUMMER x 1024 Bytes\n\ -F, --info-script=DATEI für Skript DATEI am Bandende (impliziert -M)\n\ --new-volume-script=DATEI das gleiche wie `-F DATEI'\n" #: ../src/buffer.c:530 msgid "No archive name given, what should I do?" msgstr "Kein Archiv Name angegeben, was soll ich tun?" #: ../src/buffer.c:1392 msgid " n [name] Give a new filename for the next (and subsequent) volume(s)\n\ q Abort tar\n\ ! Spawn a subshell\n\ ? Print this list\n" msgstr " n [NAME] Gebe für nächsten (und folgende) Bände neuen Dateinamen\n\ q Unterbreche `tar'\n\ ! Starte Shell in Unterprozeß\n\ ? Gebe diese Liste aus\n" #: ../src/tar.c:1017 msgid "\n\ Device blocking:\n\ -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes\n\ --block-compress block the output of compression for tapes\n\ -i, --ignore-zeros ignore blocks of zeros in archive (means EOF)\n\ -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes)\n" msgstr "\n\ Blockung des Gerätes:\n\ -b, --block-size=BLÖCKE benutze Blöcke der Größe BLÖCKE x 512 bytes\n\ --block-compress blocke die Ausgabe der Komprimierung für Bänder\n\ -i, --ignore-zeros ignoriere Blöcke mit Nullen im Archiv (heißt EOF)\n\ -B, --read-full-blocks ändere Blockung beim Lesen (für 4.2BSD `Pipes')\n" #: ../src/extract.c:471 ../src/extract.c:854 msgid "Could not change access and modification times of %s" msgstr "Konnte Zugriffsrechte und Änderungszeit von %s nicht ändern" #: ../src/extract.c:630 msgid "Could not create directory %s" msgstr "Konnte Verzeichnis %s nicht anlegen" #: ../src/list.c:725 msgid "--Continued at byte %ld--\n" msgstr "--Weitergemacht bei Byte %ld--\n" #: ../src/buffer.c:1433 msgid "Cannot fork!" msgstr "Kann nicht `fork'en!" #: ../src/rmt.c:308 ../src/rmt.c:308 msgid "Garbage command" msgstr "Ungültiges Kommando" #: ../src/tar.c:1207 ../src/tar.c:1512 ../src/tar.c:1519 msgid "Only one compression option permitted" msgstr "Nur eine Komprimier Option ist zulässig" #: ../src/tar.c:1631 msgid "Total bytes written: %d\n" msgstr "Gesamtzahl der geschriebenen Bytes: %d\n" #: ../src/diffarch.c:439 ../src/diffarch.c:621 ../src/diffarch.c:640 msgid "Cannot read %s" msgstr "Kann %s nicht lesen" #: ../src/port.c:820 msgid "Cannot open a pipe" msgstr "Kann keine `Pipe' öffnen" #: ../src/tar.c:968 msgid "\n\ Main operation mode:\n\ -t, --list list the contents of an archive\n\ -x, --extract, --get extract files from an archive\n\ -c, --create create a new archive\n\ -d, --diff, --compare find differences between archive and file system\n\ -r, --append append files to the end of an archive\n\ -u, --update only append files newer than copy in archive\n\ -A, --catenate append tar files to an archive\n\ --concatenate same as -A\n\ --delete delete from the archive (not on mag tapes!)\n" msgstr "\n\ Auswahl der Haupt-Operation:\n\ -t, --list zeige Inhalt eines Archivs an\n\ -x, --extract, --get hole Dateien aus Archiv heraus\n\ -c, --create erzeuge neues Archiv\n\ -d, --diff, --compare suche Differenzen zwischen Archiv und Dateisystem\n\ -r, --append hänge Dateien an das Ende des Archivs an\n\ -u, --update hänge nur Dateien, die jünger als im Archiv sind, an\n\ -A, --catenate hänge `tar' Datei and Archiv an\n\ --concatenate das gleiche wie `-A'\n\ --delete Lösche aus Archiv (nicht auf Magnetbändern!)\n" #: ../src/create.c:1379 msgid "%s: Unknown file type; file ignored" msgstr "%s: Unbekannter Dateityp; Datei ignoriert" #: ../src/diffarch.c:248 msgid "Cannot read link %s" msgstr "Kann Link %s nicht lesen" #: ../src/buffer.c:1102 msgid "Archive %s EOF not on block boundary" msgstr "Archiv %s Dateiende nicht auf Blockgrenze" #: ../src/extract.c:686 msgid "Visible long name error" msgstr "Fehler bei langem Namen festgestellt" #: ../src/extract.c:678 msgid "Cannot extract `%s' -- file is continued from another volume" msgstr "Kann `%s'nicht herausholen -- Datei ist Fortsetzung von einem anderen Band" #: ../src/tar.c:1646 ../src/tar.c:1666 msgid "Bad regular expression: %s" msgstr "Falscher regulärer Ausdruck: %s" #: ../src/rtapelib.c:391 msgid "Cannot execute remote shell" msgstr "Kann Remote-Shell nicht ausführen" #: ../src/diffarch.c:220 ../src/diffarch.c:551 msgid "%s: Does not exist\n" msgstr "%s: Existiert nicht\n" #: ../src/tar.c:1182 msgid "Invalid date format `%s'" msgstr "Unzulässiges Datumsformat `%s'" #: ../src/buffer.c:893 msgid "Too many errors, quitting" msgstr "Zu viele Fehler, beende" #: ../src/buffer.c:492 msgid "Cannot exec %s" msgstr "Kann %s nicht ausführen" #: ../src/buffer.c:526 msgid "Invalid value for blocksize" msgstr "Unzulässiger Wert für Blockgröße" #: ../src/list.c:764 msgid "Creating directory:" msgstr "Erzeuge Verzeichnis:" #: ../src/buffer.c:883 msgid "Read error on %s" msgstr "Lesefehler bei %s" #: ../src/buffer.c:284 ../src/buffer.c:295 ../src/buffer.c:384 msgid "Cannot open archive %s" msgstr "Kann Archiv %s nicht öffnen" #: ../src/create.c:708 msgid "Cannot add file %s" msgstr "Kann Datei %s nicht hinzufügen" #: ../src/extract.c:737 msgid "Cannot change owner of %s to uid %d gid %d" msgstr "Kann Besitzer von %s nicht auf Uid %d Gid %d setzen" #: ../src/tar.c:1383 msgid "Cannot keep old files on this system" msgstr "Kann auf diesem System nicht die alten Dateien behalten" #: ../src/buffer.c:1267 msgid "Child returned status %d" msgstr "Kind-Prozeß gibt Status %d zurück" #: ../src/extract.c:639 msgid "Added write and execute permission to directory %s" msgstr "Setze Schreib- und Ausführungsrechte für Verzeichnis %s" #: ../src/tar.c:297 msgid "Missing filename after -C" msgstr "Dateiname nach `-C' fehlt" #: ../src/tar.c:1034 msgid "\n\ Local file selection:\n\ -C, --directory DIR change to directory DIR\n\ -T, --files-from=NAME get names to extract or create from file NAME\n\ --null -T reads null-terminated names, disable -C\n\ --exclude=FILE exclude file FILE\n\ -X, --exclude-from=FILE exclude files listed in FILE\n\ -P, --absolute-paths don't strip leading `/'s from file names\n\ -h, --dereference dump instead the files symlinks point to\n\ -l, --one-file-system stay in local file system when creating archive\n\ -K, --starting-file=NAME begin at file NAME in the archive\n" msgstr "\n\ Auswahl der lokalen Dateien:\n\ -C, --directory=VERZEICHNIS wechsle zu VERZEICHNIS\n\ -T, --files-from=DATEI hole Namen der zu bearbeitenden Dateien aus DATEI\n\ --null `-T' liest Null-terminierte Namen, verbiete `-C'\n\ --exclude=DATEI lasse DATEI aus\n\ -X, --exclude-from=DATEI lasse Dateien mit Namen aus DATEI aus\n\ -P, --absolute-paths entferne führenden `/' nicht von Dateinamen\n\ -h, --dereference sichere Dateien nicht die symbolischen Links\n\ -l, --one-file-system bleibe im lokalen Dateisystem beim Erzeugen\n\ -K, --starting-file=NAME starte mit Datei NAME im Archiv\n" #: ../src/create.c:524 msgid "Wrote %ld of %ld bytes to file %s" msgstr "Schreibe %ld von %ld Bytes in Datei %s" #: ../src/extract.c:567 ../src/extract.c:583 msgid "Could not make %s" msgstr "Konnte %s nicht erzeugen" #: ../src/create.c:742 msgid "%s: is unchanged; not dumped" msgstr "%s: ist unverändert; nicht gesichert" #: ../src/tar.c:1053 msgid "\n\ Informative output:\n\ --help print this help, then exit\n\ --version print tar program version number, then exit\n\ -v, --verbose verbosely list files processed\n\ --checkpoint print directory names while reading the archive\n\ --totals print total bytes written while creating archive\n\ -R, --record-number show record number within archive with each message\n\ -w, --interactive ask for confirmation for every action\n\ --confirmation same as -w\n" msgstr "\n\ Informationsausgaben:\n\ --help zeige diese Hilfe und beende\n\ --version zeige Versionsnummer des Programms und beende\n\ -v, --verbose ausführliche Liste aller verarbeiteten Dateien\n\ --checkpoint zeige Verzeichnisnamen beim Lesen des Archivs an\n\ --totals zeige Gesamtzahl der Bytes bei Erzeugung an\n\ -R, --record-number zeige bei jeder Meldung die Eintragsnummer an\n\ -w, --interactive frage Benutzer zur Bestätigung jeder Aktion\n\ --confirmation das gleiche wie `-w'\n" #: ../src/buffer.c:718 msgid "Write checkpoint %d" msgstr "Schreibe Checkpoint %d" #: ../src/buffer.c:1190 msgid "Could not backspace archive file; it may be unreadable without -i" msgstr "Kann Archiv Datei nicht zurücksetzen; könnte ohne `-i'unlesbar sein" #: ../src/create.c:214 msgid "Removing drive spec from names in the archive" msgstr "Entferne Laufwerksangaben von Namen im Archiv" #: ../src/diffarch.c:108 msgid "Verify " msgstr "Verifiziere " #: ../src/create.c:582 ../src/create.c:1076 msgid "File %s shrunk by %d bytes, padding with zeros" msgstr "Datei %s ist um %d Bytes geschrumpft, fülle auf mit Nullen" #: ../src/tar.c:1326 msgid "Cannot change directory to %d" msgstr "Kann Verzeichnis nicht auf %d wechseln" #: ../src/create.c:826 ../src/create.c:1090 ../src/create.c:1145 ../src/create.c:1374 msgid "Cannot remove %s" msgstr "Kann %s nicht entfernen" #: ../src/extract.c:486 ../src/extract.c:865 msgid "Cannot chown file %s to uid %d gid %d" msgstr "Kann Besitzer von Datei %s nicht auf Uid %d Gid %d setzen" #: ../src/extract.c:527 msgid "Could not link %s to %s" msgstr "Konnte keinen Link von %s auf %s anlegen" #: ../src/buffer.c:264 msgid "(child) Pipe to stdin" msgstr "(Kind) `Pipe' zu Standard Eingabe" #: ../src/diffarch.c:309 msgid "%s: Mode or device-type changed\n" msgstr "%s: Modus- oder Gerätenummer sind unterschiedlich\n" #: ../src/tar.c:981 msgid "\n\ Operation mode modificators:\n\ -W, --verify attempt to verify the archive after writing it\n\ --remove-files remove files after adding them to the archive\n\ -k, --keep-old-files don't overwrite existing files from archive\n\ -S, --sparse handle sparse files efficiently\n\ -O, --to-stdout extract files to standard output\n\ -G, --incremental handle old GNU-format incremental backup\n\ -g, --listed-incremental handle new GNU-format incremental backup\n\ --ignore-failed-read do not exit with non-zero on unreadable files\n" msgstr "\n\ Auswahl der Unter-Operationen:\n\ -W, --verify versuche Archiv nach Schreiben zu verifizieren\n\ --remove-files lösche Datei nach dem Sichern im Archiv\n\ -k, --keep-old-files überschreibe vorhandene Dateien nicht\n\ -S, --sparse behandle dünn besetzte Dateien effizient\n\ -O, --to-stdout gebe Dateien auf Standard Ausgabe aus\n\ -G, --incremental behandle inkrementelle Backups im alten GNU Format\n\ -g, --listed-incremental behandle inkrementelle Backups im neuen GNU Format\n\ --ignore-failed-read fahre trotz Lesefehler fort\n" #: ../src/buffer.c:1444 msgid "Cannot exec a shell %s" msgstr "Kann keine `Shell' %s ausführen" #: ../src/rmt.c:250 ../src/rmt.c:250 msgid "rmtd: Premature eof\n" msgstr "rmtd: Vorzeitiges Dateiende\n" #: ../src/extract.c:385 msgid "%d at %d\n" msgstr "%d bei %d\n" #: ../src/create.c:598 msgid "Amount actually written is (I hope) %d.\n" msgstr "Wirklich geschriebene Menge %d (hoffe ich!).\n" #: ../src/buffer.c:413 msgid "Cannot write to compression program" msgstr "Kann nicht zum Kompressions-Programm schreiben" #: ../src/tar.c:236 ../src/tar.c:460 ../src/tar.c:487 ../src/tar.c:511 msgid "Cannot change to directory %s" msgstr "Kann nicht zu Verzeichnis %s wechseln" #: ../src/gnu.c:382 msgid "Directory %s has been renamed" msgstr "Verzeichnis %s wurde umbenannt" #: ../src/extract.c:411 ../src/extract.c:810 msgid "Could only write %d of %d bytes to file %s" msgstr "Konnte nur %d von %d Bytes in Datei %s schreiben" #: ../src/list.c:704 msgid " unknown file type `%c'\n" msgstr " unbekannter Dateityp `%s'\n" #: ../src/port.c:626 msgid "Cannot close a file #%d" msgstr "Kann Datei #%d nicht schließen" #: ../src/gnu.c:393 msgid "Directory %s is new" msgstr "Verzeichnis %s ist neu" #: ../src/buffer.c:348 msgid "tar (child)" msgstr "tar (Kind)" #: ../src/diffarch.c:501 msgid "Could not rewind archive file for verify" msgstr "Konnte Archiv Datei zur verifizierung nicht zurückspulen" #: ../src/genfile.c:47 msgid "\n\ Usage: %s [OPTION]...\n" msgstr "\n\ Benutzung: %s [OPTION]...\n" #: ../src/buffer.c:1255 msgid "Child died with signal %d%s" msgstr "Kind-Prozeß mit Signal %d%s gestorben" #: ../src/diffarch.c:295 msgid "%s: Device numbers changed\n" msgstr "%s: Gerätenummer ist unterschiedlich\n" #: ../src/buffer.c:1022 ../src/extract.c:670 msgid "Reading %s\n" msgstr "Lese %s\n" #: ../src/diffarch.c:156 msgid "Mod time" msgstr "Zeitpunkt der letzten Änderung" #: ../src/extract.c:544 msgid "Could not create symlink to %s" msgstr "Konnte symbolischen Link auf %s nicht anlegen" #: ../src/buffer.c:312 msgid "Child cannot fork" msgstr "Kind-Prozeß kann nicht `fork'en" #: ../src/extract.c:178 msgid "Unknown file type '%c' for %s, extracted as normal file" msgstr "Unbekannter Dateityp '%c'für %s, wie eine normale Datei herausgeholt" #: ../src/buffer.c:554 msgid "Cannot verify multi-volume archives" msgstr "Kann mehrteilige Archive nicht verifizieren" #: ../src/tar.c:1554 msgid "Multiple archive files requires --multi-volume" msgstr "Bei mehreren Archiv Dateien ist `--multi-volume' erforderlich" #: ../src/diffarch.c:75 msgid "Could not allocate memory for diff buffer of %d bytes" msgstr "Konnte keinen Speicher von %d Bytes für Vergleichspuffer belegen" #: ../src/buffer.c:1381 ../src/buffer.c:1406 msgid "WARNING: Archive is incomplete" msgstr "WARNUNG: Archiv unvollständig" #: ../src/mangle.c:95 msgid "Cannot rename %s to %s" msgstr "Kann %s nicht in %s umbenennen" #: ../src/buffer.c:1257 msgid " (core dumped)" msgstr " (Core-Datei geschrieben)" #: ../src/create.c:1272 msgid "%s: On a different filesystem; not dumped" msgstr "%s: Auf einem anderen Dateisystem; nicht gesichert" #: ../src/rmt.c:307 ../src/rmt.c:307 msgid "rmtd: Garbage command %c\n" msgstr "rmtd: Überflüssiges Kommando '%c'\n" #: ../src/gnu.c:603 msgid "Unexpected EOF in archive" msgstr "Unerwartetes Dateiende im Archiv" #: ../src/list.c:730 msgid "--Mangled file names--\n" msgstr "--Verstümmelte Dateinamen--\n" #: ../src/buffer.c:1033 msgid "%s is not continued on this volume" msgstr "%s ist in diesem Band nicht fortgesetzt" #: ../src/buffer.c:1053 msgid "This volume is out of sequence" msgstr "Dieser Band ist nicht an der Reihe" #: ../src/diffarch.c:256 msgid "%s: Symlink differs\n" msgstr "%s: Symbolischer Link unterschiedlich\n" #: ../src/buffer.c:351 msgid "[child] Pipe to stdout" msgstr "[Kind] `Pipe' auf Standard Ausgabe" #: ../src/rmt.c:133 ../src/rmt.c:133 msgid "rmtd: Cannot allocate buffer space\n" msgstr "rmtd: Kann Speicherplatz für Puffer nicht belegen\n" #: ../src/list.c:127 msgid "Hmm, this doesn't look like a tar archive" msgstr "Hmh, das sieht nicht wie ein `tar' Archiv aus" #: ../src/buffer.c:864 ../src/gnu.c:158 msgid "Cannot write to %s" msgstr "Kann nicht auf %s schreiben" #: ../src/gnu.c:100 ../src/tar.c:401 msgid "Could not get current directory: %s" msgstr "Konnte aktuelles Verzeichnis nicht ermitteln: %s" #: ../src/buffer.c:468 msgid "Cannot read from compression program" msgstr "Kann nicht vom Komprimierprogramm lesen" #: ../src/tar.c:1614 msgid "You may not specify more than one of the r, c, t, x, or d options" msgstr "Sie können nicht mehr als eine der Option `r', `c', `t', `x' oder `d' angeben" #: ../src/list.c:132 msgid "Skipping to next file header" msgstr "Springe zum Kopfteil für die nächste Datei" #: ../src/buffer.c:1371 msgid "\007Prepare volume #%d for %s and hit return: " msgstr "\007Legen Sie Band #%d für %s ein und drücken Sie `Return':" #: ../src/list.c:207 msgid "Only wrote %ld of %ld bytes to file %s" msgstr "Habe nur %ld von %ld Bytes in Datei %s geschrieben" #: ../src/buffer.c:1110 msgid "Only read %d bytes from archive %s" msgstr "Habe nur %d Bytes von Archiv %s gelesen" #: ../src/tar.c:347 ../src/tar.c:389 msgid "Missing file name after -C" msgstr "Dateiname nach `-C' fehlt" #: ../src/extract.c:503 ../src/extract.c:663 ../src/extract.c:874 msgid "Cannot change mode of file %s to %lo" msgstr "Kann Rechte für Datei %s nicht auf %lo setzen" #: ../src/gnu.c:235 ../src/gnu.c:360 ../src/update.c:123 msgid "Cannot stat %s" msgstr "`stat' auf %s fehlgeschlagen" #: ../src/buffer.c:259 msgid "(child) Pipe to stdout" msgstr "(Kind) `Pipe' zu Standard Ausgabe" #: ../src/buffer.c:1042 msgid "%s is the wrong size (%ld != %ld + %ld)" msgstr "%s hat die falsche Größe (%ld != %ld + %ld)" #: ../src/buffer.c:1401 msgid "No new volume; exiting.\n" msgstr "Kein neuer Band; halte an.\n" #: ../src/create.c:751 msgid "%s is the archive; not dumped" msgstr "%s ist ein Archiv; nicht gesichert" #: ../src/buffer.c:575 msgid "Cannot verify stdin/stdout archive" msgstr "Kann Archive auf Standard Ein-/Ausgabe nicht verifizieren" #: ../src/create.c:795 msgid "Removing leading / from absolute links" msgstr "Entferne führende `/'von absoluten Links" #: ../src/gnu.c:633 msgid "Error while deleting %s" msgstr "Fehler beim Löschen von %s" #: ../src/diffarch.c:116 msgid "Unknown file type '%c' for %s, diffed as normal file" msgstr "Unbekannter Dateityp '%c' für %s, Differenz wie für eine normale Datei" #: ../src/list.c:721 msgid "--Volume Header--\n" msgstr "--Band Kopfteil--\n" #: ../src/create.c:1280 ../src/gnu.c:323 msgid "Cannot open directory %s" msgstr "Kann Verzeichnis %s nicht öffnen" #: ../src/extract.c:408 ../src/extract.c:797 ../src/extract.c:807 msgid "Could not write to file %s" msgstr "Konnte nicht in Datei %s schreiben" #: ../src/diffarch.c:348 msgid "%s: No longer a directory\n" msgstr "%s: Ist kein Verzeichnis mehr\n" #: ../src/list.c:536 ../src/list.c:756 msgid "rec %10ld: " msgstr "Eint %10ld: " #: ../src/buffer.c:642 msgid "Archive not labelled to match %s" msgstr "Archiv nicht ausgezeichnet um zu %s zu passen" #: ../src/buffer.c:286 msgid "Archive to stdin" msgstr "Archiv von Standard Eingabe" #: ../src/rmt.c:251 ../src/rmt.c:251 msgid "Premature end of file" msgstr "Vorzeitiges Ende der Datei" #: ../src/diffarch.c:142 ../src/diffarch.c:370 msgid "%s: Not a regular file\n" msgstr "%s: Keine reguläre Datei\n" #: ../src/list.c:196 msgid "EOF in archive file" msgstr "Dateiende in der Archiv Datei" #: ../src/diffarch.c:60 msgid "%s: %s differs\n" msgstr "%s: %s ist unterschiedlich\n" #: ../src/tar.c:546 ../src/tar.c:563 msgid "%s: Not found in archive" msgstr "%s: Nicht im Archiv gefunden" #: ../src/rmt.c:134 ../src/rmt.c:134 msgid "Cannot allocate buffer space" msgstr "Kann keinen Speicher für Puffer belegen" #: ../src/diffarch.c:390 ../src/tar.c:150 ../src/update.c:176 msgid "Cannot open file %s" msgstr "Kann Datei %s nicht öffnen" #: ../src/buffer.c:321 msgid "((child)) Pipe to stdin" msgstr "((Kind)) `Pipe' zu Standard Eingabe" #: ../src/diffarch.c:152 msgid "Uid" msgstr "`Uid'" #: ../src/tar.c:1609 msgid "You must specify one of the r, c, t, x, or d options" msgstr "Sie müssen eine der Optionen `r', `c', `t', `x' oder `d' angeben" #: ../src/diffarch.c:154 msgid "Gid" msgstr "`Gid'" #: ../src/mangle.c:65 msgid "Unexpected EOF in mangled names" msgstr "Unerwartetes Dateiende in zerstückelten Namen" #: ../src/tar.c:963 msgid "Usage: %s [OPTION]... [FILE]...\n" msgstr "Aufruf: %s [OPTION]... [DATEI]...\n" #: ../src/buffer.c:547 msgid "Could not allocate memory for blocking factor %d" msgstr "Konnte keinen Speicher für Blockungsfaktor %d belegen" #: ../src/tar.c:94 msgid "Cannot read confirmation from user" msgstr "Kann keine Bestätigung vom Benutzer bekommen" #: ../src/diffarch.c:441 ../src/diffarch.c:623 ../src/diffarch.c:642 msgid "%s: Could only read %d of %ld bytes\n" msgstr "%s: Konnte nur %d von %ld Bytes lesen\n" #: ../src/list.c:82 msgid "Omitting %s" msgstr "Lasse %s aus" #: ../src/buffer.c:332 msgid "((child)) Pipe to stdout" msgstr "((Kind)) `Pipe' zu Standard Ausgabe" #: ../src/diffarch.c:228 msgid "%s: Not linked to %s\n" msgstr "%s: Nicht auf %s gelinkt\n" #: ../src/buffer.c:197 msgid "Cannot close descriptor %d" msgstr "Kann Deskriptor %d nicht schließen" #: ../src/diffarch.c:150 ../src/diffarch.c:354 msgid "Mode" msgstr "Modus" #: ../src/mangle.c:97 msgid "Renamed %s to %s" msgstr "Benenne %s in %s um" #: ../src/buffer.c:200 msgid "Cannot dup %s" msgstr "Kann `dup' nicht auf Datei %s anwenden" #: ../src/buffer.c:1137 ../src/buffer.c:1231 ../src/buffer.c:1344 msgid "WARNING: Cannot close %s (%d, %d)" msgstr "WARNUNG: Kann %s nicht schließen (%d, %d)" #: ../src/gnu.c:223 ../src/tar.c:283 ../src/tar.c:657 msgid "Cannot chdir to %s" msgstr "Kann nicht zu Verzeichnis %s wechseln" #: ../src/diffarch.c:245 msgid "%s: No such file or directory\n" msgstr "%s: Datei oder Verzeichnis nicht gefunden\n" #: ../src/buffer.c:418 msgid "Write to compression program short %d bytes" msgstr "Konnte letzte %d Bytes nicht zu Kompressionsprogramm ausgeben" #: ../src/gnu.c:95 ../src/tar.c:395 msgid "Could not get current directory" msgstr "Konnte aktuelles Verzeichnis nicht ermitteln" #: ../src/diffarch.c:205 ../src/diffarch.c:416 ../src/extract.c:449 msgid "Error while closing %s" msgstr "Fehler beim Schließen von %s" #: ../src/list.c:696 ../src/list.c:700 msgid " link to %s\n" msgstr " Link auf %s\n" #: ../src/buffer.c:1519 ../src/extract.c:370 ../src/extract.c:788 ../src/list.c:367 ../src/list.c:789 msgid "Unexpected EOF on archive file" msgstr "Unerwartetes Dateiende in Archiv Datei" #: ../src/buffer.c:356 msgid "[child] Pipe to stdin" msgstr "[Kind] `Pipe' auf Standard Eingabe" #: ../src/diffarch.c:222 ../src/diffarch.c:553 msgid "Cannot stat file %s" msgstr "`stat' auf Datei %s fehlgeschlagen" #: ../src/gnu.c:593 msgid "Cannot allocate %d bytes for restore" msgstr "Kann keine %d Bytes für Restaurierung belegen" #: ../src/buffer.c:297 msgid "Archive to stdout" msgstr "Archiv auf Standard Ausgabe" #: ../src/tar.c:993 msgid "\n\ Handling of file attributes:\n\ --atime-preserve don't change access times on dumped files\n\ -m, --modification-time don't extract file modified time\n\ --same-owner create extracted files with the same ownership \n\ -p, --same-permissions extract all protection information\n\ --preserve-permissions same as -p\n\ -s, --same-order sort names to extract to match archive\n\ --preserve-order same as -s\n\ --preserve same as both -p and -s\n" msgstr "\n\ Behandlung von Dateiattributen:\n\ --atime-preserve ändere Zugriffszeit von gesicherten Dateien nicht\n\ -m, --modification-time Änderungszeit beim Herausholen nicht setzen\n\ --same-owner erhalte Besitzrechte beim Herausholen\n\ -p, --same-permissions setze alle Zugriffsrechte beim Herausholen\n\ --preserve-permissions das gleiche wie `-s'\n\ -s, --same-order sortiere Namen beim Herausholen wie im Archiv\n\ --preserve-order das gleiche wie `-s'\n\ --preserve das gleiche wie `-p'und `-s'\n" #: ../src/extract.c:320 msgid "Could not create file %s" msgstr "Konnte Datei %s nicht anlegen" #: ../src/buffer.c:560 msgid "Cannot update or verify compressed archives" msgstr "Kann komprimierte Archive nicht aktualisieren oder verifizieren" #: ../src/buffer.c:867 msgid "Only wrote %u of %u bytes to %s" msgstr "Habe nur %u von %u Bytes in %s geschrieben" #: ../src/buffer.c:1026 msgid "WARNING: No volume header" msgstr "WARNUNG: Band hat keinen Kopfteil " #: ../src/tar.c:145 msgid "Too many args with -T option" msgstr "Zuviele Argumente bei `-T' Option" #: ../src/list.c:578 msgid "Visible longname error" msgstr "Fehler bei langem Namen festgestellt" #: ../src/create.c:222 ../src/extract.c:169 msgid "Removing leading / from absolute path names in the archive" msgstr "Entferne führende `/'von absoluten Links im Archiv" #: ../src/tar.c:1438 msgid "Obsolete option name replaced by --absolute-names" msgstr "Obsoleter Optionsname ist ersetzt durch --absolte-names" #: ../src/update.c:109 msgid "File %s\n" msgstr "Datei %s\n" #: ../src/update.c:197 msgid "Read error at byte %ld reading %d bytes in file %s" msgstr "Lesefehler bei Byte %ld beim Lesen von %d bytes in Datei %s" #: ../src/update.c:202 msgid "%s: File shrunk by %d bytes, (yark!)" msgstr "%s: Datei ist um %d Bytes geschrumpft, (uurg!)" #: ../src/update.c:289 msgid "Junk files\n" msgstr "Überflüssige Dateien" #: ../src/update.c:325 msgid "file %s\n" msgstr "Datei %s\n" #: ../src/update.c:331 msgid "Skip %ld\n" msgstr "Überspringe %ld\n" #: ../src/update.c:348 msgid "Out of first loop\n" msgstr "Aus der ersten Schleife heraus\n" #: ../src/update.c:372 msgid "Saved %d recs, need %d more\n" msgstr "Habe %s Einträge gesichert, muß noch weitere %d\n" #: ../src/update.c:394 msgid "New block\n" msgstr "Neuer Block\n" #: ../src/update.c:401 msgid "Header type %d\n" msgstr "Typ %d des Kopfes\n" #: ../src/update.c:422 msgid "Deleting non-header from archive" msgstr "Lösche nicht-Kopfteil aus dem Archiv" #: ../src/update.c:431 msgid "File %s " msgstr "Datei %s" #: ../src/update.c:437 msgid "Flush it\n" msgstr "Gebe alles aus\n" #: ../src/update.c:444 msgid "Flushing %d recs from %s\n" msgstr "Gebe %d Einträge von %s aus\n" #: ../src/update.c:451 msgid "Block: %d <= %d " msgstr "Block: %d <= %d " #: ../src/update.c:458 msgid "Block %d left\n" msgstr "%d Blöcke übrig" #: ../src/update.c:464 msgid "Final %d\n" msgstr "Letzte %d\n" #: ../src/update.c:488 msgid "Need %d kept_in %d keep %d\n" msgstr "Brauche %d habe behalten %d sollte behalten %d\n" #: ../src/update.c:500 msgid "Flush...\n" msgstr "Gebe alles aus...\n" #: ../src/update.c:514 msgid "Copying %d\n" msgstr "Kopiere %d\n" #: ../src/update.c:526 msgid "Now new %d need %d keep %d keep_in %d rec %d/%d\n" msgstr "jetzt neu %d brauche %d will behalten %d behalte %s Einträge %d/%d\n" #: ../src/update.c:552 msgid "Write block\n" msgstr "Schreibe Block\n" #: ../src/update.c:623 msgid "Fore to %x\n" msgstr "Vorwärts zu %x\n" #: ../src/update.c:627 msgid "Could not re-position archive file" msgstr "Konnte Dateizeiger für Archiv Datei nicht bewegen" tar-1.11.8/po/fr.po 644 625 1 66104 5753567376 7040 # msgid " (core dumped)" msgstr " (mémoire vidée)" # msgid " link to %s\n" msgstr " lien vers %s\n" # msgid " unknown file type `%c'\n" msgstr " type de fichier inconnu «%c»\n" # msgid "%c: Argument missing" msgstr "%c: Argument manquant" # msgid "%d at %d\n" msgstr "%d à %d\n" # msgid "%s is not continued on this volume" msgstr "%s ne se poursuit pas sur ce volume" # msgid "%s is the archive; not dumped" msgstr "%s est l'archive; ne sera pas sauvegardé" # msgid "%s is the wrong size (%ld != %ld + %ld)" msgstr "%s n'a pas la bonne dimension (%ld != %ld + %ld)" # msgid "%s: %s differs\n" msgstr "%s: %s diffère\n" # msgid "%s: %s: Cannot link to %s, copying instead\n" msgstr "%s: %s: Incapable d'établir un lien vers %s, alors copier\n" # msgid "%s: Could only read %d of %ld bytes\n" msgstr "%s: N'a pu lire que %d octets sur %ld\n" # msgid "%s: Data differs\n" msgstr "%s: Les données diffèrent\n" # msgid "%s: Deleting %s\n" msgstr "%s: Elimination de %s\n" # msgid "%s: Device numbers changed\n" msgstr "%s: Les chiffres d'appareil ont changé\n" # msgid "%s: Does not exist\n" msgstr "%s: N'existe pas\n" # msgid "%s: File shrunk by %d bytes, (yark!)" msgstr "%s: Le fichier a rétréci de %d octets, (horreur!)" # msgid "%s: Mode or device-type changed\n" msgstr "%s: Le mode ou le type d'appareil a changé\n" # msgid "%s: No longer a directory\n" msgstr "%s: N'est maintenant plus un répertoire\n" # msgid "%s: No such file or directory\n" msgstr "%s: Fichier ou répertoire inexistant\n" # msgid "%s: Not a regular file\n" msgstr "%s: Pas un fichier régulier\n" # msgid "%s: Not found in archive" msgstr "%s: Pas trouvé dans l'archive" # msgid "%s: Not linked to %s\n" msgstr "%s: Pas lié vers %s\n" # msgid "%s: On a different filesystem; not dumped" msgstr "%s: Sur un système de fichiers différent; ne sera pas sauvegardé" # msgid "%s: Symlink differs\n" msgstr "%s: Le lien symbolique diffère\n" # msgid "%s: Unknown file type; file ignored" msgstr "%s: Type de fichier inconnu; fichier ignoré" # msgid "%s: is unchanged; not dumped" msgstr "%s: n'est pas modifié; ne sera pas sauvegardé" # msgid "((child)) Pipe to stdin" msgstr "((fils)) «pipe» vers stdin" # msgid "((child)) Pipe to stdout" msgstr "((fils)) «pipe» vers stdout" # msgid "(child) Pipe to stdin" msgstr "(fils) «pipe» vers stdin" # msgid "(child) Pipe to stdout" msgstr "(fils) «pipe» vers stdout" # msgid "--Continued at byte %ld--\n" msgstr "--Poursuivi à l'octet %ld--\n" # msgid "--Mangled file names--\n" msgstr "--Noms de fichier chiffrés--\n" # msgid "--Volume Header--\n" msgstr "--En-tête de volume--\n" # msgid "Added write and execute permission to directory %s" msgstr "Les permissions d'écrire et d'exécuter ont été ajoutées au répertoire %s" # msgid "Amount actually written is (I hope) %d.\n" msgstr "La quantité vraiment écrite est %d (j'espère!).\n" # msgid "Archive %s EOF not on block boundary" msgstr "La fin-de-fichier de l'archive %s n'est pas à une frontière de bloc" # msgid "Archive not labelled to match %s" msgstr "L'archive n'est pas étiquetée et n'apparie pas %s" # msgid "Archive to stdin" msgstr "L'archive sur stdin" # msgid "Archive to stdout" msgstr "L'archive sur stdout" # msgid "At beginning of tape, quitting now" msgstr "Au début du ruban, terminaison immédiate" # msgid "Bad regular expression: %s" msgstr "Mauvais expression régulière: %s" # msgid "Block %d left\n" msgstr "Le bloc %d est laissé\n" # msgid "Block: %d <= %d " msgstr "Bloc: %d <= %d " # msgid "Blocksize = %d records" msgstr "Grandeur de bloc = %d enregistrements" # msgid "Cannot add file %s" msgstr "Incapable d'ajouter le fichier %s" # msgid "Cannot allocate %d bytes for restore" msgstr "Incapable d'allouer %d octets pour la remise en place" # msgid "Cannot allocate buffer space" msgstr "Incapable d'allouer l'espace tampon" # msgid "Cannot change directory to %d" msgstr "Incapable de changer le répertoire pour %d" # msgid "Cannot change mode of file %s to %lo" msgstr "Incapable de changer le mode du fichier %s pour %lo" # msgid "Cannot change owner of %s to uid %d gid %d" msgstr "Incapable de changer le propriétaire de %s pour «uid» %d «gid» %d" # msgid "Cannot change to directory %d" msgstr "Incapable de changer le répertoire pour %d (FIXME)" # msgid "Cannot change to directory %s" msgstr "Incapable de changer le répertoire pour %s" # msgid "Cannot chdir to %s" msgstr "Incapable de changer le répertoire pour %s" # msgid "Cannot chown file %s to uid %d gid %d" msgstr "Incapable de changer le propriétaire de %s pour «uid» %d «gid» %d" # msgid "Cannot close a file #%d" msgstr "Incapable de fermer le fichier au manchon %d" # msgid "Cannot close descriptor %d" msgstr "Incapable de fermer le fichier au manchon %d" # msgid "Cannot dup %s" msgstr "Incapable de reproduire %s avec «dup»" # msgid "Cannot exec %s" msgstr "Incapable d'exécuter %s" # msgid "Cannot exec a shell %s" msgstr "Incapable d'exécuter un «shell» %s" # msgid "Cannot execute remote shell" msgstr "Incapable d'exécuter un «shell» éloigné" # msgid "Cannot fork" msgstr "Incapable d'effectuer «fork»" # msgid "Cannot fork!" msgstr "Incapable d'effectuer «fork»!" # msgid "Cannot keep old files on this system" msgstr "Incapable de conserver les vieux fichiers sur ce système" # msgid "Cannot open %s" msgstr "Incapable d'ouvrir %s" # msgid "Cannot open a pipe" msgstr "Incapable d'ouvrir un «pipe»" # msgid "Cannot open archive %s" msgstr "Incapable d'ouvrir l'archive %s" # msgid "Cannot open directory %s" msgstr "Incapable d'ouvrir le répertoire %s" # msgid "Cannot open file %s" msgstr "Incapable d'ouvrir le fichier %s" # msgid "Cannot read %s" msgstr "Incapable de lire %s" # msgid "Cannot read confirmation from user" msgstr "Incapable d'obtenir une confirmation par l'usager" # msgid "Cannot read from compression program" msgstr "Incapable de lire du programme de compression" # msgid "Cannot read link %s" msgstr "Incapable de lire le lien %s" # msgid "Cannot remove %s" msgstr "Incapable d'enlever %s" # msgid "Cannot rename %s to %s" msgstr "Incapable de renommer %s en %s" # msgid "Cannot seek to %ld in file %s" msgstr "Incapable de repositionner (à %ld) le fichier %s" # msgid "Cannot stat %s" msgstr "Incapable d'exécuter «stat» pour %s" # msgid "Cannot stat file %s" msgstr "Incapable d'exécuter «stat» pour le fichier %s" # msgid "Cannot symlink %s to %s" msgstr "Incapable d'établir un lien symbolique de %s à %s" # msgid "Cannot update or verify compressed archives" msgstr "Incapable d'ajuster ou de vérifier une archive comprimée" # msgid "Cannot use compressed or remote archives" msgstr "Incapable de traiter des archives comprimées ou éloignées" # msgid "Cannot use multi-volume compressed archives" msgstr "Incapable de traiter des archives comprimées multi-volumes" # msgid "Cannot verify multi-volume archives" msgstr "Incapable de vérifier des archives multi-volumes" # msgid "Cannot verify stdin/stdout archive" msgstr "Incapable de vérifier des archives stdin ou stdout" # msgid "Cannot write to %s" msgstr "Incapable d'écrire sur %s" # msgid "Child cannot fork" msgstr "Le fils ne peut exécuter «fork»" # msgid "Child died with signal %d%s" msgstr "Le fils est mort avec un «signal» %d%s" # msgid "Child returned status %d" msgstr "Le fils a retourné un constat %d" # msgid "Copying %d\n" msgstr "Copie de %d\n (FIXME)" # msgid "Could not allocate memory for blocking factor %d" msgstr "N'a pas pu allouer la mémoire pour un facteur de blocage %d" # msgid "Could not allocate memory for diff buffer of %d bytes" msgstr "N'a pas pu allouer la mémoire pour un tampon comparant de %d octets" # msgid "Could not change access and modification times of %s" msgstr "N'a pas pu modifier les temps d'accès ou de modification pour %s" # msgid "Could not create directory %s" msgstr "N'a pas pu créer le répertoire %s" # msgid "Could not create file %s" msgstr "N'a pas pu créer le fichier %s" # msgid "Could not create symlink to %s" msgstr "N'a pas pu créer un lien symbolique vers %s" # msgid "Could not get current directory" msgstr "N'a pas pu découvrir le répertoire courant" # msgid "Could not get current directory: %s" msgstr "N'a pas pu découvrir le répertoire courant: %s" # msgid "Could not link %s to %s" msgstr "N'a pas pu établir un lien de %s à %s" # msgid "Could not make %s" msgstr "N'a pas pu fabriquer %s" # msgid "Could not re-position archive file" msgstr "N'a pas pu repositionner l'archive" # msgid "Could not rewind archive file for verify" msgstr "N'a pas pu rembobiner l'archive pour vérification" # msgid "Could not write to file %s" msgstr "N'a pas pu écrire sur le fichier %s" # msgid "Could only write %d of %d bytes to file %s" msgstr "N'a pu qu'écrire %d octets sur %d, pour le fichier %s" # msgid "Creating directory:" msgstr "Création de répertoire:" # msgid "Deleting non-header from archive" msgstr "Élimination d'une chose autre qu'un en-tête de l'archive" # msgid "Directory %s has been renamed" msgstr "Le répertoire %s a été renommé" # msgid "Directory %s is new" msgstr "Le répertoire %s est nouveau" # msgid "EOF in archive file" msgstr "Fin-de-fichier dans l'archive" # msgid "EOF? What does that mean?" msgstr "Fin-de-fichier! Qu'est-ce que ça signifie?" # msgid "Error while closing %s" msgstr "Erreur pendant la fermeture de %s" # msgid "Error while deleting %s" msgstr "Erreur durant l'élimination de %s" # msgid "File %s " msgstr "Fichier %s" # msgid "File %s shrunk by %d bytes, padding with zeros" msgstr "Le fichier %s a rétréci de %d octets, remplissage avec des zéros" # msgid "File %s\n" msgstr "Fichier %s\n" # msgid "File name %s%s too long" msgstr "Nom de fichier %s%s trop long" # msgid "Final %d\n" msgstr "Final %d\n" # msgid "Flush it\n" msgstr "Vidangez-le\n" # msgid "Flush...\n" msgstr "Vidange...\n" # msgid "Flushing %d recs from %s\n" msgstr "Vidange de %d enregistrements partant de %s\n" # msgid "Fore to %x\n" msgstr "«Fore to» %x\n" # msgid "Garbage command" msgstr "Commande non-reconnue" # msgid "Gid" msgstr "«Gid»" # msgid "Header type %d\n" msgstr "Type d'en-tête %d\n" # msgid "Hmm, this doesn't look like a tar archive" msgstr "Hum! Ça ne ressemble pas à une archive «tar»" # msgid "Invalid date format `%s'" msgstr "Format de date invalide «%s»" # msgid "Invalid value for blocksize" msgstr "Valeur invalide de grandeur de bloc" # msgid "Junk files\n" msgstr "Fichiers bidons\n" # msgid "Missing file name after -C" msgstr "Nom de fichier manquant après «-C»" # msgid "Missing filename after -C" msgstr "Nom de fichier manquant après «-C»" # msgid "Mod time" msgstr "Temps de modification" # msgid "Mode" msgstr "Mode" # msgid "Multiple archive files requires --multi-volume" msgstr "Des fichiers d'archive multiples exigent «--multi-volume»" # msgid "Need %d kept_in %d keep %d\n" msgstr "Besoin de %d, «kept_in» %d, «keep» %d\n" # msgid "New block\n" msgstr "Nouveau bloc\n" # msgid "No archive name given, what should I do?" msgstr "Aucun nom d'archive donné, que dois-je faire?" # msgid "No new volume; exiting.\n" msgstr "Pas de nouveau volume; terminaison.\n" # msgid "Now new %d need %d keep %d keep_in %d rec %d/%d\n" msgstr "Maintenant: «new» %d, «need» %d, «keep» %d, «keep_in» %d, «rec» %d/%d\n" # msgid "Omitting %s" msgstr "Omission de %s" # msgid "Only one compression option permitted" msgstr "Une seule option de compression permise" # msgid "Only read %d bytes from archive %s" msgstr "Lu seulement %d octets de l'archive %s" # msgid "Only wrote %ld of %ld bytes to file %s" msgstr "Écrit seulement %ld/%ld octets au fichier %s" # msgid "Only wrote %u of %u bytes to %s" msgstr "Écrit seulement %u/%u octets à %s" # msgid "Options [0-7][lmh] not supported by *this* tar" msgstr "Les options [0-7][lmh] ne sont pas installées pour ce «tar»-ci" # msgid "Out of first loop\n" msgstr "Hors de la première boucle\n" # msgid "Premature end of file" msgstr "Fin de fichier prématurée" # msgid "Read checkpoint %d" msgstr "Point de reprise %d en lecture" # msgid "Read error at byte %ld reading %d bytes in file %s" msgstr "Erreur de lecture à l'octet %ld, pendant la lecture de %d octets du fichier %s" # msgid "Read error at byte %ld, reading %d bytes, in file %s" msgstr "Erreur de lecture à l'octet %ld, pendant la lecture de %d octets du fichier %s" # msgid "Read error on %s" msgstr "Erreur de lecture sur %s" # msgid "Reading %s\n" msgstr "Lecture de %s\n" # msgid "Removing drive spec from names in the archive" msgstr "Les noms de l'archive sont épurés de la spécification du lecteur" # msgid "Removing leading / from absolute links" msgstr "Les liens absolus sont épurés d'un «/» préfixe" # msgid "Renamed %s to %s" msgstr "%s renommé à %s" # msgid "Saved %d recs, need %d more\n" msgstr "%d enregistrements sauvés, %d encore requis" # msgid "Size" msgstr "Grandeur" # msgid "Skip %ld\n" msgstr "Saute %ld\n" # msgid "Skipping to next file header" msgstr "Saut au prochain en-tête de fichier" # msgid "Skipping to next header" msgstr "Saut au prochain en-tête" # msgid "Symlinked %s to %s" msgstr "%s relié symboliquement à %s" # msgid "This does not look like a tar archive" msgstr "Ça ne ressemble pas à un archive «tar»" # msgid "This volume is out of sequence" msgstr "Ce volume est hors séquence" # msgid "Too many args with -T option" msgstr "Trop d'arguments pour l'option «-T»" # msgid "Too many errors, quitting" msgstr "Trop d'erreurs: terminaison" # msgid "Total bytes written: %d\n" msgstr "Nombre total d'octets écrits: %d\n" # msgid "Try `%s --help' for more information.\n" msgstr "Pour plus d'information, essayez «%s --help».\n" # msgid "Uid" msgstr "«Uid»" # msgid "Unexpected EOF in archive" msgstr "Fin de fichier intempestive dans l'archive" # msgid "Unexpected EOF in mangled names" msgstr "Fin de fichier intempestive dans les noms chiffrés" # msgid "Unexpected EOF on archive file" msgstr "Fin de fichier intempestive dans le fichier d'archive" # msgid "Unknown demangling command %s" msgstr "Commande inconnue «%s» pour déchiffrer les noms" # msgid "Unknown file type '%c' for %s, diffed as normal file" msgstr "Type de fichier «%c» inconnu, comparé comme un fichier régulier" # msgid "Unknown file type '%c' for %s, extracted as normal file" msgstr "Type de fichier «%c» inconnu, extrait comme un fichier régulier" # msgid "Unknown option %c" msgstr "Option «%c» inconnue" # msgid "Usage: %s [OPTION]... [FILE]...\n" msgstr "Usage: %s [OPTION]... [FICHIER]...\n" # msgid "VERIFY FAILURE: %d invalid header(s) detected" msgstr "ERREUR DE VÉRIFICATION: Détection de %d en-têtes invalides" # msgid "Verify " msgstr "Vérification" # msgid "Visible long name error" msgstr "Erreur manifeste dans un nom long" # msgid "Visible longname error" msgstr "Erreur manifeste dans un nom long" # msgid "Volume mismatch! %s!=%s" msgstr "Le volume ne correspond pas! %s!=%s" # msgid "WARNING: Archive is incomplete" msgstr "ATTENTION: L'archive est incomplète" # msgid "WARNING: Cannot close %s (%d, %d)" msgstr "ATTENTION: Incapable de fermer %s (%d, %d)" # msgid "WARNING: No volume header" msgstr "ATTENTION: Pas d'en-tête de volume" # msgid "Write block\n" msgstr "Écriture du bloc\n" # msgid "Write checkpoint %d" msgstr "Écriture du point de reprise %d" # msgid "Wrote %ld of %ld bytes to file %s" msgstr "%ld/%ld octets ont été écrits au fichier %s" # msgid "[child] Pipe to stdin" msgstr "[fils] «Pipe» sur stdin" # msgid "[child] Pipe to stdout" msgstr "[fils] «Pipe» sur stdout" # msgid "\ n [name] Give a new filename for the next (and subsequent) volume(s)\n\ q Abort tar\n\ ! Spawn a subshell\n\ ? Print this list\n" msgstr "\ n [NOM] Choisir un nouveau nom pour les volumes qui suivront\n\ q Interrompre l'exécution de «tar»\n\ ! Enfanter un sous-«shell»\n\ ? Imprimer cette liste\n" # msgid "\ Cannot extract `%s' -- file is continued from another volume" msgstr "\ Incapable d'extraire «%s» -- le fichier débute dans un autre volume" # msgid "\ Cannot write to compression program" msgstr "\ Incapable d'écrire au programme de compression" # msgid "\ Could not backspace archive file; it may be unreadable without -i" msgstr "\ Incapable de reculer le fichier d'archive; il pourrait exiger «-i» pour être lu" # msgid "\ Fully delay modern options after all old style options" msgstr "\ Ne donner les options modernes qu'une fois complétées les options vieux style" # msgid "\ Mandatory or optional arguments to long options are mandatory or optional\n\ for short options too.\n" msgstr "\ Les arguments obligatoires ou optionnels pour la forme longue des\n\ options sont aussi obligatoires ou optionnels pour les formes courtes\n\ qui leur correspondent.\n" # msgid "\ Read error at byte %ld, reading %d bytes, in file %s" msgstr "\ Erreur de lecture à l'octet %ld, pendant la lecture de %d octets du fichier %s" # msgid "\ Removing leading / from absolute path names in the archive" msgstr "\ Les noms de fichier absolus dans l'archive sont épurés d'un «/» préfixe" # msgid "\ Write to compression program short %d bytes" msgstr "\ Durant l'envoi à la compression, %d octets n'ont pas été acceptés" # msgid "\ You may not specify more than one of the r, c, t, x, or d options" msgstr "\ Ne pas pas choisir plus d'une option «r», «c», «t», «x» ou «d»" # msgid "\ You must specify one of the r, c, t, x, or d options" msgstr "\ Choisir au moins l'une des options «r», «c», «t», «x» ou «d»" # msgid "\ You must use a compression option (--gzip, --compress\n\ or --use-compress-program) with --block-compress" msgstr "\ Utiliser l'une des options de compression «--gzip», «--compress»\n\ ou «--use-compress-program», avec l'option «--block-compress»" # msgid "\ \n\ Archive format selection:\n\ -V, --label=NAME create archive with volume name NAME\n\ -o, --old-archive, --portability write a V7 format archive (not ANSI)\n\ -z, --gzip, --ungzip filter the archive through gzip\n\ -Z, --compress, --uncompress filter the archive through compress\n\ --use-compress-program=PROG filter through PROG (must accept -d)\n" msgstr "\ \n\ Sélection du format d'archive:\n\ -V, --label=NOM créer l'archive avec un NOM de volume\n\ -o, --old-archive, --portability produire une archive V7 (non-ANSI)\n\ -z, --gzip, --ungzip filtrer l'archive via «gzip»\n\ -Z, --compress, --uncompress filtrer l'archive via «compress»\n\ --use-compress-program=PROG filtrer l'archive via PROG (traitant -d)\n" # msgid "\ \n\ Device blocking:\n\ -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes\n\ --block-compress block the output of compression for tapes\n\ -i, --ignore-zeros ignore blocks of zeros in archive (means EOF)\n\ -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes)\n" msgstr "\ \n\ Blocage sur le lecteur:\n\ -b, --block-size=BLOCS utiliser des blocs de BLOCS x 512 octets\n\ --block-compress rebloquer la sortie de la compression sur ruban\n\ -i, --ignore-zeros ignorer les blocs nuls (comme fin-de-fichier)\n\ -B, --read-full-blocks rebloquer en lecture (pour les «pipes» 4.2BSD)\n" # msgid "\ \n\ Device selection and switching:\n\ -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME\n\ --force-local archive file is local even if has a colon\n\ --rsh-command=COMMAND use remote COMMAND instead of rsh\n\ -[0-7][lmh] specify drive and density\n\ -M, --multi-volume create/list/extract multi-volume archive\n\ -L, --tape-length=NUM change tape after writing NUM x 1024 bytes\n\ -F, --info-script=FILE run script at end of each tape (implies -M)\n\ --new-volume-script=FILE same as -F FILE\n" msgstr "\ \n\ Choix du lecteur et changements de ruban:\n\ -f, --file=[MACHINE:]FICHIER traiter l'archive FICHIER, sur MACHINE\n\ --force-local traiter une archive locale, même si «:»\n\ --rsh-command=COMMANDE remplacer «rsh» par COMMANDE\n\ -[0-7][lmh] choisir le lecteur et la densité\n\ -M, --multi-volume traiter des archives multi-volumes\n\ -L, --tape-length=NOMBRE traiter NOMBRE x 1024 octets par ruban\n\ -F, --info-script=FICHIER exécuter FICHIER au changement de ruban\n\ (force le choix de «-M»)\n\ --new-volume-script=FICHIER comme «-F FICHIER»\n" # msgid "\ \n\ Handling of file attributes:\n\ --atime-preserve don't change access times on dumped files\n\ -m, --modification-time don't extract file modified time\n\ --same-owner create extracted files with the same ownership \n\ -p, --same-permissions extract all protection information\n\ --preserve-permissions same as -p\n\ -s, --same-order sort names to extract to match archive\n\ --preserve-order same as -s\n\ --preserve same as both -p and -s\n" msgstr "\ \n\ Attributs des fichiers:\n\ --atime-preserve à la sauvegarde, préserver les dates d'accès\n\ -m, --modification-time à l'extraction, ignorer date de modification\n\ --same-owner à l'extraction, rétablir les propriétaires\n\ -p, --same-permissions à l'extration, rétablir les protections\n\ --preserve-permissions comme «-p»\n\ -s, --same-order trier les noms à extraire selon l'archive\n\ --preserve-order comme «-s»\n\ --preserve comme «-p» et «-s» à la fois\n" # msgid "\ \n\ Informative output:\n\ --help print this help, then exit\n\ --version print tar program version number, then exit\n\ -v, --verbose verbosely list files processed\n\ --checkpoint print directory names while reading the archive\n\ --totals print total bytes written while creating archive\n\ -R, --record-number show record number within archive with each message\n\ -w, --interactive ask for confirmation for every action\n\ --confirmation same as -w\n" msgstr "\ \n\ Sorties informatives:\n\ --help fournir ce message d'aide, puis terminer\n\ --version identifier le programme, puis terminer\n\ -v, --verbose étaler la liste des fichiers manipulés\n\ --checkpoint donner les noms de répertoires à la lecture\n\ --totals indiquer le nombre d'octets écrits à la création\n\ -R, --record-number afficher la position dans l'archive à chaque message\n\ -w, --interactive obtenir confirmation pour toute action\n\ --confirmation comme «-w»\n" # msgid "\ \n\ Local file selection:\n\ -C, --directory DIR change to directory DIR\n\ -T, --files-from=NAME get names to extract or create from file NAME\n\ --null -T reads null-terminated names, disable -C\n\ --exclude=FILE exclude file FILE\n\ -X, --exclude-from=FILE exclude files listed in FILE\n\ -P, --absolute-paths don't strip leading `/'s from file names\n\ -h, --dereference dump instead the files symlinks point to\n\ -l, --one-file-system stay in local file system when creating archive\n\ -K, --starting-file=NAME begin at file NAME in the archive\n\ -N, --newer=DATE only store files newer than DATE\n\ --after-date=DATE same as -N\n" msgstr "\ \n\ Choix des fichiers locaux:\n\ -C, --directory=REPERTOIRE passer au REPERTOIRE donné\n\ -T, --files-from=NOM obtenir la liste de fichiers du fichier NOM\n\ --null fait que «-T» lit des noms terminés par NUL,\n\ inhibe aussi «-C»\n\ --exclude=FICHIER exclure le FICHIER donné\n\ -X, --exclude-from=FICHIER exclure les fichiers fournis dans FICHIER\n\ -P, --absolute-paths garder les «/» préfixes aux noms de fichier\n\ -h, --dereference sauvegarder le résultat des liens symboliques\n\ -l, --one-file-system créer uniquement du système de fichiers local\n\ -K, --starting-file=NOM débuter au fichier NOM dans l'archive\n\ -N, --newer=DATE ne sauvegarder que ce qui est plus récent que DATE\n\ --after-date=DATE comme «-N»\n" # msgid "\ \n\ Main operation mode:\n\ -t, --list list the contents of an archive\n\ -x, --extract, --get extract files from an archive\n\ -c, --create create a new archive\n\ -d, --diff, --compare find differences between archive and file system\n\ -r, --append append files to the end of an archive\n\ -u, --update only append files newer than copy in archive\n\ -A, --catenate append tar files to an archive\n\ --concatenate same as -A\n\ --delete delete from the archive (not on mag tapes!)\n" msgstr "\ \n\ Mode d'opération principal:\n\ -t, --list inventorier l'archive\n\ -x, --extract, --get extraire des fichiers de l'archive\n\ -c, --create produire une nouvelle archive\n\ -d, --diff, --compare comparer l'archive et les fichiers courants\n\ -r, --append ajouter les fichiers à la fin de l'archive\n\ -u, --update n'ajouter que les fichiers rajeunissant l'archive\n\ -A, --catenate ajouter des archives «tar» à l'archive\n\ --concatenate comme «-A»\n\ --delete effacer de l'archive (pas pour des rubans!)\n" # msgid "\ \n\ On *this* particular tar, the defaults are -f %s and -b %d.\n" msgstr "\ \n\ Avec ce «tar»-ci, nous avons implicitement «-f %s» et «-b %d».\n" # msgid "\ \n\ Operation mode modificators:\n\ -W, --verify attempt to verify the archive after writing it\n\ --remove-files remove files after adding them to the archive\n\ -k, --keep-old-files don't overwrite existing files from archive\n\ -S, --sparse handle sparse files efficiently\n\ -O, --to-stdout extract files to standard output\n\ -G, --incremental handle old GNU-format incremental backup\n\ -g, --listed-incremental handle new GNU-format incremental backup\n\ --ignore-failed-read do not exit with non-zero on unreadable files\n" msgstr "\ \n\ Modificateurs de mode d'opération:\n\ -W, --verify tenter de vérifier l'archive après l'écriture\n\ --remove-files enlever les fichiers après leur sauvegarde\n\ -k, --keep-old-files à l'extraction, n'écraser aucun fichier\n\ -S, --sparse traiter les fichiers à trous adéquatement\n\ -O, --to-stdout extraire les fichiers sur la sortie standard\n\ -G, --incremental traiter une vieille archive incrémentale GNU\n\ -g, --listed-incremental traiter une nouvelle archive incrémentale GNU\n\ --ignore-failed-read ignorer les fichiers illisibles, poursuivre\n" # msgid "\007Prepare volume #%d for %s and hit return: " msgstr "\007Mettre le volume no. %d en place pour %s et appuyez sur «Return»: " # msgid "exec/tcp: Service not available" msgstr "exec/tcp: Service non disponible" # msgid "file %s\n" msgstr "fichier %s\n" # msgid "rec %10ld: " msgstr "enr %10ld: " # msgid "rmtd: Cannot allocate buffer space\n" msgstr "rmtd: Incapable d'obtenir l'espace pour les tampons\n" # msgid "rmtd: Garbage command %c\n" msgstr "rmtd: Commande «%c» sans signification\n" # msgid "rmtd: Premature eof\n" msgstr "rmtd: Fin de fichier prématurée\n" # msgid "tar (child)" msgstr "tar (fils)" tar-1.11.8/po/pt.po 644 625 1 67022 5753571575 7050 msgid " (core dumped)" msgstr " (imagem da memória despejada)" msgid " link to %s\n" msgstr " ligação para %s\n" msgid " unknown file type `%c'\n" msgstr " tipo de ficheiro desconhecido \"%c\"\n" msgid "%c: Argument missing" msgstr "%c: Falta argumento" msgid "%d at %d\n" msgstr "%d em %d\n" msgid "%s is not continued on this volume" msgstr "%s não tem continuidade neste volume" msgid "%s is the archive; not dumped" msgstr "%s é o arquivo; não será arquivado" msgid "%s is the wrong size (%ld != %ld + %ld)" msgstr "%s não é a dimensão correcta (%ld != %ld + %ld)" msgid "%s: %s differs\n" msgstr "%s: %s diferente\n" msgid "%s: %s: Cannot link to %s, copying instead\n" msgstr "%s: %s: Não é possível fazer ligação para %s, em vez disso, copia-se\n" msgid "%s: Could only read %d of %ld bytes\n" msgstr "%s: So se pôde ler %d de um total de %ld \"bytes\"\n" msgid "%s: Data differs\n" msgstr "%s: Os dados são diferentes\n" msgid "%s: Deleting %s\n" msgstr "%s: Apaga-se %s\n" msgid "%s: Device numbers changed\n" msgstr "%s: Os números do periférico mudaram\n" msgid "%s: Does not exist\n" msgstr "%s: Não existe\n" msgid "%s: File shrunk by %d bytes, (yark!)" msgstr "%s: O ficheiro diminui em %d bytes, (desgraça!)" msgid "%s: Mode or device-type changed\n" msgstr "%s: O modo ou o tipo de periférico mudou\n" msgid "%s: No longer a directory\n" msgstr "%s: Já não é um directório\n" msgid "%s: No such file or directory\n" msgstr "%s: Ficheiro, ou directório, não existe\n" msgid "%s: Not a regular file\n" msgstr "%s: Não é um ficheiro normal\n" msgid "%s: Not found in archive" msgstr "%s: Não foi encontrado no arquivo" msgid "%s: Not linked to %s\n" msgstr "%s: Não está ligado a %s\n" msgid "%s: On a different filesystem; not dumped" msgstr "%s: Está num outro sistema de ficheiros; não será arquivado" msgid "%s: Symlink differs\n" msgstr "%s: Ligação (\"link\") simbólica é diferente\n" msgid "%s: Unknown file type; file ignored" msgstr "%s: Tipo de ficheiro desconhecido; ficheiro ignorado" msgid "%s: is unchanged; not dumped" msgstr "%s: não foi modificado; não será arquivado" msgid "((child)) Pipe to stdin" msgstr "((filho)) \"pipe\" para \"stdin\"" msgid "((child)) Pipe to stdout" msgstr "((filho)) \"pipe\" para \"stdout\"" msgid "(child) Pipe to stdin" msgstr "(filho) \"pipe\" para \"stdin\"" msgid "(child) Pipe to stdout" msgstr "(filho) \"pipe\" para \"stdout\"" msgid "--Continued at byte %ld--\n" msgstr "--Continua no \"byte\" %ld--\n" msgid "--Mangled file names--\n" msgstr "--Nomes de ficheiros truncados--\n" msgid "--Volume Header--\n" msgstr "--Cabeçalho de volume--\n" msgid "Added write and execute permission to directory %s" msgstr "Acrescentaram-se permissões de escrita e de leitura ao directório %s" msgid "Amount actually written is (I hope) %d.\n" msgstr "A quantidade realmente escrita é %d (esperemos!).\n" msgid "Archive %s EOF not on block boundary" msgstr "O fim-de-ficheiro do arquivo %s não se encontra na fronteira de um bloco" msgid "Archive not labelled to match %s" msgstr "O arquivo não tem etiqueta e não condiz com %s" msgid "Archive to stdin" msgstr "Arquivo para stdin" msgid "Archive to stdout" msgstr "Arquivo para stdout" msgid "At beginning of tape, quitting now" msgstr "No princípio da fita, pára-se imediatamente" msgid "Bad regular expression: %s" msgstr "Expressão regular errada: %s" msgid "Block %d left\n" msgstr "Deixou-se o bloco %d \n" msgid "Block: %d <= %d " msgstr "Bloco: %d <= %d " msgid "Blocksize = %d records" msgstr "Tamanho do bloco = %d registos" msgid "Cannot add file %s" msgstr "Não é possível acrescentar o ficheiro %s" msgid "Cannot allocate %d bytes for restore" msgstr "Não se consegue reservar %d bytes para a recuperação" msgid "Cannot allocate buffer space" msgstr "Não se consegue reservar espaço temporário (\"buffer\")" msgid "Cannot change directory to %d" msgstr "Não se pode mudar directório para %d" msgid "Cannot change mode of file %s to %lo" msgstr "Não se pode mudar o modo do ficheiro %s para %lo" msgid "Cannot change owner of %s to uid %d gid %d" msgstr "Não se pode mudar o dono de %s para \"uid\" %d \"gid\" %d" msgid "Cannot change to directory %d" msgstr "Não se pode mudar para o directório %d" msgid "Cannot change to directory %s" msgstr "Não se pode mudar para o directório %s" msgid "Cannot chdir to %s" msgstr "Não se pode mudar para o directório %s" msgid "Cannot chown file %s to uid %d gid %d" msgstr "Não se pode mudar o dono de %s para \"uid\" %d \"gid\" %d" msgid "Cannot close a file #%d" msgstr "Não se consegue fechar o ficheiro de descritor %d" msgid "Cannot close descriptor %d" msgstr "Não se consegue fechar o ficheiro de descritor %d" msgid "Cannot dup %s" msgstr "Não se consegue duplicar %s com \"dup\"" msgid "Cannot exec %s" msgstr "Não se consegue executar %s" msgid "Cannot exec a shell %s" msgstr "Não se consegue executar uma \"shell\" %s" msgid "Cannot execute remote shell" msgstr "Não se consegue executar uma \"shell\" remota" msgid "Cannot fork" msgstr "Não se consegue criar processo ( \"fork\" )" msgid "Cannot fork!" msgstr "Não se consegue criar processo! ( \"fork\" )" msgid "Cannot keep old files on this system" msgstr "Não se consegue manter os ficheiros antigos neste sistema" msgid "Cannot open %s" msgstr "Não se consegue abrir %s" msgid "Cannot open a pipe" msgstr "Não se consegue abrir um \"pipe\"" msgid "Cannot open archive %s" msgstr "Não se consegue abrir o arquivo %s" msgid "Cannot open directory %s" msgstr "Não se consegue abrir o directório %s" msgid "Cannot open file %s" msgstr "Não se consegue abrir o ficheiro %s" msgid "Cannot read %s" msgstr "Não se consegue ler %s" msgid "Cannot read confirmation from user" msgstr "Não se consegue obter confirmação, do utilizador" msgid "Cannot read from compression program" msgstr "Não se consegue ler do programa de compressão" msgid "Cannot read link %s" msgstr "Não se consegue ler a ligação (\"link\") %s" msgid "Cannot remove %s" msgstr "Não se consegue apagar %s" msgid "Cannot rename %s to %s" msgstr "Não se consegue mudar o nome de %s para %s" msgid "Cannot seek to %ld in file %s" msgstr "Não se consegue mudar (\"seek\") para a posição %ld do ficheiro %s" msgid "Cannot stat %s" msgstr "Não se consegue executar \"stat\" para %s" msgid "Cannot stat file %s" msgstr "Não se consegue executar \"stat\" para o ficheiro %s" msgid "Cannot symlink %s to %s" msgstr "Não se pode criar uma ligação (\"link\") simbólica de %s para %s" msgid "Cannot update or verify compressed archives" msgstr "Não se pode actualizar o verificar um arquivo comprimido" msgid "Cannot use compressed or remote archives" msgstr "Não se pode usar arquivos comprimidos ou remotos" msgid "Cannot use multi-volume compressed archives" msgstr "Não se pode de usar arquivos multi-volume comprimidos" msgid "Cannot verify multi-volume archives" msgstr "Não se pode verificar arquivos multi-volume" msgid "Cannot verify stdin/stdout archive" msgstr "Não se pode de verificar arquivos stdin ou stdout" msgid "Cannot write to %s" msgstr "Não se consegue escrever em %s" msgid "Child cannot fork" msgstr "Processo filho não consegue executar \"fork\"" msgid "Child died with signal %d%s" msgstr "Processo filho morreu com o sinal %d%s" msgid "Child returned status %d" msgstr "Processo filho terminou com estado %d" msgid "Copying %d\n" msgstr "Copia de %d\n (FIXME)" msgid "Could not allocate memory for blocking factor %d" msgstr "Não se conseguiu reservar memória para um factor de bloco %d" msgid "Could not allocate memory for diff buffer of %d bytes" msgstr "Não se conseguiu reservar memória para um \"buffer\" de comparação, de %d \"bytes\"" msgid "Could not change access and modification times of %s" msgstr "Não se conseguiu modificar os tempos de acesso e modificação de %s" msgid "Could not create directory %s" msgstr "Não se conseguiu criar o directório %s" msgid "Could not create file %s" msgstr "Não se conseguiu criar o ficheiro %s" msgid "Could not create symlink to %s" msgstr "Não se conseguiu criar uma ligação (\"link\") simbólica para %s" msgid "Could not get current directory" msgstr "Não se conseguiu determinar o directório corrente" msgid "Could not get current directory: %s" msgstr "Não se conseguiu determinar o directório corrente: %s" msgid "Could not link %s to %s" msgstr "Não se conseguiu ligar %s a %s" msgid "Could not make %s" msgstr "Não se conseguiu fazer %s" msgid "Could not re-position archive file" msgstr "Não se conseguiu reposicionar o ficheiro arquivo" msgid "Could not rewind archive file for verify" msgstr "Não se conseguiu rebobinar o arquivo para verificação" msgid "Could not write to file %s" msgstr "Não se conseguiu escrever no ficheiro %s" msgid "Could only write %d of %d bytes to file %s" msgstr "Só se conseguiu escrever %d \"bytes\" de um total de %d, no ficheiro %s" msgid "Creating directory:" msgstr "Criação de directório::" msgid "Deleting non-header from archive" msgstr "Apaga-se do arquivo um não-cabeçalho" msgid "Directory %s has been renamed" msgstr "Mudou-se o nome do directório %s" msgid "Directory %s is new" msgstr "O directório %s é novo" msgid "EOF in archive file" msgstr "Fim-de-ficheiro no arquivo" msgid "EOF? What does that mean?" msgstr "Fim-de-ficheiro? Que significa isto?" msgid "Error while closing %s" msgstr "Erro durante o fecho de %s" msgid "Error while deleting %s" msgstr "Erro quando se apagava %s" msgid "File %s " msgstr "Ficheiro %s" msgid "File %s shrunk by %d bytes, padding with zeros" msgstr "O ficheiro %s diminuiu em %d \"bytes\", será completado com zeros" msgid "File %s\n" msgstr "Ficheiro %s\n" msgid "File name %s%s too long" msgstr "Nome de ficheiro %s%s longo demais" msgid "Final %d\n" msgstr "Final %d\n" msgid "Flush it\n" msgstr "Esvazia-lo\n" msgid "Flush...\n" msgstr "Esvaziamento...\n" msgid "Flushing %d recs from %s\n" msgstr "Estão-se a esvaziar %d registos de um total de %s\n" msgid "Fore to %x\n" msgstr "Fore to %x\n (FIXME)" msgid "Garbage command" msgstr "Comando desconhecido" msgid "Gid" msgstr "\"Gid\"" msgid "Header type %d\n" msgstr "Tipo de cabeçalho %d\n" msgid "Hmm, this doesn't look like a tar archive" msgstr "Pois é..., isto não parece ser um arquivo \"tar\"" msgid "Invalid date format `%s'" msgstr "Formato de data inválido \"%s\"" msgid "Invalid value for blocksize" msgstr "Valor inválido para o tamanho do bloco" msgid "Junk files\n" msgstr "Ficheiros de lixo\n" msgid "Missing file name after -C" msgstr "Falta um nome de ficheiro após \"-C\"" msgid "Missing filename after -C" msgstr "Falta um nome de ficheiro após \"-C\"" msgid "Mod time" msgstr "Tempo de modificação" msgid "Mode" msgstr "Modo" msgid "Multiple archive files requires --multi-volume" msgstr "Múltiplos ficheiros de arquivo exigem \"--multi-volume\"" msgid "Need %d kept_in %d keep %d\n" msgstr "Need %d kept_in %d keep %d\n (FIXME)" msgid "New block\n" msgstr "Novo bloco\n" msgid "No archive name given, what should I do?" msgstr "Não deram nome de arquivo, que fazer?" msgid "No new volume; exiting.\n" msgstr "Não há novo volume; termina-se. \n" msgid "Now new %d need %d keep %d keep_in %d rec %d/%d\n" msgstr "Now new %d need %d keep %d keep_in %d rec %d/%d\n (FIXME)" msgid "Omitting %s" msgstr "Omite-se %s" msgid "Only one compression option permitted" msgstr "Só se permite uma opção de compressão" msgid "Only read %d bytes from archive %s" msgstr "Só se leram %d \"bytes\" do arquivo %s" msgid "Only wrote %ld of %ld bytes to file %s" msgstr "Só se escreveram %ld \"bytes\" de um total de %ld no ficheiro %s" msgid "Only wrote %u of %u bytes to %s" msgstr "Só se escreveram %ld \"bytes\" de um total de %ld em %s" msgid "Options [0-7][lmh] not supported by *this* tar" msgstr "As opções [0-7][lmh] não funcionam neste \"tar\"" msgid "Out of first loop\n" msgstr "Fora do primeiro ciclo\n" msgid "Premature end of file" msgstr "Fim-de-ficheiro prematuro" msgid "Read checkpoint %d" msgstr "Leu-se o ponto de verificação %d" msgid "Read error at byte %ld reading %d bytes in file %s" msgstr "Erro de leitura no \"byte\" %ld, durante a leitura de %d \"bytes\" do ficheiro %s" msgid "Read error at byte %ld, reading %d bytes, in file %s" msgstr "Erro de leitura no \"byte\" %ld, durante a leitura de %d \"bytes\" do ficheiro %s" msgid "Read error on %s" msgstr "Erro de leitura sobre %s" msgid "Reading %s\n" msgstr "Leitura de %s" msgid "Removing drive spec from names in the archive" msgstr "Retira-se a especificação do \"drive\" aos nomes no arquivo" msgid "Removing leading / from absolute links" msgstr "Retira-se \"/\" das ligações (\"links\") absolutas " msgid "Renamed %s to %s" msgstr "Mudou-se o nome %s para %s" msgid "Saved %d recs, need %d more\n" msgstr "Guardaram-se %d registos, ainda são precisos %d\n" msgid "Size" msgstr "Tamanho" msgid "Skip %ld\n ##################" msgstr "Salta %ld\n" msgid "Skipping to next file header" msgstr "Salta para o próximo cabeçalho de ficheiro" msgid "Skipping to next header" msgstr "Salta para próximo cabeçalho" msgid "Symlinked %s to %s" msgstr "%s ligado simbolicamente a %s (\"link\")" msgid "This does not look like a tar archive" msgstr "Isto não se parece a um arquivo \"tar\"" msgid "This volume is out of sequence" msgstr "Este volume está fora da sequência" msgid "Too many args with -T option" msgstr "Argumentos demais para a opção \"-T\"" msgid "Too many errors, quitting" msgstr "Erros de mais: termina-se" msgid "Total bytes written: %d\n" msgstr "Número total de de \"bytes\" escritos: %d\n" msgid "Try `%s --help' for more information.\n" msgstr "Para mais informação, tente \"%s --help\".\n" msgid "Uid" msgstr "\"Uid\"" msgid "Unexpected EOF in archive" msgstr "Fim de ficheiro inesperado no arquivo" msgid "Unexpected EOF in mangled names" msgstr "Fim de ficheiro inesperado nos nomes truncados" msgid "Unexpected EOF on archive file" msgstr "Fim de ficheiro inesperado no ficheiro de arquivo" msgid "Unknown demangling command %s" msgstr "Comando desconhecido \"%s\" para decifrar os nomes truncados" msgid "Unknown file type '%c' for %s, diffed as normal file" msgstr "Tipo de ficheiro \"%c»\" desconhecido, comparado como um ficheiro normal" msgid "Unknown file type '%c' for %s, extracted as normal file" msgstr "Tipo de ficheiro \"%c\" desconhecido, extraído como um ficheiro normal" msgid "Unknown option %c" msgstr "Opção \"%c\" desconhecida" msgid "Usage: %s [OPTION]... [FILE]...\n" msgstr "Utilização: %s [OPÇÃO]... [FICHEIRO]...\n" msgid "VERIFY FAILURE: %d invalid header(s) detected" msgstr "ERRO DE VERIFICAÇÃO: Encontraram-se %d cabeçalhos inválidos" msgid "Verify " msgstr "Verificação" msgid "Visible long name error" msgstr "Erro evidente num nome longo" msgid "Visible longname error" msgstr "Erro evidente num nome longo" msgid "Volume mismatch! %s!=%s" msgstr "O volume não condiz! %s!=%s" msgid "WARNING: Archive is incomplete" msgstr "ATENÇÃO: O arquivo está incompleto" msgid "WARNING: Cannot close %s (%d, %d)" msgstr "ATENÇÃO: Não se consegue fechar %s (%d, %d)" msgid "WARNING: No volume header" msgstr "ATENÇÃO: Não há cabeçalho de volume" msgid "Write block\n" msgstr "Escreve-se o bloco\n" msgid "Write checkpoint %d" msgstr "Escreve-se o ponto de vericicação %d" msgid "Wrote %ld of %ld bytes to file %s" msgstr "Escreveram-se no ficheiro %ld \"bytes\" de um total de %ld" msgid "[child] Pipe to stdin" msgstr "[filho] \"Pipe»\" para o stdin" msgid "[child] Pipe to stdout" msgstr "[filho] \"Pipe\" para o stdout" msgid "\ n [name] Give a new filename for the next (and subsequent) volume(s)\n\ q Abort tar\n\ ! Spawn a subshell\n\ ? Print this list\n" msgstr "\ n [nome] Escolher um novo nome para os volumes qui suivront\n\ q Terminar a execução de \"tar\"\n\ ! Executar uma \"sub-shell\"\n\ ? Escrever esta lista\n" msgid "\ Cannot extract `%s' -- file is continued from another volume" msgstr "\ Não se consegue extrair \"%s\" -- o ficheiro começa num outro volume" msgid "\ Cannot write to compression program" msgstr "\ Não se consegue escrever para o programa de compressão" msgid "\ Could not backspace archive file; it may be unreadable without -i" msgstr "\ Não se consegue recuar o ficheiro de arquivo; poderá ser ilegível sem \"-i\"" msgid "\ Mandatory or optional arguments to long options are mandatory or optional\n\ for short options too.\n" msgstr "\ Os argumentos obrigatórios ou opcionais para as opções longas também\n\ são obrigatórios ou opcionais para as correspondentes opções curtas.\n" msgid "\ Read error at byte %ld, reading %d bytes, in file %s" msgstr "\ Erro de leitura no \"byte\" %ld, durante a leitura de %d \"bytes\" do ficheiro %s" msgid "\ Removing leading / from absolute path names in the archive" msgstr "\ Vai-se retirar os \"/\" dos nomes absolutos de ficheiro. " msgid "\ Write to compression program short %d bytes" msgstr "\ Faltou escrever %d \"bytes\" para o programa de compressão" msgid "\ You may not specify more than one of the r, c, t, x, or d options" msgstr "\ Não se deve escolher mais do que uma das opções \"r\", \"c\", \"t\", \"x\" ou \"d\"" msgid "\ You must specify one of the r, c, t, x, or d options" msgstr "\ Deve-se escolher pelo menos uma das opções \"r\", \"c\", \"t\", \"x\" ou \"d\"" msgid "\ You must use a compression option (--gzip, --compress\n\ or --use-compress-program) with --block-compress" msgstr "\ Deve-se utilizar uma aes opções de compressão \"--gzip\", \"--compress\"\n\ ou \"--use-compress-program\", com a opção \"--block-compress\"" msgid "\ \n\ Archive format selection:\n\ -V, --label=NAME create archive with volume name NAME\n\ -o, --old-archive, --portability write a V7 format archive (not ANSI)\n\ -z, --gzip, --ungzip filter the archive through gzip\n\ -Z, --compress, --uncompress filter the archive through compress\n\ --use-compress-program=PROG filter through PROG (must accept -d)\n" msgstr "\ \n\ Selecção do formato do arquivo:\n\ -V, --label=NOME criar o arquivo com um NOME de volume\n\ -o, --old-archive, --portability produzir um arquivo V7 (não-ANSI)\n\ -z, --gzip, --ungzip utilizar \"gzip»\" como filtro\n\ -Z, --compress, --uncompress utilizar \"compress»\" como filtro\n\ --use-compress-program=PROG utilizar PROG (tem que aceitar -d) como filtro\n" msgid "\ \n\ Device blocking:\n\ -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes\n\ --block-compress block the output of compression for tapes\n\ -i, --ignore-zeros ignore blocks of zeros in archive (means EOF)\n\ -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes)\n" msgstr "\ \n\ Blocos no periférico (\"device\") :\n\ -b, --block-size=BLOCO utilizar blocos de BLOCO x 512 \"bytes\"\n\ --block-compress dividir em blocos o resultado da compressão para fitas magnéticas.\n\ -i, --ignore-zeros ignorar os blocos de zeros (implicam fim-de-ficheiro)\n\ -B, --read-full-blocks dividir a leitura em blocos (para os \"pipes»\" 4.2BSD)\n" msgid "\ \n\ Device selection and switching:\n\ -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME\n\ --force-local archive file is local even if has a colon\n\ --rsh-command=COMMAND use remote COMMAND instead of rsh\n\ -[0-7][lmh] specify drive and density\n\ -M, --multi-volume create/list/extract multi-volume archive\n\ -L, --tape-length=NUM change tape after writing NUM x 1024 bytes\n\ -F, --info-script=FILE run script at end of each tape (implies -M)\n\ --new-volume-script=FILE same as -F FILE\n" msgstr "\ \n\ Escolha do periférico e mudanças de fita magnética:\n\ -f, --file=[MÁQUINA:]FICHEIRO tratar o arquivo FICHEIRO, na máquina MÁQUINA\n\ --force-local tratar um arquivo local, mesmo se \":»\"\n\ --rsh-command=COMANDO substituir \"rsh»\" por COMANDO\n\ -[0-7][lmh] escolher o periférico e a densidade\n\ -M, --multi-volume tratar arquivos multi-volume\n\ -L, --tape-length=NÚMERO tratar NÚMERO x 1024 \"bytes\" por fita magnética\n\ -F, --info-script=FICHEIRO executar FICHEIRO nas mudanças de fita magnética\n\ (força a escolha de \"-M»\")\n\ --new-volume-script=FICHEIRO o mesmo que \"-F FICHEIRO»\"\n" msgid "\ \n\ Handling of file attributes:\n\ --atime-preserve don't change access times on dumped files\n\ -m, --modification-time don't extract file modified time\n\ --same-owner create extracted files with the same ownership \n\ -p, --same-permissions extract all protection information\n\ --preserve-permissions same as -p\n\ -s, --same-order sort names to extract to match aarchive\n\ --preserve-order same as -s\n\ --preserve same as both -p and -s\n" msgstr "\ \n\ Atributos dos ficheiros:\n\ --atime-preserve ao guardar, preservar as de acesso \n\ -m, --modification-time na extracção, ignorar a data de modificação\n\ --same-owner na extracção, manter os mesmos donos (\"owner\")\n\ -p, --same-permissions na extracção, manter as mesmas protecções\n\ --preserve-permissions o mesmo que \"-p\"\n\ -s, --same-order ordernar os nomes a extrair segundo a sua ordem no arquivo\n\ --preserve-order o mesmo que \"-s\"\n\ --preserve o mesmo que \"-p\" conjugado com \"-s\"\n" msgid "\ \n\ Informative output:\n\ --help print this help, then exit\n\ --version print tar program version number, then exit\n\ -v, --verbose verbosely list files processed\n\ --checkpoint print directory names while reading the archive\n\ --totals print total bytes written while creating archive\n\ -R, --record-number show record number within archive with each message\n\ -w, --interactive ask for confirmation for every action\n\ --confirmation same as -w\n" msgstr "\ \n\ Saídas informativas:\n\ --help mostrar esta mensagem de ajuda e terminar\n\ --version indicar a versão do programa e terminar\n\ -v, --verbose escrever a lista dos ficheiros tratados\n\ --checkpoint indicar os nomes dos directórios durante a leitura\n\ --totals indicar o número de \"bytes\" escritos durante a criação\n\ -R, --record-number escrever a posição no arquivo em cada mensagem\n\ -w, --interactive pedir confirmação para todas as acções\n\ --confirmation o mesmo que \"-w\"\n" msgid "\ \n\ Local file selection:\n\ -C, --directory DIR change to directory DIR\n\ -T, --files-from=NAME get names to extract or create from file NAME\n\ --null -T reads null-terminated names, disable -C\n\ --exclude=FILE exclude file FILE\n\ -X, --exclude-from=FILE exclude files listed in FILE\n\ -P, --absolute-paths don't strip leading `/'s from file names\n\ -h, --dereference dump instead the files symlinks point to\n\ -l, --one-file-system stay in local file system when creating archive\n\ -K, --starting-file=NAME begin at file NAME in the archive\n\ -N, --newer=DATE only store files newer than DATE\n\ --after-date=DATE same as -N\n" msgstr "\ \n\ Selecção local de ficheiros:\n\ -C, --directory=DIRECTÓRIO mudar para o DIRECTÓRIO indicado\n\ -T, --files-from=NOME obter do ficheiro NOME a lista de ficheiros a criar ou extrair\n\ --null faz que \"-T\" leia nomes terminados por NULO,\n\ também inibe \"-C\"\n\ --exclude=FICHEIRO excluir o FICHEIRO indicado\n\ -X, --exclude-from=FICHEIRO excluir os ficheiros fornecidos no FICHEIRO\n\ -P, --absolute-paths preservar os \"/»\" iniciais nos nomes dos ficheiro\n\ -h, --dereference usar os ficheiros apontados pelas ligações simbólicas\n\ -l, --one-file-system manter-se no sistema de ficheiros local durante a criação do arquivo\n\ -K, --starting-file=NOME começar pelo ficheiro NOME, no arquivo\n\ -N, --newer=DATA só guardar ficheiros mais recentes do que DATA\n\ --after-date=DATA o mesmo que \"-N\"\n" msgid "\ \n\ Main operation mode:\n\ -t, --list list the contents of an archive\n\ -x, --extract, --get extract files from an archive\n\ -c, --create create a new archive\n\ -d, --diff, --compare find differences between archive and file system\n\ -r, --append append files to the end of an archive\n\ -u, --update only append files newer than copy in archive\n\ -A, --catenate append tar files to an archive\n\ --concatenate same as -A\n\ --delete delete from the archive (not on mag tapes!)\n" msgstr "\ \n\ Principal modo de funcionamento:\n\ -t, --list inventário do arquivo\n\ -x, --extract, --get extrair ficheiros do arquivo\n\ -c, --create criar um novo arquivo\n\ -d, --diff, --compare comparar o arquivo com os actuais ficheiros \n\ -r, --append acrescentar os ficheiros no fim do arquivo\n\ -u, --update só acrescentar os ficheiros mais novos do que as versões presentes no arquivo\n\ -A, --catenate juntar outros arquivos \"tar\" ao arquivo\n\ --concatenate o mesmo que \"-A\"\n\ --delete apagar no arquivo (execpto para fitas magnéticas!)\n" msgid "\ \n\ On *this* particular tar, the defaults are -f %s and -b %d.\n" msgstr "\ \n\ Neste \"tar\" específico tem-se, por defeito, \"-f %s\" e \"-b %d\".\n" msgid "\ \n\ Operation mode modificators:\n\ -W, --verify attempt to verify the archive after writing it\n\ --remove-files remove files after adding them to the archive\n\ -k, --keep-old-files don't overwrite existing files from archive\n\ -S, --sparse handle sparse files efficiently\n\ -O, --to-stdout extract files to standard output\n\ -G, --incremental handle old GNU-format incremental backup\n\ -g, --listed-incremental handle new GNU-format incremental backup\n\ --ignore-failed-read do not exit with non-zero on unreadable files\n" msgstr "\ \n\ Modificadores do modo de funcionamento:\n\ -W, --verify tentar verificar o arquivo depois de o escrever\n\ --remove-files apagar os ficheiros depois de serem guardados no arquivo\n\ -k, --keep-old-files na extracção, não destruir nenhum ficheiro\n\ -S, --sparse tratar eficientemente ficheiros dispersos (os que têm buracos)\n\ -O, --to-stdout extrair os ficheiros para o \"stdout\" \n\ -G, --incremental tratar um arquivo no velho formato incremental GNU\n\ -g, --listed-incremental tratar arquivo no novo formato incremental GNU\n\ --ignore-failed-read ignorar os ficheiros que não se consegue ler.\n" msgid "\007Prepare volume #%d for %s and hit return: " msgstr "\007Preparar o volume no. %d para %s e premir \"Return\": " msgid "exec/tcp: Service not available" msgstr "exec/tcp: Serviço indisponível" msgid "file %s\n" msgstr "ficheiro %s\n" msgid "rec %10ld: " msgstr "reg %10ld: " msgid "rmtd: Cannot allocate buffer space\n" msgstr "rmtd: Não se consegue reservar espaco temporário (\"buffers\")\n" msgid "rmtd: Garbage command %c\n" msgstr "rmtd: Comando \"%c\" não faz sentido\n" msgid "rmtd: Premature eof\n" msgstr "rmtd: Fim de ficheiro prematuro\n" msgid "tar (child)" msgstr "tar (filho)" tar-1.11.8/po/sv.po 644 625 1 63730 5756431564 7053 # msgid " (core dumped)" msgstr " (minnet sparat)" # msgid " link to %s\n" msgstr " länk till %s\n" # msgid " unknown file type `%c'\n" msgstr " okänd filtyp `%c'\n" # msgid "%c: Argument missing" msgstr "%c: Argument saknas" # msgid "%d at %d\n" msgstr "%d vid %d\n" # msgid "%s is not continued on this volume" msgstr "%s fortsätter inte i denna volym" # msgid "%s is the archive; not dumped" msgstr "%s är arkivet; inget arkiverat" # msgid "%s is the wrong size (%ld != %ld + %ld)" msgstr "%s har fel storlek (%ld != %ld + %ld)" # msgid "%s: %s differs\n" msgstr "%s: %s är inte lika\n" # msgid "%s: %s: Cannot link to %s, copying instead\n" msgstr "%s: %s: Kan inte länka till %s, kopierar istället\n" # msgid "%s: Could only read %d of %ld bytes\n" msgstr "%s: Kunde bara läsa %d av %ld oktetter\n" # msgid "%s: Data differs\n" msgstr "%s: Data är inte lika\n" # msgid "%s: Deleting %s\n" msgstr "%s: Tar bort %s\n" # msgid "%s: Device numbers changed\n" msgstr "%s: Enhetsnummer ändrade på sig\n" # msgid "%s: Does not exist\n" msgstr "%s: Existerar inte\n" # msgid "%s: File shrunk by %d bytes, (yark!)" msgstr "%s: Filen krympte med %d oktetter, (huga!)" # msgid "%s: Mode or device-type changed\n" msgstr "%s: Mod eller enhetstyp ändrade på sig\n" # msgid "%s: No longer a directory\n" msgstr "%s: Inte längre en filkatalog\n" # msgid "%s: No such file or directory\n" msgstr "%s: Det finns ingen sådan fil eller filkatalog\n" # msgid "%s: Not a regular file\n" msgstr "%s: Inte en normal fil\n" # msgid "%s: Not found in archive" msgstr "%s: Hittades inte i arkivet" # msgid "%s: Not linked to %s\n" msgstr "%s: Inte länkad till %s\n" # msgid "%s: On a different filesystem; not dumped" msgstr "%s: På ett annat filsystem; inte arkiverad" # msgid "%s: Symlink differs\n" msgstr "%s: Symbolisk länk inte lika\n" # msgid "%s: Unknown file type; file ignored" msgstr "%s: Okänd filtyp; filen ignorerad" # msgid "%s: is unchanged; not dumped" msgstr "%s: är oförändrad; inte arkiverad" # msgid "((child)) Pipe to stdin" msgstr "((barn)) `Pipe' till standard in" # msgid "((child)) Pipe to stdout" msgstr "((barn)) `Pipe' till standard ut " # msgid "(child) Pipe to stdin" msgstr "(barn) `Pipe' till standard in" # msgid "(child) Pipe to stdout" msgstr "(barn) `Pipe' till standard ut" # msgid "--Continued at byte %ld--\n" msgstr "--Fortsätter vid oktett %ld--\n" # msgid "--Mangled file names--\n" msgstr "--Kodade filnamn--\n" # msgid "--Volume Header--\n" msgstr "--Volymhuvud--\n" # msgid "Added write and execute permission to directory %s" msgstr "Lade till skriv och exekveringsrättigheter till filkatalog %s" # msgid "Amount actually written is (I hope) %d.\n" msgstr "Mängd som verkligen skrivits är %d (hoppas jag).\n" # msgid "Archive %s EOF not on block boundary" msgstr "I arkiv %s är inte filslut vid en blockgräns" # msgid "Archive not labelled to match %s" msgstr "Arkivet är inte etiketterad för att stämma med %s" # msgid "Archive to stdin" msgstr "Arkiv till standard in" # msgid "Archive to stdout" msgstr "Arkiv till standard ut" # msgid "At beginning of tape, quitting now" msgstr "Vid bandets början, terminerar nu" # msgid "Bad regular expression: %s" msgstr "Otillåtet reguljärt uttryck: %s" # msgid "Block %d left\n" msgstr "Block %d kvar\n" # msgid "Block: %d <= %d " msgstr "Block: %d <= %d " # msgid "Blocksize = %d records" msgstr "Blockstorlek = %d `records'" # msgid "cannot add file %s" msgstr "kan inte lägga till filen %s" # msgid "Cannot allocate %d bytes for restore" msgstr "Kan inte allokera %d oktetter för återtagning" # msgid "Cannot allocate buffer space" msgstr "Kan inte allokera plats för buffertar" # msgid "Cannot change directory to %d" msgstr "Kan inte gå till filkatalogen %d" # msgid "Cannot change mode of file %s to %lo" msgstr "Kan inte ändra rättigheter på filen %s till %lo" # msgid "Cannot change owner of %s to uid %d gid %d" msgstr "Kan inte ändra ägare för %s till `uid' %d och `gid' %d" # msgid "Cannot change to directory %d" msgstr "Kan inte gå till filkatalogen %d" # msgid "Cannot change to directory %s" msgstr "Kan inte gå till filkatalogen %s" # msgid "Cannot chdir to %s" msgstr "Kan inte gå till filkatalogen %s" # msgid "Cannot chown file %s to uid %d gid %d" msgstr "Kan inte ändra ägare för fil %s till `uid' %d och `gid' %d" # msgid "Cannot close a file #%d" msgstr "Kan inte stänga fil #%d" # msgid "Cannot close descriptor %d" msgstr "Kan inte stänga filnummer %d" # msgid "Cannot dup %s" msgstr "Kan inte skapa nytt filnummer för %s med `dup'" # msgid "Cannot exec %s" msgstr "Kan inte exekvera %s" # msgid "Cannot exec a shell %s" msgstr "Kan inte exekvera ett `shell' %s" # msgid "Cannot execute remote shell" msgstr "Kan inte exekvera `remote shell'" # msgid "Cannot fork" msgstr "Kan inte skapa ny process med `fork'" # msgid "Cannot fork!" msgstr "Kan inte skapa ny process med `fork'!" # msgid "Cannot keep old files on this system" msgstr "Kan inte behålla gamla filer på detta system" # msgid "Cannot open %s" msgstr "Kan inte öppna %s" # msgid "Cannot open a pipe" msgstr "Kan inte skapa en `pipe'" # msgid "Cannot open archive %s" msgstr "Kan inte öppna arkivet %s" # msgid "Cannot open directory %s" msgstr "Kan inte öppna filkatalogen %s" # msgid "Cannot open file %s" msgstr "Kan inte öppna filen %s" # msgid "Cannot read %s" msgstr "Kan inte läsa %s" # msgid "Cannot read confirmation from user" msgstr "Kan inte läsa bekräftelse från användaren" # msgid "Cannot read from compression program" msgstr "Kan inte läsa från komprimeringsprogrammet" # msgid "Cannot read link %s" msgstr "Kan inte läsa länk %s" # msgid "Cannot remove %s" msgstr "Kan inte ta bort %s" # msgid "Cannot rename %s to %s" msgstr "Kan inte byta namn på %s till %s" # msgid "Cannot seek to %ld in file %s" msgstr "Kan inte söka till position %ld i filen %s" # msgid "Cannot stat %s" msgstr "Kan inte göra `stat' på %s" # msgid "Cannot stat file %s" msgstr "Kan inte göra `stat' på filen %s" # msgid "Cannot symlink %s to %s" msgstr "Kan inte skapa en symbolisk länk från %s till %s" # msgid "Cannot update or verify compressed archives" msgstr "Kan inte uppdatera eller verifiera komprimerade arkiv" # msgid "Cannot use compressed or remote archives" msgstr "Kan inte använda komprimerade eller icke lokala arkiv" # msgid "Cannot use multi-volume compressed archives" msgstr "Kan inte använda komprimerade flervolymsarkiv" # msgid "Cannot verify multi-volume archives" msgstr "Kan inte verifiera flervolymsarkiv" # msgid "Cannot verify stdin/stdout archive" msgstr "Kan inte verifiera standard in/ut arkiv" # msgid "Cannot write to %s" msgstr "Kan inte skriva till %s" # msgid "Child cannot fork" msgstr "Barnet kan inte utföra `fork'" # msgid "Child died with signal %d%s" msgstr "Barnet dog med signal %d%s" # msgid "Child returned status %d" msgstr "Barnet terminerade med status %d" # msgid "Copying %d\n" msgstr "Kopierar %d\n" # msgid "Could not allocate memory for blocking factor %d" msgstr "Kunde inte allokera minne för blockfaktor %d" # msgid "Could not allocate memory for diff buffer of %d bytes" msgstr "Kunde inte allokera minne för differensbuffert av storlek %d oktetter" # msgid "Could not change access and modification times of %s" msgstr "Kunde inte ändra åtkomst och modifieringstid för %s" # msgid "Could not create directory %s" msgstr "Kunde inte skapa filkatalog %s" # msgid "Could not create file %s" msgstr "Kunde inte skapa fil %s" # msgid "Could not create symlink to %s" msgstr "Kunde inte skapa symbolisk länk till %s" # msgid "Could not get current directory" msgstr "Kunde inte komma åt namnet på nuvarande filkatalog" # msgid "Could not get current directory: %s" msgstr "Kunde inte komma åt namnet på nuvarande filkatalog: %s" # msgid "Could not link %s to %s" msgstr "Kunde inte länka %s till %s" # msgid "Could not make %s" msgstr "Kunde inte skapa %s" # msgid "Could not re-position archive file" msgstr "Kunde inte byta position i arkivfilen" # msgid "Could not rewind archive file for verify" msgstr "Kunde inte gå till början på arkivfilen för verifikation" # msgid "Could not write to file %s" msgstr "Kunde inte skriva till filen %s" # msgid "Could only write %d of %d bytes to file %s" msgstr "Kunde bara skriva %d av %d oktetter till filen %s" # msgid "Creating directory:" msgstr "Skapar filkatalog:" # msgid "Deleting non-header from archive" msgstr "Tar bort icke huvuddata från arkivet" # msgid "Directory %s has been renamed" msgstr "Filkatalogen %s har bytt namn" # msgid "Directory %s is new" msgstr "Filkatalogen %s är ny" # msgid "EOF in archive file" msgstr "Filslut i arkivfilen" # msgid "EOF? What does that mean?" msgstr "Filslut? Vad betyder det?" # msgid "Error while closing %s" msgstr "Fel inträffade vid stängning av %s" # msgid "Error while deleting %s" msgstr "Fel inträffade vid borttagning av %s" # msgid "File %s " msgstr "Fil %s" # msgid "File %s shrunk by %d bytes, padding with zeros" msgstr "Filen krympte med %d oktetter, fyller ut med nolltecken" # msgid "File %s\n" msgstr "Fil %s\n" # msgid "File name %s%s too long" msgstr "Filnamnet %s%s är för långt" # msgid "Final %d\n" msgstr "Sista %d\n" # msgid "Flush it\n" msgstr "Spolar ut den\n" # msgid "Flush...\n" msgstr "Spolar ut...\n" # msgid "Flushing %d recs from %s\n" msgstr "Spolar ut %d `records' från %s\n" # msgid "Fore to %x\n" msgstr "Framåt till %x\n" # msgid "Garbage command" msgstr "Okänt kommando" # msgid "Gid" msgstr "`Gid'" # msgid "Header type %d\n" msgstr "Huvudtyp %d\n" # msgid "Hmm, this doesn't look like a tar archive" msgstr "Hmm, det här ser inte ut som ett `tar' arkiv" # msgid "Invalid date format `%s'" msgstr "Ogiltigt format för datum `%s'" # msgid "Invalid value for blocksize" msgstr "Ogiltigt värde för blockstorlek" # msgid "Junk files\n" msgstr "Skräpfiler\n" # msgid "Missing file name after -C" msgstr "Filnamn efter -C saknas" # msgid "Missing filename after -C" msgstr "Filnamn efter -C saknas" # msgid "Mod time" msgstr "Modifieringstid" # msgid "Mode" msgstr "Mod" # msgid "Multiple archive files requires --multi-volume" msgstr "Multipla arkivfiler kräver --multi-volume" # msgid "Need %d kept_in %d keep %d\n" msgstr "Behöver %d sparat i block %d sparade %d\n" # msgid "New block\n" msgstr "Nytt block\n" # msgid "No archive name given, what should I do?" msgstr "Inget arkivnamn givet, vad ska jag göra?" # msgid "No new volume; exiting.\n" msgstr "Ingen ny volym; terminerar.\n" # msgid "Now new %d need %d keep %d keep_in %d rec %d/%d\n" msgstr "Nu nya %d behöver %d sparat %d sparat i block %d rec %d/%d\n" # msgid "Omitting %s" msgstr "Utelämnar %s" # msgid "Only one compression option permitted" msgstr "Endast en komprimeringsflagga är tillåten" # msgid "Only read %d bytes from archive %s" msgstr "Läste bara %d oktetter från arkivet %s" # msgid "Only wrote %ld of %ld bytes to file %s" msgstr "Skrev bara %ld av %ld oktetter till filen %s" # msgid "Only wrote %u of %u bytes to %s" msgstr "Skrev bara %u av %u oktetter till %s" # msgid "Options [0-7][lmh] not supported by *this* tar" msgstr "Flaggorna [0-7][lmh] finns inte i den här implementationen av tar" # msgid "Out of first loop\n" msgstr "Ut ur den första slingan\n" # msgid "Premature end of file" msgstr "Filslut kom för tidigt" # msgid "Read checkpoint %d" msgstr "Läser kontrollpunkt %d" # msgid "Read error at byte %ld reading %d bytes in file %s" msgstr "Läsfel vid oktett %ld vid läsning av %d oktetter från fil %s" # msgid "Read error at byte %ld, reading %d bytes, in file %s" msgstr "Läsfel vid oktett %ld, läste %d oktetter, i fil %s" # msgid "Read error on %s" msgstr "Läsfel i %s" # msgid "Reading %s\n" msgstr "Läser %s\n" # msgid "Removing drive spec from names in the archive" msgstr "Tar bort enhetsnamn från namnen i arkivet" # msgid "Removing leading / from absolute links" msgstr "Tar bort inledande / från absoluta länkar" # msgid "Renamed %s to %s" msgstr "Bytte namn på %s till %s" # msgid "Saved %d recs, need %d more\n" msgstr "Sparade %d `records', behöver ytterligare %d\n" # msgid "Size" msgstr "Storlek" # msgid "Skip %ld\n" msgstr "Hoppar över %ld\n" # msgid "Skipping to next file header" msgstr "Hoppar över data till nästa filhuvud" # msgid "Skipping to next header" msgstr "Hoppar över data till nästa huvud" # msgid "Symlinked %s to %s" msgstr "%s symboliskt länkad till %s" # msgid "This does not look like a tar archive" msgstr "Det här ser inte ut som ett tar arkiv" # msgid "This volume is out of sequence" msgstr "Denna volym kommer inte i rätt ordning" # msgid "Too many args with -T option" msgstr "För många argument med -T flaggan" # msgid "Too many errors, quitting" msgstr "För många fel, terminerar" # msgid "Total bytes written: %d\n" msgstr "Totalt antal oktetter skrivna: %d\n" # msgid "Try `%s --help' for more information.\n" msgstr "Gör `%s --help' för ytterligare information.\n" # msgid "Uid" msgstr "`Uid'" # msgid "Unexpected EOF in archive" msgstr "Oväntat filslut i arkivet" # msgid "Unexpected EOF in mangled names" msgstr "Oväntat filslut i kodade namn" # msgid "Unexpected EOF on archive file" msgstr "Oväntat filslut i arkivfilen" # msgid "Unknown demangling command %s" msgstr "Okänt avkodningskommando %s" # msgid "Unknown file type '%c' for %s, diffed as normal file" msgstr "Okänd filtyp `%c' för %s, jämförd som en normal fil" # msgid "Unknown file type '%c' for %s, extracted as normal file" msgstr "Okänd filtyp `%c' för %s, extraherad som en normal fil" # msgid "Unknown option %c" msgstr "Okänd flagga %c" # msgid "Usage: %s [OPTION]... [FILE]...\n" msgstr "Användning: %s [FLAGGOR]... [FIL]...\n" # msgid "VERIFY FAILURE: %d invalid header(s) detected" msgstr "VERIFIKATIONSFEL: %d okända arkivhuvuden upptäckta" # msgid "Verify " msgstr "Verifikation" # msgid "Visible long name error" msgstr "Fel på ett långt namn" # msgid "Visible longname error" msgstr "Fel på ett långt namn" # msgid "Volume mismatch! %s!=%s" msgstr "Volymerna stämmer inte! %s!=%s" # msgid "WARNING: Archive is incomplete" msgstr "VARNING: Arkivet är ofullständigt" # msgid "WARNING: Cannot close %s (%d, %d)" msgstr "VARNING: Kan inte stänga %s (%d, %d)" # msgid "WARNING: No volume header" msgstr "VARNING: Inget volymhuvud" # msgid "Write block\n" msgstr "Skriver block\n" # msgid "Write checkpoint %d" msgstr "Skriver kontrollpunkt %d" # msgid "Wrote %ld of %ld bytes to file %s" msgstr "Skrev %ld av %ld oktetter till fil %s" # msgid "[child] Pipe to stdin" msgstr "[barn] `Pipe' till standard in" # msgid "[child] Pipe to stdout" msgstr "[barn] `Pipe' till standard ut" # msgid "\ n [name] Give a new filename for the next (and subsequent) volume(s)\n\ q Abort tar\n\ ! Spawn a subshell\n\ ? Print this list\n" msgstr "\ n [NAMN] Ge ett filnam för nästa (och efterföljande) volym(er)\n\ q Avbryt tar\n\ ! Starta ett `shell'\n\ ? Skriv denna lista\n" # msgid "\ Cannot extract `%s' -- file is continued from another volume" msgstr "\ Kan inte extrahera `%s' -- filen fortsätter från en tidigare volym" # msgid "\ Cannot write to compression program" msgstr "\ Kan inte skriva till kompressionsprogrammet" # msgid "\ Could not backspace archive file; it may be unreadable without -i" msgstr "\ Kunde inte backa tillbaka i arkivfilen; den kan vara oläsbar utan -i" # msgid "\ Mandatory or optional arguments to long options are mandatory or optional\n\ for short options too.\n" msgstr "\ Obligatoriska eller icke obligatoriska argument för långa flaggor är\n\ obligatoriska respektive icke obligatoriska även för korta flaggor.\n" # msgid "\ Read error at byte %ld, reading %d bytes, in file %s" msgstr "\ Läsfel vid oktett %ld, läste %d oktetter, i fil %s" # msgid "\ Removing leading / from absolute path names in the archive" msgstr "\ Tar bort inledande / från absoluta filnamn i arkivet" # msgid "\ Write to compression program short %d bytes" msgstr "\ Skrivning till kompressionsprogrammet skrev %d oktetter för lite" # msgid "\ You may not specify more than one of the r, c, t, x, or d options" msgstr "\ Du kan inte ange mer än en av r, c, t, x, eller d flaggorna" # msgid "\ You must specify one of the r, c, t, x, or d options" msgstr "\ Du måste ange en av r, c, t, x, eller d flaggorna" # msgid "\ You must use a compression option (--gzip, --compress\n\ or --use-compress-program) with --block-compress" msgstr "\ Du måste ange ett komprimeringsprogram (--gzip, --compress\n\ eller --use-compress-program) med --block-compress" # msgid "\ \n\ Archive format selection:\n\ -V, --label=NAME create archive with volume name NAME\n\ -o, --old-archive, --portability write a V7 format archive (not ANSI)\n\ -z, --gzip, --ungzip filter the archive through gzip\n\ -Z, --compress, --uncompress filter the archive through compress\n\ --use-compress-program=PROG filter through PROG (must accept -d)\n" msgstr "\ \n\ Val av arkivformat:\n\ -V, --label=NAMN Skapa ett arkiv med volymnamn NAMN\n\ -o, --old-archive, --portability skapa ett arkiv i V7 format (ej ANSI)\n\ -z, --gzip, --ungzip sänd arkivet till `gzip'\n\ -Z, --compress, --uncompress sänd arkivet till`compress'\n\ --use-compress-program=PROG sänd arkivet till PROG (måste förstå -d)\n" # msgid "\ \n\ Device blocking:\n\ -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes\n\ --block-compress block the output of compression for tapes\n\ -i, --ignore-zeros ignore blocks of zeros in archive (means EOF)\n\ -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes)\n" msgstr "\ \n\ Blockhantering:\n\ -b, --block-size=BLOCK använd blockstorlek BLOCK x 512 oktetter\n\ --block-compress blocka resultatet från komprimering (för band)\n\ -i, --ignore-zeros ignorera block som innehåller nolltecken\n\ (betyder filslut)\n\ -B, --read-full-blocks omblocka vid läsning (för 4.2BSD `pipes')\n" # msgid "\ \n\ Device selection and switching:\n\ -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME\n\ --force-local archive file is local even if has a colon\n\ --rsh-command=COMMAND use remote COMMAND instead of rsh\n\ -[0-7][lmh] specify drive and density\n\ -M, --multi-volume create/list/extract multi-volume archive\n\ -L, --tape-length=NUM change tape after writing NUM x 1024 bytes\n\ -F, --info-script=FILE run script at end of each tape (implies -M)\n\ --new-volume-script=FILE same as -F FILE\n" msgstr "\ \n\ Enhetsval och enhetsbyte:\n\ -f, --file=[MASKIN:]FIL ange arkivfil eller enhet FIL på MASKIN\n\ --force-local arkivfil är lokal även om den innehåller :\n\ --rsh-command=KOMMANDO ersätt `rsh' med KOMMANDO\n\ -[0-7][lmh] ange enhet och densitet\n\ -M, --multi-volume behandla arkivet som ett flervolymsarkiv\n\ -L, --tape-length=NUMMER byt band efter det att NUMMER x 1024\n\ oktetter skrivits\n\ -F, --info-script=FIL kör kommandofil FIL vid slutet av varje band\n\ (-M flaggan sätts också)\n\ --new-volume-script=FIL samma som -F FIL\n" # msgid "\ \n\ Handling of file attributes:\n\ --atime-preserve don't change access times on dumped files\n\ -m, --modification-time don't extract file modified time\n\ --same-owner create extracted files with the same ownership \n\ -p, --same-permissions extract all protection information\n\ --preserve-permissions same as -p\n\ -s, --same-order sort names to extract to match archive\n\ --preserve-order same as -s\n\ --preserve same as both -p and -s\n" msgstr "\ \n\ Hantering av filattribut:\n\ --atime-preserve ändra inte åtkomsttider på filer som\n\ arkiverats\n\ -m, --modification-time extrahera inte modifieringstiden på filer\n\ --same-owner filer som extraherats får samma ägare som i\n\ arkivet\n\ -p, --same-permissions extrahera all åtkomstinformation för filer\n\ --preserve-permissions samma som -p\n\ -s, --same-order sortera de namn som ska extraheras så de\n\ passar ihop med arkivet\n\ --preserve-order sammas som -s\n\ --preserve sammas som -p och -s\n" # msgid "\ \n\ Informative output:\n\ --help print this help, then exit\n\ --version print tar program version number, then exit\n\ -v, --verbose verbosely list files processed\n\ --checkpoint print directory names while reading the archive\n\ --totals print total bytes written while creating archive\n\ -R, --record-number show record number within archive with each message\n\ -w, --interactive ask for confirmation for every action\n\ --confirmation same as -w\n" msgstr "\ \n\ Utskrift av information:\n\ --help visa denna hjälp text och terminera\n\ --version visa version på programmet och terminera\n\ -v, --verbose visa information om varje fil som behandlas\n\ --checkpoint visa filkatalogsnamn när arkivet läses\n\ --totals visa totala antalet oktetter skrivna när arkivet\n\ skapas\n\ -R, --record-number lägg till `record' nummer i arkivet till varje\n\ meddelande\n\ -w, --interactive fråga efter bekräftelse för varje operation\n\ --confirmation samma som -w\n" # msgid "\ \n\ Local file selection:\n\ -C, --directory DIR change to directory DIR\n\ -T, --files-from=NAME get names to extract or create from file NAME\n\ --null -T reads null-terminated names, disable -C\n\ --exclude=FILE exclude file FILE\n\ -X, --exclude-from=FILE exclude files listed in FILE\n\ -P, --absolute-paths don't strip leading `/'s from file names\n\ -h, --dereference dump instead the files symlinks point to\n\ -l, --one-file-system stay in local file system when creating archive\n\ -K, --starting-file=NAME begin at file NAME in the archive\n\ -N, --newer=DATE only store files newer than DATE\n\ --after-date=DATE same as -N\n" msgstr "\ \n\ Välja lokala filer:\n\ -C, --directory=KATALOG byt filkatalog till KATALOG\n\ -T, --files-from=NAMN hämta namn att extrahera eller arkivera från\n\ filen NAMN\n\ --null -T läser namn åtskiljda med nolltecken\n\ -C tas som en vanlig fil\n\ --exclude=FIL tag inte med filen FIL\n\ -X, --exclude-from=FIL tag inte med filer namngivna i filen FIL\n\ -P, --absolute-paths tag inte bort inledande / från filnamn\n\ -h, --dereference arkivera det symboliska länkar pekar till\n\ -l, --one-file-system byt inte filsystem när arkivet skapas\n\ -K, --starting-file=NAMN börja med filen NAMN i arkivet\n\ -N, --newer=DATUM arkivera endast filer som är nyare än DATUM\n\ --after-date=DATUM samma som -N\n" # msgid "\ \n\ Main operation mode:\n\ -t, --list list the contents of an archive\n\ -x, --extract, --get extract files from an archive\n\ -c, --create create a new archive\n\ -d, --diff, --compare find differences between archive and file system\n\ -r, --append append files to the end of an archive\n\ -u, --update only append files newer than copy in archive\n\ -A, --catenate append tar files to an archive\n\ --concatenate same as -A\n\ --delete delete from the archive (not on mag tapes!)\n" msgstr "\ \n\ Operationsläge:\n\ -t, --list visa inehållet i arkivet\n\ -x, --extract, --get extrahera filer från arkivet\n\ -c, --create skapa ett nytt arkiv\n\ -d, --diff, --compare visa skillnader mellan arkivet och filsystemet\n\ -r, --append lägg till filer på slutet av arkivet\n\ -u, --update lägg endast till filer som är nyare än de i arkivet\n\ -A, --catenate lägg till en arkivfil till arkivet\n\ --concatenate samma som -A\n\ --delete ta bort från arkivet (inte för arkiv på band!)\n" # msgid "\ \n\ On *this* particular tar, the defaults are -f %s and -b %d.\n" msgstr "\ \n\ På denna implementation av tar så är standardvärdena -f %s och -b %d.\n" # msgid "\ \n\ Operation mode modificators:\n\ -W, --verify attempt to verify the archive after writing it\n\ --remove-files remove files after adding them to the archive\n\ -k, --keep-old-files don't overwrite existing files from archive\n\ -S, --sparse handle sparse files efficiently\n\ -O, --to-stdout extract files to standard output\n\ -G, --incremental handle old GNU-format incremental backup\n\ -g, --listed-incremental handle new GNU-format incremental backup\n\ --ignore-failed-read do not exit with non-zero on unreadable files\n" msgstr "\ \n\ Modifierare för operationslägen:\n\ -W, --verify försök verifiera arkivet efter det skapats\n\ --remove-files ta bort filer efter de lagts till arkivet\n\ -k, --keep-old-files skriv inte över existerade filer med filer\n\ från arkivet\n\ -S, --sparse specialhantera filer med hål (mer effektivt)\n\ -O, --to-stdout extrahera filer till standard ut\n\ -G, --incremental hantera gamla GNU formatet för inkrementell\n\ säkerhetskopiering\n\ -g, --listed-incremental hantera nya GNU formatet för inkrementell\n\ säkerhetskopiering\n\ --ignore-failed-read ignorera filer som inte kan läsas\n" # msgid "\007Prepare volume #%d for %s and hit return: " msgstr "\007Förbered volym nummer %d för %s och tryck `Return':" # msgid "exec/tcp: Service not available" msgstr "exec/tcp: Servicen är inte tillgänglig" # msgid "file %s\n" msgstr "fil %s\n" # msgid "rec %10ld: " msgstr "rec %10ld: " # msgid "rmtd: Cannot allocate buffer space\n" msgstr "rmtd: Kan inte allokera buffert\n" # msgid "rmtd: Garbage command %c\n" msgstr "rmtd: Okänt kommando `%c'\n" # msgid "rmtd: Premature eof\n" msgstr "rmtd: Filslut kom för tidigt\n" # msgid "tar (child)" msgstr "tar (barn)" tar-1.11.8/po/de.gmo 644 625 1 66034 5770555137 7156 Þ•×Ô%Œ +!‡M-ÕKOX`Z-»=éP' x"f"÷" #—#«# Ä#"Î#ñ#'$7$&G$$n$“$¥$¶$Ò$$æ$ %,%G%f%~%—%)­%×%#ì%&-&E&^&t&‹&¦&¾&2Ñ&('$-' R's'„'"–'¹'Ô'ã'õ' ($(D(a($(*¤(Ï(í(%)&)>) Y)g)v))<©) æ) ò)$ÿ)$*3*F*]*v*Š*"™*$¼*á*õ*++;+J+^++v+(¢++Ë+#÷+",>,#Q,u,‡,£, ¼,0È,5ù,A/-4q-¦-Ä-Ý-ü-#.@.X."j.(.¶.*Ñ.ü. /1/O/c/w/’/©/Á/Ê/.Ó/0 0 $0 .080 R0^0n0r0)‚0¬0Å0 á0¹í0a§1 2$2>2G2.L2{2 —2(¢2Ë23ä213 J3%V3"|3&Ÿ3Æ3.æ34(4>42Q44„4¹4 Ê4-Ö4&5:+5f5w5”5 ™5£5À5Ø5%ë5606M6g6&€6§6«6Å6å674"77W7 7-°7Þ7æ7þ78.8!M8o8 ‰8–8+ª8!Ö8Aø84:9fo9Ö9ì9:#: ,:#8:\:v: ‹:ª—:8B<²{<I.>Nx?=ÇADŠ#FL®HDûJV@K—Mx³M,N FN«TNO O''O"OO+rOžO-ºO&èOP+P%:P`P.uP2¤P×P*öP!Q;QXQ2rQ&¥Q)ÌQ$öQ#R#?R!cR!…R§RÇRäR7÷R-/S)]S-‡SµSÑS!íST/T?TQTjT-‰T'·T&ßT-U34U%hU%ŽU9´UîU" V&0VWVoV!VJ±VüVW7%W]WrW‹W §WÈWãW,÷W'$XLXeX}X/œXÌX"éX6 Y?CY=ƒY7ÁY+ùY9%Z_Z.{ZªZ%ÊZ!ðZ [5[@T[C•[;Ù[#\9\-W\,…\0²\(ã\ ]1%]8W]"]0³]ä]$ù]^=^T^"r^•^²^ Í^×^:à^_ 6_A_Q_d__‘_¥_«_-¾_ì_ `,`ÌA`Taca}a—a¶a=¼a/úa *b-7bebGb7Éb c'c'6c2^c*‘cA¼cþcd9d;Ld;ˆdÄdÖd-ßd( e26eie0}e®e´e*Åeðef(.f"Wf!zfœf'´f(Üfg g-,g&Zg5gF·gDþg"Ch=fh ¤h$±h$Öh&ûh"i)@i"jiii=´i&òiMj@gjv¨j"k"Bk!ek ‡k ‘k2žk"Ñkôk l…/VWÆxSĶ Ba _RvÔÍ¥y#ˆ©Ït™Î qµ²Š¬!jª€¾JÉ8¸¯½@•UPn3H]EoÕ~>±-|‘dF*‰OºŽ¨ÑI«w’c–·Àb­=%,Y{4eÒM—Q6[s“2š”&Ê`®rT¿‚Z)Ì:+$0C°¤h m £ ÓLi¦\9g¢„†G§ƒl.ÅÃÁ¼5 Ð(‡³fkp1'˜;»‹D^<K}ËŒŸ7ÖÂA´¡u¹NXzÈ›žÇ"œ×?Prepare volume #%d for %s and hit return: Archive format selection: -V, --label=NAME create archive with volume name NAME -o, --old-archive, --portability write a V7 format archive (not ANSI) -z, --gzip, --ungzip filter the archive through gzip -Z, --compress, --uncompress filter the archive through compress --use-compress-program=PROG filter through PROG (must accept -d) Device blocking: -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes --block-compress block the output of compression for tapes -i, --ignore-zeros ignore blocks of zeros in archive (means EOF) -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes) Device selection and switching: -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME --force-local archive file is local even if has a colon --rsh-command=COMMAND use remote COMMAND instead of rsh -[0-7][lmh] specify drive and density -M, --multi-volume create/list/extract multi-volume archive -L, --tape-length=NUM change tape after writing NUM x 1024 bytes -F, --info-script=FILE run script at end of each tape (implies -M) --new-volume-script=FILE same as -F FILE Handling of file attributes: --atime-preserve don't change access times on dumped files -m, --modification-time don't extract file modified time --same-owner create extracted files with the same ownership -p, --same-permissions extract all protection information --preserve-permissions same as -p -s, --same-order sort names to extract to match archive --preserve-order same as -s --preserve same as both -p and -s Informative output: --help print this help, then exit --version print tar program version number, then exit -v, --verbose verbosely list files processed --checkpoint print directory names while reading the archive --totals print total bytes written while creating archive -R, --record-number show record number within archive with each message -w, --interactive ask for confirmation for every action --confirmation same as -w Local file selection: -C, --directory DIR change to directory DIR -T, --files-from=NAME get names to extract or create from file NAME --null -T reads null-terminated names, disable -C --exclude=FILE exclude file FILE -X, --exclude-from=FILE exclude files listed in FILE -P, --absolute-paths don't strip leading `/'s from file names -h, --dereference dump instead the files symlinks point to -l, --one-file-system stay in local file system when creating archive -K, --starting-file=NAME begin at file NAME in the archive Main operation mode: -t, --list list the contents of an archive -x, --extract, --get extract files from an archive -c, --create create a new archive -d, --diff, --compare find differences between archive and file system -r, --append append files to the end of an archive -u, --update only append files newer than copy in archive -A, --catenate append tar files to an archive --concatenate same as -A --delete delete from the archive (not on mag tapes!) On *this* particular tar, the defaults are -f %s and -b %d. Operation mode modificators: -W, --verify attempt to verify the archive after writing it --remove-files remove files after adding them to the archive -k, --keep-old-files don't overwrite existing files from archive -S, --sparse handle sparse files efficiently -O, --to-stdout extract files to standard output -G, --incremental handle old GNU-format incremental backup -g, --listed-incremental handle new GNU-format incremental backup --ignore-failed-read do not exit with non-zero on unreadable files Usage: %s [OPTION]... -N, --newer=DATE only store files newer than DATE --after-date=DATE same as -N (core dumped) link to %s n [name] Give a new filename for the next (and subsequent) volume(s) q Abort tar ! Spawn a subshell ? Print this list unknown file type `%c' %d at %d %s is not continued on this volume%s is the archive; not dumped%s is the wrong size (%ld != %ld + %ld)%s: %s differs %s: Cannot link to %s, copying instead%s: Could only read %d of %ld bytes %s: Data differs %s: Deleting %s %s: Device numbers changed %s: Does not exist %s: File shrunk by %d bytes, (yark!)%s: Mode or device-type changed %s: No longer a directory %s: No such file or directory %s: Not a regular file %s: Not found in archive%s: Not linked to %s %s: On a different filesystem; not dumped%s: Symlink differs %s: Unknown file type; file ignored%s: is unchanged; not dumped((child)) Pipe to stdin((child)) Pipe to stdout(child) Pipe to stdin(child) Pipe to stdout--Continued at byte %ld-- --Mangled file names-- --Volume Header-- Added write and execute permission to directory %sAmount actually written is (I hope) %d. Archive %s EOF not on block boundaryArchive not labelled to match %sArchive to stdinArchive to stdoutAt beginning of tape, quitting nowBad regular expression: %sBlock %d left Block: %d <= %d Blocksize = %d recordsCannot add file %sCannot allocate %d bytes for restoreCannot allocate buffer spaceCannot change directory to %dCannot change mode of file %s to %loCannot change owner of %s to uid %d gid %dCannot change to directory %sCannot chdir to %sCannot chown file %s to uid %d gid %dCannot close a file #%dCannot close descriptor %dCannot dup %sCannot exec %sCannot exec a shell %sCannot execute remote shellCannot extract `%s' -- file is continued from another volumeCannot forkCannot fork!Cannot keep old files on this systemCannot open %sCannot open a pipeCannot open archive %sCannot open directory %sCannot open file %sCannot read %sCannot read confirmation from userCannot read from compression programCannot read link %sCannot remove %sCannot rename %s to %sCannot seek to %ld in file %sCannot stat %sCannot stat file %sCannot symlink %s to %sCannot update or verify compressed archivesCannot use compressed or remote archivesCannot use multi-volume compressed archivesCannot verify multi-volume archivesCannot verify stdin/stdout archiveCannot write to %sCannot write to compression programChild cannot forkChild died with signal %d%sChild returned status %dCopying %d Could not allocate memory for blocking factor %dCould not allocate memory for diff buffer of %d bytesCould not backspace archive file; it may be unreadable without -iCould not change access and modification times of %sCould not create directory %sCould not create file %sCould not create symlink to %sCould not get current directoryCould not get current directory: %sCould not link %s to %sCould not make %sCould not re-position archive fileCould not rewind archive file for verifyCould not write to file %sCould only write %d of %d bytes to file %sCreating directory:Deleting non-header from archiveDirectory %s has been renamedDirectory %s is newEOF in archive fileEOF? What does that mean?Error while closing %sError while deleting %sFile %s File %s File %s shrunk by %d bytes, padding with zerosFile name %s%s too longFinal %d Flush it Flush... Flushing %d recs from %s Fore to %x Garbage commandGidHeader type %d Hmm, this doesn't look like a tar archiveInvalid date format `%s'Invalid value for blocksizeJunk files Mandatory arguments to long options are mandatory for short options too. --help display this help and exit --version output version information and exit Mandatory or optional arguments to long options are mandatory or optional for short options too. Missing file name after -CMissing filename after -CMod timeModeMultiple archive files requires --multi-volumeNeed %d kept_in %d keep %d New block No archive name given, what should I do?No new volume; exiting. Now new %d need %d keep %d keep_in %d rec %d/%d Obsolete option name replaced by --absolute-namesOmitting %sOnly one compression option permittedOnly read %d bytes from archive %sOnly wrote %ld of %ld bytes to file %sOnly wrote %u of %u bytes to %sOptions [0-7][lmh] not supported by *this* tarOut of first loop Premature end of fileRead checkpoint %dRead error at byte %ld reading %d bytes in file %sRead error at byte %ld, reading %d bytes, in file %sRead error on %sReading %s Removing drive spec from names in the archiveRemoving leading / from absolute linksRemoving leading / from absolute path names in the archiveRenamed %s to %sSaved %d recs, need %d more SizeSkip %ld Skipping to next file headerSkipping to next headerSymlinked %s to %sThis does not look like a tar archiveThis volume is out of sequenceToo many args with -T optionToo many errors, quittingTotal bytes written: %d Try `%s --help' for more information. UidUnexpected EOF in archiveUnexpected EOF in mangled namesUnexpected EOF on archive fileUnknown demangling command %sUnknown file type '%c' for %s, diffed as normal fileUnknown file type '%c' for %s, extracted as normal fileUsage: %s [OPTION]... [FILE]... VERIFY FAILURE: %d invalid header(s) detectedVerify Visible long name errorVisible longname errorVolume mismatch! %s!=%sWARNING: Archive is incompleteWARNING: Cannot close %s (%d, %d)WARNING: No volume headerWrite block Write checkpoint %dWrite to compression program short %d bytesWrote %ld of %ld bytes to file %sYou may not specify more than one of the r, c, t, x, or d optionsYou must specify one of the r, c, t, x, or d optionsYou must use a compression option (--gzip, --compress or --use-compress-program) with --block-compress[child] Pipe to stdin[child] Pipe to stdoutexec/tcp: Service not availablefile %s rec %10ld: rmtd: Cannot allocate buffer space rmtd: Garbage command %c rmtd: Premature eof tar (child)Version: Date: 1995-06-13 16:30:27-0400 From: =?ISO-8859-1?Q?Fran=E7ois_Pinard?= Directory: /home/pinard/tar/po Xgettext-Options: -dtar -n -k -k_ Files: ../src/genfile.c ../src/rmt.c ../src/buffer.c ../src/create.c Files: ../src/diffarch.c ../src/extract.c ../src/gnu.c ../src/list.c Files: ../src/mangle.c ../src/port.c ../src/rmt.c ../src/rtapelib.c Files: ../src/tar.c ../src/update.c Update on FIXME:date Legen Sie Band #%d für %s ein und drücken Sie `Return': Auswahl des Archiv Formates: -V, --label=NAME erzeuge Archiv mit Bandnamen NAME -o, --old-archive, --portability schreibe Archiv im V7 Format (kein ANSI) -z, --gzip, --ungzip filtere Archiv durch `gzip' -Z, --compress, --uncompress filtere Archiv durch `compress' --use-compress-program=PROG filtere Archiv durch PROG (muß -d akzeptieren) Blockung des Gerätes: -b, --block-size=BLÖCKE benutze Blöcke der Größe BLÖCKE x 512 bytes --block-compress blocke die Ausgabe der Komprimierung für Bänder -i, --ignore-zeros ignoriere Blöcke mit Nullen im Archiv (heißt EOF) -B, --read-full-blocks ändere Blockung beim Lesen (für 4.2BSD `Pipes') Geräteauswahl und -wechsel: -f, --file=[RECHNERNAME:]DATEI nutze Archiv oder Gerät DATEI auf RECHNERNAME --force-local Archivdatei lokal, auch wenn Name `:' enthält --rsh-command=KOMMANDO ersetze `rsh' durch KOMMANDO -[0-7][lmh] wähle Gerät und Schreibdichte -M, --multi-volume behandle mehbändige Archive -L, --tape-length=NUMMER wechsle Band nach NUMMER x 1024 Bytes -F, --info-script=DATEI für Skript DATEI am Bandende (impliziert -M) --new-volume-script=DATEI das gleiche wie `-F DATEI' Behandlung von Dateiattributen: --atime-preserve ändere Zugriffszeit von gesicherten Dateien nicht -m, --modification-time Änderungszeit beim Herausholen nicht setzen --same-owner erhalte Besitzrechte beim Herausholen -p, --same-permissions setze alle Zugriffsrechte beim Herausholen --preserve-permissions das gleiche wie `-s' -s, --same-order sortiere Namen beim Herausholen wie im Archiv --preserve-order das gleiche wie `-s' --preserve das gleiche wie `-p'und `-s' Informationsausgaben: --help zeige diese Hilfe und beende --version zeige Versionsnummer des Programms und beende -v, --verbose ausführliche Liste aller verarbeiteten Dateien --checkpoint zeige Verzeichnisnamen beim Lesen des Archivs an --totals zeige Gesamtzahl der Bytes bei Erzeugung an -R, --record-number zeige bei jeder Meldung die Eintragsnummer an -w, --interactive frage Benutzer zur Bestätigung jeder Aktion --confirmation das gleiche wie `-w' Auswahl der lokalen Dateien: -C, --directory=VERZEICHNIS wechsle zu VERZEICHNIS -T, --files-from=DATEI hole Namen der zu bearbeitenden Dateien aus DATEI --null `-T' liest Null-terminierte Namen, verbiete `-C' --exclude=DATEI lasse DATEI aus -X, --exclude-from=DATEI lasse Dateien mit Namen aus DATEI aus -P, --absolute-paths entferne führenden `/' nicht von Dateinamen -h, --dereference sichere Dateien nicht die symbolischen Links -l, --one-file-system bleibe im lokalen Dateisystem beim Erzeugen -K, --starting-file=NAME starte mit Datei NAME im Archiv Auswahl der Haupt-Operation: -t, --list zeige Inhalt eines Archivs an -x, --extract, --get hole Dateien aus Archiv heraus -c, --create erzeuge neues Archiv -d, --diff, --compare suche Differenzen zwischen Archiv und Dateisystem -r, --append hänge Dateien an das Ende des Archivs an -u, --update hänge nur Dateien, die jünger als im Archiv sind, an -A, --catenate hänge `tar' Datei and Archiv an --concatenate das gleiche wie `-A' --delete Lösche aus Archiv (nicht auf Magnetbändern!) Dieses *spezielle* `tar' hat die Standardwert `-f %s' und `-s %d'. Auswahl der Unter-Operationen: -W, --verify versuche Archiv nach Schreiben zu verifizieren --remove-files lösche Datei nach dem Sichern im Archiv -k, --keep-old-files überschreibe vorhandene Dateien nicht -S, --sparse behandle dünn besetzte Dateien effizient -O, --to-stdout gebe Dateien auf Standard Ausgabe aus -G, --incremental behandle inkrementelle Backups im alten GNU Format -g, --listed-incremental behandle inkrementelle Backups im neuen GNU Format --ignore-failed-read fahre trotz Lesefehler fort Benutzung: %s [OPTION]... -N, --newer=DATUM sichere nur Dateien jünger als DATUM --after-date=DATUM das gleiche wie `-N' (Core-Datei geschrieben) Link auf %s n [NAME] Gebe für nächsten (und folgende) Bände neuen Dateinamen q Unterbreche `tar' ! Starte Shell in Unterprozeß ? Gebe diese Liste aus unbekannter Dateityp `%s' %d bei %d %s ist in diesem Band nicht fortgesetzt%s ist ein Archiv; nicht gesichert%s hat die falsche Größe (%ld != %ld + %ld)%s: %s ist unterschiedlich %s: Kann %s nicht linken, kopiere stattdessen%s: Konnte nur %d von %ld Bytes lesen %s: unterschiedliche Daten %s: Lösche %s %s: Gerätenummer ist unterschiedlich %s: Existiert nicht %s: Datei ist um %d Bytes geschrumpft, (uurg!)%s: Modus- oder Gerätenummer sind unterschiedlich %s: Ist kein Verzeichnis mehr %s: Datei oder Verzeichnis nicht gefunden %s: Keine reguläre Datei %s: Nicht im Archiv gefunden%s: Nicht auf %s gelinkt %s: Auf einem anderen Dateisystem; nicht gesichert%s: Symbolischer Link unterschiedlich %s: Unbekannter Dateityp; Datei ignoriert%s: ist unverändert; nicht gesichert((Kind)) `Pipe' zu Standard Eingabe((Kind)) `Pipe' zu Standard Ausgabe(Kind) `Pipe' zu Standard Eingabe(Kind) `Pipe' zu Standard Ausgabe--Weitergemacht bei Byte %ld-- --Verstümmelte Dateinamen-- --Band Kopfteil-- Setze Schreib- und Ausführungsrechte für Verzeichnis %sWirklich geschriebene Menge %d (hoffe ich!). Archiv %s Dateiende nicht auf BlockgrenzeArchiv nicht ausgezeichnet um zu %s zu passenArchiv von Standard EingabeArchiv auf Standard AusgabeAm Anfang des Bands, stoppe jetztFalscher regulärer Ausdruck: %s%d Blöcke übrigBlock: %d <= %d Blockgröße = %d EinträgeKann Datei %s nicht hinzufügenKann keine %d Bytes für Restaurierung belegenKann keinen Speicher für Puffer belegenKann Verzeichnis nicht auf %d wechselnKann Rechte für Datei %s nicht auf %lo setzenKann Besitzer von %s nicht auf Uid %d Gid %d setzenKann nicht zu Verzeichnis %s wechselnKann nicht zu Verzeichnis %s wechselnKann Besitzer von Datei %s nicht auf Uid %d Gid %d setzenKann Datei #%d nicht schließenKann Deskriptor %d nicht schließenKann `dup' nicht auf Datei %s anwendenKann %s nicht ausführenKann keine `Shell' %s ausführenKann Remote-Shell nicht ausführenKann `%s'nicht herausholen -- Datei ist Fortsetzung von einem anderen BandKann nicht `fork'enKann nicht `fork'en!Kann auf diesem System nicht die alten Dateien behaltenKann %s nicht öffnenKann keine `Pipe' öffnenKann Archiv %s nicht öffnenKann Verzeichnis %s nicht öffnenKann Datei %s nicht öffnenKann %s nicht lesenKann keine Bestätigung vom Benutzer bekommenKann nicht vom Komprimierprogramm lesenKann Link %s nicht lesenKann %s nicht entfernenKann %s nicht in %s umbenennenKann nicht zu Position %ld in Datei %s wechseln`stat' auf %s fehlgeschlagen`stat' auf Datei %s fehlgeschlagenKann keinen symbolisches Link von %s auf %s einrichtenKann komprimierte Archive nicht aktualisieren oder verifizierenKann keine komprimierten oder nicht-lokalen Archive verwendenKann keine mehrteiligen komprimierten Archive verwendenKann mehrteilige Archive nicht verifizierenKann Archive auf Standard Ein-/Ausgabe nicht verifizierenKann nicht auf %s schreibenKann nicht zum Kompressions-Programm schreibenKind-Prozeß kann nicht `fork'enKind-Prozeß mit Signal %d%s gestorbenKind-Prozeß gibt Status %d zurückKopiere %d Konnte keinen Speicher für Blockungsfaktor %d belegenKonnte keinen Speicher von %d Bytes für Vergleichspuffer belegenKann Archiv Datei nicht zurücksetzen; könnte ohne `-i'unlesbar seinKonnte Zugriffsrechte und Änderungszeit von %s nicht ändernKonnte Verzeichnis %s nicht anlegenKonnte Datei %s nicht anlegenKonnte symbolischen Link auf %s nicht anlegenKonnte aktuelles Verzeichnis nicht ermittelnKonnte aktuelles Verzeichnis nicht ermitteln: %sKonnte keinen Link von %s auf %s anlegenKonnte %s nicht erzeugenKonnte Dateizeiger für Archiv Datei nicht bewegenKonnte Archiv Datei zur verifizierung nicht zurückspulenKonnte nicht in Datei %s schreibenKonnte nur %d von %d Bytes in Datei %s schreibenErzeuge Verzeichnis:Lösche nicht-Kopfteil aus dem ArchivVerzeichnis %s wurde umbenanntVerzeichnis %s ist neuDateiende in der Archiv DateiDateiende? Was soll das bedeuten?Fehler beim Schließen von %sFehler beim Löschen von %sDatei %s Datei %sDatei %s ist um %d Bytes geschrumpft, fülle auf mit NullenDateiname %s%s ist zu langLetzte %d Gebe alles aus Gebe alles aus... Gebe %d Einträge von %s aus Vorwärts zu %x Ungültiges Kommando`Gid'Typ %d des Kopfes Hmh, das sieht nicht wie ein `tar' Archiv ausUnzulässiges Datumsformat `%s'Unzulässiger Wert für BlockgrößeÜberflüssige DateienNotwendige Argumente für Optionen in Langform sind auch für die Kurzform notwendig. --help print this help, then exit --version print tar program version number, then exit Notwendige Argumente für Optionen in Langform sind auch für die Kurzform notwendig. Dateiname nach `-C' fehltDateiname nach `-C' fehltZeitpunkt der letzten ÄnderungModusBei mehreren Archiv Dateien ist `--multi-volume' erforderlichBrauche %d habe behalten %d sollte behalten %d Neuer Block Kein Archiv Name angegeben, was soll ich tun?Kein neuer Band; halte an. jetzt neu %d brauche %d will behalten %d behalte %s Einträge %d/%d Obsoleter Optionsname ist ersetzt durch --absolte-namesLasse %s ausNur eine Komprimier Option ist zulässigHabe nur %d Bytes von Archiv %s gelesenHabe nur %ld von %ld Bytes in Datei %s geschriebenHabe nur %u von %u Bytes in %s geschriebenDie Optionen [0-7][lmh] sind bei *diesem* `tar' nicht unterstütztAus der ersten Schleife heraus Vorzeitiges Ende der DateiLese Checkpoint %dLesefehler bei Byte %ld beim Lesen von %d bytes in Datei %sLesefehler bei Byte %ld beim Lesen von %d bytes in Datei %sLesefehler bei %sLese %s Entferne Laufwerksangaben von Namen im ArchivEntferne führende `/'von absoluten LinksEntferne führende `/'von absoluten Links im ArchivBenenne %s in %s umHabe %s Einträge gesichert, muß noch weitere %d GrößeÜberspringe %ld Springe zum Kopfteil für die nächste DateiSpringe zum nächsten KopfteilSymbolischer Link von %s auf %sDas sieht nicht wie ein `tar' Archiv ausDieser Band ist nicht an der ReiheZuviele Argumente bei `-T' OptionZu viele Fehler, beendeGesamtzahl der geschriebenen Bytes: %d `%s --help' gibt weitere Informationen. `Uid'Unerwartetes Dateiende im ArchivUnerwartetes Dateiende in zerstückelten NamenUnerwartetes Dateiende in Archiv DateiUnbekanntes Kommando %s beim Zusammensetzen von NamenUnbekannter Dateityp '%c' für %s, Differenz wie für eine normale DateiUnbekannter Dateityp '%c'für %s, wie eine normale Datei herausgeholtAufruf: %s [OPTION]... [DATEI]... FEHLER BEI VERIFIZIERUNG: %d ungültige(r) Kopfteil(e) erkanntVerifiziere Fehler bei langem Namen festgestelltFehler bei langem Namen festgestelltBände passen nicht zueinander! %s!=%sWARNUNG: Archiv unvollständigWARNUNG: Kann %s nicht schließen (%d, %d)WARNUNG: Band hat keinen Kopfteil Schreibe Block Schreibe Checkpoint %dKonnte letzte %d Bytes nicht zu Kompressionsprogramm ausgebenSchreibe %ld von %ld Bytes in Datei %sSie können nicht mehr als eine der Option `r', `c', `t', `x' oder `d' angebenSie müssen eine der Optionen `r', `c', `t', `x' oder `d' angebenSie müssen eine Option zur Komprimierung (--gzip, --compress oder --use-compress-program) bei --block-compress angeben[Kind] `Pipe' auf Standard Eingabe[Kind] `Pipe' auf Standard Ausgabeexec/tcp: Service nicht verfügbarDatei %s Eint %10ld: rmtd: Kann Speicherplatz für Puffer nicht belegen rmtd: Überflüssiges Kommando '%c' rmtd: Vorzeitiges Dateiende tar (Kind)tar-1.11.8/po/fr.gmo 644 625 1 65505 5770103576 7173 Þ•ÖÌ%| +‡<-ÄKò>GÆI-=> P| Í" Ü"—é"#š# ¯#"¹#Ü#'ú#"$+2$$^$ƒ$•$¦$Â$$Ö$ û$%7%V%n%‡%)%Ç%#Ü%&&5&N&d&{&–&®&2Á&(ô&$' B'c't'"†'©'Ä'Ó'å'ü'$(4(Q($o(*”(¿(Ý(û(%)4)L) g)u)„)›)<·) ô) *$ *2*A*T*k*„*˜*"§*$Ê*ï*++++I+X+l++„+(°++Ù+#,"),L,#_,ƒ,•,±, Ê,0Ö,5-A=-4-´-Ò-ë- .#*.N.f."x.(›.Ä.*ß. / /?/]/q/…/ /·/Ï/Ø/.á/0 (0 20 <0F0 `06l0£0³0·0)Ç0ñ0 1 &1a21”1¯1É1Ò1.×12 "2(-2V23o2 £2%¯2"Õ2&ø23.?3n33—32ª34Ý34 #4-/4&]4:„4¿4Ð4í4 ò4ü4515%D5j5‰5¦5À5&Ù5666>6]64{67°6è6 ú6-7I7Q7i7€7™7!¸7Ú7 ô78+8!A8Ac84¥8fÚ8A9W9n9Ž9 —9#£9Ç9á9 ö9C:‰F:CÐ;š=¯?ËAEÞCE$G@jIk«IL(L°7LèLMM#&M(JM0sM¤M:´M&ïMN1N'HNpN1‚N+´N(àN% O/OLOjO@OÀO+àO- P:PUPqPŠP¤PÁPßPHöP0?QCpQ1´QæQúQ(R 8RYRpR%R!§R5ÉR#ÿR*#S3NSA‚S2ÄS*÷S*"TAMT,T,¼T%éTU"'U'JUCrU¶UÓU8ñU*V@V]V#}V ¡VÂV1×V- W7WTWkW0ŠW#»W.ßW1X8@X9yX:³X0îX2YRY.lY›Y&»Y âYZ;ZCTZO˜Z@èZ!)[K[+j[*–[.Á[%ð[\".\1Q\#ƒ\5§\Ý\8õ\.]M]j]+ˆ]!´]!Ö] ø] ^@^P^ n^ x^ …^,‘^ ¾^MÌ^_0_6_-I_w_#”_¸_ É_"j`"`°`Æ`9Ë`&a ,a-:a$haFaÔa'ãa& b,2b!_b>bÀbÜböbNcNdc³cÌc@Ûc.dGKd“d+£dÏd Ød#ãde e&=ede#€e¤e!Àe.âef*f2Bf5uf/«f?Ûf?g[g#pg:”g Ïg!Üg!þg$ h#Eh*ih"”h·hÉhAéh++i>Wi<–i~ÓiRjjj ƒj ¤j °j4¼j'ñj k :k„-UVÅwRÕ¿´ A`^QuÓÌ£x!ˆ§Îs˜Í p°Ši†¨>I È6¶­»?”TOm1G\DnÔ} <¯+{›cE(‰N¸¦ÐÏH©½v~‘b•oa«;#*X€z2dÑL–P Zr’Ã0ª“$É_¬qS¾Y'Ë8)".B®¢glž¼¡³ÒKh¤[7f ƒ…F¥‚k,ÄÀº3|µ&4‡±ej/%—9¹‹C]:JŽÊŒ5Á@²Ÿt·MWyÇ™œÆ šÖ=Prepare volume #%d for %s and hit return: Archive format selection: -V, --label=NAME create archive with volume name NAME -o, --old-archive, --portability write a V7 format archive (not ANSI) -z, --gzip, --ungzip filter the archive through gzip -Z, --compress, --uncompress filter the archive through compress --use-compress-program=PROG filter through PROG (must accept -d) Device blocking: -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes --block-compress block the output of compression for tapes -i, --ignore-zeros ignore blocks of zeros in archive (means EOF) -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes) Device selection and switching: -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME --force-local archive file is local even if has a colon --rsh-command=COMMAND use remote COMMAND instead of rsh -[0-7][lmh] specify drive and density -M, --multi-volume create/list/extract multi-volume archive -L, --tape-length=NUM change tape after writing NUM x 1024 bytes -F, --info-script=FILE run script at end of each tape (implies -M) --new-volume-script=FILE same as -F FILE Handling of file attributes: --atime-preserve don't change access times on dumped files -m, --modification-time don't extract file modified time --same-owner create extracted files with the same ownership -p, --same-permissions extract all protection information --preserve-permissions same as -p -s, --same-order sort names to extract to match archive --preserve-order same as -s --preserve same as both -p and -s Informative output: --help print this help, then exit --version print tar program version number, then exit -v, --verbose verbosely list files processed --checkpoint print directory names while reading the archive --totals print total bytes written while creating archive -R, --record-number show record number within archive with each message -w, --interactive ask for confirmation for every action --confirmation same as -w Local file selection: -C, --directory DIR change to directory DIR -T, --files-from=NAME get names to extract or create from file NAME --null -T reads null-terminated names, disable -C --exclude=FILE exclude file FILE -X, --exclude-from=FILE exclude files listed in FILE -P, --absolute-paths don't strip leading `/'s from file names -h, --dereference dump instead the files symlinks point to -l, --one-file-system stay in local file system when creating archive -K, --starting-file=NAME begin at file NAME in the archive -N, --newer=DATE only store files newer than DATE --after-date=DATE same as -N Main operation mode: -t, --list list the contents of an archive -x, --extract, --get extract files from an archive -c, --create create a new archive -d, --diff, --compare find differences between archive and file system -r, --append append files to the end of an archive -u, --update only append files newer than copy in archive -A, --catenate append tar files to an archive --concatenate same as -A --delete delete from the archive (not on mag tapes!) On *this* particular tar, the defaults are -f %s and -b %d. Operation mode modificators: -W, --verify attempt to verify the archive after writing it --remove-files remove files after adding them to the archive -k, --keep-old-files don't overwrite existing files from archive -S, --sparse handle sparse files efficiently -O, --to-stdout extract files to standard output -G, --incremental handle old GNU-format incremental backup -g, --listed-incremental handle new GNU-format incremental backup --ignore-failed-read do not exit with non-zero on unreadable files (core dumped) link to %s n [name] Give a new filename for the next (and subsequent) volume(s) q Abort tar ! Spawn a subshell ? Print this list unknown file type `%c' %c: Argument missing%d at %d %s is not continued on this volume%s is the archive; not dumped%s is the wrong size (%ld != %ld + %ld)%s: %s differs %s: %s: Cannot link to %s, copying instead %s: Could only read %d of %ld bytes %s: Data differs %s: Deleting %s %s: Device numbers changed %s: Does not exist %s: File shrunk by %d bytes, (yark!)%s: Mode or device-type changed %s: No longer a directory %s: No such file or directory %s: Not a regular file %s: Not found in archive%s: Not linked to %s %s: On a different filesystem; not dumped%s: Symlink differs %s: Unknown file type; file ignored%s: is unchanged; not dumped((child)) Pipe to stdin((child)) Pipe to stdout(child) Pipe to stdin(child) Pipe to stdout--Continued at byte %ld-- --Mangled file names-- --Volume Header-- Added write and execute permission to directory %sAmount actually written is (I hope) %d. Archive %s EOF not on block boundaryArchive not labelled to match %sArchive to stdinArchive to stdoutAt beginning of tape, quitting nowBad regular expression: %sBlock %d left Block: %d <= %d Blocksize = %d recordsCannot add file %sCannot allocate %d bytes for restoreCannot allocate buffer spaceCannot change directory to %dCannot change mode of file %s to %loCannot change owner of %s to uid %d gid %dCannot change to directory %dCannot change to directory %sCannot chdir to %sCannot chown file %s to uid %d gid %dCannot close a file #%dCannot close descriptor %dCannot dup %sCannot exec %sCannot exec a shell %sCannot execute remote shellCannot extract `%s' -- file is continued from another volumeCannot forkCannot fork!Cannot keep old files on this systemCannot open %sCannot open a pipeCannot open archive %sCannot open directory %sCannot open file %sCannot read %sCannot read confirmation from userCannot read from compression programCannot read link %sCannot remove %sCannot rename %s to %sCannot seek to %ld in file %sCannot stat %sCannot stat file %sCannot symlink %s to %sCannot update or verify compressed archivesCannot use compressed or remote archivesCannot use multi-volume compressed archivesCannot verify multi-volume archivesCannot verify stdin/stdout archiveCannot write to %sCannot write to compression programChild cannot forkChild died with signal %d%sChild returned status %dCopying %d Could not allocate memory for blocking factor %dCould not allocate memory for diff buffer of %d bytesCould not backspace archive file; it may be unreadable without -iCould not change access and modification times of %sCould not create directory %sCould not create file %sCould not create symlink to %sCould not get current directoryCould not get current directory: %sCould not link %s to %sCould not make %sCould not re-position archive fileCould not rewind archive file for verifyCould not write to file %sCould only write %d of %d bytes to file %sCreating directory:Deleting non-header from archiveDirectory %s has been renamedDirectory %s is newEOF in archive fileEOF? What does that mean?Error while closing %sError while deleting %sFile %s File %s File %s shrunk by %d bytes, padding with zerosFile name %s%s too longFinal %d Flush it Flush... Flushing %d recs from %s Fore to %x Fully delay modern options after all old style optionsGarbage commandGidHeader type %d Hmm, this doesn't look like a tar archiveInvalid date format `%s'Invalid value for blocksizeJunk files Mandatory or optional arguments to long options are mandatory or optional for short options too. Missing file name after -CMissing filename after -CMod timeModeMultiple archive files requires --multi-volumeNeed %d kept_in %d keep %d New block No archive name given, what should I do?No new volume; exiting. Now new %d need %d keep %d keep_in %d rec %d/%d Omitting %sOnly one compression option permittedOnly read %d bytes from archive %sOnly wrote %ld of %ld bytes to file %sOnly wrote %u of %u bytes to %sOptions [0-7][lmh] not supported by *this* tarOut of first loop Premature end of fileRead checkpoint %dRead error at byte %ld reading %d bytes in file %sRead error at byte %ld, reading %d bytes, in file %sRead error on %sReading %s Removing drive spec from names in the archiveRemoving leading / from absolute linksRemoving leading / from absolute path names in the archiveRenamed %s to %sSaved %d recs, need %d more SizeSkip %ld Skipping to next file headerSkipping to next headerSymlinked %s to %sThis does not look like a tar archiveThis volume is out of sequenceToo many args with -T optionToo many errors, quittingTotal bytes written: %d Try `%s --help' for more information. UidUnexpected EOF in archiveUnexpected EOF in mangled namesUnexpected EOF on archive fileUnknown demangling command %sUnknown file type '%c' for %s, diffed as normal fileUnknown file type '%c' for %s, extracted as normal fileUnknown option %cUsage: %s [OPTION]... [FILE]... VERIFY FAILURE: %d invalid header(s) detectedVerify Visible long name errorVisible longname errorVolume mismatch! %s!=%sWARNING: Archive is incompleteWARNING: Cannot close %s (%d, %d)WARNING: No volume headerWrite block Write checkpoint %dWrite to compression program short %d bytesWrote %ld of %ld bytes to file %sYou may not specify more than one of the r, c, t, x, or d optionsYou must specify one of the r, c, t, x, or d optionsYou must use a compression option (--gzip, --compress or --use-compress-program) with --block-compress[child] Pipe to stdin[child] Pipe to stdoutexec/tcp: Service not availablefile %s rec %10ld: rmtd: Cannot allocate buffer space rmtd: Garbage command %c rmtd: Premature eof tar (child)Mettre le volume no. %d en place pour %s et appuyez sur «Return»: Sélection du format d'archive: -V, --label=NOM créer l'archive avec un NOM de volume -o, --old-archive, --portability produire une archive V7 (non-ANSI) -z, --gzip, --ungzip filtrer l'archive via «gzip» -Z, --compress, --uncompress filtrer l'archive via «compress» --use-compress-program=PROG filtrer l'archive via PROG (traitant -d) Blocage sur le lecteur: -b, --block-size=BLOCS utiliser des blocs de BLOCS x 512 octets --block-compress rebloquer la sortie de la compression sur ruban -i, --ignore-zeros ignorer les blocs nuls (comme fin-de-fichier) -B, --read-full-blocks rebloquer en lecture (pour les «pipes» 4.2BSD) Choix du lecteur et changements de ruban: -f, --file=[MACHINE:]FICHIER traiter l'archive FICHIER, sur MACHINE --force-local traiter une archive locale, même si «:» --rsh-command=COMMANDE remplacer «rsh» par COMMANDE -[0-7][lmh] choisir le lecteur et la densité -M, --multi-volume traiter des archives multi-volumes -L, --tape-length=NOMBRE traiter NOMBRE x 1024 octets par ruban -F, --info-script=FICHIER exécuter FICHIER au changement de ruban (force le choix de «-M») --new-volume-script=FICHIER comme «-F FICHIER» Attributs des fichiers: --atime-preserve à la sauvegarde, préserver les dates d'accès -m, --modification-time à l'extraction, ignorer date de modification --same-owner à l'extraction, rétablir les propriétaires -p, --same-permissions à l'extration, rétablir les protections --preserve-permissions comme «-p» -s, --same-order trier les noms à extraire selon l'archive --preserve-order comme «-s» --preserve comme «-p» et «-s» à la fois Sorties informatives: --help fournir ce message d'aide, puis terminer --version identifier le programme, puis terminer -v, --verbose étaler la liste des fichiers manipulés --checkpoint donner les noms de répertoires à la lecture --totals indiquer le nombre d'octets écrits à la création -R, --record-number afficher la position dans l'archive à chaque message -w, --interactive obtenir confirmation pour toute action --confirmation comme «-w» Choix des fichiers locaux: -C, --directory=REPERTOIRE passer au REPERTOIRE donné -T, --files-from=NOM obtenir la liste de fichiers du fichier NOM --null fait que «-T» lit des noms terminés par NUL, inhibe aussi «-C» --exclude=FICHIER exclure le FICHIER donné -X, --exclude-from=FICHIER exclure les fichiers fournis dans FICHIER -P, --absolute-paths garder les «/» préfixes aux noms de fichier -h, --dereference sauvegarder le résultat des liens symboliques -l, --one-file-system créer uniquement du système de fichiers local -K, --starting-file=NOM débuter au fichier NOM dans l'archive -N, --newer=DATE ne sauvegarder que ce qui est plus récent que DATE --after-date=DATE comme «-N» Mode d'opération principal: -t, --list inventorier l'archive -x, --extract, --get extraire des fichiers de l'archive -c, --create produire une nouvelle archive -d, --diff, --compare comparer l'archive et les fichiers courants -r, --append ajouter les fichiers à la fin de l'archive -u, --update n'ajouter que les fichiers rajeunissant l'archive -A, --catenate ajouter des archives «tar» à l'archive --concatenate comme «-A» --delete effacer de l'archive (pas pour des rubans!) Avec ce «tar»-ci, nous avons implicitement «-f %s» et «-b %d». Modificateurs de mode d'opération: -W, --verify tenter de vérifier l'archive après l'écriture --remove-files enlever les fichiers après leur sauvegarde -k, --keep-old-files à l'extraction, n'écraser aucun fichier -S, --sparse traiter les fichiers à trous adéquatement -O, --to-stdout extraire les fichiers sur la sortie standard -G, --incremental traiter une vieille archive incrémentale GNU -g, --listed-incremental traiter une nouvelle archive incrémentale GNU --ignore-failed-read ignorer les fichiers illisibles, poursuivre (mémoire vidée) lien vers %s n [NOM] Choisir un nouveau nom pour les volumes qui suivront q Interrompre l'exécution de «tar» ! Enfanter un sous-«shell» ? Imprimer cette liste type de fichier inconnu «%c» %c: Argument manquant%d à %d %s ne se poursuit pas sur ce volume%s est l'archive; ne sera pas sauvegardé%s n'a pas la bonne dimension (%ld != %ld + %ld)%s: %s diffère %s: %s: Incapable d'établir un lien vers %s, alors copier %s: N'a pu lire que %d octets sur %ld %s: Les données diffèrent %s: Elimination de %s %s: Les chiffres d'appareil ont changé %s: N'existe pas %s: Le fichier a rétréci de %d octets, (horreur!)%s: Le mode ou le type d'appareil a changé %s: N'est maintenant plus un répertoire %s: Fichier ou répertoire inexistant %s: Pas un fichier régulier %s: Pas trouvé dans l'archive%s: Pas lié vers %s %s: Sur un système de fichiers différent; ne sera pas sauvegardé%s: Le lien symbolique diffère %s: Type de fichier inconnu; fichier ignoré%s: n'est pas modifié; ne sera pas sauvegardé((fils)) «pipe» vers stdin((fils)) «pipe» vers stdout(fils) «pipe» vers stdin(fils) «pipe» vers stdout--Poursuivi à l'octet %ld-- --Noms de fichier chiffrés-- --En-tête de volume-- Les permissions d'écrire et d'exécuter ont été ajoutées au répertoire %sLa quantité vraiment écrite est %d (j'espère!). La fin-de-fichier de l'archive %s n'est pas à une frontière de blocL'archive n'est pas étiquetée et n'apparie pas %sL'archive sur stdinL'archive sur stdoutAu début du ruban, terminaison immédiateMauvais expression régulière: %sLe bloc %d est laissé Bloc: %d <= %d Grandeur de bloc = %d enregistrementsIncapable d'ajouter le fichier %sIncapable d'allouer %d octets pour la remise en placeIncapable d'allouer l'espace tamponIncapable de changer le répertoire pour %dIncapable de changer le mode du fichier %s pour %loIncapable de changer le propriétaire de %s pour «uid» %d «gid» %dIncapable de changer le répertoire pour %d (FIXME)Incapable de changer le répertoire pour %sIncapable de changer le répertoire pour %sIncapable de changer le propriétaire de %s pour «uid» %d «gid» %dIncapable de fermer le fichier au manchon %dIncapable de fermer le fichier au manchon %dIncapable de reproduire %s avec «dup»Incapable d'exécuter %sIncapable d'exécuter un «shell» %sIncapable d'exécuter un «shell» éloignéIncapable d'extraire «%s» -- le fichier débute dans un autre volumeIncapable d'effectuer «fork»Incapable d'effectuer «fork»!Incapable de conserver les vieux fichiers sur ce systèmeIncapable d'ouvrir %sIncapable d'ouvrir un «pipe»Incapable d'ouvrir l'archive %sIncapable d'ouvrir le répertoire %sIncapable d'ouvrir le fichier %sIncapable de lire %sIncapable d'obtenir une confirmation par l'usagerIncapable de lire du programme de compressionIncapable de lire le lien %sIncapable d'enlever %sIncapable de renommer %s en %sIncapable de repositionner (à %ld) le fichier %sIncapable d'exécuter «stat» pour %sIncapable d'exécuter «stat» pour le fichier %sIncapable d'établir un lien symbolique de %s à %sIncapable d'ajuster ou de vérifier une archive compriméeIncapable de traiter des archives comprimées ou éloignéesIncapable de traiter des archives comprimées multi-volumesIncapable de vérifier des archives multi-volumesIncapable de vérifier des archives stdin ou stdoutIncapable d'écrire sur %sIncapable d'écrire au programme de compressionLe fils ne peut exécuter «fork»Le fils est mort avec un «signal» %d%sLe fils a retourné un constat %dCopie de %d (FIXME)N'a pas pu allouer la mémoire pour un facteur de blocage %dN'a pas pu allouer la mémoire pour un tampon comparant de %d octetsIncapable de reculer le fichier d'archive; il pourrait exiger «-i» pour être luN'a pas pu modifier les temps d'accès ou de modification pour %sN'a pas pu créer le répertoire %sN'a pas pu créer le fichier %sN'a pas pu créer un lien symbolique vers %sN'a pas pu découvrir le répertoire courantN'a pas pu découvrir le répertoire courant: %sN'a pas pu établir un lien de %s à %sN'a pas pu fabriquer %sN'a pas pu repositionner l'archiveN'a pas pu rembobiner l'archive pour vérificationN'a pas pu écrire sur le fichier %sN'a pu qu'écrire %d octets sur %d, pour le fichier %sCréation de répertoire:Élimination d'une chose autre qu'un en-tête de l'archiveLe répertoire %s a été renomméLe répertoire %s est nouveauFin-de-fichier dans l'archiveFin-de-fichier! Qu'est-ce que ça signifie?Erreur pendant la fermeture de %sErreur durant l'élimination de %sFichier %s Fichier %sLe fichier %s a rétréci de %d octets, remplissage avec des zérosNom de fichier %s%s trop longFinal %d Vidangez-le Vidange... Vidange de %d enregistrements partant de %s «Fore to» %x Ne donner les options modernes qu'une fois complétées les options vieux styleCommande non-reconnue«Gid»Type d'en-tête %d Hum! Ça ne ressemble pas à une archive «tar»Format de date invalide «%s»Valeur invalide de grandeur de blocFichiers bidons Les arguments obligatoires ou optionnels pour la forme longue des options sont aussi obligatoires ou optionnels pour les formes courtes qui leur correspondent. Nom de fichier manquant après «-C»Nom de fichier manquant après «-C»Temps de modificationModeDes fichiers d'archive multiples exigent «--multi-volume»Besoin de %d, «kept_in» %d, «keep» %d Nouveau bloc Aucun nom d'archive donné, que dois-je faire?Pas de nouveau volume; terminaison. Maintenant: «new» %d, «need» %d, «keep» %d, «keep_in» %d, «rec» %d/%d Omission de %sUne seule option de compression permiseLu seulement %d octets de l'archive %sÉcrit seulement %ld/%ld octets au fichier %sÉcrit seulement %u/%u octets à %sLes options [0-7][lmh] ne sont pas installées pour ce «tar»-ciHors de la première boucle Fin de fichier prématuréePoint de reprise %d en lectureErreur de lecture à l'octet %ld, pendant la lecture de %d octets du fichier %sErreur de lecture à l'octet %ld, pendant la lecture de %d octets du fichier %sErreur de lecture sur %sLecture de %s Les noms de l'archive sont épurés de la spécification du lecteurLes liens absolus sont épurés d'un «/» préfixeLes noms de fichier absolus dans l'archive sont épurés d'un «/» préfixe%s renommé à %s%d enregistrements sauvés, %d encore requisGrandeurSaute %ld Saut au prochain en-tête de fichierSaut au prochain en-tête%s relié symboliquement à %sÇa ne ressemble pas à un archive «tar»Ce volume est hors séquenceTrop d'arguments pour l'option «-T»Trop d'erreurs: terminaisonNombre total d'octets écrits: %d Pour plus d'information, essayez «%s --help». «Uid»Fin de fichier intempestive dans l'archiveFin de fichier intempestive dans les noms chiffrésFin de fichier intempestive dans le fichier d'archiveCommande inconnue «%s» pour déchiffrer les nomsType de fichier «%c» inconnu, comparé comme un fichier régulierType de fichier «%c» inconnu, extrait comme un fichier régulierOption «%c» inconnueUsage: %s [OPTION]... [FICHIER]... ERREUR DE VÉRIFICATION: Détection de %d en-têtes invalidesVérificationErreur manifeste dans un nom longErreur manifeste dans un nom longLe volume ne correspond pas! %s!=%sATTENTION: L'archive est incomplèteATTENTION: Incapable de fermer %s (%d, %d)ATTENTION: Pas d'en-tête de volumeÉcriture du bloc Écriture du point de reprise %dDurant l'envoi à la compression, %d octets n'ont pas été acceptés%ld/%ld octets ont été écrits au fichier %sNe pas pas choisir plus d'une option «r», «c», «t», «x» ou «d»Choisir au moins l'une des options «r», «c», «t», «x» ou «d»Utiliser l'une des options de compression «--gzip», «--compress» ou «--use-compress-program», avec l'option «--block-compress»[fils] «Pipe» sur stdin[fils] «Pipe» sur stdoutexec/tcp: Service non disponiblefichier %s enr %10ld: rmtd: Incapable d'obtenir l'espace pour les tampons rmtd: Commande «%c» sans signification rmtd: Fin de fichier prématurée tar (fils)tar-1.11.8/po/pt.gmo 644 625 1 66414 5770103600 7173 Þ•ÕÄ%l +‡,-´Kâ .8Æ:-=/ Pm ¾" Í"—Ú"r#‹#  #"ª#Í#'ë#$+#$$O$t$†$—$³$$Ç$ ì$ %(%G%_%x%)Ž%¸%#Í%ñ%&&&?&U&l&‡&Ÿ&2²&(å&$' 3'T'e'"w'š'µ'Ä'Ö'í'$(%(B($`(*…(°(Î(ì(%ÿ(%)=) X)f)u)Œ)<¨) å) ñ)$þ)#*2*E*\*u*‰*"˜*$»*à*ô*++:+I+]++u+(¡++Ê+#ö+",=,#P,t,†,¢, »,0Ç,5ø,A.-4p-¥-Ã-Ü-û-#.?.W."i.(Œ.µ.*Ð.û. /0/N/b/v/‘/¨/À/É/.Ò/0 0 #0 -070 Q0]0m0q0)0«0Ä0 à0aì0N1i1ƒ1Œ1.‘1À1 Ü1(ç123)2 ]2%i2"2&²2Ù2.ù2(3;3Q32d34—3Ì3 Ý3-é3&4:>4y4Š4§4¬4É4æ4þ4%575V5s55&¦5Í5Ñ5ë5 6*64H67}6µ6 Ç6-è67767M7f7!…7§7 Á7Î7+â7!8A084r8f§89$9;9[9 d9#p9”9®9 Ã96Ï9‘:n˜;Ç=>Ï?#B•2DmÈG@6JwJM4M¯FM$öMN /N$9N"^N/N±NEÃN2 O%]1d]5–]Ì]ì]0^57^(m^F–^Ý^$õ^ _;_R_%m_“_®_ È_ Õ_?á_"!` D` N`Z`2k`ž`²`Ç`Í`/ã`a&1aXaŠka#öa#b>bSb6Xb#b ³b&¿b!æb;c Dc%Pc$vc@›c6Üc.dBdZd tdM•dMãd1e Je9Xe/’e7Âeúe0fFf Nf*Yf„f&¡f&Èf"ïf#g6g(Pg)yg£g%©g.Ïg1þg:0hFkhD²h÷h(i;8i ti€iiºi"×i,úi#'jKj$`j8…j8¾jK÷jFCk€Šk l(lEl dl ql=}l#»l ßl m„-UVÄwRÔ¾³ A`^QuÒ¢x!‡Ž¦ÍsŒ—Ì p¡‰i§>I Ç6µ¬º?“TOm1G\DnÓ} <®+{šcE(ˆN·¥ÏÎH¨¼v~b”oaª;#*X€z2dL•P Zr‘Â0©’$È_ÐqS½Y'Ê8)".B­gË» ²ÑKh£[7fŸƒ…F¤‚lk,ÿ¹3|´&4†°ej/%–9¸ŠC]:JÉ‹œ5¯À@Á±žt¶MWyƘ›Å «™Õ=Prepare volume #%d for %s and hit return: Archive format selection: -V, --label=NAME create archive with volume name NAME -o, --old-archive, --portability write a V7 format archive (not ANSI) -z, --gzip, --ungzip filter the archive through gzip -Z, --compress, --uncompress filter the archive through compress --use-compress-program=PROG filter through PROG (must accept -d) Device blocking: -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes --block-compress block the output of compression for tapes -i, --ignore-zeros ignore blocks of zeros in archive (means EOF) -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes) Device selection and switching: -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME --force-local archive file is local even if has a colon --rsh-command=COMMAND use remote COMMAND instead of rsh -[0-7][lmh] specify drive and density -M, --multi-volume create/list/extract multi-volume archive -L, --tape-length=NUM change tape after writing NUM x 1024 bytes -F, --info-script=FILE run script at end of each tape (implies -M) --new-volume-script=FILE same as -F FILE Handling of file attributes: --atime-preserve don't change access times on dumped files -m, --modification-time don't extract file modified time --same-owner create extracted files with the same ownership -p, --same-permissions extract all protection information --preserve-permissions same as -p -s, --same-order sort names to extract to match aarchive --preserve-order same as -s --preserve same as both -p and -s Informative output: --help print this help, then exit --version print tar program version number, then exit -v, --verbose verbosely list files processed --checkpoint print directory names while reading the archive --totals print total bytes written while creating archive -R, --record-number show record number within archive with each message -w, --interactive ask for confirmation for every action --confirmation same as -w Local file selection: -C, --directory DIR change to directory DIR -T, --files-from=NAME get names to extract or create from file NAME --null -T reads null-terminated names, disable -C --exclude=FILE exclude file FILE -X, --exclude-from=FILE exclude files listed in FILE -P, --absolute-paths don't strip leading `/'s from file names -h, --dereference dump instead the files symlinks point to -l, --one-file-system stay in local file system when creating archive -K, --starting-file=NAME begin at file NAME in the archive -N, --newer=DATE only store files newer than DATE --after-date=DATE same as -N Main operation mode: -t, --list list the contents of an archive -x, --extract, --get extract files from an archive -c, --create create a new archive -d, --diff, --compare find differences between archive and file system -r, --append append files to the end of an archive -u, --update only append files newer than copy in archive -A, --catenate append tar files to an archive --concatenate same as -A --delete delete from the archive (not on mag tapes!) On *this* particular tar, the defaults are -f %s and -b %d. Operation mode modificators: -W, --verify attempt to verify the archive after writing it --remove-files remove files after adding them to the archive -k, --keep-old-files don't overwrite existing files from archive -S, --sparse handle sparse files efficiently -O, --to-stdout extract files to standard output -G, --incremental handle old GNU-format incremental backup -g, --listed-incremental handle new GNU-format incremental backup --ignore-failed-read do not exit with non-zero on unreadable files (core dumped) link to %s n [name] Give a new filename for the next (and subsequent) volume(s) q Abort tar ! Spawn a subshell ? Print this list unknown file type `%c' %c: Argument missing%d at %d %s is not continued on this volume%s is the archive; not dumped%s is the wrong size (%ld != %ld + %ld)%s: %s differs %s: %s: Cannot link to %s, copying instead %s: Could only read %d of %ld bytes %s: Data differs %s: Deleting %s %s: Device numbers changed %s: Does not exist %s: File shrunk by %d bytes, (yark!)%s: Mode or device-type changed %s: No longer a directory %s: No such file or directory %s: Not a regular file %s: Not found in archive%s: Not linked to %s %s: On a different filesystem; not dumped%s: Symlink differs %s: Unknown file type; file ignored%s: is unchanged; not dumped((child)) Pipe to stdin((child)) Pipe to stdout(child) Pipe to stdin(child) Pipe to stdout--Continued at byte %ld-- --Mangled file names-- --Volume Header-- Added write and execute permission to directory %sAmount actually written is (I hope) %d. Archive %s EOF not on block boundaryArchive not labelled to match %sArchive to stdinArchive to stdoutAt beginning of tape, quitting nowBad regular expression: %sBlock %d left Block: %d <= %d Blocksize = %d recordsCannot add file %sCannot allocate %d bytes for restoreCannot allocate buffer spaceCannot change directory to %dCannot change mode of file %s to %loCannot change owner of %s to uid %d gid %dCannot change to directory %dCannot change to directory %sCannot chdir to %sCannot chown file %s to uid %d gid %dCannot close a file #%dCannot close descriptor %dCannot dup %sCannot exec %sCannot exec a shell %sCannot execute remote shellCannot extract `%s' -- file is continued from another volumeCannot forkCannot fork!Cannot keep old files on this systemCannot open %sCannot open a pipeCannot open archive %sCannot open directory %sCannot open file %sCannot read %sCannot read confirmation from userCannot read from compression programCannot read link %sCannot remove %sCannot rename %s to %sCannot seek to %ld in file %sCannot stat %sCannot stat file %sCannot symlink %s to %sCannot update or verify compressed archivesCannot use compressed or remote archivesCannot use multi-volume compressed archivesCannot verify multi-volume archivesCannot verify stdin/stdout archiveCannot write to %sCannot write to compression programChild cannot forkChild died with signal %d%sChild returned status %dCopying %d Could not allocate memory for blocking factor %dCould not allocate memory for diff buffer of %d bytesCould not backspace archive file; it may be unreadable without -iCould not change access and modification times of %sCould not create directory %sCould not create file %sCould not create symlink to %sCould not get current directoryCould not get current directory: %sCould not link %s to %sCould not make %sCould not re-position archive fileCould not rewind archive file for verifyCould not write to file %sCould only write %d of %d bytes to file %sCreating directory:Deleting non-header from archiveDirectory %s has been renamedDirectory %s is newEOF in archive fileEOF? What does that mean?Error while closing %sError while deleting %sFile %s File %s File %s shrunk by %d bytes, padding with zerosFile name %s%s too longFinal %d Flush it Flush... Flushing %d recs from %s Fore to %x Garbage commandGidHeader type %d Hmm, this doesn't look like a tar archiveInvalid date format `%s'Invalid value for blocksizeJunk files Mandatory or optional arguments to long options are mandatory or optional for short options too. Missing file name after -CMissing filename after -CMod timeModeMultiple archive files requires --multi-volumeNeed %d kept_in %d keep %d New block No archive name given, what should I do?No new volume; exiting. Now new %d need %d keep %d keep_in %d rec %d/%d Omitting %sOnly one compression option permittedOnly read %d bytes from archive %sOnly wrote %ld of %ld bytes to file %sOnly wrote %u of %u bytes to %sOptions [0-7][lmh] not supported by *this* tarOut of first loop Premature end of fileRead checkpoint %dRead error at byte %ld reading %d bytes in file %sRead error at byte %ld, reading %d bytes, in file %sRead error on %sReading %s Removing drive spec from names in the archiveRemoving leading / from absolute linksRemoving leading / from absolute path names in the archiveRenamed %s to %sSaved %d recs, need %d more SizeSkip %ld ##################Skipping to next file headerSkipping to next headerSymlinked %s to %sThis does not look like a tar archiveThis volume is out of sequenceToo many args with -T optionToo many errors, quittingTotal bytes written: %d Try `%s --help' for more information. UidUnexpected EOF in archiveUnexpected EOF in mangled namesUnexpected EOF on archive fileUnknown demangling command %sUnknown file type '%c' for %s, diffed as normal fileUnknown file type '%c' for %s, extracted as normal fileUnknown option %cUsage: %s [OPTION]... [FILE]... VERIFY FAILURE: %d invalid header(s) detectedVerify Visible long name errorVisible longname errorVolume mismatch! %s!=%sWARNING: Archive is incompleteWARNING: Cannot close %s (%d, %d)WARNING: No volume headerWrite block Write checkpoint %dWrite to compression program short %d bytesWrote %ld of %ld bytes to file %sYou may not specify more than one of the r, c, t, x, or d optionsYou must specify one of the r, c, t, x, or d optionsYou must use a compression option (--gzip, --compress or --use-compress-program) with --block-compress[child] Pipe to stdin[child] Pipe to stdoutexec/tcp: Service not availablefile %s rec %10ld: rmtd: Cannot allocate buffer space rmtd: Garbage command %c rmtd: Premature eof tar (child)Preparar o volume no. %d para %s e premir "Return": Selecção do formato do arquivo: -V, --label=NOME criar o arquivo com um NOME de volume -o, --old-archive, --portability produzir um arquivo V7 (não-ANSI) -z, --gzip, --ungzip utilizar "gzip»" como filtro -Z, --compress, --uncompress utilizar "compress»" como filtro --use-compress-program=PROG utilizar PROG (tem que aceitar -d) como filtro Blocos no periférico ("device") : -b, --block-size=BLOCO utilizar blocos de BLOCO x 512 "bytes" --block-compress dividir em blocos o resultado da compressão para fitas magnéticas. -i, --ignore-zeros ignorar os blocos de zeros (implicam fim-de-ficheiro) -B, --read-full-blocks dividir a leitura em blocos (para os "pipes»" 4.2BSD) Escolha do periférico e mudanças de fita magnética: -f, --file=[MÁQUINA:]FICHEIRO tratar o arquivo FICHEIRO, na máquina MÁQUINA --force-local tratar um arquivo local, mesmo se ":»" --rsh-command=COMANDO substituir "rsh»" por COMANDO -[0-7][lmh] escolher o periférico e a densidade -M, --multi-volume tratar arquivos multi-volume -L, --tape-length=NÚMERO tratar NÚMERO x 1024 "bytes" por fita magnética -F, --info-script=FICHEIRO executar FICHEIRO nas mudanças de fita magnética (força a escolha de "-M»") --new-volume-script=FICHEIRO o mesmo que "-F FICHEIRO»" Atributos dos ficheiros: --atime-preserve ao guardar, preservar as de acesso -m, --modification-time na extracção, ignorar a data de modificação --same-owner na extracção, manter os mesmos donos ("owner") -p, --same-permissions na extracção, manter as mesmas protecções --preserve-permissions o mesmo que "-p" -s, --same-order ordernar os nomes a extrair segundo a sua ordem no arquivo --preserve-order o mesmo que "-s" --preserve o mesmo que "-p" conjugado com "-s" Saídas informativas: --help mostrar esta mensagem de ajuda e terminar --version indicar a versão do programa e terminar -v, --verbose escrever a lista dos ficheiros tratados --checkpoint indicar os nomes dos directórios durante a leitura --totals indicar o número de "bytes" escritos durante a criação -R, --record-number escrever a posição no arquivo em cada mensagem -w, --interactive pedir confirmação para todas as acções --confirmation o mesmo que "-w" Selecção local de ficheiros: -C, --directory=DIRECTÓRIO mudar para o DIRECTÓRIO indicado -T, --files-from=NOME obter do ficheiro NOME a lista de ficheiros a criar ou extrair --null faz que "-T" leia nomes terminados por NULO, também inibe "-C" --exclude=FICHEIRO excluir o FICHEIRO indicado -X, --exclude-from=FICHEIRO excluir os ficheiros fornecidos no FICHEIRO -P, --absolute-paths preservar os "/»" iniciais nos nomes dos ficheiro -h, --dereference usar os ficheiros apontados pelas ligações simbólicas -l, --one-file-system manter-se no sistema de ficheiros local durante a criação do arquivo -K, --starting-file=NOME começar pelo ficheiro NOME, no arquivo -N, --newer=DATA só guardar ficheiros mais recentes do que DATA --after-date=DATA o mesmo que "-N" Principal modo de funcionamento: -t, --list inventário do arquivo -x, --extract, --get extrair ficheiros do arquivo -c, --create criar um novo arquivo -d, --diff, --compare comparar o arquivo com os actuais ficheiros -r, --append acrescentar os ficheiros no fim do arquivo -u, --update só acrescentar os ficheiros mais novos do que as versões presentes no arquivo -A, --catenate juntar outros arquivos "tar" ao arquivo --concatenate o mesmo que "-A" --delete apagar no arquivo (execpto para fitas magnéticas!) Neste "tar" específico tem-se, por defeito, "-f %s" e "-b %d". Modificadores do modo de funcionamento: -W, --verify tentar verificar o arquivo depois de o escrever --remove-files apagar os ficheiros depois de serem guardados no arquivo -k, --keep-old-files na extracção, não destruir nenhum ficheiro -S, --sparse tratar eficientemente ficheiros dispersos (os que têm buracos) -O, --to-stdout extrair os ficheiros para o "stdout" -G, --incremental tratar um arquivo no velho formato incremental GNU -g, --listed-incremental tratar arquivo no novo formato incremental GNU --ignore-failed-read ignorar os ficheiros que não se consegue ler. (imagem da memória despejada) ligação para %s n [nome] Escolher um novo nome para os volumes qui suivront q Terminar a execução de "tar" ! Executar uma "sub-shell" ? Escrever esta lista tipo de ficheiro desconhecido "%c" %c: Falta argumento%d em %d %s não tem continuidade neste volume%s é o arquivo; não será arquivado%s não é a dimensão correcta (%ld != %ld + %ld)%s: %s diferente %s: %s: Não é possível fazer ligação para %s, em vez disso, copia-se %s: So se pôde ler %d de um total de %ld "bytes" %s: Os dados são diferentes %s: Apaga-se %s %s: Os números do periférico mudaram %s: Não existe %s: O ficheiro diminui em %d bytes, (desgraça!)%s: O modo ou o tipo de periférico mudou %s: Já não é um directório %s: Ficheiro, ou directório, não existe %s: Não é um ficheiro normal %s: Não foi encontrado no arquivo%s: Não está ligado a %s %s: Está num outro sistema de ficheiros; não será arquivado%s: Ligação ("link") simbólica é diferente %s: Tipo de ficheiro desconhecido; ficheiro ignorado%s: não foi modificado; não será arquivado((filho)) "pipe" para "stdin"((filho)) "pipe" para "stdout"(filho) "pipe" para "stdin"(filho) "pipe" para "stdout"--Continua no "byte" %ld-- --Nomes de ficheiros truncados-- --Cabeçalho de volume-- Acrescentaram-se permissões de escrita e de leitura ao directório %sA quantidade realmente escrita é %d (esperemos!). O fim-de-ficheiro do arquivo %s não se encontra na fronteira de um blocoO arquivo não tem etiqueta e não condiz com %sArquivo para stdinArquivo para stdoutNo princípio da fita, pára-se imediatamenteExpressão regular errada: %sDeixou-se o bloco %d Bloco: %d <= %d Tamanho do bloco = %d registosNão é possível acrescentar o ficheiro %sNão se consegue reservar %d bytes para a recuperaçãoNão se consegue reservar espaço temporário ("buffer")Não se pode mudar directório para %dNão se pode mudar o modo do ficheiro %s para %loNão se pode mudar o dono de %s para "uid" %d "gid" %dNão se pode mudar para o directório %dNão se pode mudar para o directório %sNão se pode mudar para o directório %sNão se pode mudar o dono de %s para "uid" %d "gid" %dNão se consegue fechar o ficheiro de descritor %dNão se consegue fechar o ficheiro de descritor %dNão se consegue duplicar %s com "dup"Não se consegue executar %sNão se consegue executar uma "shell" %sNão se consegue executar uma "shell" remotaNão se consegue extrair "%s" -- o ficheiro começa num outro volumeNão se consegue criar processo ( "fork" )Não se consegue criar processo! ( "fork" )Não se consegue manter os ficheiros antigos neste sistemaNão se consegue abrir %sNão se consegue abrir um "pipe"Não se consegue abrir o arquivo %sNão se consegue abrir o directório %sNão se consegue abrir o ficheiro %sNão se consegue ler %sNão se consegue obter confirmação, do utilizadorNão se consegue ler do programa de compressãoNão se consegue ler a ligação ("link") %sNão se consegue apagar %sNão se consegue mudar o nome de %s para %sNão se consegue mudar ("seek") para a posição %ld do ficheiro %sNão se consegue executar "stat" para %sNão se consegue executar "stat" para o ficheiro %sNão se pode criar uma ligação ("link") simbólica de %s para %sNão se pode actualizar o verificar um arquivo comprimidoNão se pode usar arquivos comprimidos ou remotosNão se pode de usar arquivos multi-volume comprimidosNão se pode verificar arquivos multi-volumeNão se pode de verificar arquivos stdin ou stdoutNão se consegue escrever em %sNão se consegue escrever para o programa de compressãoProcesso filho não consegue executar "fork"Processo filho morreu com o sinal %d%sProcesso filho terminou com estado %dCopia de %d (FIXME)Não se conseguiu reservar memória para um factor de bloco %dNão se conseguiu reservar memória para um "buffer" de comparação, de %d "bytes"Não se consegue recuar o ficheiro de arquivo; poderá ser ilegível sem "-i"Não se conseguiu modificar os tempos de acesso e modificação de %sNão se conseguiu criar o directório %sNão se conseguiu criar o ficheiro %sNão se conseguiu criar uma ligação ("link") simbólica para %sNão se conseguiu determinar o directório correnteNão se conseguiu determinar o directório corrente: %sNão se conseguiu ligar %s a %sNão se conseguiu fazer %sNão se conseguiu reposicionar o ficheiro arquivoNão se conseguiu rebobinar o arquivo para verificaçãoNão se conseguiu escrever no ficheiro %sSó se conseguiu escrever %d "bytes" de um total de %d, no ficheiro %sCriação de directório::Apaga-se do arquivo um não-cabeçalhoMudou-se o nome do directório %sO directório %s é novoFim-de-ficheiro no arquivoFim-de-ficheiro? Que significa isto?Erro durante o fecho de %sErro quando se apagava %sFicheiro %s Ficheiro %sO ficheiro %s diminuiu em %d "bytes", será completado com zerosNome de ficheiro %s%s longo demaisFinal %d Esvazia-lo Esvaziamento... Estão-se a esvaziar %d registos de um total de %s Fore to %x (FIXME)Comando desconhecido"Gid"Tipo de cabeçalho %d Pois é..., isto não parece ser um arquivo "tar"Formato de data inválido "%s"Valor inválido para o tamanho do blocoFicheiros de lixo Os argumentos obrigatórios ou opcionais para as opções longas também são obrigatórios ou opcionais para as correspondentes opções curtas. Falta um nome de ficheiro após "-C"Falta um nome de ficheiro após "-C"Tempo de modificaçãoModoMúltiplos ficheiros de arquivo exigem "--multi-volume"Need %d kept_in %d keep %d (FIXME)Novo bloco Não deram nome de arquivo, que fazer?Não há novo volume; termina-se. Now new %d need %d keep %d keep_in %d rec %d/%d (FIXME)Omite-se %sSó se permite uma opção de compressãoSó se leram %d "bytes" do arquivo %sSó se escreveram %ld "bytes" de um total de %ld no ficheiro %sSó se escreveram %ld "bytes" de um total de %ld em %sAs opções [0-7][lmh] não funcionam neste "tar"Fora do primeiro ciclo Fim-de-ficheiro prematuroLeu-se o ponto de verificação %dErro de leitura no "byte" %ld, durante a leitura de %d "bytes" do ficheiro %sErro de leitura no "byte" %ld, durante a leitura de %d "bytes" do ficheiro %sErro de leitura sobre %sLeitura de %sRetira-se a especificação do "drive" aos nomes no arquivoRetira-se "/" das ligações ("links") absolutas Vai-se retirar os "/" dos nomes absolutos de ficheiro. Mudou-se o nome %s para %sGuardaram-se %d registos, ainda são precisos %d TamanhoSalta %ld Salta para o próximo cabeçalho de ficheiroSalta para próximo cabeçalho%s ligado simbolicamente a %s ("link")Isto não se parece a um arquivo "tar"Este volume está fora da sequênciaArgumentos demais para a opção "-T"Erros de mais: termina-seNúmero total de de "bytes" escritos: %d Para mais informação, tente "%s --help". "Uid"Fim de ficheiro inesperado no arquivoFim de ficheiro inesperado nos nomes truncadosFim de ficheiro inesperado no ficheiro de arquivoComando desconhecido "%s" para decifrar os nomes truncadosTipo de ficheiro "%c»" desconhecido, comparado como um ficheiro normalTipo de ficheiro "%c" desconhecido, extraído como um ficheiro normalOpção "%c" desconhecidaUtilização: %s [OPÇÃO]... [FICHEIRO]... ERRO DE VERIFICAÇÃO: Encontraram-se %d cabeçalhos inválidosVerificaçãoErro evidente num nome longoErro evidente num nome longoO volume não condiz! %s!=%sATENÇÃO: O arquivo está incompletoATENÇÃO: Não se consegue fechar %s (%d, %d)ATENÇÃO: Não há cabeçalho de volumeEscreve-se o bloco Escreve-se o ponto de vericicação %dFaltou escrever %d "bytes" para o programa de compressãoEscreveram-se no ficheiro %ld "bytes" de um total de %ldNão se deve escolher mais do que uma das opções "r", "c", "t", "x" ou "d"Deve-se escolher pelo menos uma das opções "r", "c", "t", "x" ou "d"Deve-se utilizar uma aes opções de compressão "--gzip", "--compress" ou "--use-compress-program", com a opção "--block-compress"[filho] "Pipe»" para o stdin[filho] "Pipe" para o stdoutexec/tcp: Serviço indisponívelficheiro %s reg %10ld: rmtd: Não se consegue reservar espaco temporário ("buffers") rmtd: Comando "%c" não faz sentido rmtd: Fim de ficheiro prematuro tar (filho)tar-1.11.8/po/sv.gmo 644 625 1 63335 5770103600 7177 Þ•ÕÄ%l +‡,-´Kâ.7Æ9-=. Pl ½" Ì"—Ù"q#Š# Ÿ#"©#Ì#'ê#$+"$$N$s$…$–$²$$Æ$ ë$ %'%F%^%w%)%·%#Ì%ð% &%&>&T&k&†&ž&2±&(ä&$ ' 2'S'd'"v'™'´'Ã'Õ'$ì'(.($L(*q(œ(º(Ø(%ë())) D)R)a)x)<”) Ñ) Ý)$ê)**1*H*a*u*"„*$§*Ì*à*ñ*+&+5+I++a+(++¶+#â+",),#<,`,r,Ž, §,0³,5ä,A-4\-‘-¯-È-ç-#.+.C."U.(x.¡.*¼.ç. û./:/N/b/}/”/¬/µ/.¾/í/ 0 0 0#0 =0I0Y0]0)m0—0°0 Ì0aØ0:1U1o1x1.}1¬1 È1(Ó1ü132 I2%U2"{2&ž2Å2.å23'3=32P34ƒ3¸3 É3-Õ3&4:*4e4v4“4 ˜4¢4¿4×4%ê45/5L5f5&5¦5ª5Ä5ä564!67V6Ž6  6-Á6ï6÷67&7?7!^7€7 š7§7+»7!ç7A 84K8f€8ç8ý89'9G9 P9#\9€9š9 ¯94»9uð9Jf;…±<[7?+“A¿C-ÜFG I›RIîKÿK–L¥L¹L ÍL ØLùL%M>M2SM'†M®MÅM ÖM÷M* N'6N^N/}N­NÅNáN*úN%O!CO!eO ‡O!¨OÊOéOP'P;P=KP1‰P,»P1èPQ1Q!HQjQŠQ™Q«Q-ÇQ%õQ R/L^ ‹^)˜^&Â^,é^$_A;_}_—_®_<Å_2` 5` A`)K`)u`4Ÿ`Ô`-í`a#a$4a!Ya{a%˜a&¾a!åab"!b-Dbrbxb’b°bÍb3éb6cTc%dc2Šc ½cÊcàcöc!d$8d]dwd†d@Ÿd%àd;e1Bemteâef f&=fdf lf xf™f´f Òfƒ-TUÃvQÔ½² @_]PtÒÊ¡w!†¥Ìr‹–Ë o®ˆh¦~=H Æ6´«¹>’SNl1F[CmÓ| ;­+zŽ™bÎD(‡M¶¤ÏÍG§»u}a“n`©:#*Wy2cÐK”O YqÁ0¨‘$Ç^ªpR¼€X'É)".A¬ fkœºŸ±ÑJg¢Z7ež‚„E£j,¾¸3{³&4…¯di/%•8·‰B\9IŒÈŠ›5¿?À°sµLVxÅ—šÄ ˜Õ<Prepare volume #%d for %s and hit return: Archive format selection: -V, --label=NAME create archive with volume name NAME -o, --old-archive, --portability write a V7 format archive (not ANSI) -z, --gzip, --ungzip filter the archive through gzip -Z, --compress, --uncompress filter the archive through compress --use-compress-program=PROG filter through PROG (must accept -d) Device blocking: -b, --block-size=BLOCKS block size of BLOCKS x 512 bytes --block-compress block the output of compression for tapes -i, --ignore-zeros ignore blocks of zeros in archive (means EOF) -B, --read-full-blocks reblock as we read (for reading 4.2BSD pipes) Device selection and switching: -f, --file=[HOSTNAME:]FILE use archive file or device FILE on HOSTNAME --force-local archive file is local even if has a colon --rsh-command=COMMAND use remote COMMAND instead of rsh -[0-7][lmh] specify drive and density -M, --multi-volume create/list/extract multi-volume archive -L, --tape-length=NUM change tape after writing NUM x 1024 bytes -F, --info-script=FILE run script at end of each tape (implies -M) --new-volume-script=FILE same as -F FILE Handling of file attributes: --atime-preserve don't change access times on dumped files -m, --modification-time don't extract file modified time --same-owner create extracted files with the same ownership -p, --same-permissions extract all protection information --preserve-permissions same as -p -s, --same-order sort names to extract to match archive --preserve-order same as -s --preserve same as both -p and -s Informative output: --help print this help, then exit --version print tar program version number, then exit -v, --verbose verbosely list files processed --checkpoint print directory names while reading the archive --totals print total bytes written while creating archive -R, --record-number show record number within archive with each message -w, --interactive ask for confirmation for every action --confirmation same as -w Local file selection: -C, --directory DIR change to directory DIR -T, --files-from=NAME get names to extract or create from file NAME --null -T reads null-terminated names, disable -C --exclude=FILE exclude file FILE -X, --exclude-from=FILE exclude files listed in FILE -P, --absolute-paths don't strip leading `/'s from file names -h, --dereference dump instead the files symlinks point to -l, --one-file-system stay in local file system when creating archive -K, --starting-file=NAME begin at file NAME in the archive -N, --newer=DATE only store files newer than DATE --after-date=DATE same as -N Main operation mode: -t, --list list the contents of an archive -x, --extract, --get extract files from an archive -c, --create create a new archive -d, --diff, --compare find differences between archive and file system -r, --append append files to the end of an archive -u, --update only append files newer than copy in archive -A, --catenate append tar files to an archive --concatenate same as -A --delete delete from the archive (not on mag tapes!) On *this* particular tar, the defaults are -f %s and -b %d. Operation mode modificators: -W, --verify attempt to verify the archive after writing it --remove-files remove files after adding them to the archive -k, --keep-old-files don't overwrite existing files from archive -S, --sparse handle sparse files efficiently -O, --to-stdout extract files to standard output -G, --incremental handle old GNU-format incremental backup -g, --listed-incremental handle new GNU-format incremental backup --ignore-failed-read do not exit with non-zero on unreadable files (core dumped) link to %s n [name] Give a new filename for the next (and subsequent) volume(s) q Abort tar ! Spawn a subshell ? Print this list unknown file type `%c' %c: Argument missing%d at %d %s is not continued on this volume%s is the archive; not dumped%s is the wrong size (%ld != %ld + %ld)%s: %s differs %s: %s: Cannot link to %s, copying instead %s: Could only read %d of %ld bytes %s: Data differs %s: Deleting %s %s: Device numbers changed %s: Does not exist %s: File shrunk by %d bytes, (yark!)%s: Mode or device-type changed %s: No longer a directory %s: No such file or directory %s: Not a regular file %s: Not found in archive%s: Not linked to %s %s: On a different filesystem; not dumped%s: Symlink differs %s: Unknown file type; file ignored%s: is unchanged; not dumped((child)) Pipe to stdin((child)) Pipe to stdout(child) Pipe to stdin(child) Pipe to stdout--Continued at byte %ld-- --Mangled file names-- --Volume Header-- Added write and execute permission to directory %sAmount actually written is (I hope) %d. Archive %s EOF not on block boundaryArchive not labelled to match %sArchive to stdinArchive to stdoutAt beginning of tape, quitting nowBad regular expression: %sBlock %d left Block: %d <= %d Blocksize = %d recordsCannot allocate %d bytes for restoreCannot allocate buffer spaceCannot change directory to %dCannot change mode of file %s to %loCannot change owner of %s to uid %d gid %dCannot change to directory %dCannot change to directory %sCannot chdir to %sCannot chown file %s to uid %d gid %dCannot close a file #%dCannot close descriptor %dCannot dup %sCannot exec %sCannot exec a shell %sCannot execute remote shellCannot extract `%s' -- file is continued from another volumeCannot forkCannot fork!Cannot keep old files on this systemCannot open %sCannot open a pipeCannot open archive %sCannot open directory %sCannot open file %sCannot read %sCannot read confirmation from userCannot read from compression programCannot read link %sCannot remove %sCannot rename %s to %sCannot seek to %ld in file %sCannot stat %sCannot stat file %sCannot symlink %s to %sCannot update or verify compressed archivesCannot use compressed or remote archivesCannot use multi-volume compressed archivesCannot verify multi-volume archivesCannot verify stdin/stdout archiveCannot write to %sCannot write to compression programChild cannot forkChild died with signal %d%sChild returned status %dCopying %d Could not allocate memory for blocking factor %dCould not allocate memory for diff buffer of %d bytesCould not backspace archive file; it may be unreadable without -iCould not change access and modification times of %sCould not create directory %sCould not create file %sCould not create symlink to %sCould not get current directoryCould not get current directory: %sCould not link %s to %sCould not make %sCould not re-position archive fileCould not rewind archive file for verifyCould not write to file %sCould only write %d of %d bytes to file %sCreating directory:Deleting non-header from archiveDirectory %s has been renamedDirectory %s is newEOF in archive fileEOF? What does that mean?Error while closing %sError while deleting %sFile %s File %s File %s shrunk by %d bytes, padding with zerosFile name %s%s too longFinal %d Flush it Flush... Flushing %d recs from %s Fore to %x Garbage commandGidHeader type %d Hmm, this doesn't look like a tar archiveInvalid date format `%s'Invalid value for blocksizeJunk files Mandatory or optional arguments to long options are mandatory or optional for short options too. Missing file name after -CMissing filename after -CMod timeModeMultiple archive files requires --multi-volumeNeed %d kept_in %d keep %d New block No archive name given, what should I do?No new volume; exiting. Now new %d need %d keep %d keep_in %d rec %d/%d Omitting %sOnly one compression option permittedOnly read %d bytes from archive %sOnly wrote %ld of %ld bytes to file %sOnly wrote %u of %u bytes to %sOptions [0-7][lmh] not supported by *this* tarOut of first loop Premature end of fileRead checkpoint %dRead error at byte %ld reading %d bytes in file %sRead error at byte %ld, reading %d bytes, in file %sRead error on %sReading %s Removing drive spec from names in the archiveRemoving leading / from absolute linksRemoving leading / from absolute path names in the archiveRenamed %s to %sSaved %d recs, need %d more SizeSkip %ld Skipping to next file headerSkipping to next headerSymlinked %s to %sThis does not look like a tar archiveThis volume is out of sequenceToo many args with -T optionToo many errors, quittingTotal bytes written: %d Try `%s --help' for more information. UidUnexpected EOF in archiveUnexpected EOF in mangled namesUnexpected EOF on archive fileUnknown demangling command %sUnknown file type '%c' for %s, diffed as normal fileUnknown file type '%c' for %s, extracted as normal fileUnknown option %cUsage: %s [OPTION]... [FILE]... VERIFY FAILURE: %d invalid header(s) detectedVerify Visible long name errorVisible longname errorVolume mismatch! %s!=%sWARNING: Archive is incompleteWARNING: Cannot close %s (%d, %d)WARNING: No volume headerWrite block Write checkpoint %dWrite to compression program short %d bytesWrote %ld of %ld bytes to file %sYou may not specify more than one of the r, c, t, x, or d optionsYou must specify one of the r, c, t, x, or d optionsYou must use a compression option (--gzip, --compress or --use-compress-program) with --block-compress[child] Pipe to stdin[child] Pipe to stdoutcannot add file %sexec/tcp: Service not availablefile %s rec %10ld: rmtd: Cannot allocate buffer space rmtd: Garbage command %c rmtd: Premature eof tar (child)Förbered volym nummer %d för %s och tryck `Return': Val av arkivformat: -V, --label=NAMN Skapa ett arkiv med volymnamn NAMN -o, --old-archive, --portability skapa ett arkiv i V7 format (ej ANSI) -z, --gzip, --ungzip sänd arkivet till `gzip' -Z, --compress, --uncompress sänd arkivet till`compress' --use-compress-program=PROG sänd arkivet till PROG (måste förstå -d) Blockhantering: -b, --block-size=BLOCK använd blockstorlek BLOCK x 512 oktetter --block-compress blocka resultatet från komprimering (för band) -i, --ignore-zeros ignorera block som innehåller nolltecken (betyder filslut) -B, --read-full-blocks omblocka vid läsning (för 4.2BSD `pipes') Enhetsval och enhetsbyte: -f, --file=[MASKIN:]FIL ange arkivfil eller enhet FIL på MASKIN --force-local arkivfil är lokal även om den innehåller : --rsh-command=KOMMANDO ersätt `rsh' med KOMMANDO -[0-7][lmh] ange enhet och densitet -M, --multi-volume behandla arkivet som ett flervolymsarkiv -L, --tape-length=NUMMER byt band efter det att NUMMER x 1024 oktetter skrivits -F, --info-script=FIL kör kommandofil FIL vid slutet av varje band (-M flaggan sätts också) --new-volume-script=FIL samma som -F FIL Hantering av filattribut: --atime-preserve ändra inte åtkomsttider på filer som arkiverats -m, --modification-time extrahera inte modifieringstiden på filer --same-owner filer som extraherats får samma ägare som i arkivet -p, --same-permissions extrahera all åtkomstinformation för filer --preserve-permissions samma som -p -s, --same-order sortera de namn som ska extraheras så de passar ihop med arkivet --preserve-order sammas som -s --preserve sammas som -p och -s Utskrift av information: --help visa denna hjälp text och terminera --version visa version på programmet och terminera -v, --verbose visa information om varje fil som behandlas --checkpoint visa filkatalogsnamn när arkivet läses --totals visa totala antalet oktetter skrivna när arkivet skapas -R, --record-number lägg till `record' nummer i arkivet till varje meddelande -w, --interactive fråga efter bekräftelse för varje operation --confirmation samma som -w Välja lokala filer: -C, --directory=KATALOG byt filkatalog till KATALOG -T, --files-from=NAMN hämta namn att extrahera eller arkivera från filen NAMN --null -T läser namn åtskiljda med nolltecken -C tas som en vanlig fil --exclude=FIL tag inte med filen FIL -X, --exclude-from=FIL tag inte med filer namngivna i filen FIL -P, --absolute-paths tag inte bort inledande / från filnamn -h, --dereference arkivera det symboliska länkar pekar till -l, --one-file-system byt inte filsystem när arkivet skapas -K, --starting-file=NAMN börja med filen NAMN i arkivet -N, --newer=DATUM arkivera endast filer som är nyare än DATUM --after-date=DATUM samma som -N Operationsläge: -t, --list visa inehållet i arkivet -x, --extract, --get extrahera filer från arkivet -c, --create skapa ett nytt arkiv -d, --diff, --compare visa skillnader mellan arkivet och filsystemet -r, --append lägg till filer på slutet av arkivet -u, --update lägg endast till filer som är nyare än de i arkivet -A, --catenate lägg till en arkivfil till arkivet --concatenate samma som -A --delete ta bort från arkivet (inte för arkiv på band!) På denna implementation av tar så är standardvärdena -f %s och -b %d. Modifierare för operationslägen: -W, --verify försök verifiera arkivet efter det skapats --remove-files ta bort filer efter de lagts till arkivet -k, --keep-old-files skriv inte över existerade filer med filer från arkivet -S, --sparse specialhantera filer med hål (mer effektivt) -O, --to-stdout extrahera filer till standard ut -G, --incremental hantera gamla GNU formatet för inkrementell säkerhetskopiering -g, --listed-incremental hantera nya GNU formatet för inkrementell säkerhetskopiering --ignore-failed-read ignorera filer som inte kan läsas (minnet sparat) länk till %s n [NAMN] Ge ett filnam för nästa (och efterföljande) volym(er) q Avbryt tar ! Starta ett `shell' ? Skriv denna lista okänd filtyp `%c' %c: Argument saknas%d vid %d %s fortsätter inte i denna volym%s är arkivet; inget arkiverat%s har fel storlek (%ld != %ld + %ld)%s: %s är inte lika %s: %s: Kan inte länka till %s, kopierar istället %s: Kunde bara läsa %d av %ld oktetter %s: Data är inte lika %s: Tar bort %s %s: Enhetsnummer ändrade på sig %s: Existerar inte %s: Filen krympte med %d oktetter, (huga!)%s: Mod eller enhetstyp ändrade på sig %s: Inte längre en filkatalog %s: Det finns ingen sådan fil eller filkatalog %s: Inte en normal fil %s: Hittades inte i arkivet%s: Inte länkad till %s %s: På ett annat filsystem; inte arkiverad%s: Symbolisk länk inte lika %s: Okänd filtyp; filen ignorerad%s: är oförändrad; inte arkiverad((barn)) `Pipe' till standard in((barn)) `Pipe' till standard ut (barn) `Pipe' till standard in(barn) `Pipe' till standard ut--Fortsätter vid oktett %ld-- --Kodade filnamn-- --Volymhuvud-- Lade till skriv och exekveringsrättigheter till filkatalog %sMängd som verkligen skrivits är %d (hoppas jag). I arkiv %s är inte filslut vid en blockgränsArkivet är inte etiketterad för att stämma med %sArkiv till standard inArkiv till standard utVid bandets början, terminerar nuOtillåtet reguljärt uttryck: %sBlock %d kvar Block: %d <= %d Blockstorlek = %d `records'Kan inte allokera %d oktetter för återtagningKan inte allokera plats för buffertarKan inte gå till filkatalogen %dKan inte ändra rättigheter på filen %s till %loKan inte ändra ägare för %s till `uid' %d och `gid' %dKan inte gå till filkatalogen %dKan inte gå till filkatalogen %sKan inte gå till filkatalogen %sKan inte ändra ägare för fil %s till `uid' %d och `gid' %dKan inte stänga fil #%dKan inte stänga filnummer %dKan inte skapa nytt filnummer för %s med `dup'Kan inte exekvera %sKan inte exekvera ett `shell' %sKan inte exekvera `remote shell'Kan inte extrahera `%s' -- filen fortsätter från en tidigare volymKan inte skapa ny process med `fork'Kan inte skapa ny process med `fork'!Kan inte behålla gamla filer på detta systemKan inte öppna %sKan inte skapa en `pipe'Kan inte öppna arkivet %sKan inte öppna filkatalogen %sKan inte öppna filen %sKan inte läsa %sKan inte läsa bekräftelse från användarenKan inte läsa från komprimeringsprogrammetKan inte läsa länk %sKan inte ta bort %sKan inte byta namn på %s till %sKan inte söka till position %ld i filen %sKan inte göra `stat' på %sKan inte göra `stat' på filen %sKan inte skapa en symbolisk länk från %s till %sKan inte uppdatera eller verifiera komprimerade arkivKan inte använda komprimerade eller icke lokala arkivKan inte använda komprimerade flervolymsarkivKan inte verifiera flervolymsarkivKan inte verifiera standard in/ut arkivKan inte skriva till %sKan inte skriva till kompressionsprogrammetBarnet kan inte utföra `fork'Barnet dog med signal %d%sBarnet terminerade med status %dKopierar %d Kunde inte allokera minne för blockfaktor %dKunde inte allokera minne för differensbuffert av storlek %d oktetterKunde inte backa tillbaka i arkivfilen; den kan vara oläsbar utan -iKunde inte ändra åtkomst och modifieringstid för %sKunde inte skapa filkatalog %sKunde inte skapa fil %sKunde inte skapa symbolisk länk till %sKunde inte komma åt namnet på nuvarande filkatalogKunde inte komma åt namnet på nuvarande filkatalog: %sKunde inte länka %s till %sKunde inte skapa %sKunde inte byta position i arkivfilenKunde inte gå till början på arkivfilen för verifikationKunde inte skriva till filen %sKunde bara skriva %d av %d oktetter till filen %sSkapar filkatalog:Tar bort icke huvuddata från arkivetFilkatalogen %s har bytt namnFilkatalogen %s är nyFilslut i arkivfilenFilslut? Vad betyder det?Fel inträffade vid stängning av %sFel inträffade vid borttagning av %sFil %s Fil %sFilen krympte med %d oktetter, fyller ut med nollteckenFilnamnet %s%s är för långtSista %d Spolar ut den Spolar ut... Spolar ut %d `records' från %s Framåt till %x Okänt kommando`Gid'Huvudtyp %d Hmm, det här ser inte ut som ett `tar' arkivOgiltigt format för datum `%s'Ogiltigt värde för blockstorlekSkräpfiler Obligatoriska eller icke obligatoriska argument för långa flaggor är obligatoriska respektive icke obligatoriska även för korta flaggor. Filnamn efter -C saknasFilnamn efter -C saknasModifieringstidModMultipla arkivfiler kräver --multi-volumeBehöver %d sparat i block %d sparade %d Nytt block Inget arkivnamn givet, vad ska jag göra?Ingen ny volym; terminerar. Nu nya %d behöver %d sparat %d sparat i block %d rec %d/%d Utelämnar %sEndast en komprimeringsflagga är tillåtenLäste bara %d oktetter från arkivet %sSkrev bara %ld av %ld oktetter till filen %sSkrev bara %u av %u oktetter till %sFlaggorna [0-7][lmh] finns inte i den här implementationen av tarUt ur den första slingan Filslut kom för tidigtLäser kontrollpunkt %dLäsfel vid oktett %ld vid läsning av %d oktetter från fil %sLäsfel vid oktett %ld, läste %d oktetter, i fil %sLäsfel i %sLäser %s Tar bort enhetsnamn från namnen i arkivetTar bort inledande / från absoluta länkarTar bort inledande / från absoluta filnamn i arkivetBytte namn på %s till %sSparade %d `records', behöver ytterligare %d StorlekHoppar över %ld Hoppar över data till nästa filhuvudHoppar över data till nästa huvud%s symboliskt länkad till %sDet här ser inte ut som ett tar arkivDenna volym kommer inte i rätt ordningFör många argument med -T flagganFör många fel, terminerarTotalt antal oktetter skrivna: %d Gör `%s --help' för ytterligare information. `Uid'Oväntat filslut i arkivetOväntat filslut i kodade namnOväntat filslut i arkivfilenOkänt avkodningskommando %sOkänd filtyp `%c' för %s, jämförd som en normal filOkänd filtyp `%c' för %s, extraherad som en normal filOkänd flagga %cAnvändning: %s [FLAGGOR]... [FIL]... VERIFIKATIONSFEL: %d okända arkivhuvuden upptäcktaVerifikationFel på ett långt namnFel på ett långt namnVolymerna stämmer inte! %s!=%sVARNING: Arkivet är ofullständigtVARNING: Kan inte stänga %s (%d, %d)VARNING: Inget volymhuvudSkriver block Skriver kontrollpunkt %dSkrivning till kompressionsprogrammet skrev %d oktetter för liteSkrev %ld av %ld oktetter till fil %sDu kan inte ange mer än en av r, c, t, x, eller d flaggornaDu måste ange en av r, c, t, x, eller d flaggornaDu måste ange ett komprimeringsprogram (--gzip, --compress eller --use-compress-program) med --block-compress[barn] `Pipe' till standard in[barn] `Pipe' till standard utkan inte lägga till filen %sexec/tcp: Servicen är inte tillgängligfil %s rec %10ld: rmtd: Kan inte allokera buffert rmtd: Okänt kommando `%c' rmtd: Filslut kom för tidigt tar (barn)