2014-02-10 02:10:30 +01:00
|
|
|
/*************************************************************************/
|
|
|
|
/* allocators.h */
|
|
|
|
/*************************************************************************/
|
|
|
|
/* This file is part of: */
|
|
|
|
/* GODOT ENGINE */
|
2017-08-27 14:11:45 +02:00
|
|
|
/* https://godotengine.org */
|
2014-02-10 02:10:30 +01:00
|
|
|
/*************************************************************************/
|
2018-01-02 11:27:24 +01:00
|
|
|
/* Copyright (c) 2007-2018 Juan Linietsky, Ariel Manzur. */
|
|
|
|
/* Copyright (c) 2014-2018 Godot Engine contributors (cf. AUTHORS.md) */
|
2014-02-10 02:10:30 +01:00
|
|
|
/* */
|
|
|
|
/* 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. */
|
|
|
|
/*************************************************************************/
|
|
|
|
#ifndef ALLOCATORS_H
|
|
|
|
#define ALLOCATORS_H
|
|
|
|
|
|
|
|
#include "os/memory.h"
|
2017-03-19 00:36:26 +01:00
|
|
|
template <int PREALLOC_COUNT = 64, int MAX_HANDS = 8>
|
2014-02-10 02:10:30 +01:00
|
|
|
class BalloonAllocator {
|
|
|
|
|
|
|
|
enum {
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
USED_FLAG = (1 << 30),
|
|
|
|
USED_MASK = USED_FLAG - 1
|
2014-02-10 02:10:30 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct Balloon {
|
|
|
|
|
|
|
|
Balloon *next;
|
|
|
|
Balloon *prev;
|
|
|
|
uint32_t hand;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct Hand {
|
|
|
|
|
|
|
|
int used;
|
|
|
|
int allocated;
|
|
|
|
Balloon *first;
|
|
|
|
Balloon *last;
|
|
|
|
};
|
|
|
|
|
|
|
|
Hand hands[MAX_HANDS];
|
|
|
|
|
|
|
|
public:
|
2017-03-19 00:36:26 +01:00
|
|
|
void *alloc(size_t p_size) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
size_t max = (1 << MAX_HANDS);
|
|
|
|
ERR_FAIL_COND_V(p_size > max, NULL);
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
unsigned int hand = 0;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
while (p_size > (size_t)(1 << hand))
|
|
|
|
++hand;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
Hand &h = hands[hand];
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
if (h.used == h.allocated) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int i = 0; i < PREALLOC_COUNT; i++) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
Balloon *b = (Balloon *)memalloc(sizeof(Balloon) + (1 << hand));
|
|
|
|
b->hand = hand;
|
2014-02-10 02:10:30 +01:00
|
|
|
if (h.last) {
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
b->prev = h.last;
|
|
|
|
h.last->next = b;
|
|
|
|
h.last = b;
|
2014-02-10 02:10:30 +01:00
|
|
|
} else {
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
b->prev = NULL;
|
|
|
|
h.last = b;
|
|
|
|
h.first = b;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
h.last->next = NULL;
|
|
|
|
h.allocated += PREALLOC_COUNT;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
Balloon *pick = h.last;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
ERR_FAIL_COND_V((pick->hand & USED_FLAG), NULL);
|
2014-02-10 02:10:30 +01:00
|
|
|
|
|
|
|
// remove last
|
2017-03-19 00:36:26 +01:00
|
|
|
h.last = h.last->prev;
|
|
|
|
h.last->next = NULL;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
pick->next = h.first;
|
|
|
|
h.first->prev = pick;
|
|
|
|
pick->prev = NULL;
|
|
|
|
h.first = pick;
|
2014-02-10 02:10:30 +01:00
|
|
|
h.used++;
|
2017-03-19 00:36:26 +01:00
|
|
|
pick->hand |= USED_FLAG;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
return (void *)(pick + 1);
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
void free(void *p_ptr) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
Balloon *b = (Balloon *)p_ptr;
|
|
|
|
b -= 1;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
ERR_FAIL_COND(!(b->hand & USED_FLAG));
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
b->hand = b->hand & USED_MASK; // not used
|
|
|
|
int hand = b->hand;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
Hand &h = hands[hand];
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
if (b == h.first)
|
|
|
|
h.first = b->next;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
|
|
|
if (b->prev)
|
2017-03-19 00:36:26 +01:00
|
|
|
b->prev->next = b->next;
|
2014-02-10 02:10:30 +01:00
|
|
|
if (b->next)
|
2017-03-19 00:36:26 +01:00
|
|
|
b->next->prev = b->prev;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
if (h.last != b) {
|
|
|
|
h.last->next = b;
|
|
|
|
b->prev = h.last;
|
|
|
|
b->next = NULL;
|
|
|
|
h.last = b;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
h.used--;
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
if (h.used <= (h.allocated - (PREALLOC_COUNT * 2))) { // this is done to ensure no alloc/free is done constantly
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int i = 0; i < PREALLOC_COUNT; i++) {
|
|
|
|
ERR_CONTINUE(h.last->hand & USED_FLAG);
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
Balloon *new_last = h.last->prev;
|
2014-02-10 02:10:30 +01:00
|
|
|
if (new_last)
|
2017-03-19 00:36:26 +01:00
|
|
|
new_last->next = NULL;
|
|
|
|
memfree(h.last);
|
|
|
|
h.last = new_last;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
2017-03-19 00:36:26 +01:00
|
|
|
h.allocated -= PREALLOC_COUNT;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
BalloonAllocator() {
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int i = 0; i < MAX_HANDS; i++) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
hands[i].allocated = 0;
|
|
|
|
hands[i].used = 0;
|
|
|
|
hands[i].first = NULL;
|
|
|
|
hands[i].last = NULL;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void clear() {
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int i = 0; i < MAX_HANDS; i++) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
while (hands[i].first) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
Balloon *b = hands[i].first;
|
|
|
|
hands[i].first = b->next;
|
2014-02-10 02:10:30 +01:00
|
|
|
memfree(b);
|
|
|
|
}
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
hands[i].allocated = 0;
|
|
|
|
hands[i].used = 0;
|
|
|
|
hands[i].first = NULL;
|
|
|
|
hands[i].last = NULL;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
~BalloonAllocator() {
|
|
|
|
|
|
|
|
clear();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif // ALLOCATORS_H
|