blob: b0d623a201776052b1f696247ab4331bfbe4d6f3 [file] [log] [blame]
H. Peter Anvin22538e22016-05-25 05:42:47 -07001/* ----------------------------------------------------------------------- *
H. Peter Anvin740ec352018-05-30 11:40:42 -07002 *
H. Peter Anvin (Intel)5bb35772019-08-16 00:29:04 -07003 * Copyright 1996-2019 The NASM Authors - All Rights Reserved
H. Peter Anvin22538e22016-05-25 05:42:47 -07004 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
9 * conditions are met:
10 *
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.
H. Peter Anvin740ec352018-05-30 11:40:42 -070017 *
H. Peter Anvin22538e22016-05-25 05:42:47 -070018 * 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.
31 *
32 * ----------------------------------------------------------------------- */
33
34/*
35 * nasmlib.c library routines for the Netwide Assembler
36 */
37
38#include "compiler.h"
H. Peter Anvin22538e22016-05-25 05:42:47 -070039#include "nasmlib.h"
H. Peter Anvinb20bc732017-03-07 19:23:03 -080040#include "error.h"
H. Peter Anvin (Intel)eb5b3ae2018-12-12 14:34:34 -080041#include "alloc.h"
H. Peter Anvin22538e22016-05-25 05:42:47 -070042
H. Peter Anvin (Intel)1c21a532019-08-09 02:34:21 -070043size_t _nasm_last_string_size;
44
H. Peter Anvin (Intel)eb5b3ae2018-12-12 14:34:34 -080045no_return nasm_alloc_failed(void)
H. Peter Anvin740ec352018-05-30 11:40:42 -070046{
H. Peter Anvin (Intel)3b91f4c2018-12-13 13:55:25 -080047 /* If nasm_fatal() gets us back here, then croak hard */
48 static bool already_here = false;
49 FILE *errfile;
50
51 if (likely(!already_here)) {
52 already_here = true;
H. Peter Anvin (Intel)df2195b2018-12-13 16:43:43 -080053 nasm_fatal("out of memory!");
H. Peter Anvin (Intel)3b91f4c2018-12-13 13:55:25 -080054 }
55
56 errfile = error_file;
57 if (!errfile)
58 error_file = stderr;
59
60 fprintf(error_file, "nasm: out of memory!\n");
61 fflush(error_file);
62 fflush(NULL);
63 abort();
H. Peter Anvin740ec352018-05-30 11:40:42 -070064}
65
H. Peter Anvin22538e22016-05-25 05:42:47 -070066void *nasm_malloc(size_t size)
67{
H. Peter Anvin (Intel)5bb35772019-08-16 00:29:04 -070068 void *p;
69
70again:
71 p = malloc(size);
72
73 if (unlikely(!p)) {
74 if (!size) {
75 size = 1;
76 goto again;
77 }
78 nasm_alloc_failed();
79 }
80 return p;
H. Peter Anvin22538e22016-05-25 05:42:47 -070081}
82
H. Peter Anvin (Intel)5bb35772019-08-16 00:29:04 -070083void *nasm_calloc(size_t nelem, size_t size)
H. Peter Anvin22538e22016-05-25 05:42:47 -070084{
H. Peter Anvin (Intel)5bb35772019-08-16 00:29:04 -070085 void *p;
86
87again:
88 p = calloc(nelem, size);
89
90 if (unlikely(!p)) {
91 if (!nelem || !size) {
92 nelem = size = 1;
93 goto again;
94 }
95 nasm_alloc_failed();
96 }
97
98 return p;
H. Peter Anvin22538e22016-05-25 05:42:47 -070099}
100
101void *nasm_zalloc(size_t size)
102{
H. Peter Anvin (Intel)5bb35772019-08-16 00:29:04 -0700103 return nasm_calloc(size, 1);
H. Peter Anvin22538e22016-05-25 05:42:47 -0700104}
105
H. Peter Anvin (Intel)5bb35772019-08-16 00:29:04 -0700106/*
107 * Unlike the system realloc, we do *not* allow size == 0 to be
108 * the equivalent to free(); we guarantee returning a non-NULL pointer.
109 *
110 * The check for calling malloc() is theoretically redundant, but be
111 * paranoid about the system library...
112 */
H. Peter Anvin22538e22016-05-25 05:42:47 -0700113void *nasm_realloc(void *q, size_t size)
114{
H. Peter Anvin (Intel)5bb35772019-08-16 00:29:04 -0700115 if (unlikely(!size))
116 size = 1;
117 q = q ? realloc(q, size) : malloc(size);
118 return validate_ptr(q);
H. Peter Anvin22538e22016-05-25 05:42:47 -0700119}
120
121void nasm_free(void *q)
122{
123 if (q)
124 free(q);
125}
126
127char *nasm_strdup(const char *s)
128{
129 char *p;
H. Peter Anvin (Intel)1c21a532019-08-09 02:34:21 -0700130 const size_t size = strlen(s) + 1;
H. Peter Anvin22538e22016-05-25 05:42:47 -0700131
H. Peter Anvin (Intel)1c21a532019-08-09 02:34:21 -0700132 _nasm_last_string_size = size;
H. Peter Anvin22538e22016-05-25 05:42:47 -0700133 p = nasm_malloc(size);
134 return memcpy(p, s, size);
135}
136
137char *nasm_strndup(const char *s, size_t len)
138{
139 char *p;
140
141 len = strnlen(s, len);
H. Peter Anvin (Intel)1c21a532019-08-09 02:34:21 -0700142 _nasm_last_string_size = len + 1;
H. Peter Anvin22538e22016-05-25 05:42:47 -0700143 p = nasm_malloc(len+1);
144 p[len] = '\0';
145 return memcpy(p, s, len);
146}
147
148char *nasm_strcat(const char *one, const char *two)
149{
150 char *rslt;
H. Peter Anvin (Intel)1c21a532019-08-09 02:34:21 -0700151 const size_t l1 = strlen(one);
152 const size_t s2 = strlen(two) + 1;
153
154 _nasm_last_string_size = l1 + s2;
155 rslt = nasm_malloc(l1 + s2);
H. Peter Anvin22538e22016-05-25 05:42:47 -0700156 memcpy(rslt, one, l1);
H. Peter Anvin (Intel)1c21a532019-08-09 02:34:21 -0700157 memcpy(rslt + l1, two, s2);
H. Peter Anvin22538e22016-05-25 05:42:47 -0700158 return rslt;
159}
H. Peter Anvin740ec352018-05-30 11:40:42 -0700160
161char *nasm_strcatn(const char *str1, ...)
162{
163 va_list ap;
164 char *rslt; /* Output buffer */
165 size_t s; /* Total buffer size */
166 size_t n; /* Number of arguments */
167 size_t *ltbl; /* Table of lengths */
168 size_t l, *lp; /* Length for current argument */
169 const char *p; /* Currently examined argument */
170 char *q; /* Output pointer */
171
172 n = 0; /* No strings encountered yet */
173 p = str1;
174 va_start(ap, str1);
175 while (p) {
176 n++;
177 p = va_arg(ap, const char *);
178 }
179 va_end(ap);
180
181 ltbl = nasm_malloc(n * sizeof(size_t));
182
183 s = 1; /* Space for final NULL */
184 p = str1;
185 lp = ltbl;
186 va_start(ap, str1);
187 while (p) {
188 *lp++ = l = strlen(p);
189 s += l;
190 p = va_arg(ap, const char *);
191 }
192 va_end(ap);
193
H. Peter Anvin (Intel)1c21a532019-08-09 02:34:21 -0700194 _nasm_last_string_size = s;
195
H. Peter Anvin740ec352018-05-30 11:40:42 -0700196 q = rslt = nasm_malloc(s);
197
198 p = str1;
199 lp = ltbl;
200 va_start(ap, str1);
201 while (p) {
202 l = *lp++;
203 memcpy(q, p, l);
204 q += l;
205 p = va_arg(ap, const char *);
206 }
207 va_end(ap);
208 *q = '\0';
209
210 nasm_free(ltbl);
211
212 return rslt;
213}