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