File size: 15,650 Bytes
5610573 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 | /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 1999-2004 Carnegie Mellon University. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* This work was supported in part by funding from the Defense Advanced
* Research Projects Agency and the National Science Foundation of the
* United States of America, and the CMU Sphinx Speech Consortium.
*
* THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
* ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
* NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* ====================================================================
*
*/
/*
* bio.c -- Sphinx-3 binary file I/O functions.
*
* **********************************************
* CMU ARPA Speech Project
*
* Copyright (c) 1996 Carnegie Mellon University.
* ALL RIGHTS RESERVED.
* **********************************************
*
* HISTORY
* $Log$
* Revision 1.4 2005/06/21 20:40:46 arthchan2003
* 1, Fixed doxygen documentation, 2, Add the $ keyword.
*
* Revision 1.3 2005/03/30 01:22:46 archan
* Fixed mistakes in last updates. Add
*
*
* 02-Jul-1997 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University
* Bugfix: Added byteswapping in bio_verify_chksum().
*
* 18-Dec-1996 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University
* Created.
*/
#include <stdio.h>
#include <string.h>
#include <assert.h>
#ifdef _MSC_VER
#pragma warning (disable: 4996)
#endif
#include <pocketsphinx/err.h>
#include "util/bio.h"
#include "util/ckd_alloc.h"
#define BIO_HDRARG_MAX 32
#define END_COMMENT "*end_comment*\n"
static void
bcomment_read(FILE * fp)
{
__BIGSTACKVARIABLE__ char iline[16384];
while (fgets(iline, sizeof(iline), fp) != NULL) {
if (strcmp(iline, END_COMMENT) == 0)
return;
}
E_FATAL("Missing %s marker\n", END_COMMENT);
}
static int32
swap_check(FILE * fp)
{
uint32 magic;
if (fread(&magic, sizeof(uint32), 1, fp) != 1) {
E_ERROR("Cannot read BYTEORDER MAGIC NO.\n");
return -1;
}
if (magic != BYTE_ORDER_MAGIC) {
/* either need to swap or got bogus magic number */
SWAP_INT32(&magic);
if (magic == BYTE_ORDER_MAGIC)
return 1;
SWAP_INT32(&magic);
E_ERROR("Bad BYTEORDER MAGIC NO: %08x, expecting %08x\n",
magic, BYTE_ORDER_MAGIC);
return -1;
}
return 0;
}
void
bio_hdrarg_free(char **argname, char **argval)
{
int32 i;
if (argname == NULL)
return;
for (i = 0; argname[i]; i++) {
ckd_free(argname[i]);
ckd_free(argval[i]);
}
ckd_free(argname);
ckd_free(argval);
}
int32
bio_writehdr_version(FILE * fp, char *version)
{
uint32 b;
fprintf(fp, "s3\n");
fprintf(fp, "version %s\n", version);
fprintf(fp, "endhdr\n");
fflush(fp);
b = (uint32) BYTE_ORDER_MAGIC;
fwrite(&b, sizeof(uint32), 1, fp);
fflush(fp);
return 0;
}
int32
bio_writehdr(FILE *fp, ...)
{
char const *key;
va_list args;
uint32 b;
fprintf(fp, "s3\n");
va_start(args, fp);
while ((key = va_arg(args, char const *)) != NULL) {
char const *val = va_arg(args, char const *);
if (val == NULL) {
E_ERROR("Wrong number of arguments\n");
va_end(args);
return -1;
}
fprintf(fp, "%s %s\n", key, val);
}
va_end(args);
fprintf(fp, "endhdr\n");
fflush(fp);
b = (uint32) BYTE_ORDER_MAGIC;
if (fwrite(&b, sizeof(uint32), 1, fp) != 1)
return -1;
fflush(fp);
return 0;
}
int32
bio_readhdr(FILE * fp, char ***argname, char ***argval, int32 * swap)
{
__BIGSTACKVARIABLE__ char line[16384], word[4096];
int32 i, l;
int32 lineno;
*argname = (char **) ckd_calloc(BIO_HDRARG_MAX + 1, sizeof(char *));
*argval = (char **) ckd_calloc(BIO_HDRARG_MAX, sizeof(char *));
lineno = 0;
if (fgets(line, sizeof(line), fp) == NULL){
E_ERROR("Premature EOF, line %d\n", lineno);
goto error_out;
}
lineno++;
if ((line[0] == 's') && (line[1] == '3') && (line[2] == '\n')) {
/* New format (post Dec-1996, including checksums); read argument-value pairs */
for (i = 0;;) {
if (fgets(line, sizeof(line), fp) == NULL) {
E_ERROR("Premature EOF, line %d\n", lineno);
goto error_out;
}
lineno++;
if (sscanf(line, "%s%n", word, &l) != 1) {
E_ERROR("Header format error, line %d\n", lineno);
goto error_out;
}
if (strcmp(word, "endhdr") == 0)
break;
if (word[0] == '#') /* Skip comments */
continue;
if (i >= BIO_HDRARG_MAX) {
E_ERROR
("Max arg-value limit(%d) exceeded; increase BIO_HDRARG_MAX\n",
BIO_HDRARG_MAX);
goto error_out;
}
(*argname)[i] = ckd_salloc(word);
if (sscanf(line + l, "%s", word) != 1) { /* Multi-word values not allowed */
E_ERROR("Header format error, line %d\n", lineno);
goto error_out;
}
(*argval)[i] = ckd_salloc(word);
i++;
}
}
else {
/* Old format (without checksums); the first entry must be the version# */
if (sscanf(line, "%s", word) != 1) {
E_ERROR("Header format error, line %d\n", lineno);
goto error_out;
}
(*argname)[0] = ckd_salloc("version");
(*argval)[0] = ckd_salloc(word);
i = 1;
bcomment_read(fp);
}
(*argname)[i] = NULL;
if ((*swap = swap_check(fp)) < 0) {
E_ERROR("swap_check failed\n");
goto error_out;
}
return 0;
error_out:
bio_hdrarg_free(*argname, *argval);
*argname = *argval = NULL;
return -1;
}
static uint32
chksum_accum(const void *buf, int32 el_sz, int32 n_el, uint32 sum)
{
int32 i;
uint8 *i8;
uint16 *i16;
uint32 *i32;
switch (el_sz) {
case 1:
i8 = (uint8 *) buf;
for (i = 0; i < n_el; i++)
sum = (sum << 5 | sum >> 27) + i8[i];
break;
case 2:
i16 = (uint16 *) buf;
for (i = 0; i < n_el; i++)
sum = (sum << 10 | sum >> 22) + i16[i];
break;
case 4:
i32 = (uint32 *) buf;
for (i = 0; i < n_el; i++)
sum = (sum << 20 | sum >> 12) + i32[i];
break;
default:
E_FATAL("Unsupported elemsize for checksum: %d\n", el_sz);
break;
}
return sum;
}
static void
swap_buf(void *buf, int32 el_sz, int32 n_el)
{
int32 i;
uint16 *buf16;
uint32 *buf32;
switch (el_sz) {
case 1:
break;
case 2:
buf16 = (uint16 *) buf;
for (i = 0; i < n_el; i++)
SWAP_INT16(buf16 + i);
break;
case 4:
buf32 = (uint32 *) buf;
for (i = 0; i < n_el; i++)
SWAP_INT32(buf32 + i);
break;
default:
E_FATAL("Unsupported elemsize for byteswapping: %d\n", el_sz);
break;
}
}
int32
bio_fread(void *buf, int32 el_sz, int32 n_el, FILE * fp, int32 swap,
uint32 * chksum)
{
if (fread(buf, el_sz, n_el, fp) != (size_t) n_el)
return -1;
if (swap)
swap_buf(buf, el_sz, n_el);
if (chksum)
*chksum = chksum_accum(buf, el_sz, n_el, *chksum);
return n_el;
}
int32
bio_fwrite(const void *buf, int32 el_sz, int32 n_el, FILE *fp,
int32 swap, uint32 *chksum)
{
if (chksum)
*chksum = chksum_accum(buf, el_sz, n_el, *chksum);
if (swap) {
void *nbuf;
int rv;
nbuf = ckd_calloc(n_el, el_sz);
memcpy(nbuf, buf, n_el * el_sz);
swap_buf(nbuf, el_sz, n_el);
rv = fwrite(nbuf, el_sz, n_el, fp);
ckd_free(nbuf);
return rv;
}
else {
return fwrite(buf, el_sz, n_el, fp);
}
}
int32
bio_fread_1d(void **buf, size_t el_sz, uint32 * n_el, FILE * fp,
int32 sw, uint32 * ck)
{
/* Read 1-d array size */
if (bio_fread(n_el, sizeof(int32), 1, fp, sw, ck) != 1)
E_FATAL("fread(arraysize) failed\n");
if (*n_el <= 0)
E_FATAL("Bad arraysize: %d\n", *n_el);
/* Allocate memory for array data */
*buf = (void *) ckd_calloc(*n_el, el_sz);
/* Read array data */
if (bio_fread(*buf, el_sz, *n_el, fp, sw, ck) != (int32)*n_el)
E_FATAL("fread(arraydata) failed\n");
return *n_el;
}
int32
bio_fread_2d(void ***arr,
size_t e_sz,
uint32 *d1,
uint32 *d2,
FILE *fp,
uint32 swap,
uint32 *chksum)
{
uint32 l_d1, l_d2;
uint32 n;
size_t ret;
void *raw;
ret = bio_fread(&l_d1, sizeof(uint32), 1, fp, swap, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to read complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fread_2d");
}
return -1;
}
ret = bio_fread(&l_d2, sizeof(uint32), 1, fp, swap, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to read complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fread_2d");
}
return -1;
}
if (bio_fread_1d(&raw, e_sz, &n, fp, swap, chksum) != (int32)n)
return -1;
assert(n == l_d1*l_d2);
*d1 = l_d1;
*d2 = l_d2;
*arr = ckd_alloc_2d_ptr(l_d1, l_d2, raw, e_sz);
return n;
}
int32
bio_fread_3d(void ****arr,
size_t e_sz,
uint32 *d1,
uint32 *d2,
uint32 *d3,
FILE *fp,
uint32 swap,
uint32 *chksum)
{
uint32 l_d1;
uint32 l_d2;
uint32 l_d3;
uint32 n;
void *raw;
size_t ret;
ret = bio_fread(&l_d1, sizeof(uint32), 1, fp, swap, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to read complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fread_3d");
}
return -1;
}
ret = bio_fread(&l_d2, sizeof(uint32), 1, fp, swap, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to read complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fread_3d");
}
return -1;
}
ret = bio_fread(&l_d3, sizeof(uint32), 1, fp, swap, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to read complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fread_3d");
}
return -1;
}
if (bio_fread_1d(&raw, e_sz, &n, fp, swap, chksum) != (int32)n) {
return -1;
}
assert(n == l_d1 * l_d2 * l_d3);
*arr = ckd_alloc_3d_ptr(l_d1, l_d2, l_d3, raw, e_sz);
*d1 = l_d1;
*d2 = l_d2;
*d3 = l_d3;
return n;
}
void
bio_verify_chksum(FILE * fp, int32 byteswap, uint32 chksum)
{
uint32 file_chksum;
if (fread(&file_chksum, sizeof(uint32), 1, fp) != 1)
E_FATAL("fread(chksum) failed\n");
if (byteswap)
SWAP_INT32(&file_chksum);
if (file_chksum != chksum)
E_FATAL
("Checksum error; file-checksum %08x, computed %08x\n",
file_chksum, chksum);
}
int
bio_fwrite_3d(void ***arr,
size_t e_sz,
uint32 d1,
uint32 d2,
uint32 d3,
FILE *fp,
uint32 *chksum)
{
size_t ret;
/* write out first dimension 1 */
ret = bio_fwrite(&d1, sizeof(uint32), 1, fp, 0, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to write complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fwrite_3d");
}
return -1;
}
/* write out first dimension 2 */
ret = bio_fwrite(&d2, sizeof(uint32), 1, fp, 0, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to write complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fwrite_3d");
}
return -1;
}
/* write out first dimension 3 */
ret = bio_fwrite(&d3, sizeof(uint32), 1, fp, 0, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to write complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fwrite_3d");
}
return -1;
}
/* write out the data in the array as one big block */
return bio_fwrite_1d(arr[0][0], e_sz, d1 * d2 * d3, fp, chksum);
}
int
bio_fwrite_1d(void *arr,
size_t e_sz,
uint32 d1,
FILE *fp,
uint32 *chksum)
{
size_t ret;
ret = bio_fwrite(&d1, sizeof(uint32), 1, fp, 0, chksum);
if (ret != 1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to write complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fwrite_1d");
}
return -1;
}
ret = bio_fwrite(arr, e_sz, d1, fp, 0, chksum);
if (ret != d1) {
if (ret == 0) {
E_ERROR_SYSTEM("Unable to write complete data");
}
else {
E_ERROR_SYSTEM("OS error in bio_fwrite_1d");
}
return -1;
}
return ret;
}
int16*
bio_read_wavfile(char const *directory,
char const *filename,
char const *extension,
int32 header,
int32 endian,
size_t *nsamps)
{
FILE *uttfp;
char *inputfile;
size_t n, l;
int16 *data;
(void)endian;
n = strlen(extension);
l = strlen(filename);
if ((n <= l) && (0 == strcmp(filename + l - n, extension)))
extension = "";
inputfile = ckd_calloc(strlen(directory) + l + n + 2, 1);
if (directory) {
sprintf(inputfile, "%s/%s%s", directory, filename, extension);
} else {
sprintf(inputfile, "%s%s", filename, extension);
}
if ((uttfp = fopen(inputfile, "rb")) == NULL) {
E_FATAL_SYSTEM("Failed to open file '%s' for reading", inputfile);
}
fseek(uttfp, 0, SEEK_END);
n = ftell(uttfp);
fseek(uttfp, 0, SEEK_SET);
if (header > 0) {
if (fseek(uttfp, header, SEEK_SET) < 0) {
E_ERROR_SYSTEM("Failed to move to an offset %d in a file '%s'", header, inputfile);
fclose(uttfp);
ckd_free(inputfile);
return NULL;
}
n -= header;
}
n /= sizeof(int16);
data = ckd_calloc(n, sizeof(*data));
if ((l = fread(data, sizeof(int16), n, uttfp)) < n) {
E_ERROR_SYSTEM("Failed to read %d samples from %s: %d", n, inputfile, l);
ckd_free(data);
ckd_free(inputfile);
fclose(uttfp);
return NULL;
}
ckd_free(inputfile);
fclose(uttfp);
if (nsamps) *nsamps = n;
return data;
}
|