2016-05-25 20:42:47 +08:00
|
|
|
/* ----------------------------------------------------------------------- *
|
2018-05-31 02:40:42 +08:00
|
|
|
*
|
2019-08-16 15:29:04 +08:00
|
|
|
* Copyright 1996-2019 The NASM Authors - All Rights Reserved
|
2016-05-25 20:42:47 +08:00
|
|
|
* See the file AUTHORS included with the NASM distribution for
|
|
|
|
* the specific copyright holders.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following
|
|
|
|
* conditions are met:
|
|
|
|
*
|
|
|
|
* * Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* * Redistributions in binary form must reproduce the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer in the documentation and/or other materials provided
|
|
|
|
* with the distribution.
|
2018-05-31 02:40:42 +08:00
|
|
|
*
|
2016-05-25 20:42:47 +08:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
|
|
|
|
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
|
|
|
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
|
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
|
|
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
|
|
|
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* ----------------------------------------------------------------------- */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nasmlib.c library routines for the Netwide Assembler
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "compiler.h"
|
|
|
|
#include "nasmlib.h"
|
2017-03-08 11:23:03 +08:00
|
|
|
#include "error.h"
|
2018-12-13 06:34:34 +08:00
|
|
|
#include "alloc.h"
|
2016-05-25 20:42:47 +08:00
|
|
|
|
2019-08-09 17:34:21 +08:00
|
|
|
size_t _nasm_last_string_size;
|
|
|
|
|
2018-12-13 06:34:34 +08:00
|
|
|
no_return nasm_alloc_failed(void)
|
2018-05-31 02:40:42 +08:00
|
|
|
{
|
2018-12-14 05:55:25 +08:00
|
|
|
/* If nasm_fatal() gets us back here, then croak hard */
|
|
|
|
static bool already_here = false;
|
|
|
|
FILE *errfile;
|
|
|
|
|
|
|
|
if (likely(!already_here)) {
|
|
|
|
already_here = true;
|
2018-12-14 08:43:43 +08:00
|
|
|
nasm_fatal("out of memory!");
|
2018-12-14 05:55:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
errfile = error_file;
|
|
|
|
if (!errfile)
|
|
|
|
error_file = stderr;
|
|
|
|
|
|
|
|
fprintf(error_file, "nasm: out of memory!\n");
|
|
|
|
fflush(error_file);
|
|
|
|
fflush(NULL);
|
|
|
|
abort();
|
2018-05-31 02:40:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void *nasm_malloc(size_t size)
|
|
|
|
{
|
2019-08-16 15:29:04 +08:00
|
|
|
void *p;
|
|
|
|
|
|
|
|
again:
|
|
|
|
p = malloc(size);
|
|
|
|
|
|
|
|
if (unlikely(!p)) {
|
|
|
|
if (!size) {
|
|
|
|
size = 1;
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
nasm_alloc_failed();
|
|
|
|
}
|
|
|
|
return p;
|
2018-05-31 02:40:42 +08:00
|
|
|
}
|
|
|
|
|
2019-08-16 15:29:04 +08:00
|
|
|
void *nasm_calloc(size_t nelem, size_t size)
|
2016-05-25 20:42:47 +08:00
|
|
|
{
|
2019-08-16 15:29:04 +08:00
|
|
|
void *p;
|
|
|
|
|
|
|
|
again:
|
|
|
|
p = calloc(nelem, size);
|
|
|
|
|
|
|
|
if (unlikely(!p)) {
|
|
|
|
if (!nelem || !size) {
|
|
|
|
nelem = size = 1;
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
nasm_alloc_failed();
|
|
|
|
}
|
|
|
|
|
|
|
|
return p;
|
2016-05-25 20:42:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void *nasm_zalloc(size_t size)
|
|
|
|
{
|
2019-08-16 15:29:04 +08:00
|
|
|
return nasm_calloc(size, 1);
|
2016-05-25 20:42:47 +08:00
|
|
|
}
|
|
|
|
|
2019-08-16 15:29:04 +08:00
|
|
|
/*
|
|
|
|
* 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...
|
|
|
|
*/
|
2016-05-25 20:42:47 +08:00
|
|
|
void *nasm_realloc(void *q, size_t size)
|
|
|
|
{
|
2019-08-16 15:29:04 +08:00
|
|
|
if (unlikely(!size))
|
|
|
|
size = 1;
|
|
|
|
q = q ? realloc(q, size) : malloc(size);
|
|
|
|
return validate_ptr(q);
|
2016-05-25 20:42:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void nasm_free(void *q)
|
|
|
|
{
|
|
|
|
if (q)
|
|
|
|
free(q);
|
|
|
|
}
|
|
|
|
|
|
|
|
char *nasm_strdup(const char *s)
|
|
|
|
{
|
|
|
|
char *p;
|
2019-08-09 17:34:21 +08:00
|
|
|
const size_t size = strlen(s) + 1;
|
2016-05-25 20:42:47 +08:00
|
|
|
|
2019-08-09 17:34:21 +08:00
|
|
|
_nasm_last_string_size = size;
|
2016-05-25 20:42:47 +08:00
|
|
|
p = nasm_malloc(size);
|
|
|
|
return memcpy(p, s, size);
|
|
|
|
}
|
|
|
|
|
|
|
|
char *nasm_strndup(const char *s, size_t len)
|
|
|
|
{
|
|
|
|
char *p;
|
|
|
|
|
|
|
|
len = strnlen(s, len);
|
2019-08-09 17:34:21 +08:00
|
|
|
_nasm_last_string_size = len + 1;
|
2016-05-25 20:42:47 +08:00
|
|
|
p = nasm_malloc(len+1);
|
|
|
|
p[len] = '\0';
|
|
|
|
return memcpy(p, s, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
char *nasm_strcat(const char *one, const char *two)
|
|
|
|
{
|
|
|
|
char *rslt;
|
2019-08-09 17:34:21 +08:00
|
|
|
const size_t l1 = strlen(one);
|
|
|
|
const size_t s2 = strlen(two) + 1;
|
|
|
|
|
|
|
|
_nasm_last_string_size = l1 + s2;
|
|
|
|
rslt = nasm_malloc(l1 + s2);
|
2016-05-25 20:42:47 +08:00
|
|
|
memcpy(rslt, one, l1);
|
2019-08-09 17:34:21 +08:00
|
|
|
memcpy(rslt + l1, two, s2);
|
2016-05-25 20:42:47 +08:00
|
|
|
return rslt;
|
|
|
|
}
|
2018-05-31 02:40:42 +08:00
|
|
|
|
|
|
|
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);
|
|
|
|
|
2019-08-09 17:34:21 +08:00
|
|
|
_nasm_last_string_size = s;
|
|
|
|
|
2018-05-31 02:40:42 +08:00
|
|
|
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;
|
|
|
|
}
|