buf_subs.c revision 1.22 1 1.22 agc /* $NetBSD: buf_subs.c,v 1.22 2003/10/13 07:41:22 agc Exp $ */
2 1.5 cgd
3 1.1 jtc /*-
4 1.22 agc * Copyright (c) 1992 Keith Muller.
5 1.1 jtc * Copyright (c) 1992, 1993
6 1.1 jtc * The Regents of the University of California. All rights reserved.
7 1.1 jtc *
8 1.1 jtc * This code is derived from software contributed to Berkeley by
9 1.1 jtc * Keith Muller of the University of California, San Diego.
10 1.1 jtc *
11 1.1 jtc * Redistribution and use in source and binary forms, with or without
12 1.1 jtc * modification, are permitted provided that the following conditions
13 1.1 jtc * are met:
14 1.1 jtc * 1. Redistributions of source code must retain the above copyright
15 1.1 jtc * notice, this list of conditions and the following disclaimer.
16 1.1 jtc * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 jtc * notice, this list of conditions and the following disclaimer in the
18 1.1 jtc * documentation and/or other materials provided with the distribution.
19 1.21 agc * 3. Neither the name of the University nor the names of its contributors
20 1.21 agc * may be used to endorse or promote products derived from this software
21 1.21 agc * without specific prior written permission.
22 1.21 agc *
23 1.21 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.21 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.21 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.21 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.21 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.21 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.21 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.21 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.21 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.21 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.21 agc * SUCH DAMAGE.
34 1.21 agc */
35 1.21 agc
36 1.7 christos #include <sys/cdefs.h>
37 1.17 tv #if defined(__RCSID) && !defined(lint)
38 1.5 cgd #if 0
39 1.5 cgd static char sccsid[] = "@(#)buf_subs.c 8.2 (Berkeley) 4/18/94";
40 1.5 cgd #else
41 1.22 agc __RCSID("$NetBSD: buf_subs.c,v 1.22 2003/10/13 07:41:22 agc Exp $");
42 1.5 cgd #endif
43 1.1 jtc #endif /* not lint */
44 1.1 jtc
45 1.1 jtc #include <sys/types.h>
46 1.1 jtc #include <sys/time.h>
47 1.1 jtc #include <sys/stat.h>
48 1.1 jtc #include <sys/param.h>
49 1.1 jtc #include <stdio.h>
50 1.1 jtc #include <ctype.h>
51 1.1 jtc #include <errno.h>
52 1.1 jtc #include <unistd.h>
53 1.1 jtc #include <stdlib.h>
54 1.1 jtc #include <string.h>
55 1.1 jtc #include "pax.h"
56 1.1 jtc #include "extern.h"
57 1.1 jtc
58 1.1 jtc /*
59 1.1 jtc * routines which implement archive and file buffering
60 1.1 jtc */
61 1.1 jtc
62 1.1 jtc #define MINFBSZ 512 /* default block size for hole detect */
63 1.13 itohy #define MAXFLT 10 /* default media read error limit */
64 1.1 jtc
65 1.1 jtc /*
66 1.1 jtc * Need to change bufmem to dynamic allocation when the upper
67 1.1 jtc * limit on blocking size is removed (though that will violate pax spec)
68 1.1 jtc * MAXBLK define and tests will also need to be updated.
69 1.1 jtc */
70 1.1 jtc static char bufmem[MAXBLK+BLKMULT]; /* i/o buffer + pushback id space */
71 1.1 jtc static char *buf; /* normal start of i/o buffer */
72 1.1 jtc static char *bufend; /* end or last char in i/o buffer */
73 1.1 jtc static char *bufpt; /* read/write point in i/o buffer */
74 1.13 itohy int blksz = MAXBLK; /* block input/output size in bytes */
75 1.13 itohy int wrblksz; /* user spec output size in bytes */
76 1.1 jtc int maxflt = MAXFLT; /* MAX consecutive media errors */
77 1.1 jtc int rdblksz; /* first read blksize (tapes only) */
78 1.1 jtc off_t wrlimit; /* # of bytes written per archive vol */
79 1.1 jtc off_t wrcnt; /* # of bytes written on current vol */
80 1.1 jtc off_t rdcnt; /* # of bytes read on current vol */
81 1.1 jtc
82 1.1 jtc /*
83 1.1 jtc * wr_start()
84 1.1 jtc * set up the buffering system to operate in a write mode
85 1.1 jtc * Return:
86 1.1 jtc * 0 if ok, -1 if the user specified write block size violates pax spec
87 1.1 jtc */
88 1.1 jtc
89 1.1 jtc int
90 1.1 jtc wr_start(void)
91 1.1 jtc {
92 1.1 jtc buf = &(bufmem[BLKMULT]);
93 1.1 jtc /*
94 1.1 jtc * Check to make sure the write block size meets pax specs. If the user
95 1.1 jtc * does not specify a blocksize, we use the format default blocksize.
96 1.1 jtc * We must be picky on writes, so we do not allow the user to create an
97 1.1 jtc * archive that might be hard to read elsewhere. If all ok, we then
98 1.1 jtc * open the first archive volume
99 1.1 jtc */
100 1.13 itohy if (!wrblksz)
101 1.1 jtc wrblksz = frmt->bsz;
102 1.1 jtc if (wrblksz > MAXBLK) {
103 1.13 itohy tty_warn(1, "Write block size of %d too large, maximum is: %d",
104 1.1 jtc wrblksz, MAXBLK);
105 1.1 jtc return(-1);
106 1.1 jtc }
107 1.1 jtc if (wrblksz % BLKMULT) {
108 1.7 christos tty_warn(1, "Write block size of %d is not a %d byte multiple",
109 1.1 jtc wrblksz, BLKMULT);
110 1.1 jtc return(-1);
111 1.1 jtc }
112 1.1 jtc
113 1.1 jtc /*
114 1.13 itohy * we only allow wrblksz to be used with all archive operations
115 1.1 jtc */
116 1.1 jtc blksz = rdblksz = wrblksz;
117 1.1 jtc if ((ar_open(arcname) < 0) && (ar_next() < 0))
118 1.1 jtc return(-1);
119 1.1 jtc wrcnt = 0;
120 1.1 jtc bufend = buf + wrblksz;
121 1.1 jtc bufpt = buf;
122 1.1 jtc return(0);
123 1.1 jtc }
124 1.1 jtc
125 1.1 jtc /*
126 1.1 jtc * rd_start()
127 1.1 jtc * set up buffering system to read an archive
128 1.1 jtc * Return:
129 1.1 jtc * 0 if ok, -1 otherwise
130 1.1 jtc */
131 1.1 jtc
132 1.1 jtc int
133 1.1 jtc rd_start(void)
134 1.1 jtc {
135 1.1 jtc /*
136 1.1 jtc * leave space for the header pushback (see get_arc()). If we are
137 1.1 jtc * going to append and user specified a write block size, check it
138 1.1 jtc * right away
139 1.1 jtc */
140 1.1 jtc buf = &(bufmem[BLKMULT]);
141 1.1 jtc if ((act == APPND) && wrblksz) {
142 1.1 jtc if (wrblksz > MAXBLK) {
143 1.7 christos tty_warn(1,
144 1.13 itohy "Write block size %d too large, maximum is: %d",
145 1.7 christos wrblksz, MAXBLK);
146 1.1 jtc return(-1);
147 1.1 jtc }
148 1.1 jtc if (wrblksz % BLKMULT) {
149 1.7 christos tty_warn(1,
150 1.7 christos "Write block size %d is not a %d byte multiple",
151 1.7 christos wrblksz, BLKMULT);
152 1.1 jtc return(-1);
153 1.1 jtc }
154 1.1 jtc }
155 1.1 jtc
156 1.1 jtc /*
157 1.1 jtc * open the archive
158 1.1 jtc */
159 1.1 jtc if ((ar_open(arcname) < 0) && (ar_next() < 0))
160 1.1 jtc return(-1);
161 1.1 jtc bufend = buf + rdblksz;
162 1.1 jtc bufpt = bufend;
163 1.1 jtc rdcnt = 0;
164 1.1 jtc return(0);
165 1.1 jtc }
166 1.1 jtc
167 1.1 jtc /*
168 1.1 jtc * cp_start()
169 1.1 jtc * set up buffer system for copying within the file system
170 1.1 jtc */
171 1.1 jtc
172 1.1 jtc void
173 1.1 jtc cp_start(void)
174 1.1 jtc {
175 1.1 jtc buf = &(bufmem[BLKMULT]);
176 1.1 jtc rdblksz = blksz = MAXBLK;
177 1.1 jtc }
178 1.1 jtc
179 1.1 jtc /*
180 1.1 jtc * appnd_start()
181 1.1 jtc * Set up the buffering system to append new members to an archive that
182 1.1 jtc * was just read. The last block(s) of an archive may contain a format
183 1.1 jtc * specific trailer. To append a new member, this trailer has to be
184 1.1 jtc * removed from the archive. The first byte of the trailer is replaced by
185 1.1 jtc * the start of the header of the first file added to the archive. The
186 1.1 jtc * format specific end read function tells us how many bytes to move
187 1.1 jtc * backwards in the archive to be positioned BEFORE the trailer. Two
188 1.13 itohy * different positions have to be adjusted, the O.S. file offset (e.g. the
189 1.1 jtc * position of the tape head) and the write point within the data we have
190 1.1 jtc * stored in the read (soon to become write) buffer. We may have to move
191 1.1 jtc * back several records (the number depends on the size of the archive
192 1.1 jtc * record and the size of the format trailer) to read up the record where
193 1.1 jtc * the first byte of the trailer is recorded. Trailers may span (and
194 1.13 itohy * overlap) record boundaries.
195 1.1 jtc * We first calculate which record has the first byte of the trailer. We
196 1.1 jtc * move the OS file offset back to the start of this record and read it
197 1.1 jtc * up. We set the buffer write pointer to be at this byte (the byte where
198 1.1 jtc * the trailer starts). We then move the OS file pointer back to the
199 1.1 jtc * start of this record so a flush of this buffer will replace the record
200 1.1 jtc * in the archive.
201 1.1 jtc * A major problem is rewriting this last record. For archives stored
202 1.18 wiz * on disk files, this is trivial. However, many devices are really picky
203 1.1 jtc * about the conditions under which they will allow a write to occur.
204 1.18 wiz * Often devices restrict the conditions where writes can be made,
205 1.1 jtc * so it may not be feasable to append archives stored on all types of
206 1.13 itohy * devices.
207 1.1 jtc * Return:
208 1.1 jtc * 0 for success, -1 for failure
209 1.1 jtc */
210 1.1 jtc
211 1.1 jtc int
212 1.1 jtc appnd_start(off_t skcnt)
213 1.1 jtc {
214 1.6 tls int res;
215 1.1 jtc off_t cnt;
216 1.1 jtc
217 1.1 jtc if (exit_val != 0) {
218 1.7 christos tty_warn(0, "Cannot append to an archive that may have flaws.");
219 1.1 jtc return(-1);
220 1.1 jtc }
221 1.1 jtc /*
222 1.1 jtc * if the user did not specify a write blocksize, inherit the size used
223 1.1 jtc * in the last archive volume read. (If a is set we still use rdblksz
224 1.1 jtc * until next volume, cannot shift sizes within a single volume).
225 1.1 jtc */
226 1.1 jtc if (!wrblksz)
227 1.1 jtc wrblksz = blksz = rdblksz;
228 1.1 jtc else
229 1.1 jtc blksz = rdblksz;
230 1.1 jtc
231 1.1 jtc /*
232 1.1 jtc * make sure that this volume allows appends
233 1.1 jtc */
234 1.1 jtc if (ar_app_ok() < 0)
235 1.1 jtc return(-1);
236 1.1 jtc
237 1.1 jtc /*
238 1.1 jtc * Calculate bytes to move back and move in front of record where we
239 1.1 jtc * need to start writing from. Remember we have to add in any padding
240 1.1 jtc * that might be in the buffer after the trailer in the last block. We
241 1.1 jtc * travel skcnt + padding ROUNDED UP to blksize.
242 1.1 jtc */
243 1.1 jtc skcnt += bufend - bufpt;
244 1.1 jtc if ((cnt = (skcnt/blksz) * blksz) < skcnt)
245 1.1 jtc cnt += blksz;
246 1.1 jtc if (ar_rev((off_t)cnt) < 0)
247 1.1 jtc goto out;
248 1.1 jtc
249 1.1 jtc /*
250 1.1 jtc * We may have gone too far if there is valid data in the block we are
251 1.1 jtc * now in front of, read up the block and position the pointer after
252 1.1 jtc * the valid data.
253 1.1 jtc */
254 1.1 jtc if ((cnt -= skcnt) > 0) {
255 1.1 jtc /*
256 1.1 jtc * watch out for stupid tape drives. ar_rev() will set rdblksz
257 1.1 jtc * to be real physical blocksize so we must loop until we get
258 1.1 jtc * the old rdblksz (now in blksz). If ar_rev() fouls up the
259 1.1 jtc * determination of the physical block size, we will fail.
260 1.1 jtc */
261 1.1 jtc bufpt = buf;
262 1.1 jtc bufend = buf + blksz;
263 1.1 jtc while (bufpt < bufend) {
264 1.1 jtc if ((res = ar_read(bufpt, rdblksz)) <= 0)
265 1.1 jtc goto out;
266 1.1 jtc bufpt += res;
267 1.1 jtc }
268 1.1 jtc if (ar_rev((off_t)(bufpt - buf)) < 0)
269 1.1 jtc goto out;
270 1.1 jtc bufpt = buf + cnt;
271 1.1 jtc bufend = buf + blksz;
272 1.1 jtc } else {
273 1.1 jtc /*
274 1.1 jtc * buffer is empty
275 1.1 jtc */
276 1.1 jtc bufend = buf + blksz;
277 1.1 jtc bufpt = buf;
278 1.1 jtc }
279 1.1 jtc rdblksz = blksz;
280 1.1 jtc rdcnt -= skcnt;
281 1.1 jtc wrcnt = 0;
282 1.1 jtc
283 1.1 jtc /*
284 1.1 jtc * At this point we are ready to write. If the device requires special
285 1.1 jtc * handling to write at a point were previously recorded data resides,
286 1.1 jtc * that is handled in ar_set_wr(). From now on we operate under normal
287 1.1 jtc * ARCHIVE mode (write) conditions
288 1.1 jtc */
289 1.1 jtc if (ar_set_wr() < 0)
290 1.1 jtc return(-1);
291 1.1 jtc act = ARCHIVE;
292 1.1 jtc return(0);
293 1.1 jtc
294 1.1 jtc out:
295 1.7 christos tty_warn(1, "Unable to rewrite archive trailer, cannot append.");
296 1.1 jtc return(-1);
297 1.1 jtc }
298 1.13 itohy
299 1.1 jtc /*
300 1.1 jtc * rd_sync()
301 1.1 jtc * A read error occurred on this archive volume. Resync the buffer and
302 1.1 jtc * try to reset the device (if possible) so we can continue to read. Keep
303 1.1 jtc * trying to do this until we get a valid read, or we reach the limit on
304 1.1 jtc * consecutive read faults (at which point we give up). The user can
305 1.1 jtc * adjust the read error limit through a command line option.
306 1.1 jtc * Returns:
307 1.1 jtc * 0 on success, and -1 on failure
308 1.1 jtc */
309 1.1 jtc
310 1.1 jtc int
311 1.1 jtc rd_sync(void)
312 1.1 jtc {
313 1.6 tls int errcnt = 0;
314 1.6 tls int res;
315 1.1 jtc
316 1.1 jtc /*
317 1.1 jtc * if the user says bail out on first fault, we are out of here...
318 1.1 jtc */
319 1.1 jtc if (maxflt == 0)
320 1.1 jtc return(-1);
321 1.1 jtc if (act == APPND) {
322 1.7 christos tty_warn(1,
323 1.7 christos "Unable to append when there are archive read errors.");
324 1.1 jtc return(-1);
325 1.1 jtc }
326 1.1 jtc
327 1.1 jtc /*
328 1.1 jtc * poke at device and try to get past media error
329 1.1 jtc */
330 1.1 jtc if (ar_rdsync() < 0) {
331 1.1 jtc if (ar_next() < 0)
332 1.1 jtc return(-1);
333 1.1 jtc else
334 1.1 jtc rdcnt = 0;
335 1.1 jtc }
336 1.1 jtc
337 1.1 jtc for (;;) {
338 1.1 jtc if ((res = ar_read(buf, blksz)) > 0) {
339 1.1 jtc /*
340 1.1 jtc * All right! got some data, fill that buffer
341 1.1 jtc */
342 1.1 jtc bufpt = buf;
343 1.1 jtc bufend = buf + res;
344 1.1 jtc rdcnt += res;
345 1.1 jtc return(0);
346 1.1 jtc }
347 1.1 jtc
348 1.1 jtc /*
349 1.1 jtc * Oh well, yet another failed read...
350 1.18 wiz * if error limit reached, ditch. otherwise poke device to move past
351 1.1 jtc * bad media and try again. if media is badly damaged, we ask
352 1.1 jtc * the poor (and upset user at this point) for the next archive
353 1.1 jtc * volume. remember the goal on reads is to get the most we
354 1.1 jtc * can extract out of the archive.
355 1.1 jtc */
356 1.1 jtc if ((maxflt > 0) && (++errcnt > maxflt))
357 1.7 christos tty_warn(0,
358 1.7 christos "Archive read error limit (%d) reached",maxflt);
359 1.1 jtc else if (ar_rdsync() == 0)
360 1.1 jtc continue;
361 1.1 jtc if (ar_next() < 0)
362 1.1 jtc break;
363 1.1 jtc rdcnt = 0;
364 1.1 jtc errcnt = 0;
365 1.1 jtc }
366 1.1 jtc return(-1);
367 1.1 jtc }
368 1.1 jtc
369 1.1 jtc /*
370 1.1 jtc * pback()
371 1.1 jtc * push the data used during the archive id phase back into the I/O
372 1.1 jtc * buffer. This is required as we cannot be sure that the header does NOT
373 1.13 itohy * overlap a block boundary (as in the case we are trying to recover a
374 1.1 jtc * flawed archived). This was not designed to be used for any other
375 1.1 jtc * purpose. (What software engineering, HA!)
376 1.1 jtc * WARNING: do not even THINK of pback greater than BLKMULT, unless the
377 1.1 jtc * pback space is increased.
378 1.1 jtc */
379 1.1 jtc
380 1.1 jtc void
381 1.1 jtc pback(char *pt, int cnt)
382 1.1 jtc {
383 1.1 jtc bufpt -= cnt;
384 1.4 mycroft memcpy(bufpt, pt, cnt);
385 1.1 jtc return;
386 1.1 jtc }
387 1.1 jtc
388 1.1 jtc /*
389 1.1 jtc * rd_skip()
390 1.13 itohy * skip forward in the archive during a archive read. Used to get quickly
391 1.1 jtc * past file data and padding for files the user did NOT select.
392 1.1 jtc * Return:
393 1.1 jtc * 0 if ok, -1 failure, and 1 when EOF on the archive volume was detected.
394 1.1 jtc */
395 1.1 jtc
396 1.1 jtc int
397 1.1 jtc rd_skip(off_t skcnt)
398 1.1 jtc {
399 1.1 jtc off_t res;
400 1.1 jtc off_t cnt;
401 1.1 jtc off_t skipped = 0;
402 1.8 scottr
403 1.1 jtc /*
404 1.13 itohy * consume what data we have in the buffer. If we have to move forward
405 1.1 jtc * whole records, we call the low level skip function to see if we can
406 1.1 jtc * move within the archive without doing the expensive reads on data we
407 1.1 jtc * do not want.
408 1.1 jtc */
409 1.1 jtc if (skcnt == 0)
410 1.1 jtc return(0);
411 1.1 jtc res = MIN((bufend - bufpt), skcnt);
412 1.1 jtc bufpt += res;
413 1.1 jtc skcnt -= res;
414 1.1 jtc
415 1.1 jtc /*
416 1.1 jtc * if skcnt is now 0, then no additional i/o is needed
417 1.1 jtc */
418 1.1 jtc if (skcnt == 0)
419 1.1 jtc return(0);
420 1.1 jtc
421 1.1 jtc /*
422 1.1 jtc * We have to read more, calculate complete and partial record reads
423 1.1 jtc * based on rdblksz. we skip over "cnt" complete records
424 1.1 jtc */
425 1.1 jtc res = skcnt%rdblksz;
426 1.1 jtc cnt = (skcnt/rdblksz) * rdblksz;
427 1.1 jtc
428 1.1 jtc /*
429 1.1 jtc * if the skip fails, we will have to resync. ar_fow will tell us
430 1.1 jtc * how much it can skip over. We will have to read the rest.
431 1.1 jtc */
432 1.1 jtc if (ar_fow(cnt, &skipped) < 0)
433 1.1 jtc return(-1);
434 1.1 jtc res += cnt - skipped;
435 1.1 jtc rdcnt += skipped;
436 1.1 jtc
437 1.1 jtc /*
438 1.1 jtc * what is left we have to read (which may be the whole thing if
439 1.1 jtc * ar_fow() told us the device can only read to skip records);
440 1.1 jtc */
441 1.1 jtc while (res > 0L) {
442 1.1 jtc cnt = bufend - bufpt;
443 1.1 jtc /*
444 1.1 jtc * if the read fails, we will have to resync
445 1.1 jtc */
446 1.1 jtc if ((cnt <= 0) && ((cnt = buf_fill()) < 0))
447 1.1 jtc return(-1);
448 1.1 jtc if (cnt == 0)
449 1.1 jtc return(1);
450 1.1 jtc cnt = MIN(cnt, res);
451 1.1 jtc bufpt += cnt;
452 1.1 jtc res -= cnt;
453 1.1 jtc }
454 1.1 jtc return(0);
455 1.1 jtc }
456 1.1 jtc
457 1.13 itohy /*
458 1.1 jtc * wr_fin()
459 1.1 jtc * flush out any data (and pad if required) the last block. We always pad
460 1.1 jtc * with zero (even though we do not have to). Padding with 0 makes it a
461 1.1 jtc * lot easier to recover if the archive is damaged. zero paddding SHOULD
462 1.1 jtc * BE a requirement....
463 1.1 jtc */
464 1.1 jtc
465 1.1 jtc void
466 1.1 jtc wr_fin(void)
467 1.1 jtc {
468 1.1 jtc if (bufpt > buf) {
469 1.4 mycroft memset(bufpt, 0, bufend - bufpt);
470 1.1 jtc bufpt = bufend;
471 1.1 jtc (void)buf_flush(blksz);
472 1.1 jtc }
473 1.1 jtc }
474 1.1 jtc
475 1.1 jtc /*
476 1.1 jtc * wr_rdbuf()
477 1.1 jtc * fill the write buffer from data passed to it in a buffer (usually used
478 1.1 jtc * by format specific write routines to pass a file header). On failure we
479 1.1 jtc * punt. We do not allow the user to continue to write flawed archives.
480 1.1 jtc * We assume these headers are not very large (the memory copy we use is
481 1.13 itohy * a bit expensive).
482 1.1 jtc * Return:
483 1.1 jtc * 0 if buffer was filled ok, -1 o.w. (buffer flush failure)
484 1.1 jtc */
485 1.1 jtc
486 1.1 jtc int
487 1.6 tls wr_rdbuf(char *out, int outcnt)
488 1.1 jtc {
489 1.6 tls int cnt;
490 1.1 jtc
491 1.1 jtc /*
492 1.1 jtc * while there is data to copy copy into the write buffer. when the
493 1.1 jtc * write buffer fills, flush it to the archive and continue
494 1.1 jtc */
495 1.1 jtc while (outcnt > 0) {
496 1.1 jtc cnt = bufend - bufpt;
497 1.1 jtc if ((cnt <= 0) && ((cnt = buf_flush(blksz)) < 0))
498 1.1 jtc return(-1);
499 1.1 jtc /*
500 1.1 jtc * only move what we have space for
501 1.1 jtc */
502 1.1 jtc cnt = MIN(cnt, outcnt);
503 1.4 mycroft memcpy(bufpt, out, cnt);
504 1.1 jtc bufpt += cnt;
505 1.1 jtc out += cnt;
506 1.1 jtc outcnt -= cnt;
507 1.1 jtc }
508 1.1 jtc return(0);
509 1.1 jtc }
510 1.1 jtc
511 1.1 jtc /*
512 1.1 jtc * rd_wrbuf()
513 1.1 jtc * copy from the read buffer into a supplied buffer a specified number of
514 1.1 jtc * bytes. If the read buffer is empty fill it and continue to copy.
515 1.1 jtc * usually used to obtain a file header for processing by a format
516 1.1 jtc * specific read routine.
517 1.1 jtc * Return
518 1.1 jtc * number of bytes copied to the buffer, 0 indicates EOF on archive volume,
519 1.1 jtc * -1 is a read error
520 1.1 jtc */
521 1.1 jtc
522 1.1 jtc int
523 1.6 tls rd_wrbuf(char *in, int cpcnt)
524 1.1 jtc {
525 1.6 tls int res;
526 1.6 tls int cnt;
527 1.6 tls int incnt = cpcnt;
528 1.1 jtc
529 1.1 jtc /*
530 1.1 jtc * loop until we fill the buffer with the requested number of bytes
531 1.1 jtc */
532 1.1 jtc while (incnt > 0) {
533 1.1 jtc cnt = bufend - bufpt;
534 1.1 jtc if ((cnt <= 0) && ((cnt = buf_fill()) <= 0)) {
535 1.1 jtc /*
536 1.1 jtc * read error, return what we got (or the error if
537 1.1 jtc * no data was copied). The caller must know that an
538 1.14 wiz * error occurred and has the best knowledge what to
539 1.1 jtc * do with it
540 1.1 jtc */
541 1.1 jtc if ((res = cpcnt - incnt) > 0)
542 1.1 jtc return(res);
543 1.1 jtc return(cnt);
544 1.1 jtc }
545 1.1 jtc
546 1.1 jtc /*
547 1.1 jtc * calculate how much data to copy based on whats left and
548 1.1 jtc * state of buffer
549 1.1 jtc */
550 1.1 jtc cnt = MIN(cnt, incnt);
551 1.4 mycroft memcpy(in, bufpt, cnt);
552 1.1 jtc bufpt += cnt;
553 1.1 jtc incnt -= cnt;
554 1.1 jtc in += cnt;
555 1.1 jtc }
556 1.1 jtc return(cpcnt);
557 1.1 jtc }
558 1.1 jtc
559 1.1 jtc /*
560 1.1 jtc * wr_skip()
561 1.13 itohy * skip forward during a write. In other words add padding to the file.
562 1.1 jtc * we add zero filled padding as it makes flawed archives much easier to
563 1.1 jtc * recover from. the caller tells us how many bytes of padding to add
564 1.1 jtc * This routine was not designed to add HUGE amount of padding, just small
565 1.1 jtc * amounts (a few 512 byte blocks at most)
566 1.1 jtc * Return:
567 1.1 jtc * 0 if ok, -1 if there was a buf_flush failure
568 1.1 jtc */
569 1.1 jtc
570 1.1 jtc int
571 1.1 jtc wr_skip(off_t skcnt)
572 1.1 jtc {
573 1.6 tls int cnt;
574 1.1 jtc
575 1.1 jtc /*
576 1.1 jtc * loop while there is more padding to add
577 1.1 jtc */
578 1.1 jtc while (skcnt > 0L) {
579 1.1 jtc cnt = bufend - bufpt;
580 1.1 jtc if ((cnt <= 0) && ((cnt = buf_flush(blksz)) < 0))
581 1.1 jtc return(-1);
582 1.1 jtc cnt = MIN(cnt, skcnt);
583 1.4 mycroft memset(bufpt, 0, cnt);
584 1.1 jtc bufpt += cnt;
585 1.1 jtc skcnt -= cnt;
586 1.1 jtc }
587 1.1 jtc return(0);
588 1.1 jtc }
589 1.1 jtc
590 1.1 jtc /*
591 1.1 jtc * wr_rdfile()
592 1.1 jtc * fill write buffer with the contents of a file. We are passed an open
593 1.1 jtc * file descriptor to the file an the archive structure that describes the
594 1.1 jtc * file we are storing. The variable "left" is modified to contain the
595 1.1 jtc * number of bytes of the file we were NOT able to write to the archive.
596 1.1 jtc * it is important that we always write EXACTLY the number of bytes that
597 1.1 jtc * the format specific write routine told us to. The file can also get
598 1.1 jtc * bigger, so reading to the end of file would create an improper archive,
599 1.1 jtc * we just detect this case and warn the user. We never create a bad
600 1.1 jtc * archive if we can avoid it. Of course trying to archive files that are
601 1.1 jtc * active is asking for trouble. It we fail, we pass back how much we
602 1.1 jtc * could NOT copy and let the caller deal with it.
603 1.1 jtc * Return:
604 1.1 jtc * 0 ok, -1 if archive write failure. a short read of the file returns a
605 1.1 jtc * 0, but "left" is set to be greater than zero.
606 1.1 jtc */
607 1.1 jtc
608 1.1 jtc int
609 1.1 jtc wr_rdfile(ARCHD *arcn, int ifd, off_t *left)
610 1.1 jtc {
611 1.6 tls int cnt;
612 1.6 tls int res = 0;
613 1.6 tls off_t size = arcn->sb.st_size;
614 1.20 lukem struct stat origsb, sb;
615 1.20 lukem
616 1.20 lukem /*
617 1.20 lukem * by default, remember the previously obtained stat information
618 1.20 lukem * (in arcn->sb) for comparing the mtime after reading.
619 1.20 lukem * if Mflag is set, use the actual mtime instead.
620 1.20 lukem */
621 1.20 lukem origsb = arcn->sb;
622 1.20 lukem if (Mflag && (fstat(ifd, &origsb) < 0))
623 1.20 lukem syswarn(1, errno, "Failed stat on %s", arcn->org_name);
624 1.1 jtc
625 1.1 jtc /*
626 1.1 jtc * while there are more bytes to write
627 1.1 jtc */
628 1.1 jtc while (size > 0L) {
629 1.1 jtc cnt = bufend - bufpt;
630 1.1 jtc if ((cnt <= 0) && ((cnt = buf_flush(blksz)) < 0)) {
631 1.1 jtc *left = size;
632 1.1 jtc return(-1);
633 1.1 jtc }
634 1.1 jtc cnt = MIN(cnt, size);
635 1.12 itohy if ((res = read_with_restart(ifd, bufpt, cnt)) <= 0)
636 1.1 jtc break;
637 1.1 jtc size -= res;
638 1.1 jtc bufpt += res;
639 1.1 jtc }
640 1.1 jtc
641 1.1 jtc /*
642 1.1 jtc * better check the file did not change during this operation
643 1.1 jtc * or the file read failed.
644 1.1 jtc */
645 1.1 jtc if (res < 0)
646 1.1 jtc syswarn(1, errno, "Read fault on %s", arcn->org_name);
647 1.1 jtc else if (size != 0L)
648 1.7 christos tty_warn(1, "File changed size during read %s", arcn->org_name);
649 1.1 jtc else if (fstat(ifd, &sb) < 0)
650 1.1 jtc syswarn(1, errno, "Failed stat on %s", arcn->org_name);
651 1.20 lukem else if (origsb.st_mtime != sb.st_mtime)
652 1.7 christos tty_warn(1, "File %s was modified during copy to archive",
653 1.1 jtc arcn->org_name);
654 1.1 jtc *left = size;
655 1.1 jtc return(0);
656 1.1 jtc }
657 1.1 jtc
658 1.1 jtc /*
659 1.1 jtc * rd_wrfile()
660 1.1 jtc * extract the contents of a file from the archive. If we are unable to
661 1.1 jtc * extract the entire file (due to failure to write the file) we return
662 1.1 jtc * the numbers of bytes we did NOT process. This way the caller knows how
663 1.1 jtc * many bytes to skip past to find the next archive header. If the failure
664 1.1 jtc * was due to an archive read, we will catch that when we try to skip. If
665 1.1 jtc * the format supplies a file data crc value, we calculate the actual crc
666 1.1 jtc * so that it can be compared to the value stored in the header
667 1.1 jtc * NOTE:
668 1.1 jtc * We call a special function to write the file. This function attempts to
669 1.1 jtc * restore file holes (blocks of zeros) into the file. When files are
670 1.1 jtc * sparse this saves space, and is a LOT faster. For non sparse files
671 1.1 jtc * the performance hit is small. As of this writing, no archive supports
672 1.1 jtc * information on where the file holes are.
673 1.1 jtc * Return:
674 1.1 jtc * 0 ok, -1 if archive read failure. if we cannot write the entire file,
675 1.1 jtc * we return a 0 but "left" is set to be the amount unwritten
676 1.1 jtc */
677 1.1 jtc
678 1.1 jtc int
679 1.1 jtc rd_wrfile(ARCHD *arcn, int ofd, off_t *left)
680 1.1 jtc {
681 1.6 tls int cnt = 0;
682 1.6 tls off_t size = arcn->sb.st_size;
683 1.6 tls int res = 0;
684 1.6 tls char *fnm = arcn->name;
685 1.1 jtc int isem = 1;
686 1.1 jtc int rem;
687 1.1 jtc int sz = MINFBSZ;
688 1.13 itohy struct stat sb;
689 1.1 jtc u_long crc = 0L;
690 1.1 jtc
691 1.1 jtc /*
692 1.1 jtc * pass the blocksize of the file being written to the write routine,
693 1.1 jtc * if the size is zero, use the default MINFBSZ
694 1.1 jtc */
695 1.11 mrg if (ofd == -1)
696 1.11 mrg sz = PAXPATHLEN+1;
697 1.13 itohy else if (fstat(ofd, &sb) == 0) {
698 1.1 jtc if (sb.st_blksize > 0)
699 1.1 jtc sz = (int)sb.st_blksize;
700 1.13 itohy } else
701 1.19 grant syswarn(0, errno,
702 1.19 grant "Unable to obtain block size for file %s", fnm);
703 1.1 jtc rem = sz;
704 1.1 jtc *left = 0L;
705 1.1 jtc
706 1.1 jtc /*
707 1.1 jtc * Copy the archive to the file the number of bytes specified. We have
708 1.1 jtc * to assume that we want to recover file holes as none of the archive
709 1.1 jtc * formats can record the location of file holes.
710 1.1 jtc */
711 1.1 jtc while (size > 0L) {
712 1.1 jtc cnt = bufend - bufpt;
713 1.1 jtc /*
714 1.1 jtc * if we get a read error, we do not want to skip, as we may
715 1.1 jtc * miss a header, so we do not set left, but if we get a write
716 1.1 jtc * error, we do want to skip over the unprocessed data.
717 1.1 jtc */
718 1.1 jtc if ((cnt <= 0) && ((cnt = buf_fill()) <= 0))
719 1.1 jtc break;
720 1.1 jtc cnt = MIN(cnt, size);
721 1.1 jtc if ((res = file_write(ofd,bufpt,cnt,&rem,&isem,sz,fnm)) <= 0) {
722 1.1 jtc *left = size;
723 1.1 jtc break;
724 1.1 jtc }
725 1.1 jtc
726 1.1 jtc if (docrc) {
727 1.1 jtc /*
728 1.1 jtc * update the actual crc value
729 1.1 jtc */
730 1.1 jtc cnt = res;
731 1.1 jtc while (--cnt >= 0)
732 1.1 jtc crc += *bufpt++ & 0xff;
733 1.1 jtc } else
734 1.1 jtc bufpt += res;
735 1.1 jtc size -= res;
736 1.1 jtc }
737 1.1 jtc
738 1.1 jtc /*
739 1.1 jtc * if the last block has a file hole (all zero), we must make sure this
740 1.1 jtc * gets updated in the file. We force the last block of zeros to be
741 1.13 itohy * written. just closing with the file offset moved forward may not put
742 1.1 jtc * a hole at the end of the file.
743 1.1 jtc */
744 1.11 mrg if (ofd != -1 && isem && (arcn->sb.st_size > 0L))
745 1.1 jtc file_flush(ofd, fnm, isem);
746 1.1 jtc
747 1.1 jtc /*
748 1.1 jtc * if we failed from archive read, we do not want to skip
749 1.1 jtc */
750 1.13 itohy if ((size > 0L) && (*left == 0L))
751 1.1 jtc return(-1);
752 1.1 jtc
753 1.1 jtc /*
754 1.1 jtc * some formats record a crc on file data. If so, then we compare the
755 1.1 jtc * calculated crc to the crc stored in the archive
756 1.1 jtc */
757 1.1 jtc if (docrc && (size == 0L) && (arcn->crc != crc))
758 1.7 christos tty_warn(1,"Actual crc does not match expected crc %s",
759 1.7 christos arcn->name);
760 1.1 jtc return(0);
761 1.1 jtc }
762 1.1 jtc
763 1.1 jtc /*
764 1.1 jtc * cp_file()
765 1.1 jtc * copy the contents of one file to another. used during -rw phase of pax
766 1.1 jtc * just as in rd_wrfile() we use a special write function to write the
767 1.1 jtc * destination file so we can properly copy files with holes.
768 1.1 jtc */
769 1.1 jtc
770 1.1 jtc void
771 1.1 jtc cp_file(ARCHD *arcn, int fd1, int fd2)
772 1.1 jtc {
773 1.6 tls int cnt;
774 1.6 tls off_t cpcnt = 0L;
775 1.6 tls int res = 0;
776 1.6 tls char *fnm = arcn->name;
777 1.6 tls int no_hole = 0;
778 1.1 jtc int isem = 1;
779 1.1 jtc int rem;
780 1.1 jtc int sz = MINFBSZ;
781 1.20 lukem struct stat sb, origsb;
782 1.1 jtc
783 1.1 jtc /*
784 1.1 jtc * check for holes in the source file. If none, we will use regular
785 1.1 jtc * write instead of file write.
786 1.1 jtc */
787 1.1 jtc if (((off_t)(arcn->sb.st_blocks * BLKMULT)) >= arcn->sb.st_size)
788 1.1 jtc ++no_hole;
789 1.1 jtc
790 1.1 jtc /*
791 1.20 lukem * by default, remember the previously obtained stat information
792 1.20 lukem * (in arcn->sb) for comparing the mtime after reading.
793 1.20 lukem * if Mflag is set, use the actual mtime instead.
794 1.20 lukem */
795 1.20 lukem origsb = arcn->sb;
796 1.20 lukem if (Mflag && (fstat(fd1, &origsb) < 0))
797 1.20 lukem syswarn(1, errno, "Failed stat on %s", arcn->org_name);
798 1.20 lukem
799 1.20 lukem /*
800 1.1 jtc * pass the blocksize of the file being written to the write routine,
801 1.1 jtc * if the size is zero, use the default MINFBSZ
802 1.1 jtc */
803 1.13 itohy if (fstat(fd2, &sb) == 0) {
804 1.1 jtc if (sb.st_blksize > 0)
805 1.1 jtc sz = sb.st_blksize;
806 1.13 itohy } else
807 1.19 grant syswarn(0, errno,
808 1.19 grant "Unable to obtain block size for file %s", fnm);
809 1.1 jtc rem = sz;
810 1.1 jtc
811 1.1 jtc /*
812 1.1 jtc * read the source file and copy to destination file until EOF
813 1.1 jtc */
814 1.1 jtc for(;;) {
815 1.12 itohy if ((cnt = read_with_restart(fd1, buf, blksz)) <= 0)
816 1.1 jtc break;
817 1.1 jtc if (no_hole)
818 1.12 itohy res = xwrite(fd2, buf, cnt);
819 1.1 jtc else
820 1.1 jtc res = file_write(fd2, buf, cnt, &rem, &isem, sz, fnm);
821 1.1 jtc if (res != cnt)
822 1.1 jtc break;
823 1.1 jtc cpcnt += cnt;
824 1.1 jtc }
825 1.1 jtc
826 1.1 jtc /*
827 1.1 jtc * check to make sure the copy is valid.
828 1.1 jtc */
829 1.1 jtc if (res < 0)
830 1.1 jtc syswarn(1, errno, "Failed write during copy of %s to %s",
831 1.1 jtc arcn->org_name, arcn->name);
832 1.1 jtc else if (cpcnt != arcn->sb.st_size)
833 1.7 christos tty_warn(1, "File %s changed size during copy to %s",
834 1.1 jtc arcn->org_name, arcn->name);
835 1.1 jtc else if (fstat(fd1, &sb) < 0)
836 1.1 jtc syswarn(1, errno, "Failed stat of %s", arcn->org_name);
837 1.20 lukem else if (origsb.st_mtime != sb.st_mtime)
838 1.7 christos tty_warn(1, "File %s was modified during copy to %s",
839 1.1 jtc arcn->org_name, arcn->name);
840 1.1 jtc
841 1.1 jtc /*
842 1.1 jtc * if the last block has a file hole (all zero), we must make sure this
843 1.1 jtc * gets updated in the file. We force the last block of zeros to be
844 1.13 itohy * written. just closing with the file offset moved forward may not put
845 1.1 jtc * a hole at the end of the file.
846 1.1 jtc */
847 1.1 jtc if (!no_hole && isem && (arcn->sb.st_size > 0L))
848 1.1 jtc file_flush(fd2, fnm, isem);
849 1.1 jtc return;
850 1.1 jtc }
851 1.1 jtc
852 1.1 jtc /*
853 1.1 jtc * buf_fill()
854 1.1 jtc * fill the read buffer with the next record (or what we can get) from
855 1.1 jtc * the archive volume.
856 1.1 jtc * Return:
857 1.1 jtc * Number of bytes of data in the read buffer, -1 for read error, and
858 1.1 jtc * 0 when finished (user specified termination in ar_next()).
859 1.1 jtc */
860 1.1 jtc
861 1.1 jtc int
862 1.1 jtc buf_fill(void)
863 1.1 jtc {
864 1.6 tls int cnt;
865 1.1 jtc static int fini = 0;
866 1.1 jtc
867 1.1 jtc if (fini)
868 1.1 jtc return(0);
869 1.1 jtc
870 1.1 jtc for(;;) {
871 1.1 jtc /*
872 1.1 jtc * try to fill the buffer. on error the next archive volume is
873 1.1 jtc * opened and we try again.
874 1.1 jtc */
875 1.1 jtc if ((cnt = ar_read(buf, blksz)) > 0) {
876 1.1 jtc bufpt = buf;
877 1.1 jtc bufend = buf + cnt;
878 1.1 jtc rdcnt += cnt;
879 1.1 jtc return(cnt);
880 1.1 jtc }
881 1.1 jtc
882 1.1 jtc /*
883 1.1 jtc * errors require resync, EOF goes to next archive
884 1.1 jtc */
885 1.1 jtc if (cnt < 0)
886 1.1 jtc break;
887 1.1 jtc if (ar_next() < 0) {
888 1.1 jtc fini = 1;
889 1.1 jtc return(0);
890 1.1 jtc }
891 1.1 jtc rdcnt = 0;
892 1.1 jtc }
893 1.1 jtc exit_val = 1;
894 1.1 jtc return(-1);
895 1.1 jtc }
896 1.1 jtc
897 1.1 jtc /*
898 1.1 jtc * buf_flush()
899 1.1 jtc * force the write buffer to the archive. We are passed the number of
900 1.1 jtc * bytes in the buffer at the point of the flush. When we change archives
901 1.1 jtc * the record size might change. (either larger or smaller).
902 1.1 jtc * Return:
903 1.1 jtc * 0 if all is ok, -1 when a write error occurs.
904 1.1 jtc */
905 1.1 jtc
906 1.1 jtc int
907 1.6 tls buf_flush(int bufcnt)
908 1.1 jtc {
909 1.6 tls int cnt;
910 1.6 tls int push = 0;
911 1.6 tls int totcnt = 0;
912 1.1 jtc
913 1.1 jtc /*
914 1.1 jtc * if we have reached the user specified byte count for each archive
915 1.15 wiz * volume, prompt for the next volume. (The non-standard -R flag).
916 1.1 jtc * NOTE: If the wrlimit is smaller than wrcnt, we will always write
917 1.1 jtc * at least one record. We always round limit UP to next blocksize.
918 1.1 jtc */
919 1.1 jtc if ((wrlimit > 0) && (wrcnt > wrlimit)) {
920 1.7 christos tty_warn(0,
921 1.7 christos "User specified archive volume byte limit reached.");
922 1.1 jtc if (ar_next() < 0) {
923 1.1 jtc wrcnt = 0;
924 1.1 jtc exit_val = 1;
925 1.1 jtc return(-1);
926 1.1 jtc }
927 1.1 jtc wrcnt = 0;
928 1.1 jtc
929 1.1 jtc /*
930 1.1 jtc * The new archive volume might have changed the size of the
931 1.1 jtc * write blocksize. if so we figure out if we need to write
932 1.1 jtc * (one or more times), or if there is now free space left in
933 1.1 jtc * the buffer (it is no longer full). bufcnt has the number of
934 1.1 jtc * bytes in the buffer, (the blocksize, at the point we were
935 1.1 jtc * CALLED). Push has the amount of "extra" data in the buffer
936 1.1 jtc * if the block size has shrunk from a volume change.
937 1.1 jtc */
938 1.1 jtc bufend = buf + blksz;
939 1.1 jtc if (blksz > bufcnt)
940 1.1 jtc return(0);
941 1.1 jtc if (blksz < bufcnt)
942 1.1 jtc push = bufcnt - blksz;
943 1.1 jtc }
944 1.1 jtc
945 1.1 jtc /*
946 1.1 jtc * We have enough data to write at least one archive block
947 1.1 jtc */
948 1.1 jtc for (;;) {
949 1.1 jtc /*
950 1.1 jtc * write a block and check if it all went out ok
951 1.1 jtc */
952 1.13 itohy cnt = ar_write(buf, blksz);
953 1.1 jtc if (cnt == blksz) {
954 1.1 jtc /*
955 1.1 jtc * the write went ok
956 1.1 jtc */
957 1.1 jtc wrcnt += cnt;
958 1.1 jtc totcnt += cnt;
959 1.1 jtc if (push > 0) {
960 1.1 jtc /* we have extra data to push to the front.
961 1.1 jtc * check for more than 1 block of push, and if
962 1.1 jtc * so we loop back to write again
963 1.1 jtc */
964 1.4 mycroft memcpy(buf, bufend, push);
965 1.1 jtc bufpt = buf + push;
966 1.1 jtc if (push >= blksz) {
967 1.1 jtc push -= blksz;
968 1.1 jtc continue;
969 1.1 jtc }
970 1.1 jtc } else
971 1.1 jtc bufpt = buf;
972 1.1 jtc return(totcnt);
973 1.1 jtc } else if (cnt > 0) {
974 1.1 jtc /*
975 1.1 jtc * Oh drat we got a partial write!
976 1.1 jtc * if format doesnt care about alignment let it go,
977 1.1 jtc * we warned the user in ar_write().... but this means
978 1.1 jtc * the last record on this volume violates pax spec....
979 1.1 jtc */
980 1.1 jtc totcnt += cnt;
981 1.1 jtc wrcnt += cnt;
982 1.1 jtc bufpt = buf + cnt;
983 1.1 jtc cnt = bufcnt - cnt;
984 1.4 mycroft memcpy(buf, bufpt, cnt);
985 1.1 jtc bufpt = buf + cnt;
986 1.1 jtc if (!frmt->blkalgn || ((cnt % frmt->blkalgn) == 0))
987 1.1 jtc return(totcnt);
988 1.1 jtc break;
989 1.1 jtc }
990 1.1 jtc
991 1.1 jtc /*
992 1.1 jtc * All done, go to next archive
993 1.1 jtc */
994 1.1 jtc wrcnt = 0;
995 1.1 jtc if (ar_next() < 0)
996 1.1 jtc break;
997 1.1 jtc
998 1.1 jtc /*
999 1.1 jtc * The new archive volume might also have changed the block
1000 1.1 jtc * size. if so, figure out if we have too much or too little
1001 1.1 jtc * data for using the new block size
1002 1.1 jtc */
1003 1.1 jtc bufend = buf + blksz;
1004 1.1 jtc if (blksz > bufcnt)
1005 1.1 jtc return(0);
1006 1.1 jtc if (blksz < bufcnt)
1007 1.1 jtc push = bufcnt - blksz;
1008 1.1 jtc }
1009 1.1 jtc
1010 1.1 jtc /*
1011 1.1 jtc * write failed, stop pax. we must not create a bad archive!
1012 1.1 jtc */
1013 1.1 jtc exit_val = 1;
1014 1.1 jtc return(-1);
1015 1.1 jtc }
1016