-
Notifications
You must be signed in to change notification settings - Fork 0
/
simple_pow2_pool.cc
57 lines (51 loc) · 1.86 KB
/
simple_pow2_pool.cc
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
/*
* Copyright (C) 2018 XMM SWAP LTD
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*
* [ MIT license: http://www.opensource.org/licenses/mit-license.php ]
*/
#include "simple_pow2_pool.h"
#ifdef USE_STDCXX_LIBRARY
#include <exception>
#include <stdexcept>
#else
#include <stdio.h>
#include <stdlib.h>
#endif
void
impl::simple_pow2_pool_base::out_of_memory()
{
#ifdef USE_STDCXX_LIBRARY
throw std::bad_alloc();
#else
fprintf(stderr, "simple_pow2_pool: out of memory\n");
abort();
#endif
}
void *
impl::simple_pow2_pool_base::extend(size_t alloc_size, size_t align_size,
impl::simple_pow2_pool_base::FreeNode **freelists)
{
auto cur = static_cast<char *>(m_cur);
void *ret = extend(alloc_size < align_size ? align_size : alloc_size);
for (size_t i = 0; alloc_size < align_size; alloc_size *= 2, i++)
add_to_list(freelists[i], cur + alloc_size);
return ret;
}