mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 03:27:39 +00:00
118db71121
This replaces the STL <new> header. Mainly, it defines a global operator new and operator delete, as well as the placement versions of these. The placement versions are required to not get compile errors when trying to write a placement new statement. Each of these operators is defined with many, many different variants. A glance at new.cc is recommended followed by a chaser of the Alexandrescu talk "std::allocator is to Allocation as std::vector is to Vexation". We must provide a global-namespace source-level definition of each operator and it is illegal for any of them to be marked inline, so here we are. The upshot is that we no longer need to include <new>, and our optional/ vector headers are self-contained.
116 lines
2.2 KiB
C++
116 lines
2.2 KiB
C++
// -*- mode:c++; indent-tabs-mode:nil; c-basic-offset:4; coding:utf-8 -*-
|
|
// vi: set et ft=cpp ts=4 sts=4 sw=4 fenc=utf-8 :vi
|
|
//
|
|
// Copyright 2024 Justine Alexandra Roberts Tunney
|
|
//
|
|
// Permission to use, copy, modify, and/or distribute this software for
|
|
// any purpose with or without fee is hereby granted, provided that the
|
|
// above copyright notice and this permission notice appear in all copies.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
|
|
// WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
|
|
// WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
|
|
// AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
|
// DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
|
// PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
|
|
// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
// PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
#include "new.h"
|
|
|
|
#include "libc/mem/mem.h"
|
|
|
|
using ctl::align_val_t;
|
|
|
|
namespace {
|
|
|
|
constexpr auto a1 = align_val_t(1);
|
|
|
|
} // namespace
|
|
|
|
void*
|
|
operator new(size_t n, align_val_t a)
|
|
{
|
|
void* p;
|
|
if (!(p = memalign(static_cast<size_t>(a), n))) {
|
|
__builtin_trap();
|
|
}
|
|
return p;
|
|
}
|
|
|
|
void*
|
|
operator new[](size_t n, ctl::align_val_t a)
|
|
{
|
|
return operator new(n, a);
|
|
}
|
|
void*
|
|
operator new(size_t n)
|
|
{
|
|
return operator new(n, a1);
|
|
}
|
|
void*
|
|
operator new[](size_t n)
|
|
{
|
|
return operator new(n, a1);
|
|
}
|
|
|
|
void*
|
|
operator new(size_t, void* p)
|
|
{
|
|
return p;
|
|
}
|
|
void*
|
|
operator new[](size_t, void* p)
|
|
{
|
|
return p;
|
|
}
|
|
|
|
void
|
|
operator delete(void* p) noexcept
|
|
{
|
|
free(p);
|
|
}
|
|
void
|
|
operator delete[](void* p) noexcept
|
|
{
|
|
free(p);
|
|
}
|
|
void
|
|
operator delete(void* p, ctl::align_val_t) noexcept
|
|
{
|
|
free(p);
|
|
}
|
|
void
|
|
operator delete[](void* p, ctl::align_val_t) noexcept
|
|
{
|
|
free(p);
|
|
}
|
|
void
|
|
operator delete(void* p, size_t) noexcept
|
|
{
|
|
free(p);
|
|
}
|
|
void
|
|
operator delete[](void* p, size_t) noexcept
|
|
{
|
|
free(p);
|
|
}
|
|
void
|
|
operator delete(void* p, size_t, ctl::align_val_t) noexcept
|
|
{
|
|
free(p);
|
|
}
|
|
void
|
|
operator delete[](void* p, size_t, ctl::align_val_t) noexcept
|
|
{
|
|
free(p);
|
|
}
|
|
|
|
void
|
|
operator delete(void*, void*) noexcept
|
|
{
|
|
}
|
|
void
|
|
operator delete[](void*, void*) noexcept
|
|
{
|
|
}
|