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