forked from confluentinc/librdkafka
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0132-strategy_ordering.c
179 lines (143 loc) · 7.28 KB
/
0132-strategy_ordering.c
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
/*
* librdkafka - Apache Kafka C library
*
* Copyright (c) 2022, Magnus Edenhill
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include "test.h"
#define _PART_CNT 4
static void verify_roundrobin_assignment(rd_kafka_t *c[]) {
rd_kafka_topic_partition_list_t *assignment1;
rd_kafka_topic_partition_list_t *assignment2;
TEST_CALL_ERR__(rd_kafka_assignment(c[0], &assignment1));
TEST_ASSERT(assignment1->cnt == _PART_CNT / 2,
"Roundrobin: Assignment partitions for %s"
"is %d, but the expected is %d\n",
rd_kafka_name(c[0]), assignment1->cnt, _PART_CNT / 2);
TEST_ASSERT(assignment1->elems[0].partition == 0,
"Roundrobin: First assignment partition for %s"
"is %d, but the expectation is %d\n",
rd_kafka_name(c[0]), assignment1->elems[0].partition, 0);
TEST_ASSERT(assignment1->elems[1].partition == 2,
"Roundrobin: Second assignment partition for %s"
"is %d, but the expectation is %d\n",
rd_kafka_name(c[0]), assignment1->elems[1].partition, 2);
TEST_CALL_ERR__(rd_kafka_assignment(c[1], &assignment2));
TEST_ASSERT(assignment2->cnt == _PART_CNT / 2,
"Roundrobin: Assignment partitions for %s"
"is %d, but the expected is %d\n",
rd_kafka_name(c[1]), assignment2->cnt, _PART_CNT / 2);
TEST_ASSERT(assignment2->elems[0].partition == 1,
"Roundrobin: First assignment partition for %s"
"is %d, but the expectation is %d\n",
rd_kafka_name(c[1]), assignment2->elems[0].partition, 1);
TEST_ASSERT(assignment2->elems[1].partition == 3,
"Roundrobin: Second assignment partition for %s"
"is %d, but the expectation is %d\n",
rd_kafka_name(c[1]), assignment2->elems[1].partition, 3);
rd_kafka_topic_partition_list_destroy(assignment1);
rd_kafka_topic_partition_list_destroy(assignment2);
}
static void verify_range_assignment(rd_kafka_t *c[]) {
rd_kafka_topic_partition_list_t *assignment1;
rd_kafka_topic_partition_list_t *assignment2;
TEST_CALL_ERR__(rd_kafka_assignment(c[0], &assignment1));
TEST_ASSERT(assignment1->cnt == _PART_CNT / 2,
"Range: Assignment partition for %s"
"is %d, but the expected is %d\n",
rd_kafka_name(c[0]), assignment1->cnt, _PART_CNT / 2);
TEST_ASSERT(assignment1->elems[0].partition == 0,
"Range: First assignment partition for %s"
"is %d, but the expectation is %d\n",
rd_kafka_name(c[0]), assignment1->elems[0].partition, 0);
TEST_ASSERT(assignment1->elems[1].partition == 1,
"Range: Second assignment partition for %s"
"is %d, but the expectation is %d\n",
rd_kafka_name(c[0]), assignment1->elems[1].partition, 1);
TEST_CALL_ERR__(rd_kafka_assignment(c[1], &assignment2));
TEST_ASSERT(assignment2->cnt == _PART_CNT / 2,
"Range: Assignment partition for %s"
"is %d, but the expected is %d\n",
rd_kafka_name(c[1]), assignment2->cnt, _PART_CNT / 2);
TEST_ASSERT(assignment2->elems[0].partition == 2,
"Range: First assignment partition for %s"
"is %d, but the expectation is %d\n",
rd_kafka_name(c[1]), assignment2->elems[0].partition, 2);
TEST_ASSERT(assignment2->elems[1].partition == 3,
"Range: Second assignment partition for %s"
"is %d, but the expectation is %d\n",
rd_kafka_name(c[1]), assignment2->elems[1].partition, 3);
rd_kafka_topic_partition_list_destroy(assignment1);
rd_kafka_topic_partition_list_destroy(assignment2);
}
static void do_test_strategy_ordering(const char *assignor,
const char *expected_assignor) {
rd_kafka_conf_t *conf;
#define _C_CNT 2
rd_kafka_t *c[_C_CNT];
const char *topic;
const int msgcnt = 100;
int i;
uint64_t testid;
SUB_TEST("partition.assignment.strategy = %s", assignor);
testid = test_id_generate();
topic = test_mk_topic_name("0132-strategy_ordering", 1);
test_create_topic_wait_exists(NULL, topic, _PART_CNT, 1, 5000);
test_produce_msgs_easy(topic, testid, RD_KAFKA_PARTITION_UA, msgcnt);
test_conf_init(&conf, NULL, 30);
test_conf_set(conf, "partition.assignment.strategy", assignor);
for (i = 0; i < _C_CNT; i++) {
char name[16];
rd_snprintf(name, sizeof(name), "c%d", i);
test_conf_set(conf, "client.id", name);
c[i] = test_create_consumer(assignor, NULL,
rd_kafka_conf_dup(conf), NULL);
test_consumer_subscribe(c[i], topic);
}
rd_kafka_conf_destroy(conf);
/* Await assignments for all consumers */
for (i = 0; i < _C_CNT; i++) {
test_consumer_wait_assignment(c[i], rd_true);
}
if (!strcmp(expected_assignor, "range"))
verify_range_assignment(c);
else
verify_roundrobin_assignment(c);
for (i = 0; i < _C_CNT; i++) {
test_consumer_close(c[i]);
rd_kafka_destroy(c[i]);
}
SUB_TEST_PASS();
}
int main_0132_strategy_ordering(int argc, char **argv) {
if (!test_consumer_group_protocol_classic()) {
TEST_SKIP(
"Test meaningful only with classic librdkafka"
" assignors\n");
return 0;
}
do_test_strategy_ordering("roundrobin,range", "roundrobin");
do_test_strategy_ordering("range,roundrobin", "range");
return 0;
}