mirror of
https://github.com/intel/linux-sgx
synced 2026-06-08 14:49:32 +00:00
Zhang Lili
60 lines
2.4 KiB
C++
60 lines
2.4 KiB
C++
/*
|
|
* Copyright (C) 2011-2021 Intel Corporation. All rights reserved.
|
|
*
|
|
* 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.
|
|
* * Neither the name of Intel Corporation nor the names of its
|
|
* contributors may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* 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.
|
|
*
|
|
*/
|
|
#include <stdlib.h>
|
|
#include <new>
|
|
#include "sgx_defs.h"
|
|
#include "sgx_trts.h"
|
|
#include "internal/se_cdefs.h"
|
|
#include "internal/cpprt_internal.h"
|
|
|
|
SGX_WEAK void* SGXAPI operator new(size_t size, std::align_val_t alignment)
|
|
{
|
|
if (size == 0)
|
|
size = 1;
|
|
if (static_cast<size_t>(alignment) < sizeof(void*))
|
|
alignment = std::align_val_t(sizeof(void*));
|
|
|
|
// Try allocating memory. If allocation fails and there is a new_handler,
|
|
// call it to try free up memory, and try again until it succeeds, or until
|
|
// the new_handler decides to terminate.
|
|
//
|
|
// If allocation fails and there is no new_handler, we throw bad_alloc
|
|
// (or return nullptr if exceptions are disabled).
|
|
void* p;
|
|
while ((p = std::__libcpp_aligned_alloc(static_cast<size_t>(alignment), size)) == nullptr)
|
|
{
|
|
if ( !call_newh() ){
|
|
throw std::bad_alloc();
|
|
}
|
|
}
|
|
return p;
|
|
}
|