nasmlib.c

   1 /* nasmlib.c    library routines for the Netwide Assembler
   2  *
   3  * The Netwide Assembler is copyright (C) 1996 Simon Tatham and
   4  * Julian Hall. All rights reserved. The software is
   5  * redistributable under the licence given in the file "Licence"
   6  * distributed in the NASM archive.
   7  */
   8
   9 #include "compiler.h"
  10
  11 #include <stdio.h>
  12 #include <stdlib.h>
  13 #include <string.h>
  14 #include <ctype.h>
  15 #include <inttypes.h>
  16
  17 #include "nasm.h"
  18 #include "nasmlib.h"
  19 #include "insns.h"
  20
  21 int globalbits = 0;    /* defined in nasm.h, works better here for ASM+DISASM */
  22 efunc nasm_malloc_error;        /* Exported for the benefit of vsnprintf.c */
  23
  24 #ifdef LOGALLOC
  25 static FILE *logfp;
  26 #endif
  27
  28 void nasm_set_malloc_error(efunc error)
  29 {
  30     nasm_malloc_error = error;
  31 #ifdef LOGALLOC
  32     logfp = fopen("malloc.log", "w");
  33     setvbuf(logfp, NULL, _IOLBF, BUFSIZ);
  34     fprintf(logfp, "null pointer is %p\n", NULL);
  35 #endif
  36 }
  37
  38 #ifdef LOGALLOC
  39 void *nasm_malloc_log(char *file, int line, size_t size)
  40 #else
  41 void *nasm_malloc(size_t size)
  42 #endif
  43 {
  44     void *p = malloc(size);
  45     if (!p)
  46         nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
  47 #ifdef LOGALLOC
  48     else
  49         fprintf(logfp, "%s %d malloc(%ld) returns %p\n",
  50                 file, line, (long)size, p);
  51 #endif
  52     return p;
  53 }
  54
  55 #ifdef LOGALLOC
  56 void *nasm_zalloc_log(char *file, int line, size_t size)
  57 #else
  58 void *nasm_zalloc(size_t size)
  59 #endif
  60 {
  61     void *p = calloc(size, 1);
  62     if (!p)
  63         nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
  64 #ifdef LOGALLOC
  65     else
  66         fprintf(logfp, "%s %d calloc(%ld, 1) returns %p\n",
  67                 file, line, (long)size, p);
  68 #endif
  69     return p;
  70 }
  71
  72 #ifdef LOGALLOC
  73 void *nasm_realloc_log(char *file, int line, void *q, size_t size)
  74 #else
  75 void *nasm_realloc(void *q, size_t size)
  76 #endif
  77 {
  78     void *p = q ? realloc(q, size) : malloc(size);
  79     if (!p)
  80         nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
  81 #ifdef LOGALLOC
  82     else if (q)
  83         fprintf(logfp, "%s %d realloc(%p,%ld) returns %p\n",
  84                 file, line, q, (long)size, p);
  85     else
  86         fprintf(logfp, "%s %d malloc(%ld) returns %p\n",
  87                 file, line, (long)size, p);
  88 #endif
  89     return p;
  90 }
  91
  92 #ifdef LOGALLOC
  93 void nasm_free_log(char *file, int line, void *q)
  94 #else
  95 void nasm_free(void *q)
  96 #endif
  97 {
  98     if (q) {
  99         free(q);
 100 #ifdef LOGALLOC
 101         fprintf(logfp, "%s %d free(%p)\n", file, line, q);
 102 #endif
 103     }
 104 }
 105
 106 #ifdef LOGALLOC
 107 char *nasm_strdup_log(char *file, int line, const char *s)
 108 #else
 109 char *nasm_strdup(const char *s)
 110 #endif
 111 {
 112     char *p;
 113     int size = strlen(s) + 1;
 114
 115     p = malloc(size);
 116     if (!p)
 117         nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
 118 #ifdef LOGALLOC
 119     else
 120         fprintf(logfp, "%s %d strdup(%ld) returns %p\n",
 121                 file, line, (long)size, p);
 122 #endif
 123     strcpy(p, s);
 124     return p;
 125 }
 126
 127 #ifdef LOGALLOC
 128 char *nasm_strndup_log(char *file, int line, char *s, size_t len)
 129 #else
 130 char *nasm_strndup(char *s, size_t len)
 131 #endif
 132 {
 133     char *p;
 134     int size = len + 1;
 135
 136     p = malloc(size);
 137     if (!p)
 138         nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
 139 #ifdef LOGALLOC
 140     else
 141         fprintf(logfp, "%s %d strndup(%ld) returns %p\n",
 142                 file, line, (long)size, p);
 143 #endif
 144     strncpy(p, s, len);
 145     p[len] = '\0';
 146     return p;
 147 }
 148
 149 #ifndef nasm_stricmp
 150 int nasm_stricmp(const char *s1, const char *s2)
 151 {
 152     while (*s1 && tolower(*s1) == tolower(*s2))
 153         s1++, s2++;
 154     if (!*s1 && !*s2)
 155         return 0;
 156     else if (tolower(*s1) < tolower(*s2))
 157         return -1;
 158     else
 159         return 1;
 160 }
 161 #endif
 162
 163 #ifndef nasm_strnicmp
 164 int nasm_strnicmp(const char *s1, const char *s2, int n)
 165 {
 166     while (n > 0 && *s1 && tolower(*s1) == tolower(*s2))
 167         s1++, s2++, n--;
 168     if ((!*s1 && !*s2) || n == 0)
 169         return 0;
 170     else if (tolower(*s1) < tolower(*s2))
 171         return -1;
 172     else
 173         return 1;
 174 }
 175 #endif
 176
 177 #ifndef nasm_strsep
 178 char *nasm_strsep(char **stringp, const char *delim)
 179 {
 180         char *s = *stringp;
 181         char *e;
 182
 183         if (!s)
 184                 return NULL;
 185
 186         e = strpbrk(s, delim);
 187         if (e)
 188                 *e++ = '\0';
 189
 190         *stringp = e;
 191         return s;
 192 }
 193 #endif
 194
 195
 196 #define lib_isnumchar(c)   (isalnum(c) || (c) == '$' || (c) == '_')
 197 #define numvalue(c)  ((c)>='a' ? (c)-'a'+10 : (c)>='A' ? (c)-'A'+10 : (c)-'0')
 198
 199 static int radix_letter(char c)
 200 {
 201     switch (c) {
 202     case 'b': case 'B':
 203     case 'y': case 'Y':
 204         return 2;               /* Binary */
 205     case 'o': case 'O':
 206     case 'q': case 'Q':
 207         return 8;               /* Octal */
 208     case 'h': case 'H':
 209     case 'x': case 'X':
 210         return 16;              /* Hexadecimal */
 211     case 'd': case 'D':
 212     case 't': case 'T':
 213         return 10;              /* Decimal */
 214     default:
 215         return 0;               /* Not a known radix letter */
 216     }
 217 }
 218
 219 int64_t readnum(char *str, bool *error)
 220 {
 221     char *r = str, *q;
 222     int32_t pradix, sradix, radix;
 223     int plen, slen, len;
 224     uint64_t result, checklimit;
 225     int digit, last;
 226     bool warn = false;
 227     int sign = 1;
 228
 229     *error = false;
 230
 231     while (isspace(*r))
 232         r++;                    /* find start of number */
 233
 234     /*
 235      * If the number came from make_tok_num (as a result of an %assign), it
 236      * might have a '-' built into it (rather than in a preceeding token).
 237      */
 238     if (*r == '-') {
 239         r++;
 240         sign = -1;
 241     }
 242
 243     q = r;
 244
 245     while (lib_isnumchar(*q))
 246         q++;                    /* find end of number */
 247
 248     len = q-r;
 249     if (!len) {
 250         /* Not numeric */
 251         *error = true;
 252         return 0;
 253     }
 254
 255     /*
 256      * Handle radix formats:
 257      *
 258      * 0<radix-letter><string>
 259      * $<string>                (hexadecimal)
 260      * <string><radix-letter>
 261      */
 262     pradix = sradix = 0;
 263     plen = slen = 0;
 264
 265     if (len > 2 && *r == '0' && (pradix = radix_letter(r[1])) != 0)
 266         plen = 2;
 267     else if (len > 1 && *r == '$')
 268         pradix = 16, plen = 1;
 269
 270     if (len > 1 && (sradix = radix_letter(q[-1])) != 0)
 271         slen = 1;
 272
 273     if (pradix > sradix) {
 274         radix = pradix;
 275         r += plen;
 276     } else if (sradix > pradix) {
 277         radix = sradix;
 278         q -= slen;
 279     } else {
 280         /* Either decimal, or invalid -- if invalid, we'll trip up
 281            further down. */
 282         radix = 10;
 283     }
 284
 285     /*
 286      * `checklimit' must be 2**64 / radix. We can't do that in
 287      * 64-bit arithmetic, which we're (probably) using, so we
 288      * cheat: since we know that all radices we use are even, we
 289      * can divide 2**63 by radix/2 instead.
 290      */
 291     checklimit = 0x8000000000000000ULL / (radix >> 1);
 292
 293     /*
 294      * Calculate the highest allowable value for the last digit of a
 295      * 64-bit constant... in radix 10, it is 6, otherwise it is 0
 296      */
 297     last = (radix == 10 ? 6 : 0);
 298
 299     result = 0;
 300     while (*r && r < q) {
 301         if (*r != '_') {
 302             if (*r < '0' || (*r > '9' && *r < 'A')
 303                 || (digit = numvalue(*r)) >= radix) {
 304                 *error = true;
 305                 return 0;
 306             }
 307             if (result > checklimit ||
 308                 (result == checklimit && digit >= last)) {
 309                 warn = true;
 310             }
 311
 312             result = radix * result + digit;
 313         }
 314         r++;
 315     }
 316
 317     if (warn)
 318         nasm_malloc_error(ERR_WARNING | ERR_PASS1 | ERR_WARN_NOV,
 319                           "numeric constant %s does not fit in 32 bits",
 320                           str);
 321
 322     return result * sign;
 323 }
 324
 325 int64_t readstrnum(char *str, int length, bool *warn)
 326 {
 327     int64_t charconst = 0;
 328     int i;
 329
 330     *warn = false;
 331
 332     str += length;
 333     if (globalbits == 64) {
 334         for (i = 0; i < length; i++) {
 335             if (charconst & 0xFF00000000000000ULL)
 336                 *warn = true;
 337             charconst = (charconst << 8) + (uint8_t)*--str;
 338         }
 339     } else {
 340         for (i = 0; i < length; i++) {
 341             if (charconst & 0xFF000000UL)
 342                 *warn = true;
 343             charconst = (charconst << 8) + (uint8_t)*--str;
 344         }
 345     }
 346     return charconst;
 347 }
 348
 349 static int32_t next_seg;
 350
 351 void seg_init(void)
 352 {
 353     next_seg = 0;
 354 }
 355
 356 int32_t seg_alloc(void)
 357 {
 358     return (next_seg += 2) - 2;
 359 }
 360
 361 #if X86_MEMORY
 362
 363 void fwriteint16_t(uint16_t data, FILE * fp)
 364 {
 365     fwrite(&data, 1, 2, fp);
 366 }
 367
 368 void fwriteint32_t(uint32_t data, FILE * fp)
 369 {
 370     fwrite(&data, 1, 4, fp);
 371 }
 372
 373 void fwriteint64_t(uint64_t data, FILE * fp)
 374 {
 375     fwrite(&data, 1, 8, fp);
 376 }
 377
 378 void fwriteaddr(uint64_t data, int size, FILE * fp)
 379 {
 380     fwrite(&data, 1, size, fp);
 381 }
 382
 383 #else /* !X86_MEMORY */
 384
 385 void fwriteint16_t(uint16_t data, FILE * fp)
 386 {
 387     char buffer[2], *p = buffer;
 388     WRITESHORT(p, data);
 389     fwrite(buffer, 1, 2, fp);
 390 }
 391
 392 void fwriteint32_t(uint32_t data, FILE * fp)
 393 {
 394     char buffer[4], *p = buffer;
 395     WRITELONG(p, data);
 396     fwrite(buffer, 1, 4, fp);
 397 }
 398
 399 void fwriteint64_t(uint64_t data, FILE * fp)
 400 {
 401     char buffer[8], *p = buffer;
 402     WRITEDLONG(p, data);
 403     fwrite(buffer, 1, 8, fp);
 404 }
 405
 406 void fwriteaddr(uint64_t data, int size, FILE * fp)
 407 {
 408     char buffer[8], *p = buffer;
 409     WRITEADDR(p, data, size);
 410     fwrite(buffer, 1, size, fp);
 411 }
 412
 413 #endif
 414
 415 void standard_extension(char *inname, char *outname, char *extension,
 416                         efunc error)
 417 {
 418     char *p, *q;
 419
 420     if (*outname)               /* file name already exists, */
 421         return;                 /* so do nothing */
 422     q = inname;
 423     p = outname;
 424     while (*q)
 425         *p++ = *q++;            /* copy, and find end of string */
 426     *p = '\0';                  /* terminate it */
 427     while (p > outname && *--p != '.') ;        /* find final period (or whatever) */
 428     if (*p != '.')
 429         while (*p)
 430             p++;                /* go back to end if none found */
 431     if (!strcmp(p, extension)) {        /* is the extension already there? */
 432         if (*extension)
 433             error(ERR_WARNING | ERR_NOFILE,
 434                   "file name already ends in `%s': "
 435                   "output will be in `nasm.out'", extension);
 436         else
 437             error(ERR_WARNING | ERR_NOFILE,
 438                   "file name already has no extension: "
 439                   "output will be in `nasm.out'");
 440         strcpy(outname, "nasm.out");
 441     } else
 442         strcpy(p, extension);
 443 }
 444
 445 #define LEAFSIZ (sizeof(RAA)-sizeof(RAA_UNION)+sizeof(RAA_LEAF))
 446 #define BRANCHSIZ (sizeof(RAA)-sizeof(RAA_UNION)+sizeof(RAA_BRANCH))
 447
 448 #define LAYERSIZ(r) ( (r)->layers==0 ? RAA_BLKSIZE : RAA_LAYERSIZE )
 449
 450 static struct RAA *real_raa_init(int layers)
 451 {
 452     struct RAA *r;
 453     int i;
 454
 455     if (layers == 0) {
 456         r = nasm_zalloc(LEAFSIZ);
 457         r->stepsize = 1L;
 458     } else {
 459         r = nasm_malloc(BRANCHSIZ);
 460         r->layers = layers;
 461         for (i = 0; i < RAA_LAYERSIZE; i++)
 462             r->u.b.data[i] = NULL;
 463         r->stepsize = RAA_BLKSIZE;
 464         while (--layers)
 465             r->stepsize *= RAA_LAYERSIZE;
 466     }
 467     return r;
 468 }
 469
 470 struct RAA *raa_init(void)
 471 {
 472     return real_raa_init(0);
 473 }
 474
 475 void raa_free(struct RAA *r)
 476 {
 477     if (r->layers == 0)
 478         nasm_free(r);
 479     else {
 480         struct RAA **p;
 481         for (p = r->u.b.data; p - r->u.b.data < RAA_LAYERSIZE; p++)
 482             if (*p)
 483                 raa_free(*p);
 484     }
 485 }
 486
 487 int64_t raa_read(struct RAA *r, int32_t posn)
 488 {
 489     if (posn >= r->stepsize * LAYERSIZ(r))
 490         return 0;               /* Return 0 for undefined entries */
 491     while (r->layers > 0) {
 492         ldiv_t l;
 493         l = ldiv(posn, r->stepsize);
 494         r = r->u.b.data[l.quot];
 495         posn = l.rem;
 496         if (!r)
 497             return 0;           /* Return 0 for undefined entries */
 498     }
 499     return r->u.l.data[posn];
 500 }
 501
 502 struct RAA *raa_write(struct RAA *r, int32_t posn, int64_t value)
 503 {
 504     struct RAA *result;
 505
 506     if (posn < 0)
 507         nasm_malloc_error(ERR_PANIC, "negative position in raa_write");
 508
 509     while (r->stepsize * LAYERSIZ(r) <= posn) {
 510         /*
 511          * Must add a layer.
 512          */
 513         struct RAA *s;
 514         int i;
 515
 516         s = nasm_malloc(BRANCHSIZ);
 517         for (i = 0; i < RAA_LAYERSIZE; i++)
 518             s->u.b.data[i] = NULL;
 519         s->layers = r->layers + 1;
 520         s->stepsize = LAYERSIZ(r) * r->stepsize;
 521         s->u.b.data[0] = r;
 522         r = s;
 523     }
 524
 525     result = r;
 526
 527     while (r->layers > 0) {
 528         ldiv_t l;
 529         struct RAA **s;
 530         l = ldiv(posn, r->stepsize);
 531         s = &r->u.b.data[l.quot];
 532         if (!*s)
 533             *s = real_raa_init(r->layers - 1);
 534         r = *s;
 535         posn = l.rem;
 536     }
 537
 538     r->u.l.data[posn] = value;
 539
 540     return result;
 541 }
 542
 543 /* Aggregate SAA components smaller than this */
 544 #define SAA_BLKLEN 65536
 545
 546 struct SAA *saa_init(size_t elem_len)
 547 {
 548     struct SAA *s;
 549     char *data;
 550
 551     s = nasm_zalloc(sizeof(struct SAA));
 552
 553     if (elem_len >= SAA_BLKLEN)
 554         s->blk_len = elem_len;
 555     else
 556         s->blk_len = SAA_BLKLEN - (SAA_BLKLEN % elem_len);
 557
 558     s->elem_len = elem_len;
 559     s->length = s->blk_len;
 560     data = nasm_malloc(s->blk_len);
 561     s->nblkptrs = s->nblks = 1;
 562     s->blk_ptrs = nasm_malloc(sizeof(char *));
 563     s->blk_ptrs[0] = data;
 564     s->wblk = s->rblk = &s->blk_ptrs[0];
 565
 566     return s;
 567 }
 568
 569 void saa_free(struct SAA *s)
 570 {
 571     char **p;
 572     size_t n;
 573
 574     for (p = s->blk_ptrs, n = s->nblks; n; p++, n--)
 575         nasm_free(*p);
 576
 577     nasm_free(s->blk_ptrs);
 578     nasm_free(s);
 579 }
 580
 581 /* Add one allocation block to an SAA */
 582 static void saa_extend(struct SAA *s)
 583 {
 584     size_t blkn = s->nblks++;
 585
 586     if (blkn >= s->nblkptrs) {
 587         size_t rindex = s->rblk - s->blk_ptrs;
 588         size_t windex = s->wblk - s->blk_ptrs;
 589
 590         s->nblkptrs <<= 1;
 591         s->blk_ptrs = nasm_realloc(s->blk_ptrs, s->nblkptrs*sizeof(char *));
 592
 593         s->rblk = s->blk_ptrs + rindex;
 594         s->wblk = s->blk_ptrs + windex;
 595     }
 596
 597     s->blk_ptrs[blkn] = nasm_malloc(s->blk_len);
 598     s->length += s->blk_len;
 599 }
 600
 601 void *saa_wstruct(struct SAA *s)
 602 {
 603     void *p;
 604
 605     if (s->wpos % s->elem_len)
 606             nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
 607                               "misaligned wpos in saa_wstruct");
 608
 609     if (s->wpos + s->elem_len > s->blk_len) {
 610         if (s->wpos != s->blk_len)
 611             nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
 612                               "unfilled block in saa_wstruct");
 613
 614         if (s->wptr + s->elem_len > s->length)
 615             saa_extend(s);
 616         s->wblk++;
 617         s->wpos = 0;
 618     }
 619
 620     p = *s->wblk + s->wpos;
 621     s->wpos += s->elem_len;
 622     s->wptr += s->elem_len;
 623
 624     if (s->wptr > s->datalen)
 625         s->datalen = s->wptr;
 626
 627     return p;
 628 }
 629
 630 void saa_wbytes(struct SAA *s, const void *data, size_t len)
 631 {
 632     const char *d = data;
 633
 634     while (len) {
 635         size_t l = s->blk_len - s->wpos;
 636         if (l > len)
 637             l = len;
 638         if (l) {
 639             if (d) {
 640                 memcpy(*s->wblk + s->wpos, d, l);
 641                 d += l;
 642             } else
 643                 memset(*s->wblk + s->wpos, 0, l);
 644             s->wpos += l;
 645             s->wptr += l;
 646             len -= l;
 647
 648             if (s->datalen < s->wptr)
 649                 s->datalen = s->wptr;
 650         }
 651         if (len) {
 652             if (s->wptr >= s->length)
 653                 saa_extend(s);
 654             s->wblk++;
 655             s->wpos = 0;
 656         }
 657     }
 658 }
 659
 660 void saa_rewind(struct SAA *s)
 661 {
 662     s->rblk = s->blk_ptrs;
 663     s->rpos = s->rptr = 0;
 664 }
 665
 666 void *saa_rstruct(struct SAA *s)
 667 {
 668     void *p;
 669
 670     if (s->rptr + s->elem_len > s->datalen)
 671         return NULL;
 672
 673     if (s->rpos % s->elem_len)
 674             nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
 675                               "misaligned rpos in saa_rstruct");
 676
 677     if (s->rpos + s->elem_len > s->blk_len) {
 678         s->rblk++;
 679         s->rpos = 0;
 680     }
 681
 682     p = *s->rblk + s->rpos;
 683     s->rpos += s->elem_len;
 684     s->rptr += s->elem_len;
 685
 686     return p;
 687 }
 688
 689 const void *saa_rbytes(struct SAA *s, size_t *lenp)
 690 {
 691     const void *p;
 692     size_t len;
 693
 694     if (s->rptr >= s->datalen) {
 695         *lenp = 0;
 696         return NULL;
 697     }
 698
 699     if (s->rpos >= s->blk_len) {
 700         s->rblk++;
 701         s->rpos = 0;
 702     }
 703
 704     len = *lenp;
 705     if (len > s->datalen - s->rptr)
 706         len = s->datalen - s->rptr;
 707     if (len > s->blk_len - s->rpos)
 708         len = s->blk_len - s->rpos;
 709
 710     *lenp = len;
 711     p = *s->rblk + s->rpos;
 712
 713     s->rpos += len;
 714     s->rptr += len;
 715
 716     return p;
 717 }
 718
 719 void saa_rnbytes(struct SAA *s, void *data, size_t len)
 720 {
 721     char *d = data;
 722
 723     if (s->rptr + len > s->datalen) {
 724         nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_rnbytes");
 725         return;
 726     }
 727
 728     while (len) {
 729         size_t l;
 730         const void *p;
 731
 732         l = len;
 733         p = saa_rbytes(s, &l);
 734
 735         memcpy(d, p, l);
 736         d   += l;
 737         len -= l;
 738     }
 739 }
 740
 741 /* Same as saa_rnbytes, except position the counter first */
 742 void saa_fread(struct SAA *s, size_t posn, void *data, size_t len)
 743 {
 744     size_t ix;
 745
 746     if (posn+len > s->datalen) {
 747         nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_fread");
 748         return;
 749     }
 750
 751     ix = posn / s->blk_len;
 752     s->rptr = posn;
 753     s->rpos = posn % s->blk_len;
 754     s->rblk = &s->blk_ptrs[ix];
 755
 756     saa_rnbytes(s, data, len);
 757 }
 758
 759 /* Same as saa_wbytes, except position the counter first */
 760 void saa_fwrite(struct SAA *s, size_t posn, const void *data, size_t len)
 761 {
 762     size_t ix;
 763
 764     if (posn > s->datalen) {
 765         /* Seek beyond the end of the existing array not supported */
 766         nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_fwrite");
 767         return;
 768     }
 769
 770     ix = posn / s->blk_len;
 771     s->wptr = posn;
 772     s->wpos = posn % s->blk_len;
 773     s->wblk = &s->blk_ptrs[ix];
 774
 775     if (!s->wpos) {
 776         s->wpos = s->blk_len;
 777         s->wblk--;
 778     }
 779
 780     saa_wbytes(s, data, len);
 781 }
 782
 783 void saa_fpwrite(struct SAA *s, FILE * fp)
 784 {
 785     const char *data;
 786     size_t len;
 787
 788     saa_rewind(s);
 789     while (len = s->datalen, (data = saa_rbytes(s, &len)) != NULL)
 790         fwrite(data, 1, len, fp);
 791 }
 792
 793 /*
 794  * Common list of prefix names
 795  */
 796 static const char *prefix_names[] = {
 797     "a16", "a32", "lock", "o16", "o32", "rep", "repe", "repne",
 798     "repnz", "repz", "times"
 799 };
 800
 801 const char *prefix_name(int token)
 802 {
 803     unsigned int prefix = token-PREFIX_ENUM_START;
 804     if (prefix > elements(prefix_names))
 805         return NULL;
 806
 807     return prefix_names[prefix];
 808 }
 809
 810 /*
 811  * Binary search.
 812  */
 813 int bsi(const char *string, const char **array, int size)
 814 {
 815     int i = -1, j = size;       /* always, i < index < j */
 816     while (j - i >= 2) {
 817         int k = (i + j) / 2;
 818         int l = strcmp(string, array[k]);
 819         if (l < 0)              /* it's in the first half */
 820             j = k;
 821         else if (l > 0)         /* it's in the second half */
 822             i = k;
 823         else                    /* we've got it :) */
 824             return k;
 825     }
 826     return -1;                  /* we haven't got it :( */
 827 }
 828
 829 int bsii(const char *string, const char **array, int size)
 830 {
 831     int i = -1, j = size;       /* always, i < index < j */
 832     while (j - i >= 2) {
 833         int k = (i + j) / 2;
 834         int l = nasm_stricmp(string, array[k]);
 835         if (l < 0)              /* it's in the first half */
 836             j = k;
 837         else if (l > 0)         /* it's in the second half */
 838             i = k;
 839         else                    /* we've got it :) */
 840             return k;
 841     }
 842     return -1;                  /* we haven't got it :( */
 843 }
 844
 845 static char *file_name = NULL;
 846 static int32_t line_number = 0;
 847
 848 char *src_set_fname(char *newname)
 849 {
 850     char *oldname = file_name;
 851     file_name = newname;
 852     return oldname;
 853 }
 854
 855 int32_t src_set_linnum(int32_t newline)
 856 {
 857     int32_t oldline = line_number;
 858     line_number = newline;
 859     return oldline;
 860 }
 861
 862 int32_t src_get_linnum(void)
 863 {
 864     return line_number;
 865 }
 866
 867 int src_get(int32_t *xline, char **xname)
 868 {
 869     if (!file_name || !*xname || strcmp(*xname, file_name)) {
 870         nasm_free(*xname);
 871         *xname = file_name ? nasm_strdup(file_name) : NULL;
 872         *xline = line_number;
 873         return -2;
 874     }
 875     if (*xline != line_number) {
 876         int32_t tmp = line_number - *xline;
 877         *xline = line_number;
 878         return tmp;
 879     }
 880     return 0;
 881 }
 882
 883 void nasm_quote(char **str)
 884 {
 885     int ln = strlen(*str);
 886     char q = (*str)[0];
 887     char *p;
 888     if (ln > 1 && (*str)[ln - 1] == q && (q == '"' || q == '\''))
 889         return;
 890     q = '"';
 891     if (strchr(*str, q))
 892         q = '\'';
 893     p = nasm_malloc(ln + 3);
 894     strcpy(p + 1, *str);
 895     nasm_free(*str);
 896     p[ln + 1] = p[0] = q;
 897     p[ln + 2] = 0;
 898     *str = p;
 899 }
 900
 901 char *nasm_strcat(char *one, char *two)
 902 {
 903     char *rslt;
 904     int l1 = strlen(one);
 905     rslt = nasm_malloc(l1 + strlen(two) + 1);
 906     strcpy(rslt, one);
 907     strcpy(rslt + l1, two);
 908     return rslt;
 909 }
 910
 911 void null_debug_init(struct ofmt *of, void *id, FILE * fp, efunc error)
 912 {
 913         (void)of;
 914         (void)id;
 915         (void)fp;
 916         (void)error;
 917 }
 918 void null_debug_linenum(const char *filename, int32_t linenumber, int32_t segto)
 919 {
 920         (void)filename;
 921         (void)linenumber;
 922         (void)segto;
 923 }
 924 void null_debug_deflabel(char *name, int32_t segment, int64_t offset,
 925                          int is_global, char *special)
 926 {
 927         (void)name;
 928         (void)segment;
 929         (void)offset;
 930         (void)is_global;
 931         (void)special;
 932 }
 933 void null_debug_routine(const char *directive, const char *params)
 934 {
 935         (void)directive;
 936         (void)params;
 937 }
 938 void null_debug_typevalue(int32_t type)
 939 {
 940         (void)type;
 941 }
 942 void null_debug_output(int type, void *param)
 943 {
 944         (void)type;
 945         (void)param;
 946 }
 947 void null_debug_cleanup(void)
 948 {
 949 }
 950
 951 struct dfmt null_debug_form = {
 952     "Null debug format",
 953     "null",
 954     null_debug_init,
 955     null_debug_linenum,
 956     null_debug_deflabel,
 957     null_debug_routine,
 958     null_debug_typevalue,
 959     null_debug_output,
 960     null_debug_cleanup
 961 };
 962
 963 struct dfmt *null_debug_arr[2] = { &null_debug_form, NULL };