FreeRDP/winpr/libwinpr/utils/collections/StreamPool.c

419 lines
7.3 KiB
C
Raw Normal View History

/**
* WinPR: Windows Portable Runtime
* Object Pool
*
* Copyright 2012 Marc-Andre Moreau <marcandre.moreau@gmail.com>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <winpr/crt.h>
#include <winpr/collections.h>
/**
* Methods
*/
2013-04-12 20:20:20 +04:00
void StreamPool_ShiftUsed(wStreamPool* pool, int index, int count)
{
if (count > 0)
{
if (pool->uSize + count > pool->uCapacity)
{
int new_cap;
wStream **new_arr;
new_cap = pool->uCapacity * 2;
new_arr = (wStream**) realloc(pool->uArray, sizeof(wStream*) * new_cap);
if (!new_arr)
return;
pool->uCapacity = new_cap;
pool->uArray = new_arr;
2013-04-12 20:20:20 +04:00
}
MoveMemory(&pool->uArray[index + count], &pool->uArray[index], (pool->uSize - index) * sizeof(wStream*));
pool->uSize += count;
}
else if (count < 0)
{
if (pool->uSize - index + count > 0)
2013-11-08 02:37:58 +04:00
{
MoveMemory(&pool->uArray[index], &pool->uArray[index - count],
(pool->uSize - index + count) * sizeof(wStream*));
}
2013-04-12 20:20:20 +04:00
pool->uSize += count;
}
}
/**
* Adds a used stream to the pool.
*/
void StreamPool_AddUsed(wStreamPool* pool, wStream* s)
{
if ((pool->uSize + 1) >= pool->uCapacity)
{
int new_cap;
wStream **new_arr;
new_cap = pool->uCapacity * 2;
new_arr = (wStream**) realloc(pool->uArray, sizeof(wStream*) * new_cap);
if (!new_arr)
return;
pool->uCapacity = new_cap;
pool->uArray = new_arr;
2013-04-12 20:20:20 +04:00
}
pool->uArray[(pool->uSize)++] = s;
}
/**
* Removes a used stream from the pool.
*/
void StreamPool_RemoveUsed(wStreamPool* pool, wStream* s)
{
int index;
BOOL found = FALSE;
for (index = 0; index < pool->uSize; index++)
{
if (pool->uArray[index] == s)
{
found = TRUE;
break;
}
}
if (found)
StreamPool_ShiftUsed(pool, index, -1);
}
void StreamPool_ShiftAvailable(wStreamPool* pool, int index, int count)
{
if (count > 0)
{
if (pool->aSize + count > pool->aCapacity)
{
int new_cap;
wStream **new_arr;
new_cap = pool->aCapacity * 2;
new_arr = (wStream**) realloc(pool->aArray, sizeof(wStream*) * new_cap);
if (!new_arr)
return;
pool->aCapacity = new_cap;
pool->aArray = new_arr;
}
MoveMemory(&pool->aArray[index + count], &pool->aArray[index], (pool->aSize - index) * sizeof(wStream*));
pool->aSize += count;
}
else if (count < 0)
{
if (pool->aSize - index + count > 0)
2013-11-08 02:37:58 +04:00
{
MoveMemory(&pool->aArray[index], &pool->aArray[index - count],
(pool->aSize - index + count) * sizeof(wStream*));
}
pool->aSize += count;
}
}
/**
* Gets a stream from the pool.
*/
wStream* StreamPool_Take(wStreamPool* pool, size_t size)
{
int index;
2013-04-30 08:36:16 +04:00
int foundIndex;
wStream* s = NULL;
if (pool->synchronized)
EnterCriticalSection(&pool->lock);
2013-04-12 21:44:23 +04:00
if (size == 0)
2013-04-12 20:20:20 +04:00
size = pool->defaultSize;
2013-11-08 02:37:58 +04:00
foundIndex = -1;
for (index = 0; index < pool->aSize; index++)
{
s = pool->aArray[index];
if (Stream_Capacity(s) >= size)
{
2013-04-30 08:36:16 +04:00
foundIndex = index;
break;
}
}
2013-11-08 02:37:58 +04:00
if (foundIndex < 0)
{
s = Stream_New(NULL, size);
if (!s)
goto out_fail;
}
else
{
Stream_SetPosition(s, 0);
StreamPool_ShiftAvailable(pool, foundIndex, -1);
}
if (s)
{
s->pool = pool;
s->count = 1;
StreamPool_AddUsed(pool, s);
}
2013-04-12 20:20:20 +04:00
out_fail:
if (pool->synchronized)
LeaveCriticalSection(&pool->lock);
return s;
}
/**
* Returns an object to the pool.
*/
void StreamPool_Return(wStreamPool* pool, wStream* s)
{
if (pool->synchronized)
EnterCriticalSection(&pool->lock);
2013-04-12 20:20:20 +04:00
if ((pool->aSize + 1) >= pool->aCapacity)
{
int new_cap;
wStream **new_arr;
new_cap = pool->aCapacity * 2;
new_arr = (wStream**) realloc(pool->aArray, sizeof(wStream*) * new_cap);
if (!new_arr)
goto out_fail;
pool->aCapacity = new_cap;
pool->aArray = new_arr;
}
else if ((pool->aSize + 1) * 3 < pool->aCapacity)
{
int new_cap;
wStream **new_arr;
new_cap = pool->aCapacity / 2;
new_arr = (wStream**) realloc(pool->aArray, sizeof(wStream*) * new_cap);
if (!new_arr)
goto out_fail;
pool->aCapacity = new_cap;
pool->aArray = new_arr;
}
2013-04-12 20:20:20 +04:00
pool->aArray[(pool->aSize)++] = s;
StreamPool_RemoveUsed(pool, s);
out_fail:
if (pool->synchronized)
LeaveCriticalSection(&pool->lock);
}
/**
* Lock the stream pool
*/
void StreamPool_Lock(wStreamPool* pool)
{
EnterCriticalSection(&pool->lock);
}
/**
* Unlock the stream pool
*/
void StreamPool_Unlock(wStreamPool* pool)
{
LeaveCriticalSection(&pool->lock);
}
/**
* Increment stream reference count
*/
void Stream_AddRef(wStream* s)
{
if (s->pool)
{
StreamPool_Lock(s->pool);
s->count++;
StreamPool_Unlock(s->pool);
}
}
/**
* Decrement stream reference count
*/
void Stream_Release(wStream* s)
{
DWORD count;
if (s->pool)
{
StreamPool_Lock(s->pool);
count = --(s->count);
StreamPool_Unlock(s->pool);
if (count == 0)
StreamPool_Return(s->pool, s);
}
}
2013-04-12 20:20:20 +04:00
/**
* Find stream in pool using pointer inside buffer
*/
wStream* StreamPool_Find(wStreamPool* pool, BYTE* ptr)
{
int index;
wStream* s = NULL;
BOOL found = FALSE;
EnterCriticalSection(&pool->lock);
2013-04-12 20:20:20 +04:00
for (index = 0; index < pool->uSize; index++)
{
s = pool->uArray[index];
if ((ptr >= Stream_Buffer(s)) && (ptr < (Stream_Buffer(s) + Stream_Capacity(s))))
2013-04-12 20:20:20 +04:00
{
found = TRUE;
break;
}
}
LeaveCriticalSection(&pool->lock);
2013-04-12 20:20:20 +04:00
return (found) ? s : NULL;
}
/**
* Find stream in pool and increment reference count
*/
void StreamPool_AddRef(wStreamPool* pool, BYTE* ptr)
{
wStream* s;
s = StreamPool_Find(pool, ptr);
if (s)
Stream_AddRef(s);
}
/**
* Find stream in pool and decrement reference count
*/
void StreamPool_Release(wStreamPool* pool, BYTE* ptr)
{
wStream* s;
s = StreamPool_Find(pool, ptr);
if (s)
Stream_Release(s);
}
/**
* Releases the streams currently cached in the pool.
*/
void StreamPool_Clear(wStreamPool* pool)
{
if (pool->synchronized)
EnterCriticalSection(&pool->lock);
2013-04-12 20:20:20 +04:00
while (pool->aSize > 0)
{
2013-04-12 20:20:20 +04:00
(pool->aSize)--;
Stream_Free(pool->aArray[pool->aSize], TRUE);
}
if (pool->synchronized)
LeaveCriticalSection(&pool->lock);
}
/**
* Construction, Destruction
*/
2013-04-12 20:20:20 +04:00
wStreamPool* StreamPool_New(BOOL synchronized, size_t defaultSize)
{
wStreamPool* pool = NULL;
pool = (wStreamPool*) calloc(1, sizeof(wStreamPool));
if (pool)
{
pool->synchronized = synchronized;
2013-04-12 20:20:20 +04:00
pool->defaultSize = defaultSize;
2013-04-12 20:20:20 +04:00
pool->aSize = 0;
pool->aCapacity = 32;
pool->aArray = (wStream**) calloc(pool->aCapacity, sizeof(wStream*));
if (!pool->aArray)
2014-11-16 17:03:20 +03:00
{
free(pool);
return NULL;
2014-11-16 17:03:20 +03:00
}
2013-04-12 20:20:20 +04:00
pool->uSize = 0;
pool->uCapacity = 32;
pool->uArray = (wStream**) calloc(pool->uCapacity, sizeof(wStream*));
if (!pool->uArray)
2014-11-16 17:03:20 +03:00
{
free(pool->aArray);
free(pool);
return NULL;
2014-11-16 17:03:20 +03:00
}
InitializeCriticalSectionAndSpinCount(&pool->lock, 4000);
}
return pool;
}
void StreamPool_Free(wStreamPool* pool)
{
if (pool)
{
StreamPool_Clear(pool);
DeleteCriticalSection(&pool->lock);
2013-04-12 20:20:20 +04:00
free(pool->aArray);
free(pool->uArray);
free(pool);
}
}