1 /* nasmlib.c library routines for the Netwide Assembler
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.
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 */
28 void nasm_set_malloc_error(efunc error)
30 nasm_malloc_error = error;
32 logfp = fopen("malloc.log", "w");
33 setvbuf(logfp, NULL, _IOLBF, BUFSIZ);
34 fprintf(logfp, "null pointer is %p\n", NULL);
39 void *nasm_malloc_log(char *file, int line, size_t size)
41 void *nasm_malloc(size_t size)
44 void *p = malloc(size);
46 nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
49 fprintf(logfp, "%s %d malloc(%ld) returns %p\n",
50 file, line, (long)size, p);
56 void *nasm_zalloc_log(char *file, int line, size_t size)
58 void *nasm_zalloc(size_t size)
61 void *p = calloc(size, 1);
63 nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
66 fprintf(logfp, "%s %d calloc(%ld, 1) returns %p\n",
67 file, line, (long)size, p);
73 void *nasm_realloc_log(char *file, int line, void *q, size_t size)
75 void *nasm_realloc(void *q, size_t size)
78 void *p = q ? realloc(q, size) : malloc(size);
80 nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
83 fprintf(logfp, "%s %d realloc(%p,%ld) returns %p\n",
84 file, line, q, (long)size, p);
86 fprintf(logfp, "%s %d malloc(%ld) returns %p\n",
87 file, line, (long)size, p);
93 void nasm_free_log(char *file, int line, void *q)
95 void nasm_free(void *q)
101 fprintf(logfp, "%s %d free(%p)\n", file, line, q);
107 char *nasm_strdup_log(char *file, int line, const char *s)
109 char *nasm_strdup(const char *s)
113 int size = strlen(s) + 1;
117 nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
120 fprintf(logfp, "%s %d strdup(%ld) returns %p\n",
121 file, line, (long)size, p);
128 char *nasm_strndup_log(char *file, int line, char *s, size_t len)
130 char *nasm_strndup(char *s, size_t len)
138 nasm_malloc_error(ERR_FATAL | ERR_NOFILE, "out of memory");
141 fprintf(logfp, "%s %d strndup(%ld) returns %p\n",
142 file, line, (long)size, p);
150 int nasm_stricmp(const char *s1, const char *s2)
152 while (*s1 && tolower(*s1) == tolower(*s2))
156 else if (tolower(*s1) < tolower(*s2))
163 #ifndef nasm_strnicmp
164 int nasm_strnicmp(const char *s1, const char *s2, int n)
166 while (n > 0 && *s1 && tolower(*s1) == tolower(*s2))
168 if ((!*s1 && !*s2) || n == 0)
170 else if (tolower(*s1) < tolower(*s2))
178 char *nasm_strsep(char **stringp, const char *delim)
186 e = strpbrk(s, delim);
196 #define lib_isnumchar(c) ( isalnum(c) || (c) == '$')
197 #define numvalue(c) ((c)>='a' ? (c)-'a'+10 : (c)>='A' ? (c)-'A'+10 : (c)-'0')
199 int64_t readnum(char *str, bool *error)
203 uint64_t result, checklimit;
211 r++; /* find start of number */
214 * If the number came from make_tok_num (as a result of an %assign), it
215 * might have a '-' built into it (rather than in a preceeding token).
224 while (lib_isnumchar(*q))
225 q++; /* find end of number */
228 * If it begins 0x, 0X or $, or ends in H, it's in hex. if it
229 * ends in Q, it's octal. if it ends in B, it's binary.
230 * Otherwise, it's ordinary decimal.
232 if (*r == '0' && (r[1] == 'x' || r[1] == 'X'))
236 else if (q[-1] == 'H' || q[-1] == 'h')
238 else if (q[-1] == 'Q' || q[-1] == 'q' || q[-1] == 'O' || q[-1] == 'o')
240 else if (q[-1] == 'B' || q[-1] == 'b' || q[-1] == 'Y' || q[-1] == 'y')
242 else if (q[-1] == 'D' || q[-1] == 'd' || q[-1] == 'T' || q[-1] == 't')
248 * If this number has been found for us by something other than
249 * the ordinary scanners, then it might be malformed by having
250 * nothing between the prefix and the suffix. Check this case
259 * `checklimit' must be 2**(32|64) / radix. We can't do that in
260 * 32/64-bit arithmetic, which we're (probably) using, so we
261 * cheat: since we know that all radices we use are even, we
262 * can divide 2**(31|63) by radix/2 instead.
264 if (globalbits == 64)
265 checklimit = 0x8000000000000000ULL / (radix >> 1);
267 checklimit = 0x80000000UL / (radix >> 1);
270 * Calculate the highest allowable value for the last digit of a
271 * 32-bit constant... in radix 10, it is 6, otherwise it is 0
273 last = (radix == 10 ? 6 : 0);
276 while (*r && r < q) {
277 if (*r < '0' || (*r > '9' && *r < 'A')
278 || (digit = numvalue(*r)) >= radix) {
282 if (result > checklimit || (result == checklimit && digit >= last)) {
286 result = radix * result + digit;
291 nasm_malloc_error(ERR_WARNING | ERR_PASS1 | ERR_WARN_NOV,
292 "numeric constant %s does not fit in 32 bits",
295 return result * sign;
298 int64_t readstrnum(char *str, int length, bool *warn)
300 int64_t charconst = 0;
306 if (globalbits == 64) {
307 for (i = 0; i < length; i++) {
308 if (charconst & 0xFF00000000000000ULL)
310 charconst = (charconst << 8) + (uint8_t)*--str;
313 for (i = 0; i < length; i++) {
314 if (charconst & 0xFF000000UL)
316 charconst = (charconst << 8) + (uint8_t)*--str;
322 static int32_t next_seg;
329 int32_t seg_alloc(void)
331 return (next_seg += 2) - 2;
334 void fwriteint16_t(int data, FILE * fp)
336 fputc((int)(data & 255), fp);
337 fputc((int)((data >> 8) & 255), fp);
340 void fwriteint32_t(int32_t data, FILE * fp)
342 fputc((int)(data & 255), fp);
343 fputc((int)((data >> 8) & 255), fp);
344 fputc((int)((data >> 16) & 255), fp);
345 fputc((int)((data >> 24) & 255), fp);
348 void fwriteint64_t(int64_t data, FILE * fp)
350 fputc((int)(data & 255), fp);
351 fputc((int)((data >> 8) & 255), fp);
352 fputc((int)((data >> 16) & 255), fp);
353 fputc((int)((data >> 24) & 255), fp);
354 fputc((int)((data >> 32) & 255), fp);
355 fputc((int)((data >> 40) & 255), fp);
356 fputc((int)((data >> 48) & 255), fp);
357 fputc((int)((data >> 56) & 255), fp);
360 void standard_extension(char *inname, char *outname, char *extension,
365 if (*outname) /* file name already exists, */
366 return; /* so do nothing */
370 *p++ = *q++; /* copy, and find end of string */
371 *p = '\0'; /* terminate it */
372 while (p > outname && *--p != '.') ; /* find final period (or whatever) */
375 p++; /* go back to end if none found */
376 if (!strcmp(p, extension)) { /* is the extension already there? */
378 error(ERR_WARNING | ERR_NOFILE,
379 "file name already ends in `%s': "
380 "output will be in `nasm.out'", extension);
382 error(ERR_WARNING | ERR_NOFILE,
383 "file name already has no extension: "
384 "output will be in `nasm.out'");
385 strcpy(outname, "nasm.out");
387 strcpy(p, extension);
390 #define LEAFSIZ (sizeof(RAA)-sizeof(RAA_UNION)+sizeof(RAA_LEAF))
391 #define BRANCHSIZ (sizeof(RAA)-sizeof(RAA_UNION)+sizeof(RAA_BRANCH))
393 #define LAYERSIZ(r) ( (r)->layers==0 ? RAA_BLKSIZE : RAA_LAYERSIZE )
395 static struct RAA *real_raa_init(int layers)
401 r = nasm_zalloc(LEAFSIZ);
404 r = nasm_malloc(BRANCHSIZ);
406 for (i = 0; i < RAA_LAYERSIZE; i++)
407 r->u.b.data[i] = NULL;
408 r->stepsize = RAA_BLKSIZE;
410 r->stepsize *= RAA_LAYERSIZE;
415 struct RAA *raa_init(void)
417 return real_raa_init(0);
420 void raa_free(struct RAA *r)
426 for (p = r->u.b.data; p - r->u.b.data < RAA_LAYERSIZE; p++)
432 int32_t raa_read(struct RAA *r, int32_t posn)
434 if (posn >= r->stepsize * LAYERSIZ(r))
435 return 0; /* Return 0 for undefined entries */
436 while (r->layers > 0) {
438 l = ldiv(posn, r->stepsize);
439 r = r->u.b.data[l.quot];
442 return 0; /* Return 0 for undefined entries */
444 return r->u.l.data[posn];
447 struct RAA *raa_write(struct RAA *r, int32_t posn, int32_t value)
452 nasm_malloc_error(ERR_PANIC, "negative position in raa_write");
454 while (r->stepsize * LAYERSIZ(r) <= posn) {
461 s = nasm_malloc(BRANCHSIZ);
462 for (i = 0; i < RAA_LAYERSIZE; i++)
463 s->u.b.data[i] = NULL;
464 s->layers = r->layers + 1;
465 s->stepsize = LAYERSIZ(r) * r->stepsize;
472 while (r->layers > 0) {
475 l = ldiv(posn, r->stepsize);
476 s = &r->u.b.data[l.quot];
478 *s = real_raa_init(r->layers - 1);
483 r->u.l.data[posn] = value;
488 /* Aggregate SAA components smaller than this */
489 #define SAA_BLKLEN 65536
491 struct SAA *saa_init(size_t elem_len)
496 s = nasm_zalloc(sizeof(struct SAA));
498 if (elem_len >= SAA_BLKLEN)
499 s->blk_len = elem_len;
501 s->blk_len = SAA_BLKLEN - (SAA_BLKLEN % elem_len);
503 s->elem_len = elem_len;
504 s->length = s->blk_len;
505 data = nasm_malloc(s->blk_len);
506 s->nblkptrs = s->nblks = 1;
507 s->blk_ptrs = nasm_malloc(sizeof(char *));
508 s->blk_ptrs[0] = data;
509 s->wblk = s->rblk = &s->blk_ptrs[0];
514 void saa_free(struct SAA *s)
519 for (p = s->blk_ptrs, n = s->nblks; n; p++, n--)
522 nasm_free(s->blk_ptrs);
526 /* Add one allocation block to an SAA */
527 static void saa_extend(struct SAA *s)
529 size_t blkn = s->nblks++;
531 if (blkn >= s->nblkptrs) {
532 size_t rindex = s->rblk - s->blk_ptrs;
533 size_t windex = s->wblk - s->blk_ptrs;
536 s->blk_ptrs = nasm_realloc(s->blk_ptrs, s->nblkptrs*sizeof(char *));
538 s->rblk = s->blk_ptrs + rindex;
539 s->wblk = s->blk_ptrs + windex;
542 s->blk_ptrs[blkn] = nasm_malloc(s->blk_len);
543 s->length += s->blk_len;
546 void *saa_wstruct(struct SAA *s)
550 if (s->wpos % s->elem_len)
551 nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
552 "misaligned wpos in saa_wstruct");
554 if (s->wpos + s->elem_len > s->blk_len) {
555 if (s->wpos != s->blk_len)
556 nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
557 "unfilled block in saa_wstruct");
559 if (s->wptr + s->elem_len > s->length)
565 p = *s->wblk + s->wpos;
566 s->wpos += s->elem_len;
567 s->wptr += s->elem_len;
569 if (s->wptr > s->datalen)
570 s->datalen = s->wptr;
575 void saa_wbytes(struct SAA *s, const void *data, size_t len)
577 const char *d = data;
580 size_t l = s->blk_len - s->wpos;
585 memcpy(*s->wblk + s->wpos, d, l);
588 memset(*s->wblk + s->wpos, 0, l);
593 if (s->datalen < s->wptr)
594 s->datalen = s->wptr;
597 if (s->wptr >= s->length)
605 void saa_rewind(struct SAA *s)
607 s->rblk = s->blk_ptrs;
608 s->rpos = s->rptr = 0;
611 void *saa_rstruct(struct SAA *s)
615 if (s->rptr + s->elem_len > s->datalen)
618 if (s->rpos % s->elem_len)
619 nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
620 "misaligned rpos in saa_rstruct");
622 if (s->rpos + s->elem_len > s->blk_len) {
627 p = *s->rblk + s->rpos;
628 s->rpos += s->elem_len;
629 s->rptr += s->elem_len;
634 const void *saa_rbytes(struct SAA *s, size_t *lenp)
639 if (s->rptr >= s->datalen) {
644 if (s->rpos >= s->blk_len) {
650 if (len > s->datalen - s->rptr)
651 len = s->datalen - s->rptr;
652 if (len > s->blk_len - s->rpos)
653 len = s->blk_len - s->rpos;
656 p = *s->rblk + s->rpos;
664 void saa_rnbytes(struct SAA *s, void *data, size_t len)
668 if (s->rptr + len > s->datalen) {
669 nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_rnbytes");
678 p = saa_rbytes(s, &l);
686 /* Same as saa_rnbytes, except position the counter first */
687 void saa_fread(struct SAA *s, size_t posn, void *data, size_t len)
691 if (posn+len > s->datalen) {
692 nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_fread");
696 ix = posn / s->blk_len;
698 s->rpos = posn % s->blk_len;
699 s->rblk = &s->blk_ptrs[ix];
701 saa_rnbytes(s, data, len);
704 /* Same as saa_wbytes, except position the counter first */
705 void saa_fwrite(struct SAA *s, size_t posn, const void *data, size_t len)
709 if (posn > s->datalen) {
710 /* Seek beyond the end of the existing array not supported */
711 nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_fwrite");
715 ix = posn / s->blk_len;
717 s->wpos = posn % s->blk_len;
718 s->wblk = &s->blk_ptrs[ix];
721 s->wpos = s->blk_len;
725 saa_wbytes(s, data, len);
728 void saa_fpwrite(struct SAA *s, FILE * fp)
734 while (len = s->datalen, (data = saa_rbytes(s, &len)) != NULL)
735 fwrite(data, 1, len, fp);
739 * Common list of prefix names
741 static const char *prefix_names[] = {
742 "a16", "a32", "lock", "o16", "o32", "rep", "repe", "repne",
743 "repnz", "repz", "times"
746 const char *prefix_name(int token)
748 unsigned int prefix = token-PREFIX_ENUM_START;
749 if (prefix > sizeof prefix_names / sizeof(const char *))
752 return prefix_names[prefix];
758 int bsi(char *string, const char **array, int size)
760 int i = -1, j = size; /* always, i < index < j */
763 int l = strcmp(string, array[k]);
764 if (l < 0) /* it's in the first half */
766 else if (l > 0) /* it's in the second half */
768 else /* we've got it :) */
771 return -1; /* we haven't got it :( */
774 int bsii(char *string, const char **array, int size)
776 int i = -1, j = size; /* always, i < index < j */
779 int l = nasm_stricmp(string, array[k]);
780 if (l < 0) /* it's in the first half */
782 else if (l > 0) /* it's in the second half */
784 else /* we've got it :) */
787 return -1; /* we haven't got it :( */
790 static char *file_name = NULL;
791 static int32_t line_number = 0;
793 char *src_set_fname(char *newname)
795 char *oldname = file_name;
800 int32_t src_set_linnum(int32_t newline)
802 int32_t oldline = line_number;
803 line_number = newline;
807 int32_t src_get_linnum(void)
812 int src_get(int32_t *xline, char **xname)
814 if (!file_name || !*xname || strcmp(*xname, file_name)) {
816 *xname = file_name ? nasm_strdup(file_name) : NULL;
817 *xline = line_number;
820 if (*xline != line_number) {
821 int32_t tmp = line_number - *xline;
822 *xline = line_number;
828 void nasm_quote(char **str)
830 int ln = strlen(*str);
833 if (ln > 1 && (*str)[ln - 1] == q && (q == '"' || q == '\''))
838 p = nasm_malloc(ln + 3);
841 p[ln + 1] = p[0] = q;
846 char *nasm_strcat(char *one, char *two)
849 int l1 = strlen(one);
850 rslt = nasm_malloc(l1 + strlen(two) + 1);
852 strcpy(rslt + l1, two);
856 void null_debug_init(struct ofmt *of, void *id, FILE * fp, efunc error)
863 void null_debug_linenum(const char *filename, int32_t linenumber, int32_t segto)
869 void null_debug_deflabel(char *name, int32_t segment, int32_t offset,
870 int is_global, char *special)
878 void null_debug_routine(const char *directive, const char *params)
883 void null_debug_typevalue(int32_t type)
887 void null_debug_output(int type, void *param)
892 void null_debug_cleanup(void)
896 struct dfmt null_debug_form = {
903 null_debug_typevalue,
908 struct dfmt *null_debug_arr[2] = { &null_debug_form, NULL };