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) == '$' || (c) == '_')
197 #define numvalue(c) ((c)>='a' ? (c)-'a'+10 : (c)>='A' ? (c)-'A'+10 : (c)-'0')
199 static int radix_letter(char c)
204 return 2; /* Binary */
207 return 8; /* Octal */
210 return 16; /* Hexadecimal */
213 return 10; /* Decimal */
215 return 0; /* Not a known radix letter */
219 int64_t readnum(char *str, bool *error)
223 uint64_t result, checklimit;
231 r++; /* find start of number */
234 * If the number came from make_tok_num (as a result of an %assign), it
235 * might have a '-' built into it (rather than in a preceeding token).
244 while (lib_isnumchar(*q))
245 q++; /* find end of number */
248 * Handle radix formats:
250 * 0<radix-letter><string>
251 * $<string> (hexadecimal)
252 * <string><radix-letter>
254 if (*r == '0' && (radix = radix_letter(r[1])))
258 else if ((radix = radix_letter(q[-1])) != 0)
264 * If this number has been found for us by something other than
265 * the ordinary scanners, then it might be malformed by having
266 * nothing between the prefix and the suffix. Check this case
275 * `checklimit' must be 2**(32|64) / radix. We can't do that in
276 * 32/64-bit arithmetic, which we're (probably) using, so we
277 * cheat: since we know that all radices we use are even, we
278 * can divide 2**(31|63) by radix/2 instead.
280 if (globalbits == 64)
281 checklimit = 0x8000000000000000ULL / (radix >> 1);
283 checklimit = 0x80000000UL / (radix >> 1);
286 * Calculate the highest allowable value for the last digit of a
287 * 32-bit constant... in radix 10, it is 6, otherwise it is 0
289 last = (radix == 10 ? 6 : 0);
292 while (*r && r < q) {
294 if (*r < '0' || (*r > '9' && *r < 'A')
295 || (digit = numvalue(*r)) >= radix) {
299 if (result > checklimit ||
300 (result == checklimit && digit >= last)) {
304 result = radix * result + digit;
310 nasm_malloc_error(ERR_WARNING | ERR_PASS1 | ERR_WARN_NOV,
311 "numeric constant %s does not fit in 32 bits",
314 return result * sign;
317 int64_t readstrnum(char *str, int length, bool *warn)
319 int64_t charconst = 0;
325 if (globalbits == 64) {
326 for (i = 0; i < length; i++) {
327 if (charconst & 0xFF00000000000000ULL)
329 charconst = (charconst << 8) + (uint8_t)*--str;
332 for (i = 0; i < length; i++) {
333 if (charconst & 0xFF000000UL)
335 charconst = (charconst << 8) + (uint8_t)*--str;
341 static int32_t next_seg;
348 int32_t seg_alloc(void)
350 return (next_seg += 2) - 2;
353 void fwriteint16_t(int data, FILE * fp)
355 fputc((int)(data & 255), fp);
356 fputc((int)((data >> 8) & 255), fp);
359 void fwriteint32_t(int32_t data, FILE * fp)
361 fputc((int)(data & 255), fp);
362 fputc((int)((data >> 8) & 255), fp);
363 fputc((int)((data >> 16) & 255), fp);
364 fputc((int)((data >> 24) & 255), fp);
367 void fwriteint64_t(int64_t data, FILE * fp)
369 fputc((int)(data & 255), fp);
370 fputc((int)((data >> 8) & 255), fp);
371 fputc((int)((data >> 16) & 255), fp);
372 fputc((int)((data >> 24) & 255), fp);
373 fputc((int)((data >> 32) & 255), fp);
374 fputc((int)((data >> 40) & 255), fp);
375 fputc((int)((data >> 48) & 255), fp);
376 fputc((int)((data >> 56) & 255), fp);
379 void standard_extension(char *inname, char *outname, char *extension,
384 if (*outname) /* file name already exists, */
385 return; /* so do nothing */
389 *p++ = *q++; /* copy, and find end of string */
390 *p = '\0'; /* terminate it */
391 while (p > outname && *--p != '.') ; /* find final period (or whatever) */
394 p++; /* go back to end if none found */
395 if (!strcmp(p, extension)) { /* is the extension already there? */
397 error(ERR_WARNING | ERR_NOFILE,
398 "file name already ends in `%s': "
399 "output will be in `nasm.out'", extension);
401 error(ERR_WARNING | ERR_NOFILE,
402 "file name already has no extension: "
403 "output will be in `nasm.out'");
404 strcpy(outname, "nasm.out");
406 strcpy(p, extension);
409 #define LEAFSIZ (sizeof(RAA)-sizeof(RAA_UNION)+sizeof(RAA_LEAF))
410 #define BRANCHSIZ (sizeof(RAA)-sizeof(RAA_UNION)+sizeof(RAA_BRANCH))
412 #define LAYERSIZ(r) ( (r)->layers==0 ? RAA_BLKSIZE : RAA_LAYERSIZE )
414 static struct RAA *real_raa_init(int layers)
420 r = nasm_zalloc(LEAFSIZ);
423 r = nasm_malloc(BRANCHSIZ);
425 for (i = 0; i < RAA_LAYERSIZE; i++)
426 r->u.b.data[i] = NULL;
427 r->stepsize = RAA_BLKSIZE;
429 r->stepsize *= RAA_LAYERSIZE;
434 struct RAA *raa_init(void)
436 return real_raa_init(0);
439 void raa_free(struct RAA *r)
445 for (p = r->u.b.data; p - r->u.b.data < RAA_LAYERSIZE; p++)
451 int32_t raa_read(struct RAA *r, int32_t posn)
453 if (posn >= r->stepsize * LAYERSIZ(r))
454 return 0; /* Return 0 for undefined entries */
455 while (r->layers > 0) {
457 l = ldiv(posn, r->stepsize);
458 r = r->u.b.data[l.quot];
461 return 0; /* Return 0 for undefined entries */
463 return r->u.l.data[posn];
466 struct RAA *raa_write(struct RAA *r, int32_t posn, int32_t value)
471 nasm_malloc_error(ERR_PANIC, "negative position in raa_write");
473 while (r->stepsize * LAYERSIZ(r) <= posn) {
480 s = nasm_malloc(BRANCHSIZ);
481 for (i = 0; i < RAA_LAYERSIZE; i++)
482 s->u.b.data[i] = NULL;
483 s->layers = r->layers + 1;
484 s->stepsize = LAYERSIZ(r) * r->stepsize;
491 while (r->layers > 0) {
494 l = ldiv(posn, r->stepsize);
495 s = &r->u.b.data[l.quot];
497 *s = real_raa_init(r->layers - 1);
502 r->u.l.data[posn] = value;
507 /* Aggregate SAA components smaller than this */
508 #define SAA_BLKLEN 65536
510 struct SAA *saa_init(size_t elem_len)
515 s = nasm_zalloc(sizeof(struct SAA));
517 if (elem_len >= SAA_BLKLEN)
518 s->blk_len = elem_len;
520 s->blk_len = SAA_BLKLEN - (SAA_BLKLEN % elem_len);
522 s->elem_len = elem_len;
523 s->length = s->blk_len;
524 data = nasm_malloc(s->blk_len);
525 s->nblkptrs = s->nblks = 1;
526 s->blk_ptrs = nasm_malloc(sizeof(char *));
527 s->blk_ptrs[0] = data;
528 s->wblk = s->rblk = &s->blk_ptrs[0];
533 void saa_free(struct SAA *s)
538 for (p = s->blk_ptrs, n = s->nblks; n; p++, n--)
541 nasm_free(s->blk_ptrs);
545 /* Add one allocation block to an SAA */
546 static void saa_extend(struct SAA *s)
548 size_t blkn = s->nblks++;
550 if (blkn >= s->nblkptrs) {
551 size_t rindex = s->rblk - s->blk_ptrs;
552 size_t windex = s->wblk - s->blk_ptrs;
555 s->blk_ptrs = nasm_realloc(s->blk_ptrs, s->nblkptrs*sizeof(char *));
557 s->rblk = s->blk_ptrs + rindex;
558 s->wblk = s->blk_ptrs + windex;
561 s->blk_ptrs[blkn] = nasm_malloc(s->blk_len);
562 s->length += s->blk_len;
565 void *saa_wstruct(struct SAA *s)
569 if (s->wpos % s->elem_len)
570 nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
571 "misaligned wpos in saa_wstruct");
573 if (s->wpos + s->elem_len > s->blk_len) {
574 if (s->wpos != s->blk_len)
575 nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
576 "unfilled block in saa_wstruct");
578 if (s->wptr + s->elem_len > s->length)
584 p = *s->wblk + s->wpos;
585 s->wpos += s->elem_len;
586 s->wptr += s->elem_len;
588 if (s->wptr > s->datalen)
589 s->datalen = s->wptr;
594 void saa_wbytes(struct SAA *s, const void *data, size_t len)
596 const char *d = data;
599 size_t l = s->blk_len - s->wpos;
604 memcpy(*s->wblk + s->wpos, d, l);
607 memset(*s->wblk + s->wpos, 0, l);
612 if (s->datalen < s->wptr)
613 s->datalen = s->wptr;
616 if (s->wptr >= s->length)
624 void saa_rewind(struct SAA *s)
626 s->rblk = s->blk_ptrs;
627 s->rpos = s->rptr = 0;
630 void *saa_rstruct(struct SAA *s)
634 if (s->rptr + s->elem_len > s->datalen)
637 if (s->rpos % s->elem_len)
638 nasm_malloc_error(ERR_PANIC|ERR_NOFILE,
639 "misaligned rpos in saa_rstruct");
641 if (s->rpos + s->elem_len > s->blk_len) {
646 p = *s->rblk + s->rpos;
647 s->rpos += s->elem_len;
648 s->rptr += s->elem_len;
653 const void *saa_rbytes(struct SAA *s, size_t *lenp)
658 if (s->rptr >= s->datalen) {
663 if (s->rpos >= s->blk_len) {
669 if (len > s->datalen - s->rptr)
670 len = s->datalen - s->rptr;
671 if (len > s->blk_len - s->rpos)
672 len = s->blk_len - s->rpos;
675 p = *s->rblk + s->rpos;
683 void saa_rnbytes(struct SAA *s, void *data, size_t len)
687 if (s->rptr + len > s->datalen) {
688 nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_rnbytes");
697 p = saa_rbytes(s, &l);
705 /* Same as saa_rnbytes, except position the counter first */
706 void saa_fread(struct SAA *s, size_t posn, void *data, size_t len)
710 if (posn+len > s->datalen) {
711 nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_fread");
715 ix = posn / s->blk_len;
717 s->rpos = posn % s->blk_len;
718 s->rblk = &s->blk_ptrs[ix];
720 saa_rnbytes(s, data, len);
723 /* Same as saa_wbytes, except position the counter first */
724 void saa_fwrite(struct SAA *s, size_t posn, const void *data, size_t len)
728 if (posn > s->datalen) {
729 /* Seek beyond the end of the existing array not supported */
730 nasm_malloc_error(ERR_PANIC|ERR_NOFILE, "overrun in saa_fwrite");
734 ix = posn / s->blk_len;
736 s->wpos = posn % s->blk_len;
737 s->wblk = &s->blk_ptrs[ix];
740 s->wpos = s->blk_len;
744 saa_wbytes(s, data, len);
747 void saa_fpwrite(struct SAA *s, FILE * fp)
753 while (len = s->datalen, (data = saa_rbytes(s, &len)) != NULL)
754 fwrite(data, 1, len, fp);
758 * Common list of prefix names
760 static const char *prefix_names[] = {
761 "a16", "a32", "lock", "o16", "o32", "rep", "repe", "repne",
762 "repnz", "repz", "times"
765 const char *prefix_name(int token)
767 unsigned int prefix = token-PREFIX_ENUM_START;
768 if (prefix > sizeof prefix_names / sizeof(const char *))
771 return prefix_names[prefix];
777 int bsi(char *string, const char **array, int size)
779 int i = -1, j = size; /* always, i < index < j */
782 int l = strcmp(string, array[k]);
783 if (l < 0) /* it's in the first half */
785 else if (l > 0) /* it's in the second half */
787 else /* we've got it :) */
790 return -1; /* we haven't got it :( */
793 int bsii(char *string, const char **array, int size)
795 int i = -1, j = size; /* always, i < index < j */
798 int l = nasm_stricmp(string, array[k]);
799 if (l < 0) /* it's in the first half */
801 else if (l > 0) /* it's in the second half */
803 else /* we've got it :) */
806 return -1; /* we haven't got it :( */
809 static char *file_name = NULL;
810 static int32_t line_number = 0;
812 char *src_set_fname(char *newname)
814 char *oldname = file_name;
819 int32_t src_set_linnum(int32_t newline)
821 int32_t oldline = line_number;
822 line_number = newline;
826 int32_t src_get_linnum(void)
831 int src_get(int32_t *xline, char **xname)
833 if (!file_name || !*xname || strcmp(*xname, file_name)) {
835 *xname = file_name ? nasm_strdup(file_name) : NULL;
836 *xline = line_number;
839 if (*xline != line_number) {
840 int32_t tmp = line_number - *xline;
841 *xline = line_number;
847 void nasm_quote(char **str)
849 int ln = strlen(*str);
852 if (ln > 1 && (*str)[ln - 1] == q && (q == '"' || q == '\''))
857 p = nasm_malloc(ln + 3);
860 p[ln + 1] = p[0] = q;
865 char *nasm_strcat(char *one, char *two)
868 int l1 = strlen(one);
869 rslt = nasm_malloc(l1 + strlen(two) + 1);
871 strcpy(rslt + l1, two);
875 void null_debug_init(struct ofmt *of, void *id, FILE * fp, efunc error)
882 void null_debug_linenum(const char *filename, int32_t linenumber, int32_t segto)
888 void null_debug_deflabel(char *name, int32_t segment, int32_t offset,
889 int is_global, char *special)
897 void null_debug_routine(const char *directive, const char *params)
902 void null_debug_typevalue(int32_t type)
906 void null_debug_output(int type, void *param)
911 void null_debug_cleanup(void)
915 struct dfmt null_debug_form = {
922 null_debug_typevalue,
927 struct dfmt *null_debug_arr[2] = { &null_debug_form, NULL };