1 /* ----------------------------------------------------------------------- *
3 * Copyright 1996-2009 The NASM Authors - All Rights Reserved
4 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * ----------------------------------------------------------------------- */
35 * nasmlib.c library routines for the Netwide Assembler
50 int globalbits = 0; /* defined in nasm.h, works better here for ASM+DISASM */
51 static vefunc nasm_verror; /* Global error handling function */
57 /* Uninitialized -> all zero by C spec */
58 const uint8_t zero_buffer[ZERO_BUF_SIZE];
61 * Prepare a table of tolower() results. This avoids function calls
65 unsigned char nasm_tolower_tab[256];
67 void tolower_init(void)
71 for (i = 0; i < 256; i++)
72 nasm_tolower_tab[i] = tolower(i);
75 void nasm_set_verror(vefunc ve)
80 void nasm_error(int severity, const char *fmt, ...)
85 nasm_verror(severity, fmt, ap);
89 void nasm_init_malloc_error(void)
92 logfp = fopen("malloc.log", "w");
93 setvbuf(logfp, NULL, _IOLBF, BUFSIZ);
94 fprintf(logfp, "null pointer is %p\n", NULL);
99 void *nasm_malloc_log(const char *file, int line, size_t size)
101 void *nasm_malloc(size_t size)
104 void *p = malloc(size);
106 nasm_error(ERR_FATAL | ERR_NOFILE, "out of memory");
109 fprintf(logfp, "%s %d malloc(%ld) returns %p\n",
110 file, line, (long)size, p);
116 void *nasm_zalloc_log(const char *file, int line, size_t size)
118 void *nasm_zalloc(size_t size)
121 void *p = calloc(size, 1);
123 nasm_error(ERR_FATAL | ERR_NOFILE, "out of memory");
126 fprintf(logfp, "%s %d calloc(%ld, 1) returns %p\n",
127 file, line, (long)size, p);
133 void *nasm_realloc_log(const char *file, int line, void *q, size_t size)
135 void *nasm_realloc(void *q, size_t size)
138 void *p = q ? realloc(q, size) : malloc(size);
140 nasm_error(ERR_FATAL | ERR_NOFILE, "out of memory");
143 fprintf(logfp, "%s %d realloc(%p,%ld) returns %p\n",
144 file, line, q, (long)size, p);
146 fprintf(logfp, "%s %d malloc(%ld) returns %p\n",
147 file, line, (long)size, p);
153 void nasm_free_log(const char *file, int line, void *q)
155 void nasm_free(void *q)
160 fprintf(logfp, "%s %d free(%p)\n", file, line, q);
167 char *nasm_strdup_log(const char *file, int line, const char *s)
169 char *nasm_strdup(const char *s)
173 int size = strlen(s) + 1;
177 nasm_error(ERR_FATAL | ERR_NOFILE, "out of memory");
180 fprintf(logfp, "%s %d strdup(%ld) returns %p\n",
181 file, line, (long)size, p);
188 char *nasm_strndup_log(const char *file, int line, const char *s, size_t len)
190 char *nasm_strndup(const char *s, size_t len)
198 nasm_error(ERR_FATAL | ERR_NOFILE, "out of memory");
201 fprintf(logfp, "%s %d strndup(%ld) returns %p\n",
202 file, line, (long)size, p);
209 no_return nasm_assert_failed(const char *file, int line, const char *msg)
211 nasm_error(ERR_FATAL, "assertion %s failed at %s:%d", msg, file, line);
216 int nasm_stricmp(const char *s1, const char *s2)
218 unsigned char c1, c2;
222 c1 = nasm_tolower(*s1++);
223 c2 = nasm_tolower(*s2++);
235 #ifndef nasm_strnicmp
236 int nasm_strnicmp(const char *s1, const char *s2, size_t n)
238 unsigned char c1, c2;
242 c1 = nasm_tolower(*s1++);
243 c2 = nasm_tolower(*s2++);
255 int nasm_memicmp(const char *s1, const char *s2, size_t n)
257 unsigned char c1, c2;
261 c1 = nasm_tolower(*s1++);
262 c2 = nasm_tolower(*s2++);
271 char *nasm_strsep(char **stringp, const char *delim)
279 e = strpbrk(s, delim);
289 #define lib_isnumchar(c) (nasm_isalnum(c) || (c) == '$' || (c) == '_')
290 #define numvalue(c) ((c)>='a' ? (c)-'a'+10 : (c)>='A' ? (c)-'A'+10 : (c)-'0')
292 static int radix_letter(char c)
297 return 2; /* Binary */
300 return 8; /* Octal */
303 return 16; /* Hexadecimal */
306 return 10; /* Decimal */
308 return 0; /* Not a known radix letter */
312 int64_t readnum(char *str, bool *error)
315 int32_t pradix, sradix, radix;
317 uint64_t result, checklimit;
324 while (nasm_isspace(*r))
325 r++; /* find start of number */
328 * If the number came from make_tok_num (as a result of an %assign), it
329 * might have a '-' built into it (rather than in a preceeding token).
338 while (lib_isnumchar(*q))
339 q++; /* find end of number */
349 * Handle radix formats:
351 * 0<radix-letter><string>
352 * $<string> (hexadecimal)
353 * <string><radix-letter>
358 if (len > 2 && *r == '0' && (pradix = radix_letter(r[1])) != 0)
360 else if (len > 1 && *r == '$')
361 pradix = 16, plen = 1;
363 if (len > 1 && (sradix = radix_letter(q[-1])) != 0)
366 if (pradix > sradix) {
369 } else if (sradix > pradix) {
373 /* Either decimal, or invalid -- if invalid, we'll trip up
379 * `checklimit' must be 2**64 / radix. We can't do that in
380 * 64-bit arithmetic, which we're (probably) using, so we
381 * cheat: since we know that all radices we use are even, we
382 * can divide 2**63 by radix/2 instead.
384 checklimit = 0x8000000000000000ULL / (radix >> 1);
387 * Calculate the highest allowable value for the last digit of a
388 * 64-bit constant... in radix 10, it is 6, otherwise it is 0
390 last = (radix == 10 ? 6 : 0);
393 while (*r && r < q) {
395 if (*r < '0' || (*r > '9' && *r < 'A')
396 || (digit = numvalue(*r)) >= radix) {
400 if (result > checklimit ||
401 (result == checklimit && digit >= last)) {
405 result = radix * result + digit;
411 nasm_error(ERR_WARNING | ERR_PASS1 | ERR_WARN_NOV,
412 "numeric constant %s does not fit in 64 bits",
415 return result * sign;
418 int64_t readstrnum(char *str, int length, bool *warn)
420 int64_t charconst = 0;
426 if (globalbits == 64) {
427 for (i = 0; i < length; i++) {
428 if (charconst & 0xFF00000000000000ULL)
430 charconst = (charconst << 8) + (uint8_t)*--str;
433 for (i = 0; i < length; i++) {
434 if (charconst & 0xFF000000UL)
436 charconst = (charconst << 8) + (uint8_t)*--str;
442 static int32_t next_seg;
449 int32_t seg_alloc(void)
451 return (next_seg += 2) - 2;
454 #ifdef WORDS_LITTLEENDIAN
456 void fwriteint16_t(uint16_t data, FILE * fp)
458 fwrite(&data, 1, 2, fp);
461 void fwriteint32_t(uint32_t data, FILE * fp)
463 fwrite(&data, 1, 4, fp);
466 void fwriteint64_t(uint64_t data, FILE * fp)
468 fwrite(&data, 1, 8, fp);
471 void fwriteaddr(uint64_t data, int size, FILE * fp)
473 fwrite(&data, 1, size, fp);
476 #else /* not WORDS_LITTLEENDIAN */
478 void fwriteint16_t(uint16_t data, FILE * fp)
480 char buffer[2], *p = buffer;
482 fwrite(buffer, 1, 2, fp);
485 void fwriteint32_t(uint32_t data, FILE * fp)
487 char buffer[4], *p = buffer;
489 fwrite(buffer, 1, 4, fp);
492 void fwriteint64_t(uint64_t data, FILE * fp)
494 char buffer[8], *p = buffer;
496 fwrite(buffer, 1, 8, fp);
499 void fwriteaddr(uint64_t data, int size, FILE * fp)
501 char buffer[8], *p = buffer;
502 WRITEADDR(p, data, size);
503 fwrite(buffer, 1, size, fp);
508 size_t fwritezero(size_t bytes, FILE *fp)
515 blksize = (bytes < ZERO_BUF_SIZE) ? bytes : ZERO_BUF_SIZE;
517 rv = fwrite(zero_buffer, 1, blksize, fp);
528 void standard_extension(char *inname, char *outname, char *extension)
532 if (*outname) /* file name already exists, */
533 return; /* so do nothing */
537 *p++ = *q++; /* copy, and find end of string */
538 *p = '\0'; /* terminate it */
539 while (p > outname && *--p != '.') ; /* find final period (or whatever) */
542 p++; /* go back to end if none found */
543 if (!strcmp(p, extension)) { /* is the extension already there? */
545 nasm_error(ERR_WARNING | ERR_NOFILE,
546 "file name already ends in `%s': "
547 "output will be in `nasm.out'", extension);
549 nasm_error(ERR_WARNING | ERR_NOFILE,
550 "file name already has no extension: "
551 "output will be in `nasm.out'");
552 strcpy(outname, "nasm.out");
554 strcpy(p, extension);
558 * Common list of prefix names
560 static const char *prefix_names[] = {
561 "a16", "a32", "a64", "asp", "lock", "o16", "o32", "o64", "osp",
562 "rep", "repe", "repne", "repnz", "repz", "times", "wait"
565 const char *prefix_name(int token)
567 unsigned int prefix = token-PREFIX_ENUM_START;
568 if (prefix > elements(prefix_names))
571 return prefix_names[prefix];
577 int bsi(const char *string, const char **array, int size)
579 int i = -1, j = size; /* always, i < index < j */
582 int l = strcmp(string, array[k]);
583 if (l < 0) /* it's in the first half */
585 else if (l > 0) /* it's in the second half */
587 else /* we've got it :) */
590 return -1; /* we haven't got it :( */
593 int bsii(const char *string, const char **array, int size)
595 int i = -1, j = size; /* always, i < index < j */
598 int l = nasm_stricmp(string, array[k]);
599 if (l < 0) /* it's in the first half */
601 else if (l > 0) /* it's in the second half */
603 else /* we've got it :) */
606 return -1; /* we haven't got it :( */
609 static char *file_name = NULL;
610 static int32_t line_number = 0;
612 char *src_set_fname(char *newname)
614 char *oldname = file_name;
619 int32_t src_set_linnum(int32_t newline)
621 int32_t oldline = line_number;
622 line_number = newline;
626 int32_t src_get_linnum(void)
631 int src_get(int32_t *xline, char **xname)
633 if (!file_name || !*xname || strcmp(*xname, file_name)) {
635 *xname = file_name ? nasm_strdup(file_name) : NULL;
636 *xline = line_number;
639 if (*xline != line_number) {
640 int32_t tmp = line_number - *xline;
641 *xline = line_number;
647 char *nasm_strcat(const char *one, const char *two)
650 int l1 = strlen(one);
651 rslt = nasm_malloc(l1 + strlen(two) + 1);
653 strcpy(rslt + l1, two);