1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
/*
* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
*
* Copyright (c) 1997-2014 ircd-hybrid development team
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA
*/
/*! \file dbuf.c
* \brief Supports dynamic data buffers.
* \version $Id$
*/
#include "stdinc.h"
#include "list.h"
#include "dbuf.h"
#include "memory.h"
#include "mempool.h"
static mp_pool_t *dbuf_pool;
void
dbuf_init(void)
{
dbuf_pool = mp_pool_new(sizeof(struct dbuf_block), MP_CHUNK_SIZE_DBUF);
}
static struct dbuf_block *
dbuf_alloc(struct dbuf_queue *qptr)
{
struct dbuf_block *block = mp_pool_get(dbuf_pool);
memset(block, 0, sizeof(*block));
dlinkAddTail(block, make_dlink_node(), &qptr->blocks);
return block;
}
void
dbuf_put(struct dbuf_queue *qptr, char *data, size_t count)
{
struct dbuf_block *last;
size_t amount;
assert(count > 0);
if (qptr->blocks.tail == NULL)
dbuf_alloc(qptr);
do {
last = qptr->blocks.tail->data;
amount = DBUF_BLOCK_SIZE - last->size;
if (!amount)
{
last = dbuf_alloc(qptr);
amount = DBUF_BLOCK_SIZE;
}
if (amount > count)
amount = count;
memcpy((void *) &last->data[last->size], data, amount);
count -= amount;
last->size += amount;
qptr->total_size += amount;
data += amount;
} while (count > 0);
}
void
dbuf_delete(struct dbuf_queue *qptr, size_t count)
{
dlink_node *ptr;
struct dbuf_block *first;
assert(qptr->total_size >= count);
if (count == 0)
return;
/* free whole blocks first.. */
while (1)
{
if (!count)
return;
ptr = qptr->blocks.head;
first = ptr->data;
if (count < first->size)
break;
qptr->total_size -= first->size;
count -= first->size;
dlinkDelete(ptr, &qptr->blocks);
free_dlink_node(ptr);
mp_pool_release(first);
}
/* ..then remove data from the beginning of the queue */
first->size -= count;
qptr->total_size -= count;
memmove((void *) &first->data, (void *) &first->data[count], first->size);
}
|
