117 lines
3.0 KiB
C
117 lines
3.0 KiB
C
/*
|
|
* Copyright (C) 2013 Glyptodon LLC
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#include "pool.h"
|
|
|
|
#include <stdlib.h>
|
|
|
|
guac_pool* guac_pool_alloc(int size) {
|
|
|
|
guac_pool* pool = malloc(sizeof(guac_pool));
|
|
|
|
/* If unable to allocate, just return NULL. */
|
|
if (pool == NULL)
|
|
return NULL;
|
|
|
|
/* Initialize empty pool */
|
|
pool->min_size = size;
|
|
pool->active = 0;
|
|
pool->__next_value = 0;
|
|
pool->__head = NULL;
|
|
pool->__tail = NULL;
|
|
|
|
return pool;
|
|
|
|
}
|
|
|
|
void guac_pool_free(guac_pool* pool) {
|
|
|
|
/* Free all ints in pool */
|
|
guac_pool_int* current = pool->__head;
|
|
while (current != NULL) {
|
|
|
|
guac_pool_int* old = current;
|
|
current = current->__next;
|
|
|
|
free(old);
|
|
}
|
|
|
|
/* Free pool */
|
|
free(pool);
|
|
|
|
}
|
|
|
|
int guac_pool_next_int(guac_pool* pool) {
|
|
|
|
int value;
|
|
|
|
pool->active++;
|
|
|
|
/* If more integers are needed, return a new one. */
|
|
if (pool->__head == NULL || pool->__next_value < pool->min_size)
|
|
return pool->__next_value++;
|
|
|
|
/* Otherwise, remove first integer. */
|
|
value = pool->__head->value;
|
|
|
|
/* If only one element exists, reset pool to empty. */
|
|
if (pool->__tail == pool->__head) {
|
|
free(pool->__head);
|
|
pool->__head = NULL;
|
|
pool->__tail = NULL;
|
|
}
|
|
|
|
/* Otherwise, advance head. */
|
|
else {
|
|
guac_pool_int* old_head = pool->__head;
|
|
pool->__head = old_head->__next;
|
|
free(old_head);
|
|
}
|
|
|
|
/* Return retrieved value. */
|
|
return value;
|
|
}
|
|
|
|
void guac_pool_free_int(guac_pool* pool, int value) {
|
|
|
|
/* Allocate and initialize new returned value */
|
|
guac_pool_int* pool_int = malloc(sizeof(guac_pool_int));
|
|
pool_int->value = value;
|
|
pool_int->__next = NULL;
|
|
|
|
pool->active--;
|
|
|
|
/* If pool empty, store as sole entry. */
|
|
if (pool->__tail == NULL)
|
|
pool->__head = pool->__tail = pool_int;
|
|
|
|
/* Otherwise, append to end of pool. */
|
|
else {
|
|
pool->__tail->__next = pool_int;
|
|
pool->__tail = pool_int;
|
|
}
|
|
|
|
}
|
|
|