blob: ccbc0c75c361f57f24e1528c9d2c5f0ebbe2b033 [file] [log] [blame]
H. Peter Anvin22538e22016-05-25 05:42:47 -07001/* ----------------------------------------------------------------------- *
H. Peter Anvin740ec352018-05-30 11:40:42 -07002 *
3 * Copyright 1996-2018 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"
39
40#include <stdlib.h>
41
42#include "nasmlib.h"
H. Peter Anvinb20bc732017-03-07 19:23:03 -080043#include "error.h"
H. Peter Anvin22538e22016-05-25 05:42:47 -070044
H. Peter Anvin740ec352018-05-30 11:40:42 -070045static no_return nasm_alloc_failed(void)
46{
47 nasm_fatal(0, "out of memory");
48}
49
50static inline void *validate_ptr(void *p)
51{
52 if (unlikely(!p))
53 nasm_alloc_failed();
54 return p;
55}
56
H. Peter Anvin22538e22016-05-25 05:42:47 -070057void *nasm_malloc(size_t size)
58{
H. Peter Anvin740ec352018-05-30 11:40:42 -070059 return validate_ptr(malloc(size));
H. Peter Anvin22538e22016-05-25 05:42:47 -070060}
61
62void *nasm_calloc(size_t size, size_t nelem)
63{
H. Peter Anvin740ec352018-05-30 11:40:42 -070064 return validate_ptr(calloc(size, nelem));
H. Peter Anvin22538e22016-05-25 05:42:47 -070065}
66
67void *nasm_zalloc(size_t size)
68{
H. Peter Anvin740ec352018-05-30 11:40:42 -070069 return validate_ptr(calloc(1, size));
H. Peter Anvin22538e22016-05-25 05:42:47 -070070}
71
72void *nasm_realloc(void *q, size_t size)
73{
H. Peter Anvin740ec352018-05-30 11:40:42 -070074 return validate_ptr(q ? realloc(q, size) : malloc(size));
H. Peter Anvin22538e22016-05-25 05:42:47 -070075}
76
77void nasm_free(void *q)
78{
79 if (q)
80 free(q);
81}
82
83char *nasm_strdup(const char *s)
84{
85 char *p;
86 size_t size = strlen(s) + 1;
87
88 p = nasm_malloc(size);
89 return memcpy(p, s, size);
90}
91
92char *nasm_strndup(const char *s, size_t len)
93{
94 char *p;
95
96 len = strnlen(s, len);
97 p = nasm_malloc(len+1);
98 p[len] = '\0';
99 return memcpy(p, s, len);
100}
101
102char *nasm_strcat(const char *one, const char *two)
103{
104 char *rslt;
105 size_t l1 = strlen(one);
106 size_t l2 = strlen(two);
107 rslt = nasm_malloc(l1 + l2 + 1);
108 memcpy(rslt, one, l1);
109 memcpy(rslt + l1, two, l2+1);
110 return rslt;
111}
H. Peter Anvin740ec352018-05-30 11:40:42 -0700112
113char *nasm_strcatn(const char *str1, ...)
114{
115 va_list ap;
116 char *rslt; /* Output buffer */
117 size_t s; /* Total buffer size */
118 size_t n; /* Number of arguments */
119 size_t *ltbl; /* Table of lengths */
120 size_t l, *lp; /* Length for current argument */
121 const char *p; /* Currently examined argument */
122 char *q; /* Output pointer */
123
124 n = 0; /* No strings encountered yet */
125 p = str1;
126 va_start(ap, str1);
127 while (p) {
128 n++;
129 p = va_arg(ap, const char *);
130 }
131 va_end(ap);
132
133 ltbl = nasm_malloc(n * sizeof(size_t));
134
135 s = 1; /* Space for final NULL */
136 p = str1;
137 lp = ltbl;
138 va_start(ap, str1);
139 while (p) {
140 *lp++ = l = strlen(p);
141 s += l;
142 p = va_arg(ap, const char *);
143 }
144 va_end(ap);
145
146 q = rslt = nasm_malloc(s);
147
148 p = str1;
149 lp = ltbl;
150 va_start(ap, str1);
151 while (p) {
152 l = *lp++;
153 memcpy(q, p, l);
154 q += l;
155 p = va_arg(ap, const char *);
156 }
157 va_end(ap);
158 *q = '\0';
159
160 nasm_free(ltbl);
161
162 return rslt;
163}