1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/* SPDX-License-Identifier: BSD-2-Clause */
/* Copyright 1996-2019 The NASM Authors - All Rights Reserved */
/*
* nasmlib.c library routines for the Netwide Assembler
*/
#include "compiler.h"
#include "nasmlib.h"
#include "error.h"
#include "alloc.h"
size_t _nasm_last_string_size;
fatal_func nasm_alloc_failed(void)
{
nasm_critical("out of memory!");
}
void *nasm_malloc(size_t size)
{
void *p;
again:
p = malloc(size);
if (unlikely(!p)) {
if (!size) {
size = 1;
goto again;
}
nasm_alloc_failed();
}
return p;
}
void *nasm_calloc(size_t nelem, size_t size)
{
void *p;
again:
p = calloc(nelem, size);
if (unlikely(!p)) {
if (!nelem || !size) {
nelem = size = 1;
goto again;
}
nasm_alloc_failed();
}
return p;
}
void *nasm_zalloc(size_t size)
{
return nasm_calloc(size, 1);
}
/*
* Unlike the system realloc, we do *not* allow size == 0 to be
* the equivalent to free(); we guarantee returning a non-NULL pointer.
*
* The check for calling malloc() is theoretically redundant, but be
* paranoid about the system library...
*/
void *nasm_realloc(void *q, size_t size)
{
if (unlikely(!size))
size = 1;
q = q ? realloc(q, size) : malloc(size);
return validate_ptr(q);
}
void nasm_free(void *q)
{
if (q){
free(q);
q = NULL;
}
}
char *nasm_strdup(const char *s)
{
char *p;
const size_t size = strlen(s) + 1;
_nasm_last_string_size = size;
p = nasm_malloc(size);
return memcpy(p, s, size);
}
char *nasm_strndup(const char *s, size_t len)
{
char *p;
len = strnlen(s, len);
_nasm_last_string_size = len + 1;
p = nasm_malloc(len+1);
p[len] = '\0';
return memcpy(p, s, len);
}
char *nasm_strcat(const char *one, const char *two)
{
char *rslt;
const size_t l1 = strlen(one);
const size_t s2 = strlen(two) + 1;
_nasm_last_string_size = l1 + s2;
rslt = nasm_malloc(l1 + s2);
memcpy(rslt, one, l1);
memcpy(rslt + l1, two, s2);
return rslt;
}
char *nasm_strcatn(const char *str1, ...)
{
va_list ap;
char *rslt; /* Output buffer */
size_t s; /* Total buffer size */
size_t n; /* Number of arguments */
size_t *ltbl; /* Table of lengths */
size_t l, *lp; /* Length for current argument */
const char *p; /* Currently examined argument */
char *q; /* Output pointer */
n = 0; /* No strings encountered yet */
p = str1;
va_start(ap, str1);
while (p) {
n++;
p = va_arg(ap, const char *);
}
va_end(ap);
ltbl = nasm_malloc(n * sizeof(size_t));
s = 1; /* Space for final NULL */
p = str1;
lp = ltbl;
va_start(ap, str1);
while (p) {
*lp++ = l = strlen(p);
s += l;
p = va_arg(ap, const char *);
}
va_end(ap);
_nasm_last_string_size = s;
q = rslt = nasm_malloc(s);
p = str1;
lp = ltbl;
va_start(ap, str1);
while (p) {
l = *lp++;
memcpy(q, p, l);
q += l;
p = va_arg(ap, const char *);
}
va_end(ap);
*q = '\0';
nasm_free(ltbl);
return rslt;
}
|
