Skip to content

Commit

Permalink
Fix roundrobin assignor for asymmetrical subscriptions (#3159)
Browse files Browse the repository at this point in the history
The roundrobin partition assignment strategy could get stuck in an
endless loop or generate uneven assignments in case the group members
had asymmetric subscriptions (e.g., c1 subscribes to t1,t2 while c2
subscribes to t2,t3).
  • Loading branch information
edenhill committed Dec 10, 2020
1 parent 9d522ad commit bc75f28
Show file tree
Hide file tree
Showing 6 changed files with 200 additions and 5 deletions.
4 changes: 4 additions & 0 deletions CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -54,6 +54,10 @@ and the sticky consumer group partition assignor.
cgrp states (@gridaphobe, #3127).
* Fix possible null dereference in `Message::errstr()` (#3140).
* Partition fetch state was not set to STOPPED if OffsetCommit failed.
* The `roundrobin` partition assignment strategy could get stuck in an
endless loop or generate uneven assignments in case the group members
had asymmetric subscriptions (e.g., c1 subscribes to t1,t2 while c2
subscribes to t2,t3). (#3159)

# librdkafka v1.5.2

Expand Down
5 changes: 2 additions & 3 deletions src/rdkafka_roundrobin_assignor.c
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@
* The roundrobin assignor lays out all the available partitions and all the
* available consumers. It then proceeds to do a roundrobin assignment from
* partition to consumer. If the subscriptions of all consumer instances are
* identical, then the partitions will be uniformly distributed. (i.e., the
* identical, then the partitions will be uniformly distributed. (i.e., the
* partition ownership counts will be within a delta of exactly one across all
* consumers.)
*
Expand Down Expand Up @@ -85,8 +85,7 @@ rd_kafka_roundrobin_assignor_assign_cb (rd_kafka_t *rk,
/* Scan through members until we find one with a
* subscription to this topic. */
do {
next = (next+1) %
rd_list_cnt(&eligible_topic->members);
next = (next+1) % member_cnt;
} while (!rd_kafka_group_member_find_subscription(
rk, &members[next],
eligible_topic->metadata->topic));
Expand Down
186 changes: 186 additions & 0 deletions tests/0120-asymmetric_subscription.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,186 @@
/*
* librdkafka - Apache Kafka C library
*
* Copyright (c) 2020, 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


/**
* @brief Verify proper assignment for asymmetrical subscriptions.
*/
static void do_test_asymmetric (const char *assignor, const char *bootstraps) {
rd_kafka_conf_t *conf;
#define _C_CNT 3
rd_kafka_t *c[_C_CNT];
#define _S_CNT 2 /* max subscription count per consumer */
const char *topics[_C_CNT][_S_CNT] = {
/* c0 */ { "t1", "t2" },
/* c1 */ { "t2", "t3" },
/* c2 */ { "t4" },
};
struct {
const char *topic;
const int cnt;
int seen;
} expect[_C_CNT][_S_CNT] = {
/* c0 */
{
{ "t1", _PART_CNT },
{ "t2", _PART_CNT/2 },
},
/* c1 */
{
{ "t2", _PART_CNT/2 },
{ "t3", _PART_CNT },
},
/* c2 */
{
{ "t4", _PART_CNT },
},
};
const char *groupid = assignor;
int i;

SUB_TEST_QUICK("%s assignor", assignor);

test_conf_init(&conf, NULL, 30);
test_conf_set(conf, "bootstrap.servers", bootstraps);
test_conf_set(conf, "partition.assignment.strategy", assignor);

for (i = 0 ; i < _C_CNT ; i++) {
char name[16];
rd_kafka_topic_partition_list_t *tlist =
rd_kafka_topic_partition_list_new(2);
int j;

rd_snprintf(name, sizeof(name), "c%d", i);
test_conf_set(conf, "client.id", name);

for (j = 0 ; j < _S_CNT && topics[i][j] ; j++)
rd_kafka_topic_partition_list_add(
tlist, topics[i][j], RD_KAFKA_PARTITION_UA);

c[i] = test_create_consumer(groupid, NULL,
rd_kafka_conf_dup(conf), NULL);

TEST_CALL_ERR__(rd_kafka_subscribe(c[i], tlist));

rd_kafka_topic_partition_list_destroy(tlist);
}

rd_kafka_conf_destroy(conf);


/* Await assignments for all consumers */
for (i = 0 ; i < _C_CNT ; i++)
test_consumer_wait_assignment(c[i]);

/* All have assignments, grab them. */
for (i = 0 ; i < _C_CNT ; i++) {
int j;
int p;
rd_kafka_topic_partition_list_t *assignment;

TEST_CALL_ERR__(rd_kafka_assignment(c[i], &assignment));

TEST_ASSERT(assignment, "No assignment for %s",
rd_kafka_name(c[i]));

for (p = 0 ; p < assignment->cnt ; p++) {
const rd_kafka_topic_partition_t *part =
&assignment->elems[p];
rd_bool_t found = rd_false;

for (j = 0 ; j < _S_CNT && expect[i][j].topic ; j++) {
if (!strcmp(part->topic, expect[i][j].topic)) {
expect[i][j].seen++;
found = rd_true;
break;
}
}

TEST_ASSERT(found,
"%s was assigned unexpected topic %s",
rd_kafka_name(c[i]), part->topic);

}

for (j = 0 ; j < _S_CNT && expect[i][j].topic ; j++) {
TEST_ASSERT(expect[i][j].seen == expect[i][j].cnt,
"%s expected %d assigned partitions "
"for %s, not %d",
rd_kafka_name(c[i]),
expect[i][j].cnt,
expect[i][j].topic,
expect[i][j].seen);
}

rd_kafka_topic_partition_list_destroy(assignment);
}


for (i = 0 ; i < _C_CNT ; i++) {
if (strcmp(assignor, "range") && (i & 1) == 0)
test_consumer_close(c[i]);
rd_kafka_destroy(c[i]);
}


SUB_TEST_PASS();
}


int main_0120_asymmetric_subscription (int argc, char **argv) {
const char *bootstraps;
rd_kafka_mock_cluster_t *mcluster;

if (test_needs_auth()) {
TEST_SKIP("Mock cluster does not support SSL/SASL\n");
return 0;
}

mcluster = test_mock_cluster_new(3, &bootstraps);


/* Create topics */
rd_kafka_mock_topic_create(mcluster, "t1", _PART_CNT, 1);
rd_kafka_mock_topic_create(mcluster, "t2", _PART_CNT, 1);
rd_kafka_mock_topic_create(mcluster, "t3", _PART_CNT, 1);
rd_kafka_mock_topic_create(mcluster, "t4", _PART_CNT, 1);


do_test_asymmetric("roundrobin", bootstraps);
do_test_asymmetric("range", bootstraps);
do_test_asymmetric("cooperative-sticky", bootstraps);

test_mock_cluster_destroy(mcluster);

return 0;
}
1 change: 1 addition & 0 deletions tests/CMakeLists.txt
Original file line number Diff line number Diff line change
Expand Up @@ -111,6 +111,7 @@ set(
0117-mock_errors.c
0118-commit_rebalance.c
0119-consumer_auth.cpp
0120-asymmetric_subscription.c
8000-idle.cpp
test.c
testcpp.cpp
Expand Down
8 changes: 6 additions & 2 deletions tests/test.c
Original file line number Diff line number Diff line change
Expand Up @@ -228,6 +228,7 @@ _TEST_DECL(0116_kafkaconsumer_close);
_TEST_DECL(0117_mock_errors);
_TEST_DECL(0118_commit_rebalance);
_TEST_DECL(0119_consumer_auth);
_TEST_DECL(0120_asymmetric_subscription);

/* Manual tests */
_TEST_DECL(8000_idle);
Expand Down Expand Up @@ -426,6 +427,7 @@ struct test tests[] = {
_TEST(0117_mock_errors, TEST_F_LOCAL),
_TEST(0118_commit_rebalance, 0),
_TEST(0119_consumer_auth, 0, TEST_BRKVER(2,1,0,0)),
_TEST(0120_asymmetric_subscription, TEST_F_LOCAL),

/* Manual tests */
_TEST(8000_idle, TEST_F_MANUAL),
Expand Down Expand Up @@ -1886,7 +1888,8 @@ rd_kafka_t *test_create_handle (int mode, rd_kafka_conf_t *conf) {
test_socket_enable(conf);
#endif
} else {
test_conf_set(conf, "client.id", test_curr->name);
if (!strcmp(test_conf_get(conf, "client.id"), "rdkafka"))
test_conf_set(conf, "client.id", test_curr->name);
}


Expand Down Expand Up @@ -2599,7 +2602,8 @@ void test_consumer_wait_assignment (rd_kafka_t *rk) {
test_consumer_poll_once(rk, NULL, 1000);
}

TEST_SAY("Assignment (%d partition(s)): ", assignment->cnt);
TEST_SAY("%s: Assignment (%d partition(s)): ",
rd_kafka_name(rk), assignment->cnt);
for (i = 0 ; i < assignment->cnt ; i++)
TEST_SAY0("%s%s[%"PRId32"]",
i == 0 ? "" : ", ",
Expand Down
1 change: 1 addition & 0 deletions win32/tests/tests.vcxproj
Original file line number Diff line number Diff line change
Expand Up @@ -201,6 +201,7 @@
<ClCompile Include="..\..\tests\0117-mock_errors.c" />
<ClCompile Include="..\..\tests\0118-commit_rebalance.c" />
<ClCompile Include="..\..\tests\0119-consumer_auth.cpp" />
<ClCompile Include="..\..\tests\0120-asymmetric_subscription.c" />
<ClCompile Include="..\..\tests\8000-idle.cpp" />
<ClCompile Include="..\..\tests\test.c" />
<ClCompile Include="..\..\tests\testcpp.cpp" />
Expand Down

0 comments on commit bc75f28

Please sign in to comment.