summaryrefslogtreecommitdiffstats
path: root/ctdb/tests/src/ctdb_io_test.c
blob: b035342aa655348f7a229c2fcc91ef3619d3d285 (plain)
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
/*
   ctdb_io tests

   Copyright (C) Christof Schmitt 2019

   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 "replace.h"
#include "system/filesys.h"

#include <assert.h>

#include "common/ctdb_io.c"

void ctdb_set_error(struct ctdb_context *ctdb, const char *fmt, ...)
{
	va_list ap;
	va_start(ap, fmt);
	vprintf(fmt, ap);
	va_end(ap);
	assert(false);
}

static void test_setup(ctdb_queue_cb_fn_t cb,
		       int *pfd,
		       struct ctdb_context **pctdb,
		       struct ctdb_queue **pqueue)
{
	int pipefd[2], ret;
	struct ctdb_context *ctdb;
	struct ctdb_queue *queue;

	ret = pipe(pipefd);
	assert(ret == 0);

	ctdb = talloc_zero(NULL, struct ctdb_context);
	assert(ctdb != NULL);

	ctdb->ev = tevent_context_init(NULL);

	queue = ctdb_queue_setup(ctdb, ctdb, pipefd[0], 0, cb,
				 NULL, "test queue");
	assert(queue != NULL);

	*pctdb = ctdb;
	*pfd = pipefd[1];
	if (pqueue != NULL) {
		*pqueue = queue;
	}
}

static const size_t test1_req_len = 8;
static const char *test1_req = "abcdefgh";

static void test1_callback(uint8_t *data, size_t length, void *private_data)
{
	uint32_t len;

	len = *(uint32_t *)data;
	assert(len == sizeof(uint32_t) + test1_req_len);

	assert(length == sizeof(uint32_t) + test1_req_len);
	assert(memcmp(data  + sizeof(len), test1_req, test1_req_len) == 0);
}

static void test1(void)
{
	struct ctdb_context *ctdb;
	int fd;
	ssize_t ret;
	uint32_t pkt_size;

	test_setup(test1_callback, &fd, &ctdb, NULL);

	pkt_size = sizeof(uint32_t) + test1_req_len;
	ret = write(fd, &pkt_size, sizeof(pkt_size));
	assert(ret != -1 && (size_t)ret == sizeof(pkt_size));

	ret = write(fd, test1_req, test1_req_len);
	assert(ret != -1 && (size_t)ret == test1_req_len);

	tevent_loop_once(ctdb->ev);

	TALLOC_FREE(ctdb);
}

static const size_t test2_req_len[] = { 900, 24, 600 };

static int test2_cb_num = 0;

static void test2_callback(uint8_t *data, size_t length, void *private_data)
{
	uint32_t len;

	len = *(uint32_t *)data;
	assert(len == sizeof(uint32_t) + test2_req_len[test2_cb_num]);
	assert(length == sizeof(uint32_t) + test2_req_len[test2_cb_num]);

	test2_cb_num++;
}

static void test2(void)
{
	struct ctdb_context *ctdb;
	int fd;
	ssize_t ret;
	size_t i;
	uint32_t pkt_size;
	char req[1024] = { 0 };

	for (i = 0; i < sizeof(req); i++) {
		req[i] = i % CHAR_MAX;
	}

	test_setup(test2_callback, &fd, &ctdb, NULL);

	/*
	 * request 0
	 */

	pkt_size = sizeof(uint32_t) + test2_req_len[0];
	ret = write(fd, &pkt_size, sizeof(pkt_size));
	assert(ret != -1 && (size_t)ret == sizeof(pkt_size));

	ret = write(fd, req, test2_req_len[0]);
	assert(ret != -1 && (size_t)ret == test2_req_len[0]);

	/*
	 * request 1
	 */
	pkt_size = sizeof(uint32_t) + test2_req_len[1];
	ret = write(fd, &pkt_size, sizeof(pkt_size));
	assert(ret != -1 && (size_t)ret == sizeof(pkt_size));

	/*
	 * Omit the last byte to avoid buffer processing.
	 */
	ret = write(fd, req, test2_req_len[1] - 1);
	assert(ret != -1 && (size_t)ret == test2_req_len[1] - 1);

	tevent_loop_once(ctdb->ev);

	/*
	 * Write the missing byte now.
	 */
	ret = write(fd, &req[test2_req_len[1] - 1], 1);
	assert(ret != -1 && (size_t)ret == 1);

	/*
	 * request 2
	 */
	pkt_size = sizeof(uint32_t) + test2_req_len[2];
	ret = write(fd, &pkt_size, sizeof(pkt_size));
	assert(ret != -1 && (size_t)ret == sizeof(pkt_size));

	ret = write(fd, req, test2_req_len[2]);
	assert(ret != -1 && (size_t)ret == test2_req_len[2]);

	tevent_loop_once(ctdb->ev);
	tevent_loop_once(ctdb->ev);

	assert(test2_cb_num == 2);

	TALLOC_FREE(ctdb);
}

static void test_cb(uint8_t *data, size_t length, void *private_data)
{
	/* dummy handler, not verifying anything */
	TALLOC_FREE(data);
}

static void test3(void)
{
	struct ctdb_context *ctdb;
	struct ctdb_queue *queue;
	uint32_t pkt_size;
	char *request;
	size_t req_len;
	int fd;
	ssize_t ret;

	test_setup(test_cb, &fd, &ctdb, &queue);
	request = talloc_zero_size(queue, queue->buffer_size);

	/*
	 * calculate a request length which will fit into the buffer
	 * but not twice. Because we need to write the size integer
	 * as well (4-bytes) we're guaranteed that no 2 packets will fit.
	 */
	req_len = queue->buffer_size >> 1;

	/* writing first packet */
	pkt_size = sizeof(uint32_t) + req_len;

	ret = write(fd, &pkt_size, sizeof(pkt_size));
	assert(ret != -1 && (size_t)ret == sizeof(pkt_size));

	ret = write(fd, request, req_len);
	assert(ret != -1 && (size_t)ret == req_len);

	/* writing second, incomplete packet */
	pkt_size = sizeof(uint32_t) + req_len;

	ret = write(fd, &pkt_size, sizeof(pkt_size));
	assert(ret != -1 && (size_t)ret == sizeof(pkt_size));

	ret = write(fd, request, req_len >> 1);
	assert(ret != -1 && (size_t)ret == req_len >> 1);

	/* process...only 1st packet can be processed */
	tevent_loop_once(ctdb->ev);

	/* we should see a progressed offset of req_len + sizeof(pkt_size) */
	assert(queue->buffer.offset == req_len + sizeof(pkt_size));

	/* writing another few bytes of the still incomplete packet */
	ret = write(fd, request, (req_len >> 1) - 1);
	assert(ret != -1 && (size_t)ret == (req_len >> 1) - 1);

	/*
	 * the packet is still incomplete and cannot be processed
	 * but the packet data had to be moved in the buffer in order
	 * to fetch the new 199 bytes -> offset must be 0 now.
	 */
	tevent_loop_once(ctdb->ev);
	/*
	 * needs to be called twice as an incomplete packet
	 * does not trigger a schedule_immediate
	 */
	tevent_loop_once(ctdb->ev);

	assert(queue->buffer.offset == 0);

	TALLOC_FREE(ctdb);
}

static void test4(void)
{
	struct ctdb_context *ctdb;
	struct ctdb_queue *queue;
	uint32_t pkt_size;
	char *request;
	size_t req_len, half_buf_size;
	int fd;
	ssize_t ret;

	test_setup(test_cb, &fd, &ctdb, &queue);

	req_len = queue->buffer_size << 1; /* double the buffer size */
	request = talloc_zero_size(queue, req_len);

	/* writing first part of packet exceeding standard buffer size */
	pkt_size = sizeof(uint32_t) + req_len;

	ret = write(fd, &pkt_size, sizeof(pkt_size));
	assert(ret != -1 && (size_t)ret == sizeof(pkt_size));

	half_buf_size = queue->buffer_size >> 1;

	ret = write(fd, request, req_len - half_buf_size);
	assert(ret != -1 && (size_t)ret == req_len - half_buf_size);

	/*
	 * process...
	 * this needs to be done to have things changed
	 */
	tevent_loop_once(ctdb->ev);
	/*
	 * needs to be called twice as an initial incomplete packet
	 * does not trigger a schedule_immediate
	 */
	tevent_loop_once(ctdb->ev);

	/* the buffer should be resized to packet size now */
	assert(queue->buffer.size == pkt_size);

	/* writing remaining data */
	ret = write(fd, request, half_buf_size);
	assert(ret != -1 && (size_t)ret == half_buf_size);

	/* process... */
	tevent_loop_once(ctdb->ev);

	/*
	 * the buffer was increased beyond its standard size.
	 * once packet got processed, the buffer has to be free'd
	 * and will be re-allocated with standard size on new request arrival.
	 */

	assert(queue->buffer.size == 0);

	/* writing new packet to verify standard buffer size */
	pkt_size = sizeof(uint32_t) + half_buf_size;

	ret = write(fd, &pkt_size, sizeof(pkt_size));
	assert(ret != -1 && (size_t)ret == sizeof(pkt_size));

	ret = write(fd, request, half_buf_size);
	assert(ret != -1 && (size_t)ret == half_buf_size);

	/* process... */
	tevent_loop_once(ctdb->ev);

	/* back to standard buffer size */
	assert(queue->buffer.size == queue->buffer_size);

	TALLOC_FREE(ctdb);
}

int main(int argc, const char **argv)
{
	int num;

	if (argc != 2) {
		fprintf(stderr, "%s <testnum>\n", argv[0]);
		exit(1);
	}


	num = atoi(argv[1]);
	switch (num) {
	case 1:
		test1();
		break;

	case 2:
		test2();
		break;

	case 3:
		test3();
		break;

	case 4:
		test4();
		break;

	default:
		fprintf(stderr, "Unknown test number %s\n", argv[1]);
	}

	return 0;
}