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
)
222 int32_t pradix
, sradix
, radix
;
224 uint64_t result
, checklimit
;
232 r
++; /* find start of number */
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).
245 while (lib_isnumchar(*q
))
246 q
++; /* find end of number */
249 * Handle radix formats:
251 * 0<radix-letter><string>
252 * $<string> (hexadecimal)
253 * <string><radix-letter>
258 if (*r
== '0' && (pradix
= radix_letter(r
[1])) != 0)
261 pradix
= 16, plen
= 1;
263 if ((sradix
= radix_letter(q
[-1])) != 0)
266 if (pradix
> sradix
) {
269 } else if (sradix
> pradix
) {
273 /* Either decimal, or invalid -- if invalid, we'll trip up
279 * If this number has been found for us by something other than
280 * the ordinary scanners, then it might be malformed by having
281 * nothing between the prefix and the suffix. Check this case
290 * `checklimit' must be 2**(32|64) / radix. We can't do that in
291 * 32/64-bit arithmetic, which we're (probably) using, so we
292 * cheat: since we know that all radices we use are even, we
293 * can divide 2**(31|63) by radix/2 instead.
295 if (globalbits
== 64)
296 checklimit
= 0x8000000000000000ULL
/ (radix
>> 1);
298 checklimit
= 0x80000000UL
/ (radix
>> 1);
301 * Calculate the highest allowable value for the last digit of a
302 * 32-bit constant... in radix 10, it is 6, otherwise it is 0
304 last
= (radix
== 10 ? 6 : 0);
307 while (*r
&& r
< q
) {
309 if (*r
< '0' || (*r
> '9' && *r
< 'A')
310 || (digit
= numvalue(*r
)) >= radix
) {
314 if (result
> checklimit
||
315 (result
== checklimit
&& digit
>= last
)) {
319 result
= radix
* result
+ digit
;
325 nasm_malloc_error(ERR_WARNING
| ERR_PASS1
| ERR_WARN_NOV
,
326 "numeric constant %s does not fit in 32 bits",
329 return result
* sign
;
332 int64_t readstrnum(char *str
, int length
, bool *warn
)
334 int64_t charconst
= 0;
340 if (globalbits
== 64) {
341 for (i
= 0; i
< length
; i
++) {
342 if (charconst
& 0xFF00000000000000ULL
)
344 charconst
= (charconst
<< 8) + (uint8_t)*--str
;
347 for (i
= 0; i
< length
; i
++) {
348 if (charconst
& 0xFF000000UL
)
350 charconst
= (charconst
<< 8) + (uint8_t)*--str
;
356 static int32_t next_seg
;
363 int32_t seg_alloc(void)
365 return (next_seg
+= 2) - 2;
368 void fwriteint16_t(int data
, FILE * fp
)
370 fputc((int)(data
& 255), fp
);
371 fputc((int)((data
>> 8) & 255), fp
);
374 void fwriteint32_t(int32_t data
, FILE * fp
)
376 fputc((int)(data
& 255), fp
);
377 fputc((int)((data
>> 8) & 255), fp
);
378 fputc((int)((data
>> 16) & 255), fp
);
379 fputc((int)((data
>> 24) & 255), fp
);
382 void fwriteint64_t(int64_t data
, FILE * fp
)
384 fputc((int)(data
& 255), fp
);
385 fputc((int)((data
>> 8) & 255), fp
);
386 fputc((int)((data
>> 16) & 255), fp
);
387 fputc((int)((data
>> 24) & 255), fp
);
388 fputc((int)((data
>> 32) & 255), fp
);
389 fputc((int)((data
>> 40) & 255), fp
);
390 fputc((int)((data
>> 48) & 255), fp
);
391 fputc((int)((data
>> 56) & 255), fp
);
394 void standard_extension(char *inname
, char *outname
, char *extension
,
399 if (*outname
) /* file name already exists, */
400 return; /* so do nothing */
404 *p
++ = *q
++; /* copy, and find end of string */
405 *p
= '\0'; /* terminate it */
406 while (p
> outname
&& *--p
!= '.') ; /* find final period (or whatever) */
409 p
++; /* go back to end if none found */
410 if (!strcmp(p
, extension
)) { /* is the extension already there? */
412 error(ERR_WARNING
| ERR_NOFILE
,
413 "file name already ends in `%s': "
414 "output will be in `nasm.out'", extension
);
416 error(ERR_WARNING
| ERR_NOFILE
,
417 "file name already has no extension: "
418 "output will be in `nasm.out'");
419 strcpy(outname
, "nasm.out");
421 strcpy(p
, extension
);
424 #define LEAFSIZ (sizeof(RAA)-sizeof(RAA_UNION)+sizeof(RAA_LEAF))
425 #define BRANCHSIZ (sizeof(RAA)-sizeof(RAA_UNION)+sizeof(RAA_BRANCH))
427 #define LAYERSIZ(r) ( (r)->layers==0 ? RAA_BLKSIZE : RAA_LAYERSIZE )
429 static struct RAA
*real_raa_init(int layers
)
435 r
= nasm_zalloc(LEAFSIZ
);
438 r
= nasm_malloc(BRANCHSIZ
);
440 for (i
= 0; i
< RAA_LAYERSIZE
; i
++)
441 r
->u
.b
.data
[i
] = NULL
;
442 r
->stepsize
= RAA_BLKSIZE
;
444 r
->stepsize
*= RAA_LAYERSIZE
;
449 struct RAA
*raa_init(void)
451 return real_raa_init(0);
454 void raa_free(struct RAA
*r
)
460 for (p
= r
->u
.b
.data
; p
- r
->u
.b
.data
< RAA_LAYERSIZE
; p
++)
466 int32_t raa_read(struct RAA
*r
, int32_t posn
)
468 if (posn
>= r
->stepsize
* LAYERSIZ(r
))
469 return 0; /* Return 0 for undefined entries */
470 while (r
->layers
> 0) {
472 l
= ldiv(posn
, r
->stepsize
);
473 r
= r
->u
.b
.data
[l
.quot
];
476 return 0; /* Return 0 for undefined entries */
478 return r
->u
.l
.data
[posn
];
481 struct RAA
*raa_write(struct RAA
*r
, int32_t posn
, int32_t value
)
486 nasm_malloc_error(ERR_PANIC
, "negative position in raa_write");
488 while (r
->stepsize
* LAYERSIZ(r
) <= posn
) {
495 s
= nasm_malloc(BRANCHSIZ
);
496 for (i
= 0; i
< RAA_LAYERSIZE
; i
++)
497 s
->u
.b
.data
[i
] = NULL
;
498 s
->layers
= r
->layers
+ 1;
499 s
->stepsize
= LAYERSIZ(r
) * r
->stepsize
;
506 while (r
->layers
> 0) {
509 l
= ldiv(posn
, r
->stepsize
);
510 s
= &r
->u
.b
.data
[l
.quot
];
512 *s
= real_raa_init(r
->layers
- 1);
517 r
->u
.l
.data
[posn
] = value
;
522 /* Aggregate SAA components smaller than this */
523 #define SAA_BLKLEN 65536
525 struct SAA
*saa_init(size_t elem_len
)
530 s
= nasm_zalloc(sizeof(struct SAA
));
532 if (elem_len
>= SAA_BLKLEN
)
533 s
->blk_len
= elem_len
;
535 s
->blk_len
= SAA_BLKLEN
- (SAA_BLKLEN
% elem_len
);
537 s
->elem_len
= elem_len
;
538 s
->length
= s
->blk_len
;
539 data
= nasm_malloc(s
->blk_len
);
540 s
->nblkptrs
= s
->nblks
= 1;
541 s
->blk_ptrs
= nasm_malloc(sizeof(char *));
542 s
->blk_ptrs
[0] = data
;
543 s
->wblk
= s
->rblk
= &s
->blk_ptrs
[0];
548 void saa_free(struct SAA
*s
)
553 for (p
= s
->blk_ptrs
, n
= s
->nblks
; n
; p
++, n
--)
556 nasm_free(s
->blk_ptrs
);
560 /* Add one allocation block to an SAA */
561 static void saa_extend(struct SAA
*s
)
563 size_t blkn
= s
->nblks
++;
565 if (blkn
>= s
->nblkptrs
) {
566 size_t rindex
= s
->rblk
- s
->blk_ptrs
;
567 size_t windex
= s
->wblk
- s
->blk_ptrs
;
570 s
->blk_ptrs
= nasm_realloc(s
->blk_ptrs
, s
->nblkptrs
*sizeof(char *));
572 s
->rblk
= s
->blk_ptrs
+ rindex
;
573 s
->wblk
= s
->blk_ptrs
+ windex
;
576 s
->blk_ptrs
[blkn
] = nasm_malloc(s
->blk_len
);
577 s
->length
+= s
->blk_len
;
580 void *saa_wstruct(struct SAA
*s
)
584 if (s
->wpos
% s
->elem_len
)
585 nasm_malloc_error(ERR_PANIC
|ERR_NOFILE
,
586 "misaligned wpos in saa_wstruct");
588 if (s
->wpos
+ s
->elem_len
> s
->blk_len
) {
589 if (s
->wpos
!= s
->blk_len
)
590 nasm_malloc_error(ERR_PANIC
|ERR_NOFILE
,
591 "unfilled block in saa_wstruct");
593 if (s
->wptr
+ s
->elem_len
> s
->length
)
599 p
= *s
->wblk
+ s
->wpos
;
600 s
->wpos
+= s
->elem_len
;
601 s
->wptr
+= s
->elem_len
;
603 if (s
->wptr
> s
->datalen
)
604 s
->datalen
= s
->wptr
;
609 void saa_wbytes(struct SAA
*s
, const void *data
, size_t len
)
611 const char *d
= data
;
614 size_t l
= s
->blk_len
- s
->wpos
;
619 memcpy(*s
->wblk
+ s
->wpos
, d
, l
);
622 memset(*s
->wblk
+ s
->wpos
, 0, l
);
627 if (s
->datalen
< s
->wptr
)
628 s
->datalen
= s
->wptr
;
631 if (s
->wptr
>= s
->length
)
639 void saa_rewind(struct SAA
*s
)
641 s
->rblk
= s
->blk_ptrs
;
642 s
->rpos
= s
->rptr
= 0;
645 void *saa_rstruct(struct SAA
*s
)
649 if (s
->rptr
+ s
->elem_len
> s
->datalen
)
652 if (s
->rpos
% s
->elem_len
)
653 nasm_malloc_error(ERR_PANIC
|ERR_NOFILE
,
654 "misaligned rpos in saa_rstruct");
656 if (s
->rpos
+ s
->elem_len
> s
->blk_len
) {
661 p
= *s
->rblk
+ s
->rpos
;
662 s
->rpos
+= s
->elem_len
;
663 s
->rptr
+= s
->elem_len
;
668 const void *saa_rbytes(struct SAA
*s
, size_t *lenp
)
673 if (s
->rptr
>= s
->datalen
) {
678 if (s
->rpos
>= s
->blk_len
) {
684 if (len
> s
->datalen
- s
->rptr
)
685 len
= s
->datalen
- s
->rptr
;
686 if (len
> s
->blk_len
- s
->rpos
)
687 len
= s
->blk_len
- s
->rpos
;
690 p
= *s
->rblk
+ s
->rpos
;
698 void saa_rnbytes(struct SAA
*s
, void *data
, size_t len
)
702 if (s
->rptr
+ len
> s
->datalen
) {
703 nasm_malloc_error(ERR_PANIC
|ERR_NOFILE
, "overrun in saa_rnbytes");
712 p
= saa_rbytes(s
, &l
);
720 /* Same as saa_rnbytes, except position the counter first */
721 void saa_fread(struct SAA
*s
, size_t posn
, void *data
, size_t len
)
725 if (posn
+len
> s
->datalen
) {
726 nasm_malloc_error(ERR_PANIC
|ERR_NOFILE
, "overrun in saa_fread");
730 ix
= posn
/ s
->blk_len
;
732 s
->rpos
= posn
% s
->blk_len
;
733 s
->rblk
= &s
->blk_ptrs
[ix
];
735 saa_rnbytes(s
, data
, len
);
738 /* Same as saa_wbytes, except position the counter first */
739 void saa_fwrite(struct SAA
*s
, size_t posn
, const void *data
, size_t len
)
743 if (posn
> s
->datalen
) {
744 /* Seek beyond the end of the existing array not supported */
745 nasm_malloc_error(ERR_PANIC
|ERR_NOFILE
, "overrun in saa_fwrite");
749 ix
= posn
/ s
->blk_len
;
751 s
->wpos
= posn
% s
->blk_len
;
752 s
->wblk
= &s
->blk_ptrs
[ix
];
755 s
->wpos
= s
->blk_len
;
759 saa_wbytes(s
, data
, len
);
762 void saa_fpwrite(struct SAA
*s
, FILE * fp
)
768 while (len
= s
->datalen
, (data
= saa_rbytes(s
, &len
)) != NULL
)
769 fwrite(data
, 1, len
, fp
);
773 * Common list of prefix names
775 static const char *prefix_names
[] = {
776 "a16", "a32", "lock", "o16", "o32", "rep", "repe", "repne",
777 "repnz", "repz", "times"
780 const char *prefix_name(int token
)
782 unsigned int prefix
= token
-PREFIX_ENUM_START
;
783 if (prefix
> sizeof prefix_names
/ sizeof(const char *))
786 return prefix_names
[prefix
];
792 int bsi(char *string
, const char **array
, int size
)
794 int i
= -1, j
= size
; /* always, i < index < j */
797 int l
= strcmp(string
, array
[k
]);
798 if (l
< 0) /* it's in the first half */
800 else if (l
> 0) /* it's in the second half */
802 else /* we've got it :) */
805 return -1; /* we haven't got it :( */
808 int bsii(char *string
, const char **array
, int size
)
810 int i
= -1, j
= size
; /* always, i < index < j */
813 int l
= nasm_stricmp(string
, array
[k
]);
814 if (l
< 0) /* it's in the first half */
816 else if (l
> 0) /* it's in the second half */
818 else /* we've got it :) */
821 return -1; /* we haven't got it :( */
824 static char *file_name
= NULL
;
825 static int32_t line_number
= 0;
827 char *src_set_fname(char *newname
)
829 char *oldname
= file_name
;
834 int32_t src_set_linnum(int32_t newline
)
836 int32_t oldline
= line_number
;
837 line_number
= newline
;
841 int32_t src_get_linnum(void)
846 int src_get(int32_t *xline
, char **xname
)
848 if (!file_name
|| !*xname
|| strcmp(*xname
, file_name
)) {
850 *xname
= file_name
? nasm_strdup(file_name
) : NULL
;
851 *xline
= line_number
;
854 if (*xline
!= line_number
) {
855 int32_t tmp
= line_number
- *xline
;
856 *xline
= line_number
;
862 void nasm_quote(char **str
)
864 int ln
= strlen(*str
);
867 if (ln
> 1 && (*str
)[ln
- 1] == q
&& (q
== '"' || q
== '\''))
872 p
= nasm_malloc(ln
+ 3);
875 p
[ln
+ 1] = p
[0] = q
;
880 char *nasm_strcat(char *one
, char *two
)
883 int l1
= strlen(one
);
884 rslt
= nasm_malloc(l1
+ strlen(two
) + 1);
886 strcpy(rslt
+ l1
, two
);
890 void null_debug_init(struct ofmt
*of
, void *id
, FILE * fp
, efunc error
)
897 void null_debug_linenum(const char *filename
, int32_t linenumber
, int32_t segto
)
903 void null_debug_deflabel(char *name
, int32_t segment
, int32_t offset
,
904 int is_global
, char *special
)
912 void null_debug_routine(const char *directive
, const char *params
)
917 void null_debug_typevalue(int32_t type
)
921 void null_debug_output(int type
, void *param
)
926 void null_debug_cleanup(void)
930 struct dfmt null_debug_form
= {
937 null_debug_typevalue
,
942 struct dfmt
*null_debug_arr
[2] = { &null_debug_form
, NULL
};