forked from metin2/server
295 lines
6.5 KiB
C++
295 lines
6.5 KiB
C++
/*
|
|
* Filename: buffer.c
|
|
* Description: Buffer 처리 모듈
|
|
*
|
|
* Author: 김한주 (aka. 비엽, Cronan)
|
|
*/
|
|
#define __LIBTHECORE__
|
|
#include "stdafx.h"
|
|
|
|
static LPBUFFER normalized_buffer_pool[32] = { NULL, };
|
|
|
|
#define DEFAULT_POOL_SIZE 8192
|
|
|
|
// internal function forward
|
|
void buffer_realloc(LPBUFFER& buffer, int length);
|
|
|
|
static int buffer_get_pool_index(int size) {
|
|
int i;
|
|
for (i = 0; i < 32; ++i) {
|
|
if ((1 << i) >= size) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1; // too big... not pooled
|
|
}
|
|
static int buffer_get_exac_pool_index(int size) {
|
|
int i;
|
|
for (i = 0; i < 32; ++i) {
|
|
if ((1 << i) == size) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1; // too big... not pooled
|
|
}
|
|
// 모든 buffer pool 해제.
|
|
static void buffer_pool_free ()
|
|
{
|
|
for (int i = 31; i >= 0; i--)
|
|
{
|
|
if (normalized_buffer_pool[i] != NULL)
|
|
{
|
|
LPBUFFER next;
|
|
for (LPBUFFER p = normalized_buffer_pool[i]; p != NULL; p = next)
|
|
{
|
|
next = p->next;
|
|
free(p->mem_data);
|
|
free(p);
|
|
}
|
|
normalized_buffer_pool[i] = NULL;
|
|
}
|
|
}
|
|
}
|
|
// n보다 큰 buffer pool 하나를 해제.
|
|
static bool buffer_larger_pool_free (int n)
|
|
{
|
|
for (int i = 31; i > n; i--)
|
|
{
|
|
if (normalized_buffer_pool[i] != NULL)
|
|
{
|
|
LPBUFFER buffer = normalized_buffer_pool[i];
|
|
LPBUFFER next = buffer->next;
|
|
free(buffer->mem_data);
|
|
free(buffer);
|
|
normalized_buffer_pool[i] = next;
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
bool safe_create(char** pdata, int number)
|
|
{
|
|
if (!((*pdata) = (char *) calloc (number, sizeof(char))))
|
|
{
|
|
sys_err("calloc failed [%d] %s", errno, strerror(errno));
|
|
return false;
|
|
}
|
|
else
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
LPBUFFER buffer_new(int size)
|
|
{
|
|
if (size < 0) {
|
|
return NULL;
|
|
}
|
|
|
|
LPBUFFER buffer = NULL;
|
|
int pool_index = buffer_get_pool_index(size);
|
|
if (pool_index >= 0) {
|
|
BUFFER** buffer_pool = normalized_buffer_pool + pool_index;
|
|
size = 1 << pool_index;
|
|
|
|
if (*buffer_pool) {
|
|
buffer = *buffer_pool;
|
|
*buffer_pool = buffer->next;
|
|
}
|
|
}
|
|
|
|
if (buffer == NULL)
|
|
{
|
|
CREATE(buffer, BUFFER, 1);
|
|
buffer->mem_size = size;
|
|
// buffer_new에서 calloc failed가 자주 발생하여(터키의 빈약한 머신에서 주로 발생),
|
|
// calloc이 실패하면, buffer pool을 비우고 다시 시도한다.
|
|
if (!safe_create(&buffer->mem_data, size))
|
|
{
|
|
// 필요한 buffer보다 큰 buffer pool에서 하나를 해제.
|
|
if (!buffer_larger_pool_free(pool_index))
|
|
// 실패하면 최후의 수단으로, 모든 pool을 해제한다.
|
|
buffer_pool_free();
|
|
CREATE(buffer->mem_data, char, size);
|
|
sys_err ("buffer pool free success.");
|
|
}
|
|
}
|
|
assert(buffer != NULL);
|
|
assert(buffer->mem_size == size);
|
|
assert(buffer->mem_data != NULL);
|
|
|
|
buffer_reset(buffer);
|
|
|
|
return buffer;
|
|
}
|
|
|
|
void buffer_delete(LPBUFFER buffer)
|
|
{
|
|
if (buffer == NULL) {
|
|
return;
|
|
}
|
|
buffer_reset(buffer);
|
|
|
|
int size = buffer->mem_size;
|
|
|
|
int pool_index = buffer_get_exac_pool_index(size);
|
|
if (pool_index >= 0) {
|
|
BUFFER** buffer_pool = normalized_buffer_pool + pool_index;
|
|
buffer->next = *buffer_pool;
|
|
*buffer_pool = buffer;
|
|
}
|
|
else {
|
|
free(buffer->mem_data);
|
|
free(buffer);
|
|
}
|
|
}
|
|
|
|
DWORD buffer_size(LPBUFFER buffer)
|
|
{
|
|
return (buffer->length);
|
|
}
|
|
|
|
void buffer_reset(LPBUFFER buffer)
|
|
{
|
|
buffer->read_point = buffer->mem_data;
|
|
buffer->write_point = buffer->mem_data;
|
|
buffer->write_point_pos = 0;
|
|
buffer->length = 0;
|
|
buffer->next = NULL;
|
|
buffer->flag = 0;
|
|
}
|
|
|
|
void buffer_write(LPBUFFER& buffer, const void *src, int length)
|
|
{
|
|
if (buffer->write_point_pos + length >= buffer->mem_size)
|
|
buffer_realloc(buffer, buffer->mem_size + length + MIN(10240, length));
|
|
|
|
thecore_memcpy(buffer->write_point, src, length);
|
|
buffer_write_proceed(buffer, length);
|
|
}
|
|
|
|
void buffer_read(LPBUFFER buffer, void * buf, int bytes)
|
|
{
|
|
thecore_memcpy(buf, buffer->read_point, bytes);
|
|
buffer_read_proceed(buffer, bytes);
|
|
}
|
|
|
|
BYTE buffer_byte(LPBUFFER buffer)
|
|
{
|
|
BYTE val = *(BYTE *) buffer->read_point;
|
|
buffer_read_proceed(buffer, sizeof(BYTE));
|
|
return val;
|
|
}
|
|
|
|
WORD buffer_word(LPBUFFER buffer)
|
|
{
|
|
WORD val = *(WORD *) buffer->read_point;
|
|
buffer_read_proceed(buffer, sizeof(WORD));
|
|
return val;
|
|
}
|
|
|
|
DWORD buffer_dword(LPBUFFER buffer)
|
|
{
|
|
DWORD val = *(DWORD *) buffer->read_point;
|
|
buffer_read_proceed(buffer, sizeof(DWORD));
|
|
return val;
|
|
}
|
|
|
|
const void * buffer_read_peek(LPBUFFER buffer)
|
|
{
|
|
return (const void *) buffer->read_point;
|
|
}
|
|
|
|
void buffer_read_proceed(LPBUFFER buffer, int length)
|
|
{
|
|
if (length == 0)
|
|
return;
|
|
|
|
if (length < 0)
|
|
sys_err("buffer_proceed: length argument lower than zero (length: %d)", length);
|
|
else if (length > buffer->length)
|
|
{
|
|
sys_err("buffer_proceed: length argument bigger than buffer (length: %d, buffer: %d)", length, buffer->length);
|
|
length = buffer->length;
|
|
}
|
|
|
|
// 처리할 길이가 버퍼 길이보다 작다면, 버퍼를 남겨두어야 한다.
|
|
if (length < buffer->length)
|
|
{
|
|
// write_point 와 pos 는 그대로 두고 read_point 만 증가 시킨다.
|
|
if (buffer->read_point + length - buffer->mem_data > buffer->mem_size)
|
|
{
|
|
sys_err("buffer_read_proceed: buffer overflow! length %d read_point %d", length, buffer->read_point - buffer->mem_data);
|
|
abort();
|
|
}
|
|
|
|
buffer->read_point += length;
|
|
buffer->length -= length;
|
|
}
|
|
else
|
|
{
|
|
buffer_reset(buffer);
|
|
}
|
|
}
|
|
|
|
void * buffer_write_peek(LPBUFFER buffer)
|
|
{
|
|
return (buffer->write_point);
|
|
}
|
|
|
|
void buffer_write_proceed(LPBUFFER buffer, int length)
|
|
{
|
|
buffer->length += length;
|
|
buffer->write_point += length;
|
|
buffer->write_point_pos += length;
|
|
}
|
|
|
|
int buffer_has_space(LPBUFFER buffer)
|
|
{
|
|
return (buffer->mem_size - buffer->write_point_pos);
|
|
}
|
|
|
|
void buffer_adjust_size(LPBUFFER& buffer, int add_size)
|
|
{
|
|
if (buffer->mem_size >= buffer->write_point_pos + add_size)
|
|
return;
|
|
|
|
sys_log(0, "buffer_adjust %d current %d/%d", add_size, buffer->length, buffer->mem_size);
|
|
buffer_realloc(buffer, buffer->mem_size + add_size);
|
|
}
|
|
|
|
void buffer_realloc(LPBUFFER& buffer, int length)
|
|
{
|
|
int i, read_point_pos;
|
|
LPBUFFER temp;
|
|
|
|
assert(length >= 0 && "buffer_realloc: length is lower than zero");
|
|
|
|
if (buffer->mem_size >= length)
|
|
return;
|
|
|
|
// i 는 새로 할당된 크기와 이전크기의 차, 실제로 새로 생긴
|
|
// 메모리의 크기를 뜻한다.
|
|
i = length - buffer->mem_size;
|
|
|
|
if (i <= 0)
|
|
return;
|
|
|
|
temp = buffer_new (length);
|
|
sys_log(0, "reallocating buffer to %d, current %d", temp->mem_size, buffer->mem_size);
|
|
thecore_memcpy(temp->mem_data, buffer->mem_data, buffer->mem_size);
|
|
|
|
read_point_pos = buffer->read_point - buffer->mem_data;
|
|
|
|
// write_point 와 read_point 를 재 연결 시킨다.
|
|
temp->write_point = temp->mem_data + buffer->write_point_pos;
|
|
temp->write_point_pos = buffer->write_point_pos;
|
|
temp->read_point = temp->mem_data + read_point_pos;
|
|
temp->flag = buffer->flag;
|
|
temp->next = NULL;
|
|
temp->length = buffer->length;
|
|
|
|
buffer_delete(buffer);
|
|
buffer = temp;
|
|
}
|