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
|
/*
* librdkafka - Apache Kafka C library
*
* Copyright (c) 2012-2015, 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 <iostream>
#include "testcpp.h"
/**
* Test offset_for_times (KIP-79): time-based offset lookups.
*/
static int verify_offset(const RdKafka::TopicPartition *tp,
int64_t timestamp,
int64_t exp_offset,
RdKafka::ErrorCode exp_err) {
int fails = 0;
if (tp->err() != exp_err) {
Test::FailLater(tostr()
<< " " << tp->topic() << " [" << tp->partition() << "] "
<< "expected error " << RdKafka::err2str(exp_err)
<< ", got " << RdKafka::err2str(tp->err()) << "\n");
fails++;
}
if (!exp_err && tp->offset() != exp_offset) {
Test::FailLater(tostr()
<< " " << tp->topic() << " [" << tp->partition() << "] "
<< "expected offset " << exp_offset << " for timestamp "
<< timestamp << ", got " << tp->offset() << "\n");
fails++;
}
return fails;
}
static void test_offset_time(void) {
std::vector<RdKafka::TopicPartition *> query_parts;
std::string topic = Test::mk_topic_name("0054-offset_time", 1);
RdKafka::Conf *conf, *tconf;
int64_t timestamps[] = {
/* timestamp, expected offset */
1234,
0,
999999999999,
1,
};
const int timestamp_cnt = 2;
int fails = 0;
std::string errstr;
Test::conf_init(&conf, &tconf, 0);
/* Need acks=all to make sure OffsetRequest correctly reads fully
* written Produce record. */
Test::conf_set(tconf, "acks", "all");
Test::conf_set(conf, "api.version.request", "true");
conf->set("dr_cb", &Test::DrCb, errstr);
conf->set("default_topic_conf", tconf, errstr);
RdKafka::Producer *p = RdKafka::Producer::create(conf, errstr);
if (!p)
Test::Fail("Failed to create Producer: " + errstr);
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 97, timestamps[0]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 98, timestamps[0]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 99, timestamps[0]));
/* First query timestamps before topic exists, should fail. */
Test::Say("Attempting first offsetsForTimes() query (should fail)\n");
RdKafka::ErrorCode err = p->offsetsForTimes(query_parts, tmout_multip(10000));
Test::Say("offsetsForTimes #1 with non-existing partitions returned " +
RdKafka::err2str(err) + "\n");
Test::print_TopicPartitions("offsetsForTimes #1", query_parts);
if (err != RdKafka::ERR__UNKNOWN_PARTITION)
Test::Fail(
"offsetsForTimes #1 should have failed with UNKNOWN_PARTITION, "
"not " +
RdKafka::err2str(err));
Test::Say("Producing to " + topic + "\n");
for (int partition = 0; partition < 2; partition++) {
for (int ti = 0; ti < timestamp_cnt * 2; ti += 2) {
err = p->produce(topic, partition, RdKafka::Producer::RK_MSG_COPY,
(void *)topic.c_str(), topic.size(), NULL, 0,
timestamps[ti], NULL);
if (err != RdKafka::ERR_NO_ERROR)
Test::Fail("Produce failed: " + RdKafka::err2str(err));
}
}
if (p->flush(tmout_multip(5000)) != 0)
Test::Fail("Not all messages flushed");
for (int ti = 0; ti < timestamp_cnt * 2; ti += 2) {
RdKafka::TopicPartition::destroy(query_parts);
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 0, timestamps[ti]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 1, timestamps[ti]));
Test::Say(tostr() << "Attempting offsetsForTimes() for timestamp "
<< timestamps[ti] << "\n");
err = p->offsetsForTimes(query_parts, tmout_multip(5000));
Test::print_TopicPartitions("offsetsForTimes", query_parts);
if (err != RdKafka::ERR_NO_ERROR)
Test::Fail("offsetsForTimes failed: " + RdKafka::err2str(err));
fails += verify_offset(query_parts[0], timestamps[ti], timestamps[ti + 1],
RdKafka::ERR_NO_ERROR);
fails += verify_offset(query_parts[1], timestamps[ti], timestamps[ti + 1],
RdKafka::ERR_NO_ERROR);
}
/* repeat test with -1 timeout */
for (int ti = 0; ti < timestamp_cnt * 2; ti += 2) {
RdKafka::TopicPartition::destroy(query_parts);
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 0, timestamps[ti]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 1, timestamps[ti]));
Test::Say(tostr() << "Attempting offsetsForTimes() for timestamp "
<< timestamps[ti] << " with a timeout of -1\n");
err = p->offsetsForTimes(query_parts, -1);
Test::print_TopicPartitions("offsetsForTimes", query_parts);
if (err != RdKafka::ERR_NO_ERROR)
Test::Fail("offsetsForTimes failed: " + RdKafka::err2str(err));
fails += verify_offset(query_parts[0], timestamps[ti], timestamps[ti + 1],
RdKafka::ERR_NO_ERROR);
fails += verify_offset(query_parts[1], timestamps[ti], timestamps[ti + 1],
RdKafka::ERR_NO_ERROR);
}
/* And a negative test with a request that should timeout instantly. */
for (int ti = 0; ti < timestamp_cnt * 2; ti += 2) {
RdKafka::TopicPartition::destroy(query_parts);
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 0, timestamps[ti]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 1, timestamps[ti]));
Test::Say(tostr() << "Attempting offsetsForTimes() for timestamp "
<< timestamps[ti]
<< " with minimal timeout (should fail)\n");
err = p->offsetsForTimes(query_parts, 0);
Test::print_TopicPartitions("offsetsForTimes", query_parts);
if (err != RdKafka::ERR__TIMED_OUT)
Test::Fail(
"expected offsetsForTimes(timeout=0) to fail with TIMED_OUT, not " +
RdKafka::err2str(err));
}
/* Include non-existent partitions */
for (int ti = 0; ti < timestamp_cnt * 2; ti += 2) {
RdKafka::TopicPartition::destroy(query_parts);
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 0, timestamps[ti]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 1, timestamps[ti]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 2, timestamps[ti]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 20, timestamps[ti]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 3, timestamps[ti]));
query_parts.push_back(
RdKafka::TopicPartition::create(topic, 21, timestamps[ti]));
Test::Say("Attempting offsetsForTimes() with non-existent partitions\n");
err = p->offsetsForTimes(query_parts, -1);
Test::print_TopicPartitions("offsetsForTimes", query_parts);
if (err != RdKafka::ERR_NO_ERROR)
Test::Fail("expected offsetsForTimes(timeout=0) to succeed, not " +
RdKafka::err2str(err));
fails += verify_offset(query_parts[0], timestamps[ti], timestamps[ti + 1],
RdKafka::ERR_NO_ERROR);
fails += verify_offset(query_parts[1], timestamps[ti], timestamps[ti + 1],
RdKafka::ERR_NO_ERROR);
fails += verify_offset(query_parts[2], timestamps[ti], -1,
RdKafka::ERR_NO_ERROR);
fails += verify_offset(query_parts[3], timestamps[ti], -1,
RdKafka::ERR__UNKNOWN_PARTITION);
fails += verify_offset(query_parts[4], timestamps[ti], -1,
RdKafka::ERR_NO_ERROR);
fails += verify_offset(query_parts[5], timestamps[ti], -1,
RdKafka::ERR__UNKNOWN_PARTITION);
}
if (fails > 0)
Test::Fail(tostr() << "See " << fails << " previous error(s)");
RdKafka::TopicPartition::destroy(query_parts);
delete p;
delete conf;
delete tconf;
}
extern "C" {
int main_0054_offset_time(int argc, char **argv) {
test_offset_time();
return 0;
}
}
|
