nasm/nasmlib/alloc.c
H. Peter Anvin 6a4353c4c2 errors: be more robust in handling unexpected fatal errors
Introduce a new error level, ERR_CRITICAL, beyond which we will
minimize the amount of code that will be executed before we die; in
particular don't execute any memory allocations, and if we somehow end
up recursing, abort() immediately.

Basically, "less than panic, more than fatal."

At this point this level is used by nasm_alloc_failed().

Signed-off-by: H. Peter Anvin <hpa@zytor.com>
2019-08-28 18:32:46 -07:00

198 lines
4.8 KiB
C

/* ----------------------------------------------------------------------- *
*
* Copyright 1996-2019 The NASM Authors - All Rights Reserved
* 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.
*
* 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"
#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);
}
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;
}