| 1 | #include "lib.h" |
| 2 | |
| 3 | static void usage(FILE *fp) |
| 4 | { |
| 5 | fprintf(fp, |
| 6 | "usage: %s [-ci] [-B PARAM=VALUE,...] [-R MAP]\n" |
| 7 | "\t[-b OUTMAP] [-r [START]-[END]] DEVICE OUTFILE\n", |
| 8 | prog); |
| 9 | } |
| 10 | |
| 11 | static double tvdiff(const struct timeval *tv_lo, |
| 12 | const struct timeval *tv_hi) |
| 13 | { |
| 14 | return ((tv_hi->tv_sec - tv_lo->tv_sec) + |
| 15 | (tv_hi->tv_usec - tv_lo->tv_usec)/1.0e6); |
| 16 | } |
| 17 | |
| 18 | #define DEFVEC(vtype, etype) \ |
| 19 | typedef struct { etype *v; size_t n, sz; } vtype |
| 20 | #define VEC_INIT { 0, 0, 0 } |
| 21 | #define VEC_FREE(vv) do { \ |
| 22 | free((vv)->v); (vv)->v 0; (vv)->n = (vv)->sz = 0; \ |
| 23 | } while (0) |
| 24 | #define VEC_PUSH(p, vv) do { \ |
| 25 | size_t _want; \ |
| 26 | if ((vv)->n >= (vv)->sz) { \ |
| 27 | (vv)->sz = (vv)->sz ? 2*(vv)->sz : 32; \ |
| 28 | _want = (vv)->sz*sizeof(*(vv)->v); \ |
| 29 | (vv)->v = realloc((vv)->v, _want); \ |
| 30 | if (!(vv)->v) bail("out of memory allocating %zu bytes", _want); \ |
| 31 | } \ |
| 32 | (p) = &(vv)->v[(vv)->n++]; \ |
| 33 | } while (0) |
| 34 | |
| 35 | #define MAXFILES (1 + 2*99 + 1) |
| 36 | struct file { |
| 37 | ident id; |
| 38 | secaddr start, end; |
| 39 | }; |
| 40 | DEFVEC(file_v, struct file); |
| 41 | static file_v filetab = VEC_INIT; |
| 42 | |
| 43 | enum { EV_STOP, EV_BEGIN, EV_END, EV_WRITE }; |
| 44 | struct event { |
| 45 | unsigned char ev, file; |
| 46 | secaddr pos; |
| 47 | }; |
| 48 | DEFVEC(event_v, struct event); |
| 49 | static event_v eventq = VEC_INIT; |
| 50 | |
| 51 | static int compare_event(const void *a, const void *b) |
| 52 | { |
| 53 | const struct event *eva = a, *evb = b; |
| 54 | |
| 55 | if (eva->pos < evb->pos) return (-1); |
| 56 | else if (eva->pos > evb->pos) return (+1); |
| 57 | |
| 58 | if (eva->ev < evb->ev) return (-1); |
| 59 | else if (eva->ev > evb->ev) return (+1); |
| 60 | |
| 61 | if (eva->file < evb->file) return (-1); |
| 62 | else if (eva->file > evb->file) return (+1); |
| 63 | |
| 64 | return (0); |
| 65 | } |
| 66 | |
| 67 | typedef uint_least32_t bits; |
| 68 | static bits live[(MAXFILES + 31)/32]; |
| 69 | |
| 70 | static inline int livep(unsigned i) |
| 71 | { return (live[i/32]&((bits)1 << (i%32))); } |
| 72 | static inline void set_live(unsigned i) |
| 73 | { live[i/32] |= (bits)1 << (i%32); } |
| 74 | static inline void clear_live(unsigned i) |
| 75 | { live[i/32] &= ~((bits)1 << (i%32)); } |
| 76 | static inline int least_live(void) |
| 77 | { |
| 78 | unsigned i, n = (filetab.n + 32)/32; |
| 79 | bits b; |
| 80 | |
| 81 | for (i = 0; i < n; i++) { b = live[i]; if (b) goto found; } |
| 82 | return (-1); |
| 83 | found: |
| 84 | i *= 32; |
| 85 | if (!(b&0x0000ffff)) { b >>= 16; i += 16; } |
| 86 | if (!(b&0x000000ff)) { b >>= 8; i += 8; } |
| 87 | if (!(b&0x0000000f)) { b >>= 4; i += 4; } |
| 88 | if (!(b&0x00000003)) { b >>= 2; i += 2; } |
| 89 | if (!(b&0x00000001)) { b >>= 1; i += 1; } |
| 90 | assert(b&1); |
| 91 | return (i); |
| 92 | } |
| 93 | |
| 94 | static void put_event(unsigned evtype, unsigned file, secaddr pos) |
| 95 | { |
| 96 | struct event *ev; |
| 97 | |
| 98 | VEC_PUSH(ev, &eventq); |
| 99 | ev->ev = evtype; ev->file = file; ev->pos = pos; |
| 100 | } |
| 101 | |
| 102 | static void put_file(ident id, secaddr start, secaddr end) |
| 103 | { |
| 104 | struct file *f; |
| 105 | size_t i; |
| 106 | |
| 107 | VEC_PUSH(f, &filetab); i = f - filetab.v; |
| 108 | f->id = id; f->start = start; f->end = end; |
| 109 | put_event(EV_BEGIN, i, start); |
| 110 | put_event(EV_END, i, end); |
| 111 | } |
| 112 | |
| 113 | static void put_menu(dvd_reader_t *dvd, unsigned title) |
| 114 | { |
| 115 | ident id = mkident(VOB, title, 0); |
| 116 | char fn[MAXFNSZ]; |
| 117 | secaddr start, len; |
| 118 | |
| 119 | store_filename(fn, id); |
| 120 | start = UDFFindFile(dvd, fn, &len); if (!start) return; |
| 121 | #ifdef DEBUG |
| 122 | printf(";; %8"PRIuSEC" .. %-8"PRIuSEC": %s\n", |
| 123 | start, start + SECTORS(len), fn); |
| 124 | #endif |
| 125 | put_file(id, start, start + SECTORS(len)); |
| 126 | } |
| 127 | |
| 128 | static void put_title(dvd_reader_t *dvd, unsigned title) |
| 129 | { |
| 130 | char fn[MAXFNSZ]; |
| 131 | secaddr start[9], len[9]; |
| 132 | unsigned i, npart; |
| 133 | |
| 134 | for (i = 0; i < 9; i++) { |
| 135 | store_filename(fn, mkident(VOB, title, i + 1)); |
| 136 | start[i] = UDFFindFile(dvd, fn, &len[i]); if (!start[i]) break; |
| 137 | } |
| 138 | npart = i; if (!npart) return; |
| 139 | |
| 140 | #ifdef DEBUG |
| 141 | for (i = 0; i < npart; i++) { |
| 142 | store_filename(fn, mkident(VOB, title, i + 1)); |
| 143 | printf(";; %8"PRIuSEC" .. %-8"PRIuSEC": %s\n", |
| 144 | start[i], start[i] + SECTORS(len[i]), fn); |
| 145 | } |
| 146 | #endif |
| 147 | |
| 148 | if (npart > 1) |
| 149 | for (i = 0; i < npart - 1; i++) { |
| 150 | if (len[i]%SECTORSZ) |
| 151 | bail("title %u part %u length = %"PRIuSEC" not a multiple of %d", |
| 152 | title, i, len[i], SECTORSZ); |
| 153 | if (start[i] + len[i]/SECTORSZ != start[i + 1]) |
| 154 | bail |
| 155 | ("title %u part %u end = %"PRIuSEC" /= part %u start = %"PRIuSEC"", |
| 156 | title, i, start[i] + len[i]/SECTORSZ, i + 1, start[i + 1]); |
| 157 | } |
| 158 | |
| 159 | put_file(mkident(VOB, title, 1), |
| 160 | start[0], start[npart - 1] + SECTORS(len[npart - 1])); |
| 161 | } |
| 162 | |
| 163 | static secaddr last_pos, limit, nsectors, ndone; |
| 164 | static struct timeval last_time; |
| 165 | static double wsum, wcount; |
| 166 | static struct file *file; |
| 167 | static secaddr bad_start; |
| 168 | static unsigned retry, max_retries = 4; |
| 169 | static int bad_err; |
| 170 | |
| 171 | static const char throbber[] = "|<-<|>->"; |
| 172 | static unsigned throbix = 0; |
| 173 | |
| 174 | static double scale_bytes(double n, const char **unit_out) |
| 175 | { |
| 176 | const char *unit = ""; |
| 177 | |
| 178 | if (n > 1600) { n /= 1024; unit = "k"; } |
| 179 | if (n > 1600) { n /= 1024; unit = "M"; } |
| 180 | if (n > 1600) { n /= 1024; unit = "G"; } |
| 181 | if (n > 1600) { n /= 1024; unit = "T"; } |
| 182 | |
| 183 | *unit_out = unit; return (n); |
| 184 | } |
| 185 | |
| 186 | static struct progress_item |
| 187 | copy_progress, disc_progress, |
| 188 | file_progress, badblock_progress; |
| 189 | |
| 190 | #define TIMESTRMAX 16 |
| 191 | static char *fmttime(unsigned long t, char *buf) |
| 192 | { |
| 193 | if (t < 60) sprintf(buf, "%ld s", t); |
| 194 | else if (t < 3600) sprintf(buf, "%ld:%02ld", t/60, t%60); |
| 195 | else sprintf(buf, "%ld:%02ld:%02ld", t/3600, (t/60)%60, t%60); |
| 196 | return (buf); |
| 197 | } |
| 198 | |
| 199 | static void render_perfstats(struct progress_render_state *render) |
| 200 | { |
| 201 | int eta; |
| 202 | char timebuf[TIMESTRMAX]; |
| 203 | double rate; |
| 204 | const char *unit; |
| 205 | |
| 206 | if (!wsum || !wcount) { rate = 0; eta = -1; } |
| 207 | else { rate = wsum/wcount; eta = (int)((nsectors - ndone)/rate + 0.5); } |
| 208 | |
| 209 | rate = scale_bytes(rate*SECTORSZ, &unit); |
| 210 | progress_putright(render, "ETA %s ", rate ? fmttime(eta, timebuf) : "???"); |
| 211 | progress_putright(render, "%.1f %sB/s, ", rate, unit); |
| 212 | } |
| 213 | |
| 214 | static void render_copy_progress(struct progress_item *item, |
| 215 | struct progress_render_state *render) |
| 216 | { |
| 217 | double frac = (double)ndone/nsectors; |
| 218 | |
| 219 | progress_putleft(render, " %c copied %.1f%%", |
| 220 | throbber[throbix], 100.0*frac); |
| 221 | render_perfstats(render); |
| 222 | progress_putleft(render, " (%"PRIuSEC" of %"PRIuSEC")", ndone, nsectors); |
| 223 | |
| 224 | progress_showbar(render, frac); |
| 225 | } |
| 226 | |
| 227 | static void render_disc_progress(struct progress_item *item, |
| 228 | struct progress_render_state *render) |
| 229 | { |
| 230 | double frac = (double)last_pos/limit; |
| 231 | |
| 232 | progress_putleft(render, " disc %.1f%% (%"PRIuSEC" of %"PRIuSEC")", |
| 233 | 100.0*frac, last_pos, limit); |
| 234 | progress_showbar(render, frac); |
| 235 | } |
| 236 | |
| 237 | static void render_file_progress(struct progress_item *item, |
| 238 | struct progress_render_state *render) |
| 239 | { |
| 240 | secaddr off = last_pos - file->start, len = file->end - file->start; |
| 241 | char fn[MAXFNSZ]; |
| 242 | double frac; |
| 243 | |
| 244 | store_filename(fn, file->id); |
| 245 | frac = (double)off/len; |
| 246 | progress_putleft(render, " `%s' %.1f%% (%"PRIuSEC" of %"PRIuSEC")", |
| 247 | fn, 100.0*frac, off, len); |
| 248 | progress_showbar(render, frac); |
| 249 | } |
| 250 | |
| 251 | static void render_badblock_progress(struct progress_item *item, |
| 252 | struct progress_render_state *render) |
| 253 | { |
| 254 | secaddr n = last_pos - bad_start; |
| 255 | int bg; |
| 256 | |
| 257 | if (!n) { |
| 258 | progress_putleft(render, " Retrying bad sector %"PRIuSEC"", bad_start); |
| 259 | progress_putright(render, "attempt %u/%u ", retry + 1, max_retries); |
| 260 | bg = 4; |
| 261 | } else { |
| 262 | progress_putleft(render, " Found %"PRIuSEC" bad %s", |
| 263 | n, n == 1 ? "sector" : "sectors"); |
| 264 | progress_putright(render, "%"PRIuSEC" .. %"PRIuSEC" ", |
| 265 | bad_start, last_pos); |
| 266 | bg = 1; |
| 267 | } |
| 268 | if (bad_err && bad_err != EIO) |
| 269 | progress_putleft(render, " (%s)", strerror(bad_err)); |
| 270 | progress_shownotice(render, bg, 7); |
| 271 | } |
| 272 | |
| 273 | static double alpha = 0.1; |
| 274 | |
| 275 | static void update_progress(secaddr pos) |
| 276 | { |
| 277 | struct timeval now; |
| 278 | double t, f, g; |
| 279 | |
| 280 | gettimeofday(&now, 0); |
| 281 | t = tvdiff(&last_time, &now); |
| 282 | |
| 283 | #define BETA (1 - alpha) |
| 284 | |
| 285 | if (t) { |
| 286 | g = wcount ? pow(BETA, t) : 0.0; f = (1 - g)/(1 - BETA); |
| 287 | wsum = f*(pos - last_pos)/t + g*wsum; |
| 288 | wcount = f + g*wcount; |
| 289 | ndone += pos - last_pos; |
| 290 | last_time = now; last_pos = pos; |
| 291 | } |
| 292 | |
| 293 | #undef BETA |
| 294 | |
| 295 | throbix++; if (!throbber[throbix]) throbix = 0; |
| 296 | } |
| 297 | |
| 298 | static void report_progress(secaddr pos) |
| 299 | { update_progress(pos); progress_update(&progress); } |
| 300 | |
| 301 | static dvd_reader_t *dvd; |
| 302 | static int dvdfd = -1, outfd = -1; |
| 303 | static dvd_file_t *vob; |
| 304 | static const char *mapfile; static FILE *mapfp; |
| 305 | static const char *errfile; static FILE *errfp; |
| 306 | |
| 307 | struct badblock { secaddr start, end; }; |
| 308 | DEFVEC(badblock_v, struct badblock); |
| 309 | static badblock_v badblocks = VEC_INIT; |
| 310 | |
| 311 | static int compare_badblock(const void *a, const void *b) |
| 312 | { |
| 313 | const struct badblock *ba = a, *bb = b; |
| 314 | |
| 315 | if (ba->start < bb->start) return (-1); |
| 316 | else if (ba->start > bb->start) return (+1); |
| 317 | |
| 318 | if (ba->end < bb->end) return (-1); |
| 319 | else if (ba->end > bb->end) return (+1); |
| 320 | |
| 321 | return (0); |
| 322 | } |
| 323 | |
| 324 | static double bad_block_delay = 0.0; |
| 325 | static double good_block_delay = 0.0; |
| 326 | |
| 327 | static ssize_t read_sectors(secaddr pos, void *buf, secaddr want) |
| 328 | { |
| 329 | ssize_t n, done; |
| 330 | size_t lo, mid, hi; |
| 331 | int fakeerr = 0; |
| 332 | struct badblock *bad, *best; |
| 333 | unsigned char *p = buf; |
| 334 | |
| 335 | if (badblocks.n) { |
| 336 | best = 0; lo = 0; hi = badblocks.n; |
| 337 | #ifdef DEBUG |
| 338 | progress_clear(&progress); |
| 339 | printf(";; searching badblocks for %"PRIuSEC" .. %"PRIuSEC"\n", |
| 340 | pos, pos + want); |
| 341 | #endif |
| 342 | while (lo < hi) { |
| 343 | mid = lo + (hi - lo)/2; bad = &badblocks.v[mid]; |
| 344 | #ifdef DEBUG |
| 345 | printf(";; try %zu (%"PRIuSEC" .. %"PRIuSEC")... ", |
| 346 | mid, bad->start, bad->end); |
| 347 | #endif |
| 348 | if (pos < bad->start) { D( printf("high\n"); ) best = bad; hi = mid; } |
| 349 | else if (pos >= bad->end) { D( printf("low\n"); ) lo = mid + 1; } |
| 350 | else { D( printf("match!\n"); ) errno = EIO; return (-1); } |
| 351 | } |
| 352 | #ifdef DEBUG |
| 353 | if (best) |
| 354 | printf(";; next is %"PRIuSEC" .. %"PRIuSEC"\n", |
| 355 | best->start, best->end); |
| 356 | #endif |
| 357 | if (best && pos + want > best->start) |
| 358 | { want = best->start - pos; fakeerr = EIO; sit(bad_block_delay); } |
| 359 | } |
| 360 | done = 0; |
| 361 | while (want) { |
| 362 | if (vob) |
| 363 | { errno = 0; n = DVDReadBlocks(vob, pos - file->start, want, p); } |
| 364 | else if (file) { |
| 365 | if (lseek(dvdfd, (off_t)pos*SECTORSZ, SEEK_SET) < 0) |
| 366 | bail_syserr(errno, "failed to seek to sector %"PRIuSEC"", pos); |
| 367 | errno = 0; n = read(dvdfd, p, want*SECTORSZ); |
| 368 | if (n >= 0) n /= SECTORSZ; |
| 369 | } else { |
| 370 | memset(p, 0, want*SECTORSZ); |
| 371 | n = want; |
| 372 | } |
| 373 | |
| 374 | if (n > 0) { done += n; pos += n; p += n*SECTORSZ; want -= n; } |
| 375 | else if (!n) break; |
| 376 | else if (errno == EIO && errfile) { |
| 377 | open_file_on_demand(errfile, &errfp, "bad-sector error log"); |
| 378 | fprintf(errfp, "%"PRIuSEC" %"PRIuSEC"\n", pos, pos + 1); |
| 379 | check_write(errfp, "bad-sector error log"); |
| 380 | break; |
| 381 | } else if (errno != EINTR) break; |
| 382 | } |
| 383 | if (fakeerr && !errno) errno = fakeerr; |
| 384 | else if (done > 0 && good_block_delay) sit(done*good_block_delay); |
| 385 | return (!done && errno ? -1 : done); |
| 386 | } |
| 387 | |
| 388 | static void record_bad_sectors(secaddr bad_lo, secaddr bad_hi) |
| 389 | { |
| 390 | char fn[MAXFNSZ]; |
| 391 | |
| 392 | if (!mapfile) return; |
| 393 | |
| 394 | open_file_on_demand(mapfile, &mapfp, "bad-sector region map"); |
| 395 | fprintf(mapfp, "%"PRIuSEC" %"PRIuSEC" # %"PRIuSEC" sectors", |
| 396 | bad_lo, bad_hi, bad_hi - bad_lo); |
| 397 | |
| 398 | if (file && id_kind(file->id) != RAW) { |
| 399 | store_filename(fn, file->id); |
| 400 | fprintf(mapfp, "; `%s' %"PRIuSEC" .. %"PRIuSEC" of %"PRIuSEC"", |
| 401 | fn, bad_lo - file->start, bad_hi - file->start, |
| 402 | file->end - file->start); |
| 403 | } |
| 404 | |
| 405 | fputc('\n', mapfp); |
| 406 | check_write(mapfp, "bad-sector region map"); |
| 407 | } |
| 408 | |
| 409 | static void recovered(secaddr bad_lo, secaddr bad_hi) |
| 410 | { |
| 411 | char fn[MAXFNSZ]; |
| 412 | |
| 413 | progress_clear(&progress); |
| 414 | |
| 415 | if (!file || id_kind(file->id) == RAW) |
| 416 | moan("skipping %"PRIuSEC" bad sectors (%"PRIuSEC" .. %"PRIuSEC")", |
| 417 | bad_hi - bad_lo, bad_lo, bad_hi); |
| 418 | else { |
| 419 | store_filename(fn, file->id); |
| 420 | moan("skipping %"PRIuSEC" bad sectors (%"PRIuSEC" .. %"PRIuSEC"; " |
| 421 | "`%s' %"PRIuSEC" .. %"PRIuSEC" of %"PRIuSEC")", |
| 422 | bad_hi - bad_lo, bad_lo, bad_hi, |
| 423 | fn, bad_lo - file->start, bad_hi - file->start, |
| 424 | file->end - file->start); |
| 425 | } |
| 426 | |
| 427 | record_bad_sectors(bad_lo, bad_hi); |
| 428 | |
| 429 | if (lseek(outfd, (off_t)(bad_hi - bad_lo)*SECTORSZ, SEEK_CUR) < 0) |
| 430 | bail_syserr(errno, "failed to seek past bad sectors"); |
| 431 | |
| 432 | progress_removeitem(&progress, &badblock_progress); |
| 433 | progress_update(&progress); |
| 434 | } |
| 435 | |
| 436 | struct recoverybuf { |
| 437 | unsigned char *buf; |
| 438 | secaddr sz, pos, start, end; |
| 439 | secaddr good_lo, good_hi; |
| 440 | }; |
| 441 | |
| 442 | static void rearrange_sectors(struct recoverybuf *r, |
| 443 | secaddr dest, secaddr src, secaddr len) |
| 444 | { |
| 445 | assert(dest + len <= r->sz); |
| 446 | assert(src + len <= r->sz); |
| 447 | memmove(r->buf + dest*SECTORSZ, r->buf + src*SECTORSZ, len*SECTORSZ); |
| 448 | } |
| 449 | |
| 450 | #ifdef DEBUG |
| 451 | static PRINTF_LIKE(2, 3) |
| 452 | void show_recovery_buffer_map(const struct recoverybuf *r, |
| 453 | const char *what, ...) |
| 454 | { |
| 455 | va_list ap; |
| 456 | |
| 457 | va_start(ap, what); |
| 458 | progress_clear(&progress); |
| 459 | printf(";; recovery buffer ("); |
| 460 | vprintf(what, ap); |
| 461 | printf("): " |
| 462 | "(%"PRIuSEC") ..%"PRIuSEC".. " |
| 463 | "[%"PRIuSEC" ..%"PRIuSEC".. %"PRIuSEC"] " |
| 464 | "..%"PRIuSEC".. (%"PRIuSEC")\n", |
| 465 | r->pos, r->start, |
| 466 | r->pos + r->start, r->end - r->start, r->pos + r->end, |
| 467 | r->sz - r->end, r->pos + r->sz); |
| 468 | va_end(ap); |
| 469 | assert(r->start <= r->end); |
| 470 | assert(r->end <= r->sz); |
| 471 | } |
| 472 | #endif |
| 473 | |
| 474 | static ssize_t recovery_read_sectors(struct recoverybuf *r, |
| 475 | secaddr pos, secaddr off, secaddr want) |
| 476 | { |
| 477 | ssize_t n; |
| 478 | |
| 479 | assert(off <= r->sz); assert(want <= r->sz - off); |
| 480 | n = read_sectors(pos, r->buf + off*SECTORSZ, want); |
| 481 | return (n); |
| 482 | } |
| 483 | |
| 484 | static ssize_t recovery_read_buffer(struct recoverybuf *r, |
| 485 | secaddr pos, secaddr want) |
| 486 | { |
| 487 | secaddr diff, pp, nn; |
| 488 | ssize_t n; |
| 489 | |
| 490 | #ifdef DEBUG |
| 491 | progress_clear(&progress); |
| 492 | show_recovery_buffer_map(r, "begin(%"PRIuSEC", %"PRIuSEC")", pos, want); |
| 493 | #endif |
| 494 | |
| 495 | if (pos < r->pos) { |
| 496 | diff = r->pos - pos; |
| 497 | if (r->start + diff >= r->sz) { |
| 498 | r->pos = pos; r->start = r->end = 0; |
| 499 | #ifdef DEBUG |
| 500 | show_recovery_buffer_map(r, "cleared; shift up by %"PRIuSEC"", diff); |
| 501 | #endif |
| 502 | } else { |
| 503 | if (r->end + diff > r->sz) r->end = r->sz - diff; |
| 504 | rearrange_sectors(r, r->start + diff, r->start, r->end - r->start); |
| 505 | r->pos -= diff; r->start += diff; r->end += diff; |
| 506 | #ifdef DEBUG |
| 507 | show_recovery_buffer_map(r, "shifted up by %"PRIuSEC"", diff); |
| 508 | #endif |
| 509 | } |
| 510 | } else if (pos > r->pos + r->end) { |
| 511 | r->pos = pos; r->start = r->end = 0; |
| 512 | #ifdef DEBUG |
| 513 | show_recovery_buffer_map(r, "cleared; beyond previous region"); |
| 514 | #endif |
| 515 | } else if (pos + want > r->pos + r->sz) { |
| 516 | diff = (pos + want) - (r->pos + r->sz); |
| 517 | if (r->end <= diff) { |
| 518 | r->pos = pos; r->start = r->end = 0; |
| 519 | #ifdef DEBUG |
| 520 | show_recovery_buffer_map(r, "cleared; shift down by %"PRIuSEC"", diff); |
| 521 | #endif |
| 522 | } else { |
| 523 | if (r->start < diff) r->start = diff; |
| 524 | rearrange_sectors(r, r->start - diff, r->start, r->end - r->start); |
| 525 | r->pos += diff; r->start -= diff; r->end -= diff; |
| 526 | #ifdef DEBUG |
| 527 | show_recovery_buffer_map(r, "shifted down by %"PRIuSEC"", diff); |
| 528 | #endif |
| 529 | } |
| 530 | } |
| 531 | |
| 532 | if (pos < r->pos + r->start) { |
| 533 | pp = pos - r->pos; nn = r->start - pp; |
| 534 | #ifdef DEBUG |
| 535 | printf(";; read low (%"PRIuSEC"@%"PRIuSEC", %"PRIuSEC")", pos, pp, nn); |
| 536 | fflush(stdout); |
| 537 | #endif |
| 538 | n = recovery_read_sectors(r, pos, pp, nn); |
| 539 | #ifdef DEBUG |
| 540 | printf(" -> %zd\n", n); |
| 541 | #endif |
| 542 | if (n != nn) { |
| 543 | if (n >= 0 && n > want) n = want; |
| 544 | goto end; |
| 545 | } |
| 546 | r->start = pp; |
| 547 | #ifdef DEBUG |
| 548 | show_recovery_buffer_map(r, "joined new region"); |
| 549 | #endif |
| 550 | } |
| 551 | |
| 552 | if (pos + want > r->pos + r->end) { |
| 553 | pp = r->end; nn = (pos + want) - (r->pos + r->end); |
| 554 | #ifdef DEBUG |
| 555 | printf(";; read high (%"PRIuSEC"@%"PRIuSEC", %"PRIuSEC")", |
| 556 | r->pos + pp, pp, nn); |
| 557 | fflush(stdout); |
| 558 | #endif |
| 559 | n = recovery_read_sectors(r, r->pos + pp, pp, nn); |
| 560 | #ifdef DEBUG |
| 561 | printf(" -> %zd\n", n); |
| 562 | #endif |
| 563 | if (n > 0) { |
| 564 | r->end += n; |
| 565 | #ifdef DEBUG |
| 566 | show_recovery_buffer_map(r, "joined new region"); |
| 567 | #endif |
| 568 | } |
| 569 | } |
| 570 | |
| 571 | n = r->pos + r->end - pos; |
| 572 | if (!n && want) n = -1; |
| 573 | else if (n > want) n = want; |
| 574 | |
| 575 | end: |
| 576 | #ifdef DEBUG |
| 577 | show_recovery_buffer_map(r, "done; return %zd", n); |
| 578 | #endif |
| 579 | return (n); |
| 580 | } |
| 581 | |
| 582 | static ssize_t recovery_read_multiple(struct recoverybuf *r, |
| 583 | secaddr pos, secaddr want) |
| 584 | { |
| 585 | ssize_t n; |
| 586 | secaddr skip, want0 = want; |
| 587 | |
| 588 | while (want > r->sz) { |
| 589 | skip = want - r->sz; |
| 590 | n = recovery_read_buffer(r, pos + skip, r->sz); |
| 591 | if (n < r->sz) return (skip + (n >= 0 ? n : 0)); |
| 592 | want -= r->sz; |
| 593 | } |
| 594 | n = recovery_read_buffer(r, pos, want); |
| 595 | if (n < 0 || n < want) return (n); |
| 596 | return (want0); |
| 597 | } |
| 598 | |
| 599 | static ssize_t recovery_read(struct recoverybuf *r, |
| 600 | secaddr pos, secaddr want) |
| 601 | { |
| 602 | secaddr lo = pos, hi = pos + want, span; |
| 603 | ssize_t n; |
| 604 | |
| 605 | if (hi < r->good_lo || lo > r->good_hi) { |
| 606 | n = recovery_read_multiple(r, lo, hi - lo); |
| 607 | if (n > 0) { r->good_lo = lo; r->good_hi = lo + n; } |
| 608 | return (n); |
| 609 | } |
| 610 | |
| 611 | if (hi > r->good_hi) { |
| 612 | span = hi - r->good_hi; |
| 613 | n = recovery_read_multiple(r, r->good_hi, span); |
| 614 | if (n > 0) r->good_hi += n; |
| 615 | if (n < 0 || n < span) return (r->good_hi - lo); |
| 616 | } |
| 617 | |
| 618 | if (lo < r->good_lo) { |
| 619 | span = r->good_lo - lo; |
| 620 | n = recovery_read_multiple(r, lo, span); |
| 621 | if (n == span) r->good_lo = lo; |
| 622 | else return (n); |
| 623 | } |
| 624 | |
| 625 | n = r->good_hi - pos; if (n > want) n = want; |
| 626 | if (!n) { errno = EIO; n = -1; } |
| 627 | return (n); |
| 628 | } |
| 629 | |
| 630 | static double clear_factor = 1.5; |
| 631 | static secaddr clear_min = 1, clear_max = SECLIMIT; |
| 632 | static double step_factor = 2.0; |
| 633 | static secaddr step_min = 1, step_max = 0; |
| 634 | |
| 635 | static secaddr run_length_wanted(secaddr pos, secaddr badlen, secaddr end) |
| 636 | { |
| 637 | secaddr want; |
| 638 | |
| 639 | want = clear_factor*badlen; |
| 640 | if (want < clear_min) want = clear_min; |
| 641 | if (want > end - pos) want = end - pos; |
| 642 | if (clear_max && want > clear_max) want = clear_max; |
| 643 | return (want); |
| 644 | } |
| 645 | |
| 646 | static void report_bad_blocks_progress(secaddr bad_hi, int err) |
| 647 | { bad_err = err; report_progress(bad_hi); } |
| 648 | |
| 649 | static ssize_t find_good_sector(secaddr *pos_inout, secaddr end, |
| 650 | unsigned char *buf, secaddr sz) |
| 651 | { |
| 652 | secaddr pos = *pos_inout, bad_lo, bad_hi, good, step, want; |
| 653 | struct recoverybuf r; |
| 654 | ssize_t n; |
| 655 | |
| 656 | bad_start = pos; bad_err = errno; |
| 657 | badblock_progress.render = render_badblock_progress; |
| 658 | progress_additem(&progress, &badblock_progress); |
| 659 | |
| 660 | r.buf = buf; r.sz = sz; r.pos = r.start = r.end = 0; |
| 661 | r.good_lo = r.good_hi = 0; |
| 662 | |
| 663 | want = sz; if (want > end - pos) want = end - pos; |
| 664 | for (retry = 0; retry < max_retries; retry++) { |
| 665 | report_bad_blocks_progress(pos, errno); |
| 666 | n = recovery_read(&r, pos, want); |
| 667 | #ifdef DEBUG |
| 668 | progress_clear(&progress); |
| 669 | printf(";; [retry] try reading %"PRIuSEC" .. %"PRIuSEC" -> %zd\n", |
| 670 | pos, pos + want, n); |
| 671 | #endif |
| 672 | if (n > 0) { |
| 673 | progress_clear(&progress); |
| 674 | moan("sector %"PRIuSEC" read ok after retry", pos); |
| 675 | progress_removeitem(&progress, &badblock_progress); |
| 676 | progress_update(&progress); |
| 677 | return (n); |
| 678 | } |
| 679 | } |
| 680 | |
| 681 | bad_lo = pos; bad_hi = pos + 1; |
| 682 | for (;;) { |
| 683 | report_bad_blocks_progress(bad_hi, errno); |
| 684 | #ifdef DEBUG |
| 685 | progress_clear(&progress); |
| 686 | printf(";; bounding bad-block region: " |
| 687 | "%"PRIuSEC" ..%"PRIuSEC".. %"PRIuSEC"\n", |
| 688 | bad_lo, bad_hi - bad_lo, bad_hi); |
| 689 | #endif |
| 690 | if (bad_hi >= end) { |
| 691 | progress_clear(&progress); |
| 692 | moan("giving up on this extent"); |
| 693 | recovered(bad_lo, end); *pos_inout = end; |
| 694 | return (0); |
| 695 | } |
| 696 | step = (step_factor - 1)*(bad_hi - bad_lo); |
| 697 | if (step < step_min) step = step_min; |
| 698 | if (step_max && step > step_max) step = step_max; |
| 699 | if (step > end - bad_hi) step = end - bad_hi; |
| 700 | pos = bad_hi + step - 1; |
| 701 | want = run_length_wanted(pos, step, end); |
| 702 | n = recovery_read(&r, pos, want); |
| 703 | #ifdef DEBUG |
| 704 | printf(";; [bound] try reading %"PRIuSEC" .. %"PRIuSEC" -> %zd\n", |
| 705 | pos, pos + want, n); |
| 706 | #endif |
| 707 | if (n == want) break; |
| 708 | if (n < 0) n = 0; |
| 709 | bad_hi = pos + n + 1; |
| 710 | } |
| 711 | |
| 712 | good = pos; |
| 713 | while (good > bad_hi) { |
| 714 | report_bad_blocks_progress(bad_hi, errno); |
| 715 | #ifdef DEBUG |
| 716 | progress_clear(&progress); |
| 717 | printf(";; limiting bad-block region: " |
| 718 | "%"PRIuSEC" ..%"PRIuSEC".. %"PRIuSEC" ..%"PRIuSEC".. %"PRIuSEC"\n", |
| 719 | bad_lo, bad_hi - bad_lo, bad_hi, good - bad_hi, good); |
| 720 | #endif |
| 721 | pos = bad_hi + (good - bad_hi)/2; |
| 722 | step = pos - bad_lo; |
| 723 | want = run_length_wanted(pos, step, end); |
| 724 | n = recovery_read(&r, pos, want); |
| 725 | #ifdef DEBUG |
| 726 | printf(";; [limit] try reading %"PRIuSEC" .. %"PRIuSEC" -> %zd\n", |
| 727 | pos, pos + want, n); |
| 728 | #endif |
| 729 | if (n < 0) n = 0; |
| 730 | if (n == want) good = pos; |
| 731 | else bad_hi = pos + n + 1; |
| 732 | } |
| 733 | recovered(bad_lo, bad_hi); *pos_inout = bad_hi; |
| 734 | if (bad_hi < r.pos + r.start || r.pos + r.end <= bad_hi) |
| 735 | n = 0; |
| 736 | else { |
| 737 | n = r.pos + r.end - bad_hi; |
| 738 | rearrange_sectors(&r, 0, bad_hi - r.pos, n); |
| 739 | } |
| 740 | #ifdef DEBUG |
| 741 | show_recovery_buffer_map(&r, "returning %zd good sectors at %"PRIuSEC"", |
| 742 | n, bad_hi); |
| 743 | #endif |
| 744 | return (n); |
| 745 | } |
| 746 | |
| 747 | static void emit(secaddr start, secaddr end) |
| 748 | { |
| 749 | #define BUFSECTORS 512 |
| 750 | |
| 751 | int least; |
| 752 | unsigned char buf[BUFSECTORS*SECTORSZ]; |
| 753 | secaddr pos; |
| 754 | size_t want; |
| 755 | ssize_t n; |
| 756 | static int first_time = 1; |
| 757 | #ifdef DEBUG |
| 758 | struct file *f; |
| 759 | char fn[MAXFNSZ]; |
| 760 | int act = -1; |
| 761 | int i; |
| 762 | #endif |
| 763 | |
| 764 | least = least_live(); |
| 765 | |
| 766 | #ifdef DEBUG |
| 767 | printf(";; %8"PRIuSEC" .. %"PRIuSEC"\n", start, end); |
| 768 | |
| 769 | for (i = 0; i < filetab.n; i++) { |
| 770 | if (!livep(i)) continue; |
| 771 | if (act == -1) act = i; |
| 772 | f = &filetab.v[i]; store_filename(fn, f->id); |
| 773 | printf(";;\t\t%8"PRIuSEC" .. %-8"PRIuSEC" %s\n", |
| 774 | start - f->start, end - f->start, fn); |
| 775 | } |
| 776 | if (act == -1) printf(";;\t\t#<no live source>\n"); |
| 777 | assert(act == least); |
| 778 | #endif |
| 779 | |
| 780 | if (least == -1) |
| 781 | { file = 0; vob = 0; } |
| 782 | else { |
| 783 | file = &filetab.v[least]; |
| 784 | switch (id_kind(file->id)) { |
| 785 | case RAW: |
| 786 | vob = 0; |
| 787 | break; |
| 788 | case VOB: |
| 789 | if (first_time) { progress_clear(&progress); first_time = 0; } |
| 790 | vob = DVDOpenFile(dvd, id_title(file->id), |
| 791 | id_part(file->id) |
| 792 | ? DVD_READ_TITLE_VOBS |
| 793 | : DVD_READ_MENU_VOBS); |
| 794 | if (!vob) |
| 795 | bail("failed to open %s %u", |
| 796 | id_part(file->id) ? "title" : "menu", |
| 797 | id_title(file->id)); |
| 798 | progress_update(&progress); |
| 799 | break; |
| 800 | default: |
| 801 | abort(); |
| 802 | } |
| 803 | } |
| 804 | |
| 805 | if (file && id_kind(file->id) != RAW) { |
| 806 | file_progress.render = render_file_progress; |
| 807 | progress_additem(&progress, &file_progress); |
| 808 | } |
| 809 | |
| 810 | pos = start; |
| 811 | while (pos < end) { |
| 812 | want = end - pos; if (want > BUFSECTORS) want = BUFSECTORS; |
| 813 | n = read_sectors(pos, buf, want); |
| 814 | |
| 815 | if (n <= 0) n = find_good_sector(&pos, end, buf, BUFSECTORS); |
| 816 | if (n > 0) { carefully_write(outfd, buf, n*SECTORSZ); pos += n; } |
| 817 | report_progress(pos); |
| 818 | } |
| 819 | |
| 820 | if (vob) { DVDCloseFile(vob); vob = 0; } |
| 821 | |
| 822 | if (file && id_kind(file->id) != RAW) |
| 823 | progress_removeitem(&progress, &file_progress); |
| 824 | progress_update(&progress); |
| 825 | |
| 826 | #undef BUFSECTORS |
| 827 | } |
| 828 | |
| 829 | struct buf { |
| 830 | char *p; |
| 831 | size_t n, sz; |
| 832 | }; |
| 833 | #define BUF_INIT { 0, 0, 0 } |
| 834 | #define BUF_REWIND(b) do { (b)->n = 0; } while (0) |
| 835 | #define BUF_FREE(b) do { \ |
| 836 | buf *_b = (b); \ |
| 837 | free(_b->p); _b->p = 0; _b->n = _b->sz = 0; \ |
| 838 | } while (0) |
| 839 | #define BUF_PUTC(b, ch) do { \ |
| 840 | struct buf *_b = (b); \ |
| 841 | if (_b->n >= _b->sz) { \ |
| 842 | _b->sz = _b->sz ? 2*_b->sz : 32; \ |
| 843 | _b->p = realloc(_b->p, _b->sz); \ |
| 844 | if (!_b->p) bail("out of memory allocating %zu bytes", _b->sz); \ |
| 845 | } \ |
| 846 | _b->p[_b->n] = (ch); \ |
| 847 | } while (0) |
| 848 | |
| 849 | static int read_line(FILE *fp, struct buf *b) |
| 850 | { |
| 851 | int ch; |
| 852 | |
| 853 | ch = getc(fp); |
| 854 | if (ch == EOF) |
| 855 | return (-1); |
| 856 | else if (ch != '\n') do { |
| 857 | BUF_PUTC(b, ch); b->n++; |
| 858 | ch = getc(fp); |
| 859 | } while (ch != EOF && ch != '\n'); |
| 860 | BUF_PUTC(b, 0); |
| 861 | return (0); |
| 862 | } |
| 863 | |
| 864 | #define PRF_HYPHEN 1u |
| 865 | static int parse_range(const char *p, unsigned f, |
| 866 | secaddr *start_out, secaddr *end_out) |
| 867 | { |
| 868 | char *q; |
| 869 | int err, rc; |
| 870 | unsigned long start, end; |
| 871 | |
| 872 | err = errno; |
| 873 | |
| 874 | if (ISDIGIT(*p)) { |
| 875 | start = strtoul(p, &q, 0); |
| 876 | if (errno || start >= SECLIMIT) { rc = -1; goto end; } |
| 877 | *start_out = start; p = q; |
| 878 | } else if (!(f&PRF_HYPHEN)) |
| 879 | { rc = -1; goto end; } |
| 880 | else |
| 881 | start = 0; |
| 882 | |
| 883 | if (f&PRF_HYPHEN) { |
| 884 | if (*p != '-') { rc = -1; goto end; } |
| 885 | p++; |
| 886 | } else { |
| 887 | if (!ISSPACE(*p)) { rc = -1; goto end; } |
| 888 | do p++; while (ISSPACE(*p)); |
| 889 | } |
| 890 | |
| 891 | if (ISDIGIT(*p)) { |
| 892 | end = strtoul(p, &q, 0); |
| 893 | if (errno || end > SECLIMIT || end < start) { rc = -1; goto end; } |
| 894 | *end_out = end; p = q; |
| 895 | } else if (!(f&PRF_HYPHEN)) |
| 896 | { rc = -1; goto end; } |
| 897 | |
| 898 | if (!(f&PRF_HYPHEN)) while (ISSPACE(*p)) p++; |
| 899 | if (*p && ((f&PRF_HYPHEN) || *p != '#')) { rc = -1; goto end; } |
| 900 | |
| 901 | rc = 0; |
| 902 | end: |
| 903 | errno = err; |
| 904 | return (rc); |
| 905 | } |
| 906 | |
| 907 | #ifdef DEBUG |
| 908 | static void dump_eventq(const char *what) |
| 909 | { |
| 910 | unsigned i; |
| 911 | const struct event *ev; |
| 912 | char fn[MAXFNSZ]; |
| 913 | |
| 914 | printf("\n;; event dump (%s):\n", what); |
| 915 | for (i = 0; i < eventq.n; i++) { |
| 916 | ev = &eventq.v[i]; |
| 917 | switch (ev->ev) { |
| 918 | case EV_BEGIN: |
| 919 | store_filename(fn, filetab.v[ev->file].id); |
| 920 | printf(";; %8"PRIuSEC": begin %s\n", ev->pos, fn); |
| 921 | break; |
| 922 | case EV_END: |
| 923 | store_filename(fn, filetab.v[ev->file].id); |
| 924 | printf(";; %8"PRIuSEC": end %s\n", ev->pos, fn); |
| 925 | break; |
| 926 | case EV_WRITE: |
| 927 | printf(";; %8"PRIuSEC": write\n", ev->pos); |
| 928 | break; |
| 929 | case EV_STOP: |
| 930 | printf(";; %8"PRIuSEC": stop\n", ev->pos); |
| 931 | break; |
| 932 | default: |
| 933 | printf(";; %8"PRIuSEC": ?%u\n", ev->pos, ev->ev); |
| 934 | break; |
| 935 | } |
| 936 | } |
| 937 | } |
| 938 | #endif |
| 939 | |
| 940 | int main(int argc, char *argv[]) |
| 941 | { |
| 942 | unsigned f = 0; |
| 943 | const char *p; |
| 944 | off_t volsz; |
| 945 | secaddr pos; |
| 946 | off_t off; |
| 947 | secaddr start, end, last; |
| 948 | const struct event *ev; |
| 949 | const char *device, *outfile; |
| 950 | struct badblock *bad; |
| 951 | int opt, blksz; |
| 952 | size_t i; |
| 953 | FILE *fp; |
| 954 | struct buf buf = BUF_INIT; |
| 955 | struct timeval tv0, tv1; |
| 956 | double t, rate, tot; |
| 957 | const char *rateunit, *totunit; |
| 958 | char timebuf[TIMESTRMAX], id_in[MAXIDSZ], id_out[MAXIDSZ]; |
| 959 | dvd_reader_t *dvd_out; |
| 960 | #ifdef DEBUG |
| 961 | const struct file *file; |
| 962 | char fn[MAXFNSZ]; |
| 963 | #endif |
| 964 | |
| 965 | #define f_bogus 1u |
| 966 | #define f_continue 2u |
| 967 | #define f_fixup 4u |
| 968 | #define f_stats 8u |
| 969 | #define f_checkid 16u |
| 970 | #define f_write 256u |
| 971 | |
| 972 | set_prog(argv[0]); |
| 973 | for (;;) { |
| 974 | opt = getopt(argc, argv, "hB:E:FR:X:b:cir:s"); if (opt < 0) break; |
| 975 | switch (opt) { |
| 976 | case 'h': usage(stderr); exit(0); |
| 977 | case 'B': |
| 978 | p = optarg; |
| 979 | #define SKIP_PREFIX(s) \ |
| 980 | (STRNCMP(p, ==, s "=", sizeof(s)) && (p += sizeof(s), 1)) |
| 981 | for (;;) { |
| 982 | if (SKIP_PREFIX("cf")) |
| 983 | clear_factor = parse_float(&p, PNF_JUNK, 0, DBL_MAX, |
| 984 | "clear factor"); |
| 985 | else if (SKIP_PREFIX("cmin")) |
| 986 | clear_min = parse_int(&p, PNF_JUNK, 1, SECLIMIT, |
| 987 | "clear minimum"); |
| 988 | else if (SKIP_PREFIX("cmax")) |
| 989 | clear_max = parse_int(&p, PNF_JUNK, 1, SECLIMIT, |
| 990 | "clear maximum"); |
| 991 | else if (SKIP_PREFIX("sf")) |
| 992 | step_factor = parse_float(&p, PNF_JUNK, 0, DBL_MAX, |
| 993 | "step factor"); |
| 994 | else if (SKIP_PREFIX("smin")) |
| 995 | step_min = parse_int(&p, PNF_JUNK, 1, SECLIMIT - 1, |
| 996 | "step minimum"); |
| 997 | else if (SKIP_PREFIX("smax")) |
| 998 | step_max = parse_int(&p, PNF_JUNK, 1, SECLIMIT - 1, |
| 999 | "step maximum"); |
| 1000 | else if (SKIP_PREFIX("retry")) |
| 1001 | max_retries = parse_int(&p, PNF_JUNK, 0, INT_MAX, "retries"); |
| 1002 | else if (SKIP_PREFIX("alpha")) |
| 1003 | alpha = parse_float(&p, PNF_JUNK, 0, 1, "average decay factor"); |
| 1004 | else if (SKIP_PREFIX("_badwait")) |
| 1005 | bad_block_delay = parse_float(&p, PNF_JUNK, 0, DBL_MAX, |
| 1006 | "bad-block delay"); |
| 1007 | else if (SKIP_PREFIX("_blkwait")) |
| 1008 | good_block_delay = parse_float(&p, PNF_JUNK, 0, DBL_MAX, |
| 1009 | "good block delay"); |
| 1010 | else |
| 1011 | bail("unknown bad blocks parameter `%s'", p); |
| 1012 | if (!*p) break; |
| 1013 | else if (*p != ',') bail("unexpected junk in parameters"); |
| 1014 | p++; |
| 1015 | } |
| 1016 | #undef SKIP_PREFIX |
| 1017 | break; |
| 1018 | case 'E': errfile = optarg; break; |
| 1019 | case 'F': f |= f_fixup; break; |
| 1020 | case 'R': |
| 1021 | fp = fopen(optarg, "r"); |
| 1022 | if (!fp) |
| 1023 | bail_syserr(errno, "failed to open ranges file `%s'", optarg); |
| 1024 | i = 0; last = -1; |
| 1025 | for (;;) { |
| 1026 | BUF_REWIND(&buf); if (read_line(fp, &buf)) break; |
| 1027 | p = buf.p; i++; |
| 1028 | while (ISSPACE(*p)) p++; |
| 1029 | if (!*p || *p == '#') continue; |
| 1030 | if (parse_range(p, 0, &start, &end) || |
| 1031 | (last <= SECLIMIT && start < last)) |
| 1032 | bail("bad range `%s' at `%s' line %zu", buf.p, optarg, i); |
| 1033 | if (start < end) { |
| 1034 | if (start == last) |
| 1035 | eventq.v[eventq.n - 1].pos = end; |
| 1036 | else { |
| 1037 | put_event(EV_WRITE, 0, start); |
| 1038 | put_event(EV_STOP, 0, end); |
| 1039 | } |
| 1040 | last = end; |
| 1041 | } |
| 1042 | } |
| 1043 | if (ferror(fp)) |
| 1044 | bail_syserr(errno, "failed to read ranges file `%s'", optarg); |
| 1045 | break; |
| 1046 | case 'X': |
| 1047 | fp = fopen(optarg, "r"); |
| 1048 | if (!fp) |
| 1049 | bail_syserr(errno, "failed to open bad-blocks file `%s'", optarg); |
| 1050 | i = 0; last = -1; |
| 1051 | for (;;) { |
| 1052 | BUF_REWIND(&buf); if (read_line(fp, &buf)) break; |
| 1053 | p = buf.p; i++; |
| 1054 | while (ISSPACE(*p)) p++; |
| 1055 | if (!*p || *p == '#') continue; |
| 1056 | if (parse_range(p, 0, &start, &end) || |
| 1057 | (last <= SECLIMIT && start < last)) |
| 1058 | bail("bad range `%s' at `%s' line %zu", buf.p, optarg, i); |
| 1059 | if (start < end) |
| 1060 | { VEC_PUSH(bad, &badblocks); bad->start = start; bad->end = end; } |
| 1061 | } |
| 1062 | if (ferror(fp)) |
| 1063 | bail_syserr(errno, "failed to read bad-blocks file `%s'", optarg); |
| 1064 | break; |
| 1065 | case 'b': |
| 1066 | if (mapfile) bail("can't have multiple map files"); |
| 1067 | mapfile = optarg; |
| 1068 | break; |
| 1069 | case 'c': f |= f_continue; break; |
| 1070 | case 'i': f |= f_checkid; break; |
| 1071 | case 'r': |
| 1072 | start = 0; end = -1; |
| 1073 | if (parse_range(optarg, PRF_HYPHEN, &start, &end)) |
| 1074 | bail("bad range `%s'", optarg); |
| 1075 | if (start < end) { |
| 1076 | put_event(EV_WRITE, 0, start); |
| 1077 | if (end <= SECLIMIT) put_event(EV_STOP, 0, end); |
| 1078 | } |
| 1079 | break; |
| 1080 | case 's': f |= f_stats; break; |
| 1081 | default: f |= f_bogus; break; |
| 1082 | } |
| 1083 | } |
| 1084 | if (argc - optind != 2) f |= f_bogus; |
| 1085 | if (f&f_bogus) { usage(stderr); exit(2); } |
| 1086 | |
| 1087 | setlocale(LC_ALL, ""); |
| 1088 | progress_init(&progress); |
| 1089 | device = argv[optind]; outfile = argv[optind + 1]; |
| 1090 | |
| 1091 | if (badblocks.n) { |
| 1092 | qsort(badblocks.v, badblocks.n, sizeof(struct badblock), |
| 1093 | compare_badblock); |
| 1094 | #ifdef DEBUG |
| 1095 | printf(";; fake bad blocks:\n"); |
| 1096 | for (i = 0; i < badblocks.n; i++) |
| 1097 | printf(";;\t%8"PRIuSEC" .. %"PRIuSEC"\n", |
| 1098 | badblocks.v[i].start, badblocks.v[i].end); |
| 1099 | #endif |
| 1100 | } |
| 1101 | |
| 1102 | open_dvd(device, O_RDONLY, &dvdfd, &dvd); |
| 1103 | |
| 1104 | blksz = SECTORSZ; volsz = device_size(dvdfd, device, &blksz); |
| 1105 | if (blksz != SECTORSZ) |
| 1106 | bail("device `%s' block size %d /= %d", device, blksz, SECTORSZ); |
| 1107 | if (volsz%SECTORSZ) |
| 1108 | bail("device `%s' volume size %"PRIu64" not a multiple of %d", |
| 1109 | device, volsz, SECTORSZ); |
| 1110 | |
| 1111 | if (f&f_checkid) { |
| 1112 | open_dvd(outfile, O_RDONLY, 0, &dvd_out); |
| 1113 | if (dvd_id(id_in, dvd, DIF_MUSTIFOHASH, device) || |
| 1114 | dvd_id(id_out, dvd_out, DIF_MUSTIFOHASH, device)) |
| 1115 | exit(2); |
| 1116 | if (STRCMP(id_in, !=, id_out)) |
| 1117 | bail("DVD id mismatch: input `%s' is `%s'; output `%s' is `%s'", |
| 1118 | device, id_in, outfile, id_out); |
| 1119 | } |
| 1120 | |
| 1121 | outfd = open(outfile, O_WRONLY | O_CREAT, 0666); |
| 1122 | if (outfd < 0) |
| 1123 | bail_syserr(errno, "failed to create output file `%s'", outfile); |
| 1124 | |
| 1125 | if (f&f_continue) { |
| 1126 | off = lseek(outfd, 0, SEEK_END); |
| 1127 | if (off < 0) |
| 1128 | bail_syserr(errno, "failed to seek to end of output file `%s'", |
| 1129 | outfile); |
| 1130 | put_event(EV_WRITE, 0, off/SECTORSZ); |
| 1131 | } else if (!eventq.n && !(f&f_fixup)) |
| 1132 | put_event(EV_WRITE, 0, 0); |
| 1133 | |
| 1134 | /* It's fast enough just to check everything. */ |
| 1135 | put_menu(dvd, 0); |
| 1136 | for (i = 1; i < 100; i++) { |
| 1137 | put_menu(dvd, i); |
| 1138 | put_title(dvd, i); |
| 1139 | } |
| 1140 | put_file(mkident(RAW, 0, 0), 0, volsz/SECTORSZ); |
| 1141 | assert(filetab.n <= MAXFILES); |
| 1142 | |
| 1143 | for (i = 0, limit = 0; i < filetab.n; i++) |
| 1144 | if (filetab.v[i].end > limit) limit = filetab.v[i].end; |
| 1145 | |
| 1146 | if (end > limit) end = limit; |
| 1147 | |
| 1148 | #ifdef DEBUG |
| 1149 | printf("\n;; files:\n"); |
| 1150 | for (i = 0; i < filetab.n; i++) { |
| 1151 | file = &filetab.v[i]; |
| 1152 | store_filename(fn, file->id); |
| 1153 | printf(";;\t%8"PRIuSEC" .. %-8"PRIuSEC" %s\n", |
| 1154 | file->start, file->end, fn); |
| 1155 | } |
| 1156 | #endif |
| 1157 | |
| 1158 | qsort(eventq.v, eventq.n, sizeof(struct event), compare_event); |
| 1159 | |
| 1160 | f &= ~f_write; start = 0; |
| 1161 | for (i = 0; i < eventq.n; i++) { |
| 1162 | ev = &eventq.v[i]; |
| 1163 | switch (ev->ev) { |
| 1164 | case EV_WRITE: |
| 1165 | if (f&f_write) |
| 1166 | bail("overlapping ranges: range from %"PRIuSEC" " |
| 1167 | "still open at %"PRIuSEC"", |
| 1168 | start, ev->pos); |
| 1169 | f |= f_write; start = ev->pos; |
| 1170 | break; |
| 1171 | case EV_STOP: |
| 1172 | f &= ~f_write; |
| 1173 | break; |
| 1174 | } |
| 1175 | } |
| 1176 | |
| 1177 | #ifdef DEBUG |
| 1178 | dump_eventq("initial"); |
| 1179 | #endif |
| 1180 | f &= ~f_write; start = 0; |
| 1181 | for (i = 0; i < eventq.n; i++) { |
| 1182 | ev = &eventq.v[i]; |
| 1183 | if (ev->ev == EV_WRITE) { start = ev->pos; f |= f_write; } |
| 1184 | if (ev->pos >= limit) break; |
| 1185 | if (ev->ev == EV_STOP) { nsectors += ev->pos - start; f &= ~f_write; } |
| 1186 | if (f&f_fixup) start = ev->pos; |
| 1187 | } |
| 1188 | eventq.n = i; |
| 1189 | #ifdef DEBUG |
| 1190 | dump_eventq("trimmed"); |
| 1191 | #endif |
| 1192 | if (f&f_fixup) { |
| 1193 | put_event(EV_WRITE, 0, start); |
| 1194 | f |= f_write; |
| 1195 | } |
| 1196 | if (f&f_write) { |
| 1197 | nsectors += limit - start; |
| 1198 | put_event(EV_STOP, 0, limit); |
| 1199 | } |
| 1200 | #ifdef DEBUG |
| 1201 | dump_eventq("final"); |
| 1202 | #endif |
| 1203 | |
| 1204 | copy_progress.render = render_copy_progress; |
| 1205 | progress_additem(&progress, ©_progress); |
| 1206 | if (nsectors == limit - start) |
| 1207 | { ndone = start; nsectors = limit; } |
| 1208 | else { |
| 1209 | disc_progress.render = render_disc_progress; |
| 1210 | progress_additem(&progress, &disc_progress); |
| 1211 | } |
| 1212 | |
| 1213 | if (f&f_stats) gettimeofday(&tv0, 0); |
| 1214 | |
| 1215 | #ifdef DEBUG |
| 1216 | printf("\n;; event sweep:\n"); |
| 1217 | #endif |
| 1218 | f &= ~f_write; |
| 1219 | for (pos = 0, i = 0; i < eventq.n; i++) { |
| 1220 | ev = &eventq.v[i]; |
| 1221 | if (ev->pos > pos) { |
| 1222 | if (f&f_write) emit(pos, ev->pos); |
| 1223 | pos = ev->pos; |
| 1224 | #ifdef DEBUG |
| 1225 | progress_clear(&progress); |
| 1226 | printf(";;\n"); |
| 1227 | #endif |
| 1228 | } |
| 1229 | switch (ev->ev) { |
| 1230 | case EV_BEGIN: |
| 1231 | set_live(ev->file); |
| 1232 | #ifdef DEBUG |
| 1233 | store_filename(fn, filetab.v[ev->file].id); |
| 1234 | progress_clear(&progress); |
| 1235 | printf(";; %8"PRIuSEC": begin `%s'\n", pos, fn); |
| 1236 | #endif |
| 1237 | break; |
| 1238 | case EV_WRITE: |
| 1239 | gettimeofday(&last_time, 0); last_pos = pos; |
| 1240 | if (lseek(outfd, (off_t)ev->pos*SECTORSZ, SEEK_SET) < 0) |
| 1241 | bail_syserr(errno, |
| 1242 | "failed to seek to resume position " |
| 1243 | "(sector %"PRIuSEC") in output file `%s'", |
| 1244 | ev->pos, outfile); |
| 1245 | #ifdef DEBUG |
| 1246 | progress_clear(&progress); |
| 1247 | printf(";; %8"PRIuSEC": begin write\n", pos); |
| 1248 | #endif |
| 1249 | f |= f_write; |
| 1250 | break; |
| 1251 | case EV_STOP: |
| 1252 | f &= ~f_write; |
| 1253 | #ifdef DEBUG |
| 1254 | progress_clear(&progress); |
| 1255 | printf(";; %8"PRIuSEC": end write\n", pos); |
| 1256 | #endif |
| 1257 | break; |
| 1258 | case EV_END: |
| 1259 | clear_live(ev->file); |
| 1260 | #ifdef DEBUG |
| 1261 | store_filename(fn, filetab.v[ev->file].id); |
| 1262 | progress_clear(&progress); |
| 1263 | printf(";; %8"PRIuSEC": end `%s'\n", pos, fn); |
| 1264 | #endif |
| 1265 | break; |
| 1266 | default: abort(); |
| 1267 | } |
| 1268 | } |
| 1269 | |
| 1270 | progress_clear(&progress); |
| 1271 | |
| 1272 | if (ftruncate(outfd, (off_t)limit*SECTORSZ) < 0) |
| 1273 | bail_syserr(errno, "failed to set output file `%s' length", outfile); |
| 1274 | |
| 1275 | if (f&f_stats) { |
| 1276 | gettimeofday(&tv1, 0); t = tvdiff(&tv0, &tv1); |
| 1277 | if (nsectors == limit) { ndone -= start; nsectors -= start; } |
| 1278 | tot = scale_bytes((double)nsectors*SECTORSZ, &totunit); |
| 1279 | rate = scale_bytes((double)nsectors*SECTORSZ/t, &rateunit); |
| 1280 | moan("all done: %.1f %sB in %s -- %.1f %sB/s", |
| 1281 | tot, totunit, fmttime(t, timebuf), rate, rateunit); |
| 1282 | } |
| 1283 | |
| 1284 | if (dvd) DVDClose(dvd); |
| 1285 | if (dvdfd >= 0) close(dvdfd); |
| 1286 | if (outfd >= 0) close(outfd); |
| 1287 | carefully_fclose(mapfp, "bad-sector region map"); |
| 1288 | carefully_fclose(errfp, "bad-sector error log"); |
| 1289 | progress_free(&progress); |
| 1290 | |
| 1291 | #undef f_bogus |
| 1292 | #undef f_continue |
| 1293 | #undef f_fixup |
| 1294 | #undef f_stats |
| 1295 | #undef f_write |
| 1296 | |
| 1297 | return (0); |
| 1298 | } |