81 lines
1.2 KiB
C++
81 lines
1.2 KiB
C++
|
#include <string.h>
|
||
|
|
#include "sh_stack.h"
|
||
|
|
#include "CVector.h"
|
||
|
|
#include "mysql2_header.h"
|
||
|
|
|
||
|
|
struct QHandle
|
||
|
|
{
|
||
|
|
void *_ptr;
|
||
|
|
FREEHANDLE _func;
|
||
|
|
HandleType type;
|
||
|
|
bool isfree;
|
||
|
|
};
|
||
|
|
|
||
|
|
CVector<QHandle *> g_Handles;
|
||
|
|
CStack<unsigned int> g_FreeHandles;
|
||
|
|
|
||
|
|
unsigned int MakeHandle(void *ptr, HandleType type, FREEHANDLE f)
|
||
|
|
{
|
||
|
|
unsigned int num;
|
||
|
|
QHandle *h;
|
||
|
|
|
||
|
|
if (g_FreeHandles.size())
|
||
|
|
{
|
||
|
|
num = g_FreeHandles.front();
|
||
|
|
g_FreeHandles.pop();
|
||
|
|
h = g_Handles[num];
|
||
|
|
} else {
|
||
|
|
h = new QHandle;
|
||
|
|
g_Handles.push_back(h);
|
||
|
|
num = static_cast<unsigned int>(g_Handles.size()) - 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
h->_ptr = ptr;
|
||
|
|
h->type = type;
|
||
|
|
h->_func = f;
|
||
|
|
h->isfree = false;
|
||
|
|
|
||
|
|
return num + 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
void *GetHandle(unsigned int num, HandleType type)
|
||
|
|
{
|
||
|
|
if (num == 0)
|
||
|
|
return NULL;
|
||
|
|
|
||
|
|
num--;
|
||
|
|
if (num >= g_Handles.size())
|
||
|
|
return NULL;
|
||
|
|
|
||
|
|
QHandle *h = g_Handles[num];
|
||
|
|
if (h->isfree || (h->type != type))
|
||
|
|
return NULL;
|
||
|
|
|
||
|
|
return h->_ptr;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool FreeHandle(unsigned int num)
|
||
|
|
{
|
||
|
|
if (num == 0)
|
||
|
|
return false;
|
||
|
|
|
||
|
|
unsigned int _num = num;
|
||
|
|
|
||
|
|
num--;
|
||
|
|
if (num >= g_Handles.size())
|
||
|
|
return false;
|
||
|
|
|
||
|
|
QHandle *h = g_Handles[num];
|
||
|
|
if (h->isfree)
|
||
|
|
return false;
|
||
|
|
|
||
|
|
h->_func(h->_ptr, _num);
|
||
|
|
h->_ptr = NULL;
|
||
|
|
h->_func = NULL;
|
||
|
|
h->isfree = true;
|
||
|
|
|
||
|
|
g_FreeHandles.push(num);
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|