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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
/* $%BEGINLICENSE%$
Copyright (C) 2007-2008 MySQL AB, 2008 Sun Microsystems, Inc
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; version 2 of the License.
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
$%ENDLICENSE%$ */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "network-queue.h"
#ifndef DISABLE_DEPRECATED_DECL
network_queue *network_queue_init() {
return network_queue_new();
}
#endif
network_queue *network_queue_new() {
network_queue *queue;
queue = g_new0(network_queue, 1);
queue->chunks = g_queue_new();
return queue;
}
void network_queue_free(network_queue *queue) {
GString *packet;
if (!queue) return;
while ((packet = g_queue_pop_head(queue->chunks))) g_string_free(packet, TRUE);
g_queue_free(queue->chunks);
g_free(queue);
}
int network_queue_append(network_queue *queue, GString *s) {
queue->len += s->len;
g_queue_push_tail(queue->chunks, s);
return 0;
}
/**
* get a string from the head of the queue and leave the queue unchanged
*
* @param queue the queue to read from
* @param peek_len bytes to collect
* @param dest GString to write it. If NULL, we allow a new one and return it
* @return NULL if not enough data
* if dest is not NULL, dest, otherwise a new GString containing the data
*/
GString *network_queue_peek_string(network_queue *queue, gsize peek_len, GString *dest) {
gsize we_want = peek_len;
GList *node;
/* TODO: convert to DTrace probe
g_debug("[%s] looking for %d bytes, queue has %d", G_STRLOC, peek_len, queue->len); */
if (queue->len < peek_len) {
return NULL;
}
if (!dest) {
/* no define */
dest = g_string_sized_new(peek_len);
}
g_assert_cmpint(dest->allocated_len, >, peek_len);
for (node = queue->chunks->head; node && we_want; node = node->next) {
GString *chunk = node->data;
if (node == queue->chunks->head) {
gsize we_have = we_want < (chunk->len - queue->offset) ? we_want : (chunk->len - queue->offset);
g_string_append_len(dest, chunk->str + queue->offset, we_have);
we_want -= we_have;
} else {
gsize we_have = we_want < chunk->len ? we_want : chunk->len;
g_string_append_len(dest, chunk->str, we_have);
we_want -= we_have;
}
}
return dest;
}
/**
* get a string from the head of the queue and remove the chunks from the queue
*/
GString *network_queue_pop_string(network_queue *queue, gsize steal_len, GString *dest) {
gsize we_want = steal_len;
GString *chunk;
if (queue->len < steal_len) {
return NULL;
}
while ((chunk = g_queue_peek_head(queue->chunks))) {
gsize we_have = we_want < (chunk->len - queue->offset) ? we_want : (chunk->len - queue->offset);
if (!dest && (queue->offset == 0) && (chunk->len == steal_len)) {
/* optimize the common case that we want to have to full chunk
*
* if dest is null, we can remove the GString from the queue and return it directly without
* copying it
*/
dest = g_queue_pop_head(queue->chunks);
queue->len -= we_have;
return dest;
}
if (!dest) {
/* if we don't have a dest-buffer yet, create one */
dest = g_string_sized_new(steal_len);
}
g_string_append_len(dest, chunk->str + queue->offset, we_have);
queue->offset += we_have;
queue->len -= we_have;
we_want -= we_have;
if (chunk->len == queue->offset) {
/* the chunk is done, remove it */
g_string_free(g_queue_pop_head(queue->chunks), TRUE);
queue->offset = 0;
} else {
break;
}
}
return dest;
}
|