| 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/ni_rows; |
| 391 |
+ |
c = n - r*ni_rows; |
| 392 |
+ |
n = (long)c*ni_columns + r; |
| 393 |
+ |
} |
| 394 |
+ |
} else if (transpose) /* transpose only */ |
| 395 |
+ |
n = (long)c*ni_columns + r; |
| 396 |
+ |
else /* XXX should never happen! */ |
| 397 |
+ |
n = (long)r*no_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) { |
| 424 |
< |
fprintf(stderr, |
| 425 |
< |
"Input too small for specified size and type\n"); |
| 423 |
> |
if (nrecords > mp->len/(n_comp*comp_size)) { |
| 424 |
> |
fputs("Input too small for specified size and type\n", |
| 425 |
> |
stderr); |
| 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 (outLevels <= 1 && |
| 443 |
> |
(no_rows != ni_columns) | (no_columns != ni_rows)) |
| 444 |
> |
goto badspec; |
| 445 |
> |
} else { |
| 446 |
> |
if (no_columns <= 0) |
| 447 |
> |
no_columns = ni_columns; |
| 448 |
> |
if (no_rows <= 0) |
| 449 |
> |
no_rows = ni_rows; |
| 450 |
> |
} |
| 451 |
> |
if (ni_rows*ni_columns != no_rows*no_columns) { |
| 452 |
> |
fputs("Number of input and output records do not match\n", |
| 453 |
> |
stderr); |
| 454 |
> |
return(0); |
| 455 |
> |
} |
| 456 |
> |
/* reorder records */ |
| 457 |
|
for (i = 0; i < no_rows; i++) { |
| 458 |
< |
for (j = 0; j < no_columns; j++) |
| 458 |
> |
for (j = 0; j < no_columns; j++) { |
| 459 |
> |
long n = get_input_pos(i, j); |
| 460 |
> |
if (n >= nrecords) { |
| 461 |
> |
fputs("Index past end-of-file\n", stderr); |
| 462 |
> |
return(0); |
| 463 |
> |
} |
| 464 |
|
if (rp != NULL) { /* ASCII output */ |
| 465 |
< |
print_record(rp, j*ni_columns + i); |
| 465 |
> |
print_record(rp, n); |
| 466 |
|
putc(tabEOL[j >= no_columns-1], stdout); |
| 467 |
|
} else { /* binary output */ |
| 468 |
< |
fwrite((char *)mp->base + |
| 469 |
< |
-record_width*(j*ni_columns + i), |
| 328 |
< |
-record_width, 1, stdout); |
| 468 |
> |
putbinary((char *)mp->base + (n_comp*comp_size)*n, |
| 469 |
> |
comp_size, n_comp, stdout); |
| 470 |
|
} |
| 471 |
+ |
} |
| 472 |
|
if (ferror(stdout)) { |
| 473 |
|
fprintf(stderr, "Error writing to stdout\n"); |
| 474 |
|
return(0); |
| 478 |
|
free_records(rp); |
| 479 |
|
return(1); |
| 480 |
|
badspec: |
| 481 |
< |
fprintf(stderr, "Bad transpose specification -- check dimension(s)\n"); |
| 481 |
> |
fprintf(stderr, "Bad dimension(s)\n"); |
| 482 |
|
return(0); |
| 483 |
|
} |
| 484 |
|
|
| 490 |
|
int columns2go = no_columns; |
| 491 |
|
char word[256]; |
| 492 |
|
/* sanity checks */ |
| 493 |
< |
if (record_width <= 0) { |
| 494 |
< |
fprintf(stderr, "Bad call to do_resize (record_width = %d)\n", |
| 353 |
< |
record_width); |
| 354 |
< |
return(0); |
| 355 |
< |
} |
| 493 |
> |
if (comp_size || (no_columns == ni_columns) & (no_rows == ni_rows)) |
| 494 |
> |
return(output_stream(fp)); /* no-op -- just copy */ |
| 495 |
|
if (no_columns <= 0) { |
| 496 |
|
fprintf(stderr, "Missing -oc specification\n"); |
| 497 |
|
return(0); |
| 507 |
|
do { /* reshape records */ |
| 508 |
|
int n; |
| 509 |
|
|
| 510 |
< |
for (n = record_width; n--; ) { |
| 510 |
> |
for (n = n_comp; n--; ) { |
| 511 |
|
if (fget_word(word, fp) == NULL) { |
| 512 |
< |
if (records2go > 0 || n < record_width-1) |
| 512 |
> |
if (records2go > 0 || n < n_comp-1) |
| 513 |
|
break; |
| 514 |
|
goto done; /* normal EOD */ |
| 515 |
|
} |
| 544 |
|
static int |
| 545 |
|
headline(char *s, void *p) |
| 546 |
|
{ |
| 547 |
< |
char fmt[32]; |
| 547 |
> |
static char fmt[MAXFMTLEN]; |
| 548 |
> |
int n; |
| 549 |
|
|
| 550 |
|
if (formatval(fmt, s)) { |
| 551 |
+ |
if (fmtid == NULL) { |
| 552 |
+ |
fmtid = fmt; |
| 553 |
+ |
return(0); |
| 554 |
+ |
} |
| 555 |
|
if (!strcmp(fmt, fmtid)) |
| 556 |
|
return(0); |
| 557 |
|
fprintf(stderr, "Input format '%s' != '%s'\n", fmt, fmtid); |
| 558 |
|
return(-1); |
| 559 |
|
} |
| 560 |
< |
fputs(s, stdout); /* copy header info. */ |
| 560 |
> |
if (!strncmp(s, "NROWS=", 6)) { |
| 561 |
> |
n = atoi(s+6); |
| 562 |
> |
if ((ni_rows > 0) & (n != ni_rows)) { |
| 563 |
> |
fputs("Incorrect input row count\n", stderr); |
| 564 |
> |
return(-1); |
| 565 |
> |
} |
| 566 |
> |
ni_rows = n; |
| 567 |
> |
return(0); |
| 568 |
> |
} |
| 569 |
> |
if (!strncmp(s, "NCOLS=", 6)) { |
| 570 |
> |
n = atoi(s+6); |
| 571 |
> |
if ((ni_columns > 0) & (n != ni_columns)) { |
| 572 |
> |
fputs("Incorrect input column count\n", stderr); |
| 573 |
> |
return(-1); |
| 574 |
> |
} |
| 575 |
> |
ni_columns = n; |
| 576 |
> |
return(0); |
| 577 |
> |
} |
| 578 |
> |
if (!strncmp(s, "NCOMP=", 6)) { |
| 579 |
> |
n = atoi(s+6); |
| 580 |
> |
if ((n_comp > 0) & (n != n_comp)) { |
| 581 |
> |
fputs("Incorrect number of components\n", stderr); |
| 582 |
> |
return(-1); |
| 583 |
> |
} |
| 584 |
> |
n_comp = n; |
| 585 |
> |
return(0); |
| 586 |
> |
} |
| 587 |
> |
if (o_header) |
| 588 |
> |
fputs(s, stdout); /* copy header info. */ |
| 589 |
|
return(0); |
| 590 |
|
} |
| 591 |
|
|
| 593 |
|
int |
| 594 |
|
main(int argc, char *argv[]) |
| 595 |
|
{ |
| 596 |
< |
int do_header = 1; /* header i/o? */ |
| 425 |
< |
int transpose = 0; /* transpose rows & cols? */ |
| 426 |
< |
int i; |
| 596 |
> |
int a; |
| 597 |
|
|
| 598 |
< |
for (i = 1; i < argc && argv[i][0] == '-'; i++) |
| 599 |
< |
switch (argv[i][1]) { |
| 598 |
> |
for (a = 1; a < argc && argv[a][0] == '-'; a++) |
| 599 |
> |
switch (argv[a][1]) { |
| 600 |
|
case 'i': /* input */ |
| 601 |
< |
if (argv[i][2] == 'c') /* columns */ |
| 602 |
< |
ni_columns = atoi(argv[++i]); |
| 603 |
< |
else if (argv[i][2] == 'r') |
| 604 |
< |
ni_rows = atoi(argv[++i]); |
| 601 |
> |
if (argv[a][2] == 'c') /* columns */ |
| 602 |
> |
ni_columns = atoi(argv[++a]); |
| 603 |
> |
else if (argv[a][2] == 'r') |
| 604 |
> |
ni_rows = atoi(argv[++a]); |
| 605 |
|
else |
| 606 |
|
goto userr; |
| 607 |
|
break; |
| 608 |
|
case 'o': /* output */ |
| 609 |
< |
if (argv[i][2] == 'c') /* columns */ |
| 610 |
< |
no_columns = atoi(argv[++i]); |
| 611 |
< |
else if (argv[i][2] == 'r') |
| 612 |
< |
no_rows = atoi(argv[++i]); |
| 613 |
< |
else |
| 609 |
> |
if (argv[a][2] == 'c') /* columns */ |
| 610 |
> |
no_columns = atoi(argv[++a]); |
| 611 |
> |
else if (argv[a][2] == 'r') |
| 612 |
> |
no_rows = atoi(argv[++a]); |
| 613 |
> |
else if (argv[a][2] || |
| 614 |
> |
!(outLevels=get_array(argv[++a], outArray, MAXLEVELS))) |
| 615 |
|
goto userr; |
| 616 |
|
break; |
| 617 |
< |
case 'h': /* header on/off */ |
| 618 |
< |
do_header = !do_header; |
| 617 |
> |
case 'h': /* turn off header */ |
| 618 |
> |
switch (argv[a][2]) { |
| 619 |
> |
case 'i': |
| 620 |
> |
i_header = 0; |
| 621 |
> |
break; |
| 622 |
> |
case 'o': |
| 623 |
> |
o_header = 0; |
| 624 |
> |
break; |
| 625 |
> |
case '\0': |
| 626 |
> |
i_header = o_header = 0; |
| 627 |
> |
break; |
| 628 |
> |
default: |
| 629 |
> |
goto userr; |
| 630 |
> |
} |
| 631 |
|
break; |
| 632 |
|
case 't': /* transpose on/off */ |
| 633 |
|
transpose = !transpose; |
| 634 |
|
break; |
| 635 |
|
case 'f': /* format */ |
| 636 |
< |
switch (argv[i][2]) { |
| 636 |
> |
switch (argv[a][2]) { |
| 637 |
|
case 'a': /* ASCII */ |
| 638 |
|
case 'A': |
| 639 |
|
fmtid = "ascii"; |
| 640 |
< |
record_width = 1; |
| 640 |
> |
comp_size = 0; |
| 641 |
|
break; |
| 642 |
|
case 'f': /* float */ |
| 643 |
|
case 'F': |
| 644 |
|
fmtid = "float"; |
| 645 |
< |
record_width = -(int)sizeof(float); |
| 645 |
> |
comp_size = sizeof(float); |
| 646 |
|
break; |
| 647 |
|
case 'd': /* double */ |
| 648 |
|
case 'D': |
| 649 |
|
fmtid = "double"; |
| 650 |
< |
record_width = -(int)sizeof(double); |
| 650 |
> |
comp_size = sizeof(double); |
| 651 |
|
break; |
| 652 |
|
case 'b': /* binary (bytes) */ |
| 653 |
|
case 'B': |
| 654 |
|
fmtid = "byte"; |
| 655 |
< |
record_width = -1; |
| 655 |
> |
comp_size = 1; |
| 656 |
|
break; |
| 657 |
|
default: |
| 658 |
|
goto userr; |
| 659 |
|
} |
| 660 |
< |
if (argv[i][3]) { |
| 661 |
< |
if (!isdigit(argv[i][3])) |
| 660 |
> |
if (argv[a][3]) { |
| 661 |
> |
if (!isdigit(argv[a][3])) |
| 662 |
|
goto userr; |
| 663 |
< |
record_width *= atoi(argv[i]+3); |
| 664 |
< |
} |
| 663 |
> |
n_comp = atoi(argv[a]+3); |
| 664 |
> |
} else |
| 665 |
> |
n_comp = 1; |
| 666 |
|
break; |
| 667 |
|
case 'w': /* warnings on/off */ |
| 668 |
|
warnings = !warnings; |
| 670 |
|
default: |
| 671 |
|
goto userr; |
| 672 |
|
} |
| 673 |
< |
if (!record_width) |
| 673 |
> |
if (a < argc-1) /* arg count OK? */ |
| 674 |
|
goto userr; |
| 675 |
< |
if (i < argc-1) /* arg count OK? */ |
| 676 |
< |
goto userr; |
| 675 |
> |
if (outLevels) { /* should check consistency? */ |
| 676 |
> |
no_rows = outArray[0][0]; |
| 677 |
> |
no_columns = outArray[0][1]; |
| 678 |
> |
} |
| 679 |
|
/* open input file? */ |
| 680 |
< |
if (i == argc-1 && freopen(argv[i], "r", stdin) == NULL) { |
| 681 |
< |
fprintf(stderr, "%s: cannot open for reading\n", argv[i]); |
| 680 |
> |
if (a == argc-1 && freopen(argv[a], "r", stdin) == NULL) { |
| 681 |
> |
fprintf(stderr, "%s: cannot open for reading\n", argv[a]); |
| 682 |
|
return(1); |
| 683 |
|
} |
| 684 |
< |
if (record_width < 0) { |
| 684 |
> |
if (comp_size) { |
| 685 |
|
SET_FILE_BINARY(stdin); |
| 686 |
|
SET_FILE_BINARY(stdout); |
| 687 |
|
} |
| 688 |
|
/* check for no-op */ |
| 689 |
< |
if (!transpose && (record_width < 0 || |
| 690 |
< |
(no_columns == ni_columns) & (no_rows == ni_rows))) { |
| 689 |
> |
if (!transpose & (outLevels <= 1) & (i_header == o_header) && |
| 690 |
> |
(no_columns == ni_columns) & (no_rows == ni_rows)) { |
| 691 |
|
if (warnings) |
| 692 |
|
fprintf(stderr, "%s: no-op -- copying input verbatim\n", |
| 693 |
|
argv[0]); |
| 695 |
|
return(1); |
| 696 |
|
return(0); |
| 697 |
|
} |
| 698 |
< |
if (do_header) { /* read/write header */ |
| 699 |
< |
if (getheader(stdin, &headline, NULL) < 0) |
| 698 |
> |
if (i_header) { /* read header */ |
| 699 |
> |
if (getheader(stdin, headline, NULL) < 0) |
| 700 |
|
return(1); |
| 701 |
< |
printargs(argc, argv, stdout); |
| 701 |
> |
if (!check_sizes()) |
| 702 |
> |
return(1); |
| 703 |
> |
if (comp_size) { /* a little late... */ |
| 704 |
> |
SET_FILE_BINARY(stdin); |
| 705 |
> |
SET_FILE_BINARY(stdout); |
| 706 |
> |
} |
| 707 |
> |
} else if (!check_sizes()) |
| 708 |
> |
return(1); |
| 709 |
> |
if (o_header) { /* write/add to header */ |
| 710 |
> |
if (!i_header) |
| 711 |
> |
newheader("RADIANCE", stdout); |
| 712 |
> |
printargs(a, argv, stdout); |
| 713 |
> |
if (no_rows > 0) |
| 714 |
> |
printf("NROWS=%d\n", no_rows); |
| 715 |
> |
if (no_columns > 0) |
| 716 |
> |
printf("NCOLS=%d\n", no_columns); |
| 717 |
> |
printf("NCOMP=%d\n", n_comp); |
| 718 |
|
fputformat(fmtid, stdout); |
| 719 |
|
fputc('\n', stdout); /* finish new header */ |
| 720 |
|
} |
| 721 |
< |
if (transpose) { /* transposing rows & columns? */ |
| 722 |
< |
MEMLOAD myMem; /* need to load into memory */ |
| 723 |
< |
if (i == argc-1) { |
| 721 |
> |
if (transpose | (outLevels > 1)) { /* moving stuff around? */ |
| 722 |
> |
MEMLOAD myMem; /* need to map into memory */ |
| 723 |
> |
if (a == argc-1) { |
| 724 |
|
if (load_file(&myMem, stdin) <= 0) { |
| 725 |
|
fprintf(stderr, "%s: error loading file into memory\n", |
| 726 |
< |
argv[i]); |
| 726 |
> |
argv[a]); |
| 727 |
|
return(1); |
| 728 |
|
} |
| 729 |
|
} else if (load_stream(&myMem, stdin) <= 0) { |
| 731 |
|
argv[0]); |
| 732 |
|
return(1); |
| 733 |
|
} |
| 734 |
< |
if (!do_transpose(&myMem)) |
| 734 |
> |
if (!do_reorder(&myMem)) |
| 735 |
|
return(1); |
| 736 |
< |
/* free_load(&myMem); */ |
| 737 |
< |
} else if (!do_resize(stdin)) /* just reshaping input */ |
| 736 |
> |
/* free_load(&myMem); about to exit, so don't bother */ |
| 737 |
> |
} else if (!do_resize(stdin)) /* reshaping input */ |
| 738 |
|
return(1); |
| 739 |
|
return(0); |
| 740 |
|
userr: |
| 741 |
|
fprintf(stderr, |
| 742 |
< |
"Usage: %s [-h][-w][-f[afdb][N]][-t][-ic in_col][-ir in_row][-oc out_col][-or out_row] [input.dat]\n", |
| 742 |
> |
"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", |
| 743 |
|
argv[0]); |
| 744 |
|
return(1); |
| 745 |
|
} |