| 11 |  | #include "platform.h" | 
| 12 |  | #include "rtio.h" | 
| 13 |  | #include "resolu.h" | 
| 14 | < | #ifdef _WIN32 | 
| 15 | < | #undef ftello | 
| 16 | < | #define ftello  ftell | 
| 17 | < | #undef ssize_t | 
| 18 | < | #define ssize_t size_t | 
| 14 | > | #if defined(_WIN32) || defined(_WIN64) | 
| 15 | > | #undef ftello | 
| 16 | > | #define       ftello  ftell | 
| 17 | > | #undef ssize_t | 
| 18 | > | #define ssize_t       size_t | 
| 19 |  | #else | 
| 20 | < | #include <sys/mman.h> | 
| 20 | > | #include <sys/mman.h> | 
| 21 |  | #endif | 
| 22 |  |  | 
| 23 | < | #ifdef getc_unlocked            /* avoid horrendous overhead of flockfile */ | 
| 24 | < | #undef getc | 
| 25 | < | #undef putc | 
| 26 | < | #define getc    getc_unlocked | 
| 27 | < | #define putc    putc_unlocked | 
| 28 | < | #endif | 
| 23 | > | #define MAXLEVELS       16      /* max RxC.. block pairs */ | 
| 24 |  |  | 
| 25 |  | typedef struct { | 
| 26 | + | void    *mapped;        /* memory-mapped pointer */ | 
| 27 |  | void    *base;          /* pointer to base memory */ | 
| 28 |  | size_t  len;            /* allocated memory length */ | 
| 33 | – | int     mapped;         /* memory-mapped file? */ | 
| 29 |  | } MEMLOAD;              /* file loaded/mapped into memory */ | 
| 30 |  |  | 
| 31 |  | typedef struct { | 
| 32 |  | int     nw_rec;         /* number of words per record */ | 
| 33 | < | int     nrecs;          /* number of records we found */ | 
| 33 | > | long    nrecs;          /* number of records we found */ | 
| 34 |  | char    *rec[1];        /* record array (extends struct) */ | 
| 35 |  | } RECINDEX; | 
| 36 |  |  | 
| 44 |  | return; | 
| 45 |  | #ifdef MAP_FILE | 
| 46 |  | if (mp->mapped) | 
| 47 | < | munmap(mp->base, mp->len); | 
| 47 | > | munmap(mp->mapped, mp->len); | 
| 48 |  | else | 
| 49 |  | #endif | 
| 50 |  | free(mp->base); | 
| 51 | + | mp->mapped = NULL; | 
| 52 |  | mp->base = NULL; | 
| 53 |  | mp->len = 0; | 
| 54 |  | } | 
| 55 |  |  | 
| 60 | – | /* load a file into memory */ | 
| 61 | – | static int | 
| 62 | – | load_file(MEMLOAD *mp, FILE *fp) | 
| 63 | – | { | 
| 64 | – | int     fd; | 
| 65 | – | off_t   skip, flen; | 
| 66 | – |  | 
| 67 | – | if (mp == NULL) | 
| 68 | – | return(-1); | 
| 69 | – | mp->base = NULL; | 
| 70 | – | mp->len = 0; | 
| 71 | – | mp->mapped = 0; | 
| 72 | – | if (fp == NULL) | 
| 73 | – | return(-1); | 
| 74 | – | fd = fileno(fp); | 
| 75 | – | skip = ftello(fp); | 
| 76 | – | flen = lseek(fd, 0, SEEK_END); | 
| 77 | – | if (flen <= skip) | 
| 78 | – | return((int)(flen - skip)); | 
| 79 | – | mp->len = (size_t)(flen - skip); | 
| 80 | – | #ifdef MAP_FILE | 
| 81 | – | if (mp->len > 1L<<20) {         /* map file if > 1 MByte */ | 
| 82 | – | mp->base = mmap(NULL, mp->len, PROT_READ, MAP_PRIVATE, fd, skip); | 
| 83 | – | if (mp->base != MAP_FAILED) { | 
| 84 | – | mp->mapped = 1; | 
| 85 | – | return(1);      /* mmap() success */ | 
| 86 | – | } | 
| 87 | – | mp->base = NULL;        /* fall back to reading it in... */ | 
| 88 | – | } | 
| 89 | – | #endif | 
| 90 | – | if (lseek(fd, skip, SEEK_SET) != skip || | 
| 91 | – | (mp->base = malloc(mp->len)) == NULL) { | 
| 92 | – | mp->len = 0; | 
| 93 | – | return(-1); | 
| 94 | – | } | 
| 95 | – | if (read(fd, (char *)mp->base, mp->len) != mp->len) { | 
| 96 | – | free_load(mp); | 
| 97 | – | return(-1); | 
| 98 | – | } | 
| 99 | – | return(1); | 
| 100 | – | } | 
| 101 | – |  | 
| 56 |  | /* load memory from an input stream, starting from current position */ | 
| 57 |  | static int | 
| 58 |  | load_stream(MEMLOAD *mp, FILE *fp) | 
| 63 |  |  | 
| 64 |  | if (mp == NULL) | 
| 65 |  | return(-1); | 
| 66 | + | mp->mapped = NULL; | 
| 67 |  | mp->base = NULL; | 
| 68 |  | mp->len = 0; | 
| 114 | – | mp->mapped = 0; | 
| 69 |  | if (fp == NULL) | 
| 70 |  | return(-1); | 
| 71 |  | while ((nr = fread(buf, 1, sizeof(buf), fp)) > 0) { | 
| 72 |  | if (!alloced) | 
| 73 | < | mp->base = malloc(nr); | 
| 73 | > | mp->base = malloc(alloced = nr); | 
| 74 |  | else if (mp->len+nr > alloced) | 
| 75 |  | mp->base = realloc(mp->base, | 
| 76 |  | alloced = alloced*(2+(nr==sizeof(buf)))/2+nr); | 
| 88 |  | return(mp->len > 0); | 
| 89 |  | } | 
| 90 |  |  | 
| 91 | + | /* load a file into memory */ | 
| 92 | + | static int | 
| 93 | + | load_file(MEMLOAD *mp, FILE *fp) | 
| 94 | + | { | 
| 95 | + | int     fd; | 
| 96 | + | off_t   skip, flen, fpos; | 
| 97 | + |  | 
| 98 | + | #if defined(_WIN32) || defined(_WIN64) | 
| 99 | + | /* too difficult to fix this */ | 
| 100 | + | return load_stream(mp, fp); | 
| 101 | + | #endif | 
| 102 | + | if (mp == NULL) | 
| 103 | + | return(-1); | 
| 104 | + | mp->mapped = NULL; | 
| 105 | + | mp->base = NULL; | 
| 106 | + | mp->len = 0; | 
| 107 | + | if (fp == NULL) | 
| 108 | + | return(-1); | 
| 109 | + | fd = fileno(fp); | 
| 110 | + | skip = ftello(fp); | 
| 111 | + | flen = lseek(fd, 0, SEEK_END); | 
| 112 | + | if (flen <= skip) | 
| 113 | + | return((int)(flen - skip)); | 
| 114 | + | mp->len = (size_t)(flen - skip); | 
| 115 | + | #ifdef MAP_FILE | 
| 116 | + | if (mp->len > 1L<<20) {         /* map file if > 1 MByte */ | 
| 117 | + | mp->mapped = mmap(NULL, flen, PROT_READ, MAP_PRIVATE, fd, 0); | 
| 118 | + | if (mp->mapped != MAP_FAILED) { | 
| 119 | + | mp->base = (char *)mp->mapped + skip; | 
| 120 | + | return(1);      /* mmap() success */ | 
| 121 | + | } | 
| 122 | + | mp->mapped = NULL;      /* else fall back to reading it in... */ | 
| 123 | + | } | 
| 124 | + | #endif | 
| 125 | + | if (lseek(fd, skip, SEEK_SET) != skip || | 
| 126 | + | (mp->base = malloc(mp->len)) == NULL) { | 
| 127 | + | mp->len = 0; | 
| 128 | + | return(-1); | 
| 129 | + | } | 
| 130 | + | fpos = skip; | 
| 131 | + | while (fpos < flen) {           /* read() fails if n > 2 GBytes */ | 
| 132 | + | ssize_t nread = read(fd, (char *)mp->base+(fpos-skip), | 
| 133 | + | (flen-fpos < 1L<<24) ? flen-fpos : 1L<<24); | 
| 134 | + | if (nread <= 0) { | 
| 135 | + | free_load(mp); | 
| 136 | + | return(-1); | 
| 137 | + | } | 
| 138 | + | fpos += nread; | 
| 139 | + | } | 
| 140 | + | return(1); | 
| 141 | + | } | 
| 142 | + |  | 
| 143 |  | /* free a record index */ | 
| 144 |  | #define free_records(rp)        free(rp) | 
| 145 |  |  | 
| 147 |  | static RECINDEX * | 
| 148 |  | index_records(const MEMLOAD *mp, int nw_rec) | 
| 149 |  | { | 
| 150 | + | int             nall = 0; | 
| 151 |  | RECINDEX        *rp; | 
| 152 |  | char            *cp, *mend; | 
| 153 |  | int             n; | 
| 156 |  | return(NULL); | 
| 157 |  | if (nw_rec <= 0) | 
| 158 |  | return(NULL); | 
| 159 | < | rp = (RECINDEX *)malloc(sizeof(RECINDEX) + mp->len/(2*nw_rec)*sizeof(char *)); | 
| 159 | > | nall = 1000; | 
| 160 | > | rp = (RECINDEX *)malloc(sizeof(RECINDEX) + nall*sizeof(char *)); | 
| 161 |  | if (rp == NULL) | 
| 162 |  | return(NULL); | 
| 163 |  | rp->nw_rec = nw_rec; | 
| 169 |  | ++cp; | 
| 170 |  | if (cp >= mend) | 
| 171 |  | break; | 
| 172 | + | if (rp->nrecs >= nall) { | 
| 173 | + | nall += nall>>1;        /* get more record space */ | 
| 174 | + | rp = (RECINDEX *)realloc(rp, | 
| 175 | + | sizeof(RECINDEX) + nall*sizeof(char *)); | 
| 176 | + | if (rp == NULL) | 
| 177 | + | return(NULL); | 
| 178 | + | } | 
| 179 |  | rp->rec[rp->nrecs++] = cp;      /* point to first non-white */ | 
| 180 |  | n = rp->nw_rec; | 
| 181 |  | while (++cp < mend)             /* find end of record */ | 
| 219 |  |  | 
| 220 |  | /* copy nth record from index to stdout */ | 
| 221 |  | static int | 
| 222 | < | print_record(const RECINDEX *rp, int n) | 
| 222 | > | print_record(const RECINDEX *rp, long n) | 
| 223 |  | { | 
| 224 |  | int     words2go = rp->nw_rec; | 
| 225 |  | char    *scp; | 
| 252 |  |  | 
| 253 |  | if (fp == NULL) | 
| 254 |  | return(0); | 
| 255 | < | fflush(stdout);                 /* assumes nothing in input buffer */ | 
| 256 | < | while ((n = read(fileno(fp), buf, sizeof(buf))) > 0) | 
| 255 | > | fflush(stdout); | 
| 256 | > | while ((n = fread(buf, 1, sizeof(buf), fp)) > 0) | 
| 257 |  | if (write(fileno(stdout), buf, n) != n) | 
| 258 |  | return(0); | 
| 259 | < | return(n >= 0); | 
| 259 | > | return(!ferror(fp)); | 
| 260 |  | } | 
| 261 |  |  | 
| 262 |  | /* get next word from stream, leaving stream on EOL or start of next word */ | 
| 282 |  | return(buf); | 
| 283 |  | } | 
| 284 |  |  | 
| 285 | < | char            *fmtid = "ascii";               /* format id */ | 
| 286 | < | int             record_width = 3;               /* words/record (<0 binary) */ | 
| 285 | > | char            *fmtid = NULL;                  /* format id */ | 
| 286 | > | int             comp_size = 0;                  /* binary bytes/channel */ | 
| 287 | > | int             n_comp = 0;                     /* components/record */ | 
| 288 |  | int             ni_columns = 0;                 /* number of input columns */ | 
| 289 |  | int             ni_rows = 0;                    /* number of input rows */ | 
| 290 |  | int             no_columns = 0;                 /* number of output columns */ | 
| 291 |  | int             no_rows = 0;                    /* number of output rows */ | 
| 292 | + | int             transpose = 0;                  /* transpose rows & cols? */ | 
| 293 | + | int             i_header = 1;                   /* input header? */ | 
| 294 | + | int             o_header = 1;                   /* output header? */ | 
| 295 | + | int             outArray[MAXLEVELS][2];         /* output block nesting */ | 
| 296 | + | int             outLevels = 0;                  /* number of blocking levels */ | 
| 297 |  |  | 
| 298 | < | /* output transposed ASCII or binary data from memory */ | 
| 298 | > | /* parse RxCx... string */ | 
| 299 |  | static int | 
| 300 | < | do_transpose(const MEMLOAD *mp) | 
| 300 | > | get_array(const char *spec, int blklvl[][2], int nlvls) | 
| 301 |  | { | 
| 302 | + | int     n; | 
| 303 | + |  | 
| 304 | + | if (nlvls <= 0) { | 
| 305 | + | fputs("Too many block levels!\n", stderr); | 
| 306 | + | exit(1); | 
| 307 | + | } | 
| 308 | + | if (sscanf(spec, "%dx%d", &blklvl[0][0], &blklvl[0][1]) != 2) { | 
| 309 | + | fputs("Bad block specification!\n", stderr); | 
| 310 | + | exit(1); | 
| 311 | + | } | 
| 312 | + | while (isdigit(*spec)) | 
| 313 | + | spec++; | 
| 314 | + | spec++;         /* 'x' */ | 
| 315 | + | while (isdigit(*spec)) | 
| 316 | + | spec++; | 
| 317 | + | if ((*spec != 'x') & (*spec != 'X')) { | 
| 318 | + | if (*spec) { | 
| 319 | + | fputs("Blocks must be separated by 'x' or 'X'\n", stderr); | 
| 320 | + | exit(1); | 
| 321 | + | } | 
| 322 | + | return(1); | 
| 323 | + | } | 
| 324 | + | spec++; | 
| 325 | + | n = get_array(spec, blklvl+1, nlvls-1); | 
| 326 | + | if (!n) | 
| 327 | + | return(0); | 
| 328 | + | blklvl[0][0] *= blklvl[1][0]; | 
| 329 | + | blklvl[0][1] *= blklvl[1][1]; | 
| 330 | + | return(n+1); | 
| 331 | + | } | 
| 332 | + |  | 
| 333 | + | /* check settings and assign defaults */ | 
| 334 | + | static int | 
| 335 | + | check_sizes() | 
| 336 | + | { | 
| 337 | + | if (fmtid == NULL) { | 
| 338 | + | fmtid = "ascii"; | 
| 339 | + | } else if (!comp_size) { | 
| 340 | + | if (!strcmp(fmtid, "float")) | 
| 341 | + | comp_size = sizeof(float); | 
| 342 | + | else if (!strcmp(fmtid, "double")) | 
| 343 | + | comp_size = sizeof(double); | 
| 344 | + | else if (!strcmp(fmtid, "byte")) | 
| 345 | + | comp_size = 1; | 
| 346 | + | else if (strcmp(fmtid, "ascii")) { | 
| 347 | + | fprintf(stderr, "Unsupported format: %s\n", fmtid); | 
| 348 | + | return(0); | 
| 349 | + | } | 
| 350 | + | } | 
| 351 | + | if (transpose && (no_rows <= 0) & (no_columns <= 0)) { | 
| 352 | + | if (ni_rows > 0) no_columns = ni_rows; | 
| 353 | + | if (ni_columns > 0) no_rows = ni_columns; | 
| 354 | + | } else if ((no_rows <= 0) & (no_columns > 0) && | 
| 355 | + | !((ni_rows*ni_columns) % no_columns)) | 
| 356 | + | no_rows = ni_rows*ni_columns/no_columns; | 
| 357 | + | if (n_comp <= 0) | 
| 358 | + | n_comp = 3; | 
| 359 | + | return(1); | 
| 360 | + | } | 
| 361 | + |  | 
| 362 | + | /* call to compute block input position */ | 
| 363 | + | static long | 
| 364 | + | get_block_pos(int r, int c, int blklvl[][2], int nlvls) | 
| 365 | + | { | 
| 366 | + | long    n = 0; | 
| 367 | + |  | 
| 368 | + | while (nlvls > 1) { | 
| 369 | + | int     sr = r/blklvl[1][0]; | 
| 370 | + | int     sc = c/blklvl[1][1]; | 
| 371 | + | r -= sr*blklvl[1][0]; | 
| 372 | + | c -= sc*blklvl[1][1]; | 
| 373 | + | n += sr*blklvl[1][0]*blklvl[0][1] + sc*blklvl[1][0]*blklvl[1][1]; | 
| 374 | + | blklvl++; | 
| 375 | + | nlvls--; | 
| 376 | + | } | 
| 377 | + | n += r*blklvl[0][1] + c; | 
| 378 | + | return(n); | 
| 379 | + | } | 
| 380 | + |  | 
| 381 | + | /* return input offset based on array ordering and transpose option */ | 
| 382 | + | static long | 
| 383 | + | get_input_pos(int r, int c) | 
| 384 | + | { | 
| 385 | + | long    n; | 
| 386 | + |  | 
| 387 | + | if (outLevels > 1) {            /* block reordering */ | 
| 388 | + | n = get_block_pos(r, c, outArray, outLevels); | 
| 389 | + | if (transpose) { | 
| 390 | + | r = n/no_columns; | 
| 391 | + | c = n - r*no_columns; | 
| 392 | + | n = (long)r*ni_columns + c; | 
| 393 | + | } | 
| 394 | + | } else if (transpose)           /* transpose only */ | 
| 395 | + | n = (long)c*ni_columns + r; | 
| 396 | + | else                            /* XXX should never happen! */ | 
| 397 | + | n = (long)r*ni_columns + c; | 
| 398 | + | return(n); | 
| 399 | + | } | 
| 400 | + |  | 
| 401 | + | /* output reordered ASCII or binary data from memory */ | 
| 402 | + | static int | 
| 403 | + | do_reorder(const MEMLOAD *mp) | 
| 404 | + | { | 
| 405 |  | static const char       tabEOL[2] = {'\t','\n'}; | 
| 406 |  | RECINDEX                *rp = NULL; | 
| 407 |  | long                    nrecords; | 
| 412 |  | if (ni_columns <= 0) | 
| 413 |  | ni_columns = no_rows; | 
| 414 |  | /* get # records (& index) */ | 
| 415 | < | if (record_width > 0) { | 
| 416 | < | if ((rp = index_records(mp, record_width)) == NULL) | 
| 415 | > | if (!comp_size) { | 
| 416 | > | if ((rp = index_records(mp, n_comp)) == NULL) | 
| 417 |  | return(0); | 
| 418 |  | if (ni_columns <= 0) | 
| 419 |  | ni_columns = count_columns(rp); | 
| 420 |  | nrecords = rp->nrecs; | 
| 421 |  | } else if ((ni_rows > 0) & (ni_columns > 0)) { | 
| 422 |  | nrecords = ni_rows*ni_columns; | 
| 423 | < | if (nrecords > mp->len / -record_width) { | 
| 423 | > | if (nrecords > mp->len/(n_comp*comp_size)) { | 
| 424 |  | fprintf(stderr, | 
| 425 |  | "Input too small for specified size and type\n"); | 
| 426 |  | return(0); | 
| 427 |  | } | 
| 428 |  | } else | 
| 429 | < | nrecords = mp->len / -record_width; | 
| 429 | > | nrecords = mp->len/(n_comp*comp_size); | 
| 430 |  | /* check sizes */ | 
| 431 |  | if ((ni_rows <= 0) & (ni_columns > 0)) | 
| 432 |  | ni_rows = nrecords/ni_columns; | 
| 434 |  | ni_columns = nrecords/ni_rows; | 
| 435 |  | if (nrecords != ni_rows*ni_columns) | 
| 436 |  | goto badspec; | 
| 437 | < | if (no_columns <= 0) | 
| 438 | < | no_columns = ni_rows; | 
| 439 | < | if (no_rows <= 0) | 
| 440 | < | no_rows = ni_columns; | 
| 441 | < | if ((no_rows != ni_columns) | (no_columns != ni_rows)) | 
| 442 | < | goto badspec; | 
| 443 | < | /* transpose records */ | 
| 437 | > | if (transpose) { | 
| 438 | > | if (no_columns <= 0) | 
| 439 | > | no_columns = ni_rows; | 
| 440 | > | if (no_rows <= 0) | 
| 441 | > | no_rows = ni_columns; | 
| 442 | > | if ((no_rows != ni_columns) | (no_columns != ni_rows)) | 
| 443 | > | goto badspec; | 
| 444 | > | } else { | 
| 445 | > | if (no_columns <= 0) | 
| 446 | > | no_columns = ni_columns; | 
| 447 | > | if (no_rows <= 0) | 
| 448 | > | no_rows = ni_rows; | 
| 449 | > | if ((no_rows != ni_rows) | (no_columns != ni_columns)) | 
| 450 | > | goto badspec; | 
| 451 | > | } | 
| 452 | > | /* reorder records */ | 
| 453 |  | for (i = 0; i < no_rows; i++) { | 
| 454 | < | for (j = 0; j < no_columns; j++) | 
| 454 | > | for (j = 0; j < no_columns; j++) { | 
| 455 | > | long    n = get_input_pos(i, j); | 
| 456 |  | if (rp != NULL) {               /* ASCII output */ | 
| 457 | < | print_record(rp, j*ni_columns + i); | 
| 457 | > | print_record(rp, n); | 
| 458 |  | putc(tabEOL[j >= no_columns-1], stdout); | 
| 459 |  | } else {                        /* binary output */ | 
| 460 | < | fwrite((char *)mp->base + | 
| 461 | < | -record_width*(j*ni_columns + i), | 
| 328 | < | -record_width, 1, stdout); | 
| 460 | > | putbinary((char *)mp->base + (n_comp*comp_size)*n, | 
| 461 | > | comp_size, n_comp, stdout); | 
| 462 |  | } | 
| 463 | + | } | 
| 464 |  | if (ferror(stdout)) { | 
| 465 |  | fprintf(stderr, "Error writing to stdout\n"); | 
| 466 |  | return(0); | 
| 470 |  | free_records(rp); | 
| 471 |  | return(1); | 
| 472 |  | badspec: | 
| 473 | < | fprintf(stderr, "Bad transpose specification -- check dimension(s)\n"); | 
| 473 | > | fprintf(stderr, "Bad dimension(s)\n"); | 
| 474 |  | return(0); | 
| 475 |  | } | 
| 476 |  |  | 
| 482 |  | int     columns2go = no_columns; | 
| 483 |  | char    word[256]; | 
| 484 |  | /* sanity checks */ | 
| 485 | < | if (record_width <= 0) { | 
| 486 | < | fprintf(stderr, "Bad call to do_resize (record_width = %d)\n", | 
| 353 | < | record_width); | 
| 354 | < | return(0); | 
| 355 | < | } | 
| 485 | > | if (comp_size || (no_columns == ni_columns) & (no_rows == ni_rows)) | 
| 486 | > | return(output_stream(fp));      /* no-op -- just copy */ | 
| 487 |  | if (no_columns <= 0) { | 
| 488 |  | fprintf(stderr, "Missing -oc specification\n"); | 
| 489 |  | return(0); | 
| 499 |  | do {                                    /* reshape records */ | 
| 500 |  | int     n; | 
| 501 |  |  | 
| 502 | < | for (n = record_width; n--; ) { | 
| 502 | > | for (n = n_comp; n--; ) { | 
| 503 |  | if (fget_word(word, fp) == NULL) { | 
| 504 | < | if (records2go > 0 || n < record_width-1) | 
| 504 | > | if (records2go > 0 || n < n_comp-1) | 
| 505 |  | break; | 
| 506 |  | goto done;      /* normal EOD */ | 
| 507 |  | } | 
| 536 |  | static int | 
| 537 |  | headline(char *s, void *p) | 
| 538 |  | { | 
| 539 | < | char    fmt[32]; | 
| 539 | > | static char     fmt[MAXFMTLEN]; | 
| 540 | > | int             n; | 
| 541 |  |  | 
| 542 |  | if (formatval(fmt, s)) { | 
| 543 | + | if (fmtid == NULL) { | 
| 544 | + | fmtid = fmt; | 
| 545 | + | return(0); | 
| 546 | + | } | 
| 547 |  | if (!strcmp(fmt, fmtid)) | 
| 548 |  | return(0); | 
| 549 |  | fprintf(stderr, "Input format '%s' != '%s'\n", fmt, fmtid); | 
| 550 |  | return(-1); | 
| 551 |  | } | 
| 552 | < | fputs(s, stdout);                       /* copy header info. */ | 
| 552 | > | if (!strncmp(s, "NROWS=", 6)) { | 
| 553 | > | n = atoi(s+6); | 
| 554 | > | if ((ni_rows > 0) & (n != ni_rows)) { | 
| 555 | > | fputs("Incorrect input row count\n", stderr); | 
| 556 | > | return(-1); | 
| 557 | > | } | 
| 558 | > | ni_rows = n; | 
| 559 | > | return(0); | 
| 560 | > | } | 
| 561 | > | if (!strncmp(s, "NCOLS=", 6)) { | 
| 562 | > | n = atoi(s+6); | 
| 563 | > | if ((ni_columns > 0) & (n != ni_columns)) { | 
| 564 | > | fputs("Incorrect input column count\n", stderr); | 
| 565 | > | return(-1); | 
| 566 | > | } | 
| 567 | > | ni_columns = n; | 
| 568 | > | return(0); | 
| 569 | > | } | 
| 570 | > | if (!strncmp(s, "NCOMP=", 6)) { | 
| 571 | > | n = atoi(s+6); | 
| 572 | > | if ((n_comp > 0) & (n != n_comp)) { | 
| 573 | > | fputs("Incorrect number of components\n", stderr); | 
| 574 | > | return(-1); | 
| 575 | > | } | 
| 576 | > | n_comp = n; | 
| 577 | > | return(0); | 
| 578 | > | } | 
| 579 | > | if (o_header) | 
| 580 | > | fputs(s, stdout);               /* copy header info. */ | 
| 581 |  | return(0); | 
| 582 |  | } | 
| 583 |  |  | 
| 585 |  | int | 
| 586 |  | main(int argc, char *argv[]) | 
| 587 |  | { | 
| 588 | < | int     do_header = 1;                  /* header i/o? */ | 
| 425 | < | int     transpose = 0;                  /* transpose rows & cols? */ | 
| 426 | < | int     i; | 
| 588 | > | int     a; | 
| 589 |  |  | 
| 590 | < | for (i = 1; i < argc && argv[i][0] == '-'; i++) | 
| 591 | < | switch (argv[i][1]) { | 
| 590 | > | for (a = 1; a < argc && argv[a][0] == '-'; a++) | 
| 591 | > | switch (argv[a][1]) { | 
| 592 |  | case 'i':                       /* input */ | 
| 593 | < | if (argv[i][2] == 'c')  /* columns */ | 
| 594 | < | ni_columns = atoi(argv[++i]); | 
| 595 | < | else if (argv[i][2] == 'r') | 
| 596 | < | ni_rows = atoi(argv[++i]); | 
| 593 | > | if (argv[a][2] == 'c')  /* columns */ | 
| 594 | > | ni_columns = atoi(argv[++a]); | 
| 595 | > | else if (argv[a][2] == 'r') | 
| 596 | > | ni_rows = atoi(argv[++a]); | 
| 597 |  | else | 
| 598 |  | goto userr; | 
| 599 |  | break; | 
| 600 |  | case 'o':                       /* output */ | 
| 601 | < | if (argv[i][2] == 'c')  /* columns */ | 
| 602 | < | no_columns = atoi(argv[++i]); | 
| 603 | < | else if (argv[i][2] == 'r') | 
| 604 | < | no_rows = atoi(argv[++i]); | 
| 605 | < | else | 
| 601 | > | if (argv[a][2] == 'c')  /* columns */ | 
| 602 | > | no_columns = atoi(argv[++a]); | 
| 603 | > | else if (argv[a][2] == 'r') | 
| 604 | > | no_rows = atoi(argv[++a]); | 
| 605 | > | else if (argv[a][2] || | 
| 606 | > | !(outLevels=get_array(argv[++a], outArray, MAXLEVELS))) | 
| 607 |  | goto userr; | 
| 608 |  | break; | 
| 609 | < | case 'h':                       /* header on/off */ | 
| 610 | < | do_header = !do_header; | 
| 609 | > | case 'h':                       /* turn off header */ | 
| 610 | > | switch (argv[a][2]) { | 
| 611 | > | case 'i': | 
| 612 | > | i_header = 0; | 
| 613 | > | break; | 
| 614 | > | case 'o': | 
| 615 | > | o_header = 0; | 
| 616 | > | break; | 
| 617 | > | case '\0': | 
| 618 | > | i_header = o_header = 0; | 
| 619 | > | break; | 
| 620 | > | default: | 
| 621 | > | goto userr; | 
| 622 | > | } | 
| 623 |  | break; | 
| 624 |  | case 't':                       /* transpose on/off */ | 
| 625 |  | transpose = !transpose; | 
| 626 |  | break; | 
| 627 |  | case 'f':                       /* format */ | 
| 628 | < | switch (argv[i][2]) { | 
| 628 | > | switch (argv[a][2]) { | 
| 629 |  | case 'a':               /* ASCII */ | 
| 630 |  | case 'A': | 
| 631 |  | fmtid = "ascii"; | 
| 632 | < | record_width = 1; | 
| 632 | > | comp_size = 0; | 
| 633 |  | break; | 
| 634 |  | case 'f':               /* float */ | 
| 635 |  | case 'F': | 
| 636 |  | fmtid = "float"; | 
| 637 | < | record_width = -(int)sizeof(float); | 
| 637 | > | comp_size = sizeof(float); | 
| 638 |  | break; | 
| 639 |  | case 'd':               /* double */ | 
| 640 |  | case 'D': | 
| 641 |  | fmtid = "double"; | 
| 642 | < | record_width = -(int)sizeof(double); | 
| 642 | > | comp_size = sizeof(double); | 
| 643 |  | break; | 
| 644 |  | case 'b':               /* binary (bytes) */ | 
| 645 |  | case 'B': | 
| 646 |  | fmtid = "byte"; | 
| 647 | < | record_width = -1; | 
| 647 | > | comp_size = 1; | 
| 648 |  | break; | 
| 649 |  | default: | 
| 650 |  | goto userr; | 
| 651 |  | } | 
| 652 | < | if (argv[i][3]) { | 
| 653 | < | if (!isdigit(argv[i][3])) | 
| 652 | > | if (argv[a][3]) { | 
| 653 | > | if (!isdigit(argv[a][3])) | 
| 654 |  | goto userr; | 
| 655 | < | record_width *= atoi(argv[i]+3); | 
| 656 | < | } | 
| 655 | > | n_comp = atoi(argv[a]+3); | 
| 656 | > | } else | 
| 657 | > | n_comp = 1; | 
| 658 |  | break; | 
| 659 |  | case 'w':                       /* warnings on/off */ | 
| 660 |  | warnings = !warnings; | 
| 662 |  | default: | 
| 663 |  | goto userr; | 
| 664 |  | } | 
| 665 | < | if (!record_width) | 
| 665 | > | if (a < argc-1)                         /* arg count OK? */ | 
| 666 |  | goto userr; | 
| 667 | < | if (i < argc-1)                         /* arg count OK? */ | 
| 668 | < | goto userr; | 
| 667 | > | if (outLevels) {                        /* should check consistency? */ | 
| 668 | > | no_rows = outArray[0][0]; | 
| 669 | > | no_columns = outArray[0][1]; | 
| 670 | > | } | 
| 671 |  | /* open input file? */ | 
| 672 | < | if (i == argc-1 && freopen(argv[i], "r", stdin) == NULL) { | 
| 673 | < | fprintf(stderr, "%s: cannot open for reading\n", argv[i]); | 
| 672 | > | if (a == argc-1 && freopen(argv[a], "r", stdin) == NULL) { | 
| 673 | > | fprintf(stderr, "%s: cannot open for reading\n", argv[a]); | 
| 674 |  | return(1); | 
| 675 |  | } | 
| 676 | < | if (record_width < 0) { | 
| 676 | > | if (comp_size) { | 
| 677 |  | SET_FILE_BINARY(stdin); | 
| 678 |  | SET_FILE_BINARY(stdout); | 
| 679 |  | } | 
| 680 |  | /* check for no-op */ | 
| 681 | < | if (!transpose && (record_width < 0 || | 
| 682 | < | (no_columns == ni_columns) & (no_rows == ni_rows))) { | 
| 681 | > | if (!transpose & (outLevels <= 1) & (i_header == o_header) && | 
| 682 | > | (no_columns == ni_columns) & (no_rows == ni_rows)) { | 
| 683 |  | if (warnings) | 
| 684 |  | fprintf(stderr, "%s: no-op -- copying input verbatim\n", | 
| 685 |  | argv[0]); | 
| 687 |  | return(1); | 
| 688 |  | return(0); | 
| 689 |  | } | 
| 690 | < | if (do_header) {                        /* read/write header */ | 
| 691 | < | if (getheader(stdin, &headline, NULL) < 0) | 
| 690 | > | if (i_header) {                         /* read header */ | 
| 691 | > | if (getheader(stdin, headline, NULL) < 0) | 
| 692 |  | return(1); | 
| 693 | < | printargs(argc, argv, stdout); | 
| 693 | > | if (!check_sizes()) | 
| 694 | > | return(1); | 
| 695 | > | if (comp_size) {                /* a little late... */ | 
| 696 | > | SET_FILE_BINARY(stdin); | 
| 697 | > | SET_FILE_BINARY(stdout); | 
| 698 | > | } | 
| 699 | > | } else if (!check_sizes()) | 
| 700 | > | return(1); | 
| 701 | > | if (o_header) {                         /* write/add to header */ | 
| 702 | > | if (!i_header) | 
| 703 | > | newheader("RADIANCE", stdout); | 
| 704 | > | printargs(a, argv, stdout); | 
| 705 | > | if (no_rows > 0) | 
| 706 | > | printf("NROWS=%d\n", no_rows); | 
| 707 | > | if (no_columns > 0) | 
| 708 | > | printf("NCOLS=%d\n", no_columns); | 
| 709 | > | printf("NCOMP=%d\n", n_comp); | 
| 710 |  | fputformat(fmtid, stdout); | 
| 711 |  | fputc('\n', stdout);            /* finish new header */ | 
| 712 |  | } | 
| 713 | < | if (transpose) {                        /* transposing rows & columns? */ | 
| 714 | < | MEMLOAD myMem;                  /* need to load into memory */ | 
| 715 | < | if (i == argc-1) { | 
| 713 | > | if (transpose | (outLevels > 1)) {      /* moving stuff around? */ | 
| 714 | > | MEMLOAD myMem;                  /* need to map into memory */ | 
| 715 | > | if (a == argc-1) { | 
| 716 |  | if (load_file(&myMem, stdin) <= 0) { | 
| 717 |  | fprintf(stderr, "%s: error loading file into memory\n", | 
| 718 | < | argv[i]); | 
| 718 | > | argv[a]); | 
| 719 |  | return(1); | 
| 720 |  | } | 
| 721 |  | } else if (load_stream(&myMem, stdin) <= 0) { | 
| 723 |  | argv[0]); | 
| 724 |  | return(1); | 
| 725 |  | } | 
| 726 | < | if (!do_transpose(&myMem)) | 
| 726 | > | if (!do_reorder(&myMem)) | 
| 727 |  | return(1); | 
| 728 | < | /* free_load(&myMem); */ | 
| 729 | < | } else if (!do_resize(stdin))           /* just reshaping input */ | 
| 728 | > | /* free_load(&myMem);   about to exit, so don't bother */ | 
| 729 | > | } else if (!do_resize(stdin))           /* reshaping input */ | 
| 730 |  | return(1); | 
| 731 |  | return(0); | 
| 732 |  | userr: | 
| 733 |  | fprintf(stderr, | 
| 734 | < | "Usage: %s [-h][-w][-f[afdb][N]][-t][-ic in_col][-ir in_row][-oc out_col][-or out_row] [input.dat]\n", | 
| 734 | > | "Usage: %s [-h[io]][-w][-f[afdb][N]][-t][-ic in_col][-ir in_row][-oc out_col][-or out_row][-o RxC[xR1xC1..]] [input.dat]\n", | 
| 735 |  | argv[0]); | 
| 736 |  | return(1); | 
| 737 |  | } |