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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
|
/**
* mds — A micro-display server
* Copyright © 2014 Mattias Andrée (maandree@member.fsf.org)
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include "mds-message.h"
#include "macros.h"
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <unistd.h>
#include <sys/socket.h>
/**
* Initialsie a message slot so that it can
* be used by `mds_message_read`.
*
* @param this Memory slot in which to store the new message
* @return Non-zero on error, errno will be set accordingly.
* Destroy the message on error.
*/
int mds_message_initialise(mds_message_t* this)
{
this->headers = NULL;
this->header_count = 0;
this->payload = NULL;
this->payload_size = 0;
this->payload_ptr = 0;
this->buffer_size = 128;
this->buffer_ptr = 0;
this->buffer = malloc(this->buffer_size * sizeof(char));
this->stage = 0;
if (this->buffer == NULL)
return -1;
return 0;
}
/**
* Release all resources in a message, should
* be done even if initialisation fails
*
* @param this The message
*/
void mds_message_destroy(mds_message_t* this)
{
if (this->headers != NULL)
{
size_t i;
for (i = 0; i < this->header_count; i++)
if (this->headers[i] != NULL)
free(this->headers[i]);
free(this->headers);
}
if (this->payload != NULL)
free(this->payload);
if (this->buffer != NULL)
free(this->buffer);
}
/**
* Read the next message from a file descriptor
*
* @param this Memory slot in which to store the new message
* @param fd The file descriptor
* @return Non-zero on error or interruption, errno will be
* set accordingly. Destroy the message on error,
* be aware that the reading could have been
* interrupted by a signal rather than canonical error.
* If -2 is returned errno will not have been set,
* -2 indicates that the message is malformated,
* which is a state that cannot be recovered from.
*/
int mds_message_read(mds_message_t* this, int fd)
{
size_t header_commit_buffer = 0;
/* If we are at stage 2, we are done and it is time to start over.
This is important because the function coul have been interrupted. */
if (this->stage == 2)
{
if (this->headers != NULL)
{
size_t i;
for (i = 0; i < this->header_count; i++)
if (this->headers[i] != NULL)
free(this->headers[i]);
free(this->headers);
}
this->header_count = 0;
if (this->payload != NULL)
free(this->payload);
this->payload_size = 0;
this->payload_ptr = 0;
this->stage = 0;
}
/* Read from file descriptor until we have a full message. */
for (;;)
{
size_t n, i;
ssize_t got;
char* p;
/* Stage 0: headers. */
if (this->stage == 0)
/* Read all headers that we have stored into the read buffer. */
while ((p = memchr(this->buffer, '\n', this->buffer_ptr)) != NULL)
{
size_t len = (size_t)(p - this->buffer) + 1;
char* header;
/* We have found an empty line, i.e. the end of the headers.*/
if (len == 0)
{
/* Remove the \n (end of empty line) we found from the buffer. */
memmove(this->buffer, this->buffer + 1, this->buffer_ptr -= 1);
/* Get the length of the payload. */
for (i = 0; i < this->header_count; i++)
if (strstr(this->headers[i], "Length: ") == this->headers[i])
{
/* Store the message length. */
header = this->headers[i] + strlen("Length: ");
this->payload_size = (size_t)atoll(header);
/* Do not except a length that is not correctly formated. */
for (; *header; header++)
if ((*header < '0') || ('9' < *header))
return -2; /* Malformated value, enters unrecoverable state. */
/* Stop searching for the ‘Length’ header, we have found and parsed it. */
break;
}
/* Allocate the payload buffer. */
if (this->payload_size > 0)
{
this->payload = malloc(this->payload_size * sizeof(char));
if (this->payload == NULL)
return -1;
}
/* Mark end of stage, next stage is getting the payload. */
this->stage = 1;
/* Stop searching for headers. */
break;
}
/* Head have found a header. */
/* One every eighth heaer found with this function call,
we prepare the header list for eight more headers so
that it does not need to be reallocated again and again. */
if (header_commit_buffer == 0)
{
header_commit_buffer = 8;
if (this->headers == NULL)
{
this->headers = malloc(header_commit_buffer * sizeof(char*));
if (this->headers == NULL)
return -1;
}
else
{
char** old_headers = this->headers;
n = this->header_count + header_commit_buffer;
this->headers = realloc(this->headers, n * sizeof(char*));
if (this->headers == NULL)
{
this->headers = old_headers;
return -1;
}
}
}
/* Allocat the header.*/
header = malloc(len * sizeof(char));
if (header == NULL)
return -1;
/* Copy the header data into the allocated header, */
memcpy(header, this->buffer, len);
/* and NUL-terminate it. */
header[len - 1] = '\0';
/* Remove the header data from the read buffer. */
memmove(this->buffer, this->buffer + len, this->buffer_ptr -= len);
/* Make sure the the header syntex is correct so the the
program does not need to care about it. */
if ((p = memchr(header, ':', len)) == NULL)
{
/* Buck you, rawmemchr should not segfault the program. */
free(header);
return -2;
}
if (p[1] != ' ') /* Also an invalid format. */
{
free(header);
return -2;
}
/* Store the header in the heaer list. */
this->headers[this->header_count++] = header;
header_commit_buffer -= 1;
}
/* Stage 1: payload. */
if ((this->stage == 1) && (this->payload_ptr > 0))
{
/* How much of the payload that has not yet been filled. */
size_t need = this->payload_size - this->payload_ptr;
if (this->buffer_ptr <= need)
/* If we have everything that we need, just copy it into the payload buffer. */
memcpy(this->payload + this->payload_ptr, this->buffer, this->buffer_ptr);
else
{
/* Otherwise, copy what we have, and remove it from the the read buffer. */
memcpy(this->payload + this->payload_ptr, this->buffer, need);
memmove(this->buffer, this->buffer + need, this->buffer_ptr - need);
}
/* Keep track of how much we have read. */
this->payload_ptr += this->buffer_ptr;
if (this->buffer_ptr <= need)
/* Reset the read pointer as the read buffer is empty now. */
this->buffer_ptr = 0;
else
/* But if we head left over data that is for the next message,
just move the pointer back as much as we read. (Which is
actually what we do even we did not have excess data.) */
this->buffer_ptr -= need;
/* If we have filled the payload, make the end of this stage,
i.e. that the message is complete, and return with success. */
if (this->payload_ptr == this->payload_size)
{
this->stage = 2;
return 0;
}
}
/* If stage 1 was not completed. */
/* Figure out how much space we have left in the read buffer. */
n = this->buffer_size - this->buffer_ptr;
/* If we do not have too much left, grow the buffer, */
if (n < 128)
{
char* old_buffer = this->buffer;
this->buffer_size <<= 1;
this->buffer = realloc(this->buffer, this->buffer_size * sizeof(char));
if (this->buffer == NULL)
{
this->buffer = old_buffer;
this->buffer_size >>= 1;
return -1;
}
/* and recalculate how much space we have left. */
n = this->buffer_size - this->buffer_ptr;
}
/* Then read from the file descriptor. */
errno = 0;
got = recv(fd, this->buffer + this->buffer_ptr, n, 0);
this->buffer_ptr += (size_t)(got < 0 ? 0 : got);
if (errno)
return -1;
}
}
/**
* Get the required allocation size for `data` of the
* function `mds_message_marshal`
*
* @param this The message
* @param include_buffer Whether buffer should be marshalled (state serialisation, not communication)
* @return The size of the message when marshalled
*/
size_t mds_message_marshal_size(mds_message_t* this, int include_buffer)
{
size_t rc = this->header_count + this->payload_size;
size_t i;
for (i = 0; i < this->header_count; i++)
rc += strlen(this->headers[i]);
rc *= sizeof(char);
rc += (include_buffer ? 4 : 2) * sizeof(size_t);
rc += (include_buffer ? 2 : 1) * sizeof(int);
return rc;
}
/**
* Marshal a message, this can be used both when serialising
* the servers state or to get the byte stream to send to
* the recipient of the message
*
* @param this The message
* @param data Output buffer for the marshalled data
* @param include_buffer Whether buffer should be marshalled (state serialisation, not communication)
*/
void mds_message_marshal(mds_message_t* this, char* data, int include_buffer)
{
size_t i, n;
buf_set_next(data, int, MDS_MESSAGE_T_VERSION);
buf_set_next(data, size_t, this->header_count);
buf_set_next(data, size_t, this->payload_size);
if (include_buffer)
{
buf_set_next(data, size_t, this->payload_ptr);
buf_set_next(data, size_t, this->buffer_ptr);
}
if (include_buffer)
{
buf_set_next(data, int, this->stage);
}
for (i = 0; i < this->header_count; i++)
{
n = strlen(this->headers[i]) + 1;
memcpy(data, this->headers[i], n * sizeof(char));
buf_next(data, char, n);
}
memcpy(data, this->payload, this->payload_size * sizeof(char));
if (include_buffer)
{
buf_next(data, char, this->payload_size);
memcpy(data, this->buffer, this->buffer_ptr * sizeof(char));
}
}
/**
* Unmarshal a message, it is assumed that the buffer is marshalled
*
* @param this Memory slot in which to store the new message
* @param data In buffer with the marshalled data
* @return Non-zero on error, errno will be set accordingly.
* Destroy the message on error.
*/
int mds_message_unmarshal(mds_message_t* this, char* data)
{
size_t i, n, header_count;
/* buf_get(data, int, 0, MDS_MESSAGE_T_VERSION); */
buf_next(data, int, 1);
this->header_count = 0;
buf_get_next(data, size_t, header_count);
buf_get_next(data, size_t, this->payload_size);
buf_get_next(data, size_t, this->payload_ptr);
buf_get_next(data, size_t, this->buffer_size = this->buffer_ptr);
/* Make sure that the pointers are NULL so that they are
not freed without being allocated when the message is
destroyed if this function fails. */
this->headers = NULL;
this->payload = NULL;
this->buffer = NULL;
buf_get_next(data, int, this->stage);
/* To 2-power-multiple of 128 bytes. */
this->buffer_size >>= 7;
if (this->buffer_size == 0)
this->buffer_size = 1;
else
{
this->buffer_size -= 1;
this->buffer_size |= this->buffer_size >> 1;
this->buffer_size |= this->buffer_size >> 2;
this->buffer_size |= this->buffer_size >> 4;
this->buffer_size |= this->buffer_size >> 8;
this->buffer_size |= this->buffer_size >> 16;
#if __WORDSIZE == 64
this->buffer_size |= this->buffer_size >> 32;
#endif
this->buffer_size += 1;
}
this->buffer_size <<= 7;
/* Allocate header list, payload and read buffer. */
if (header_count > 0)
{
this->headers = malloc(header_count * sizeof(char*));
if (this->headers == NULL)
return -1;
}
if (this->payload_size > 0)
{
this->payload = malloc(this->payload_size * sizeof(char));
if (this->payload == NULL)
return -1;
}
this->buffer = malloc(this->buffer_size * sizeof(char));
if (this->buffer == NULL)
return -1;
/* Fill the header list, payload and read buffer. */
for (i = 0; i < this->header_count; i++)
{
n = strlen(data) + 1;
this->headers[i] = malloc(n * sizeof(char));
if (this->headers[i] == NULL)
return -1;
memcpy(this->headers[i], data, n * sizeof(char));
buf_next(data, char, n);
this->header_count++;
}
memcpy(this->payload, data, this->payload_size * sizeof(char));
buf_next(data, char, this->payload_size);
memcpy(this->buffer, data, this->buffer_ptr * sizeof(char));
return 0;
}
|