-
Notifications
You must be signed in to change notification settings - Fork 3.2k
/
Copy pathrdkafka_partition.c
3638 lines (2919 loc) · 118 KB
/
rdkafka_partition.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
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
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* librdkafka - The Apache Kafka C/C++ library
*
* Copyright (c) 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 "rdkafka_int.h"
#include "rdkafka_topic.h"
#include "rdkafka_broker.h"
#include "rdkafka_request.h"
#include "rdkafka_offset.h"
#include "rdkafka_partition.h"
#include "rdregex.h"
#include "rdports.h" /* rd_qsort_r() */
const char *rd_kafka_fetch_states[] = {
"none",
"stopping",
"stopped",
"offset-query",
"offset-wait",
"active"
};
static rd_kafka_op_res_t
rd_kafka_toppar_op_serve (rd_kafka_t *rk,
rd_kafka_q_t *rkq, rd_kafka_op_t *rko,
rd_kafka_q_cb_type_t cb_type, void *opaque);
static void rd_kafka_toppar_offset_retry (rd_kafka_toppar_t *rktp,
int backoff_ms,
const char *reason);
static RD_INLINE int32_t
rd_kafka_toppar_version_new_barrier0 (rd_kafka_toppar_t *rktp,
const char *func, int line) {
int32_t version = rd_atomic32_add(&rktp->rktp_version, 1);
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "BARRIER",
"%s [%"PRId32"]: %s:%d: new version barrier v%"PRId32,
rktp->rktp_rkt->rkt_topic->str, rktp->rktp_partition,
func, line, version);
return version;
}
#define rd_kafka_toppar_version_new_barrier(rktp) \
rd_kafka_toppar_version_new_barrier0(rktp, __FUNCTION__, __LINE__)
/**
* Toppar based OffsetResponse handling.
* This is used for updating the low water mark for consumer lag.
*/
static void rd_kafka_toppar_lag_handle_Offset (rd_kafka_t *rk,
rd_kafka_broker_t *rkb,
rd_kafka_resp_err_t err,
rd_kafka_buf_t *rkbuf,
rd_kafka_buf_t *request,
void *opaque) {
shptr_rd_kafka_toppar_t *s_rktp = opaque;
rd_kafka_toppar_t *rktp = rd_kafka_toppar_s2i(s_rktp);
rd_kafka_topic_partition_list_t *offsets;
rd_kafka_topic_partition_t *rktpar;
offsets = rd_kafka_topic_partition_list_new(1);
/* Parse and return Offset */
err = rd_kafka_handle_Offset(rkb->rkb_rk, rkb, err,
rkbuf, request, offsets);
if (err == RD_KAFKA_RESP_ERR__IN_PROGRESS) {
rd_kafka_topic_partition_list_destroy(offsets);
return; /* Retrying */
}
if (!err && !(rktpar = rd_kafka_topic_partition_list_find(
offsets,
rktp->rktp_rkt->rkt_topic->str,
rktp->rktp_partition)))
err = RD_KAFKA_RESP_ERR__UNKNOWN_PARTITION;
if (!err) {
rd_kafka_toppar_lock(rktp);
rktp->rktp_lo_offset = rktpar->offset;
rd_kafka_toppar_unlock(rktp);
}
rd_kafka_topic_partition_list_destroy(offsets);
rktp->rktp_wait_consumer_lag_resp = 0;
rd_kafka_toppar_destroy(s_rktp); /* from request.opaque */
}
/**
* Request information from broker to keep track of consumer lag.
*
* Locality: toppar handle thread
*/
static void rd_kafka_toppar_consumer_lag_req (rd_kafka_toppar_t *rktp) {
rd_kafka_broker_t *rkb;
rd_kafka_topic_partition_list_t *partitions;
if (rktp->rktp_wait_consumer_lag_resp)
return; /* Previous request not finished yet */
rkb = rd_kafka_toppar_leader(rktp, 1/*proper brokers only*/);
if (!rkb)
return;
rktp->rktp_wait_consumer_lag_resp = 1;
partitions = rd_kafka_topic_partition_list_new(1);
rd_kafka_topic_partition_list_add(partitions,
rktp->rktp_rkt->rkt_topic->str,
rktp->rktp_partition)->offset =
RD_KAFKA_OFFSET_BEGINNING;
/* Ask for oldest offset. The newest offset is automatically
* propagated in FetchResponse.HighwaterMark. */
rd_kafka_OffsetRequest(rkb, partitions, 0,
RD_KAFKA_REPLYQ(rktp->rktp_ops, 0),
rd_kafka_toppar_lag_handle_Offset,
rd_kafka_toppar_keep(rktp));
rd_kafka_topic_partition_list_destroy(partitions);
rd_kafka_broker_destroy(rkb); /* from toppar_leader() */
}
/**
* Request earliest offset to measure consumer lag
*
* Locality: toppar handler thread
*/
static void rd_kafka_toppar_consumer_lag_tmr_cb (rd_kafka_timers_t *rkts,
void *arg) {
rd_kafka_toppar_t *rktp = arg;
rd_kafka_toppar_consumer_lag_req(rktp);
}
/**
* Add new partition to topic.
*
* Locks: rd_kafka_topic_wrlock() must be held.
* Locks: rd_kafka_wrlock() must be held.
*/
shptr_rd_kafka_toppar_t *rd_kafka_toppar_new0 (rd_kafka_itopic_t *rkt,
int32_t partition,
const char *func, int line) {
rd_kafka_toppar_t *rktp;
rktp = rd_calloc(1, sizeof(*rktp));
rktp->rktp_partition = partition;
rktp->rktp_rkt = rkt;
rktp->rktp_leader_id = -1;
/* Mark partition as unknown (does not exist) until we see the
* partition in topic metadata. */
if (partition != RD_KAFKA_PARTITION_UA)
rktp->rktp_flags |= RD_KAFKA_TOPPAR_F_UNKNOWN;
rktp->rktp_fetch_state = RD_KAFKA_TOPPAR_FETCH_NONE;
rktp->rktp_fetch_msg_max_bytes
= rkt->rkt_rk->rk_conf.fetch_msg_max_bytes;
rktp->rktp_offset_fp = NULL;
rd_kafka_offset_stats_reset(&rktp->rktp_offsets);
rd_kafka_offset_stats_reset(&rktp->rktp_offsets_fin);
rktp->rktp_hi_offset = RD_KAFKA_OFFSET_INVALID;
rktp->rktp_lo_offset = RD_KAFKA_OFFSET_INVALID;
rktp->rktp_query_offset = RD_KAFKA_OFFSET_INVALID;
rktp->rktp_next_offset = RD_KAFKA_OFFSET_INVALID;
rktp->rktp_last_next_offset = RD_KAFKA_OFFSET_INVALID;
rktp->rktp_app_offset = RD_KAFKA_OFFSET_INVALID;
rktp->rktp_stored_offset = RD_KAFKA_OFFSET_INVALID;
rktp->rktp_committing_offset = RD_KAFKA_OFFSET_INVALID;
rktp->rktp_committed_offset = RD_KAFKA_OFFSET_INVALID;
rd_kafka_msgq_init(&rktp->rktp_msgq);
rd_kafka_msgq_init(&rktp->rktp_xmit_msgq);
mtx_init(&rktp->rktp_lock, mtx_plain);
rd_refcnt_init(&rktp->rktp_refcnt, 0);
rktp->rktp_fetchq = rd_kafka_q_new(rkt->rkt_rk);
rktp->rktp_ops = rd_kafka_q_new(rkt->rkt_rk);
rktp->rktp_ops->rkq_serve = rd_kafka_toppar_op_serve;
rktp->rktp_ops->rkq_opaque = rktp;
rd_atomic32_init(&rktp->rktp_version, 1);
rktp->rktp_op_version = rd_atomic32_get(&rktp->rktp_version);
rd_atomic32_init(&rktp->rktp_msgs_inflight, 0);
rd_kafka_pid_reset(&rktp->rktp_eos.pid);
/* Consumer: If statistics is available we query the oldest offset
* of each partition.
* Since the oldest offset only moves on log retention, we cap this
* value on the low end to a reasonable value to avoid flooding
* the brokers with OffsetRequests when our statistics interval is low.
* FIXME: Use a global timer to collect offsets for all partitions */
if (rktp->rktp_rkt->rkt_rk->rk_conf.stats_interval_ms > 0 &&
rkt->rkt_rk->rk_type == RD_KAFKA_CONSUMER &&
rktp->rktp_partition != RD_KAFKA_PARTITION_UA) {
int intvl = rkt->rkt_rk->rk_conf.stats_interval_ms;
if (intvl < 10 * 1000 /* 10s */)
intvl = 10 * 1000;
rd_kafka_timer_start(&rkt->rkt_rk->rk_timers,
&rktp->rktp_consumer_lag_tmr,
intvl * 1000ll,
rd_kafka_toppar_consumer_lag_tmr_cb,
rktp);
}
rktp->rktp_s_rkt = rd_kafka_topic_keep(rkt);
rd_kafka_q_fwd_set(rktp->rktp_ops, rkt->rkt_rk->rk_ops);
rd_kafka_dbg(rkt->rkt_rk, TOPIC, "TOPPARNEW", "NEW %s [%"PRId32"] %p (at %s:%d)",
rkt->rkt_topic->str, rktp->rktp_partition, rktp,
func, line);
return rd_kafka_toppar_keep_src(func, line, rktp);
}
/**
* Removes a toppar from its duties, global lists, etc.
*
* Locks: rd_kafka_toppar_lock() MUST be held
*/
static void rd_kafka_toppar_remove (rd_kafka_toppar_t *rktp) {
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "TOPPARREMOVE",
"Removing toppar %s [%"PRId32"] %p",
rktp->rktp_rkt->rkt_topic->str, rktp->rktp_partition,
rktp);
rd_kafka_timer_stop(&rktp->rktp_rkt->rkt_rk->rk_timers,
&rktp->rktp_offset_query_tmr, 1/*lock*/);
rd_kafka_timer_stop(&rktp->rktp_rkt->rkt_rk->rk_timers,
&rktp->rktp_consumer_lag_tmr, 1/*lock*/);
rd_kafka_q_fwd_set(rktp->rktp_ops, NULL);
}
/**
* Final destructor for partition.
*/
void rd_kafka_toppar_destroy_final (rd_kafka_toppar_t *rktp) {
rd_kafka_toppar_remove(rktp);
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "DESTROY",
"%s [%"PRId32"]: %p DESTROY_FINAL",
rktp->rktp_rkt->rkt_topic->str,
rktp->rktp_partition, rktp);
/* Clear queues */
rd_kafka_assert(rktp->rktp_rkt->rkt_rk,
rd_kafka_msgq_len(&rktp->rktp_xmit_msgq) == 0);
rd_kafka_dr_msgq(rktp->rktp_rkt, &rktp->rktp_msgq,
RD_KAFKA_RESP_ERR__DESTROY);
rd_kafka_q_destroy_owner(rktp->rktp_fetchq);
rd_kafka_q_destroy_owner(rktp->rktp_ops);
rd_kafka_replyq_destroy(&rktp->rktp_replyq);
rd_kafka_topic_destroy0(rktp->rktp_s_rkt);
mtx_destroy(&rktp->rktp_lock);
rd_refcnt_destroy(&rktp->rktp_refcnt);
rd_free(rktp);
}
/**
* Set toppar fetching state.
*
* Locality: broker thread
* Locks: rd_kafka_toppar_lock() MUST be held.
*/
void rd_kafka_toppar_set_fetch_state (rd_kafka_toppar_t *rktp,
int fetch_state) {
rd_kafka_assert(NULL,
thrd_is_current(rktp->rktp_rkt->rkt_rk->rk_thread));
if ((int)rktp->rktp_fetch_state == fetch_state)
return;
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "PARTSTATE",
"Partition %.*s [%"PRId32"] changed fetch state %s -> %s",
RD_KAFKAP_STR_PR(rktp->rktp_rkt->rkt_topic),
rktp->rktp_partition,
rd_kafka_fetch_states[rktp->rktp_fetch_state],
rd_kafka_fetch_states[fetch_state]);
rktp->rktp_fetch_state = fetch_state;
if (fetch_state == RD_KAFKA_TOPPAR_FETCH_ACTIVE)
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk,
CONSUMER|RD_KAFKA_DBG_TOPIC,
"FETCH",
"Partition %.*s [%"PRId32"] start fetching "
"at offset %s",
RD_KAFKAP_STR_PR(rktp->rktp_rkt->rkt_topic),
rktp->rktp_partition,
rd_kafka_offset2str(rktp->rktp_next_offset));
}
/**
* Returns the appropriate toppar for a given rkt and partition.
* The returned toppar has increased refcnt and must be unreffed by calling
* rd_kafka_toppar_destroy().
* May return NULL.
*
* If 'ua_on_miss' is true the UA (unassigned) toppar is returned if
* 'partition' was not known locally, else NULL is returned.
*
* Locks: Caller must hold rd_kafka_topic_*lock()
*/
shptr_rd_kafka_toppar_t *rd_kafka_toppar_get0 (const char *func, int line,
const rd_kafka_itopic_t *rkt,
int32_t partition,
int ua_on_miss) {
shptr_rd_kafka_toppar_t *s_rktp;
if (partition >= 0 && partition < rkt->rkt_partition_cnt)
s_rktp = rkt->rkt_p[partition];
else if (partition == RD_KAFKA_PARTITION_UA || ua_on_miss)
s_rktp = rkt->rkt_ua;
else
return NULL;
if (s_rktp)
return rd_kafka_toppar_keep_src(func,line,
rd_kafka_toppar_s2i(s_rktp));
return NULL;
}
/**
* Same as rd_kafka_toppar_get() but no need for locking and
* looks up the topic first.
*
* Locality: any
* Locks: none
*/
shptr_rd_kafka_toppar_t *rd_kafka_toppar_get2 (rd_kafka_t *rk,
const char *topic,
int32_t partition,
int ua_on_miss,
int create_on_miss) {
shptr_rd_kafka_itopic_t *s_rkt;
rd_kafka_itopic_t *rkt;
shptr_rd_kafka_toppar_t *s_rktp;
rd_kafka_wrlock(rk);
/* Find or create topic */
if (unlikely(!(s_rkt = rd_kafka_topic_find(rk, topic, 0/*no-lock*/)))) {
if (!create_on_miss) {
rd_kafka_wrunlock(rk);
return NULL;
}
s_rkt = rd_kafka_topic_new0(rk, topic, NULL,
NULL, 0/*no-lock*/);
if (!s_rkt) {
rd_kafka_wrunlock(rk);
rd_kafka_log(rk, LOG_ERR, "TOPIC",
"Failed to create local topic \"%s\": %s",
topic, rd_strerror(errno));
return NULL;
}
}
rd_kafka_wrunlock(rk);
rkt = rd_kafka_topic_s2i(s_rkt);
rd_kafka_topic_wrlock(rkt);
s_rktp = rd_kafka_toppar_desired_add(rkt, partition);
rd_kafka_topic_wrunlock(rkt);
rd_kafka_topic_destroy0(s_rkt);
return s_rktp;
}
/**
* Returns a toppar if it is available in the cluster.
* '*errp' is set to the error-code if lookup fails.
*
* Locks: topic_*lock() MUST be held
*/
shptr_rd_kafka_toppar_t *
rd_kafka_toppar_get_avail (const rd_kafka_itopic_t *rkt,
int32_t partition, int ua_on_miss,
rd_kafka_resp_err_t *errp) {
shptr_rd_kafka_toppar_t *s_rktp;
switch (rkt->rkt_state)
{
case RD_KAFKA_TOPIC_S_UNKNOWN:
/* No metadata received from cluster yet.
* Put message in UA partition and re-run partitioner when
* cluster comes up. */
partition = RD_KAFKA_PARTITION_UA;
break;
case RD_KAFKA_TOPIC_S_NOTEXISTS:
/* Topic not found in cluster.
* Fail message immediately. */
*errp = RD_KAFKA_RESP_ERR__UNKNOWN_TOPIC;
return NULL;
case RD_KAFKA_TOPIC_S_EXISTS:
/* Topic exists in cluster. */
/* Topic exists but has no partitions.
* This is usually an transient state following the
* auto-creation of a topic. */
if (unlikely(rkt->rkt_partition_cnt == 0)) {
partition = RD_KAFKA_PARTITION_UA;
break;
}
/* Check that partition exists. */
if (partition >= rkt->rkt_partition_cnt) {
*errp = RD_KAFKA_RESP_ERR__UNKNOWN_PARTITION;
return NULL;
}
break;
default:
rd_kafka_assert(rkt->rkt_rk, !*"NOTREACHED");
break;
}
/* Get new partition */
s_rktp = rd_kafka_toppar_get(rkt, partition, 0);
if (unlikely(!s_rktp)) {
/* Unknown topic or partition */
if (rkt->rkt_state == RD_KAFKA_TOPIC_S_NOTEXISTS)
*errp = RD_KAFKA_RESP_ERR__UNKNOWN_TOPIC;
else
*errp = RD_KAFKA_RESP_ERR__UNKNOWN_PARTITION;
return NULL;
}
return s_rktp;
}
/**
* Looks for partition 'i' in topic 'rkt's desired list.
*
* The desired partition list is the list of partitions that are desired
* (e.g., by the consumer) but not yet seen on a broker.
* As soon as the partition is seen on a broker the toppar is moved from
* the desired list and onto the normal rkt_p array.
* When the partition on the broker goes away a desired partition is put
* back on the desired list.
*
* Locks: rd_kafka_topic_*lock() must be held.
* Note: 'rktp' refcount is increased.
*/
shptr_rd_kafka_toppar_t *rd_kafka_toppar_desired_get (rd_kafka_itopic_t *rkt,
int32_t partition) {
shptr_rd_kafka_toppar_t *s_rktp;
int i;
RD_LIST_FOREACH(s_rktp, &rkt->rkt_desp, i) {
rd_kafka_toppar_t *rktp = rd_kafka_toppar_s2i(s_rktp);
if (rktp->rktp_partition == partition)
return rd_kafka_toppar_keep(rktp);
}
return NULL;
}
/**
* Link toppar on desired list.
*
* Locks: rd_kafka_topic_wrlock() and toppar_lock() must be held.
*/
void rd_kafka_toppar_desired_link (rd_kafka_toppar_t *rktp) {
shptr_rd_kafka_toppar_t *s_rktp;
if (rktp->rktp_s_for_desp)
return; /* Already linked */
s_rktp = rd_kafka_toppar_keep(rktp);
rd_list_add(&rktp->rktp_rkt->rkt_desp, s_rktp);
rktp->rktp_s_for_desp = s_rktp; /* Desired list refcount */
}
/**
* Unlink toppar from desired list.
*
* Locks: rd_kafka_topic_wrlock() and toppar_lock() must be held.
*/
void rd_kafka_toppar_desired_unlink (rd_kafka_toppar_t *rktp) {
if (!rktp->rktp_s_for_desp)
return; /* Not linked */
rd_list_remove(&rktp->rktp_rkt->rkt_desp, rktp->rktp_s_for_desp);
rd_kafka_toppar_destroy(rktp->rktp_s_for_desp);
rktp->rktp_s_for_desp = NULL;
}
/**
* @brief If rktp is not already desired:
* - mark as DESIRED|UNKNOWN
* - add to desired list
*
* @remark toppar_lock() MUST be held
*/
void rd_kafka_toppar_desired_add0 (rd_kafka_toppar_t *rktp) {
if ((rktp->rktp_flags & RD_KAFKA_TOPPAR_F_DESIRED))
return;
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "DESIRED",
"%s [%"PRId32"]: adding to DESIRED list",
rktp->rktp_rkt->rkt_topic->str, rktp->rktp_partition);
rktp->rktp_flags |= RD_KAFKA_TOPPAR_F_DESIRED;
rd_kafka_toppar_desired_link(rktp);
}
/**
* Adds 'partition' as a desired partition to topic 'rkt', or updates
* an existing partition to be desired.
*
* Locks: rd_kafka_topic_wrlock() must be held.
*/
shptr_rd_kafka_toppar_t *rd_kafka_toppar_desired_add (rd_kafka_itopic_t *rkt,
int32_t partition) {
shptr_rd_kafka_toppar_t *s_rktp;
rd_kafka_toppar_t *rktp;
if ((s_rktp = rd_kafka_toppar_get(rkt,
partition, 0/*no_ua_on_miss*/))) {
rktp = rd_kafka_toppar_s2i(s_rktp);
rd_kafka_toppar_lock(rktp);
if (unlikely(!(rktp->rktp_flags & RD_KAFKA_TOPPAR_F_DESIRED))) {
rd_kafka_dbg(rkt->rkt_rk, TOPIC, "DESP",
"Setting topic %s [%"PRId32"] partition "
"as desired",
rkt->rkt_topic->str, rktp->rktp_partition);
rktp->rktp_flags |= RD_KAFKA_TOPPAR_F_DESIRED;
}
/* If toppar was marked for removal this is no longer
* the case since the partition is now desired. */
rktp->rktp_flags &= ~RD_KAFKA_TOPPAR_F_REMOVE;
rd_kafka_toppar_unlock(rktp);
return s_rktp;
}
if ((s_rktp = rd_kafka_toppar_desired_get(rkt, partition)))
return s_rktp;
s_rktp = rd_kafka_toppar_new(rkt, partition);
rktp = rd_kafka_toppar_s2i(s_rktp);
rd_kafka_toppar_lock(rktp);
rd_kafka_toppar_desired_add0(rktp);
rd_kafka_toppar_unlock(rktp);
rd_kafka_dbg(rkt->rkt_rk, TOPIC, "DESP",
"Adding desired topic %s [%"PRId32"]",
rkt->rkt_topic->str, rktp->rktp_partition);
return s_rktp; /* Callers refcount */
}
/**
* Unmarks an 'rktp' as desired.
*
* Locks: rd_kafka_topic_wrlock() and rd_kafka_toppar_lock() MUST be held.
*/
void rd_kafka_toppar_desired_del (rd_kafka_toppar_t *rktp) {
if (!(rktp->rktp_flags & RD_KAFKA_TOPPAR_F_DESIRED))
return;
rktp->rktp_flags &= ~RD_KAFKA_TOPPAR_F_DESIRED;
rd_kafka_toppar_desired_unlink(rktp);
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "DESP",
"Removing (un)desired topic %s [%"PRId32"]",
rktp->rktp_rkt->rkt_topic->str, rktp->rktp_partition);
if (rktp->rktp_flags & RD_KAFKA_TOPPAR_F_UNKNOWN) {
/* If this partition does not exist in the cluster
* and is no longer desired, remove it. */
rd_kafka_toppar_broker_leave_for_remove(rktp);
}
}
/**
* Append message at tail of 'rktp' message queue.
*/
void rd_kafka_toppar_enq_msg (rd_kafka_toppar_t *rktp, rd_kafka_msg_t *rkm) {
int queue_len;
rd_kafka_q_t *wakeup_q = NULL;
rd_kafka_toppar_lock(rktp);
if (!rkm->rkm_u.producer.msgid &&
rktp->rktp_partition != RD_KAFKA_PARTITION_UA)
rkm->rkm_u.producer.msgid = ++rktp->rktp_msgid;
if (rktp->rktp_partition == RD_KAFKA_PARTITION_UA ||
rktp->rktp_rkt->rkt_conf.queuing_strategy == RD_KAFKA_QUEUE_FIFO) {
/* No need for enq_sorted(), this is the oldest message. */
queue_len = rd_kafka_msgq_enq(&rktp->rktp_msgq, rkm);
} else {
queue_len = rd_kafka_msgq_enq_sorted(rktp->rktp_rkt,
&rktp->rktp_msgq, rkm);
}
if (unlikely(queue_len == 1 &&
(wakeup_q = rktp->rktp_msgq_wakeup_q)))
rd_kafka_q_keep(wakeup_q);
rd_kafka_toppar_unlock(rktp);
if (wakeup_q) {
rd_kafka_q_yield(wakeup_q);
rd_kafka_q_destroy(wakeup_q);
}
}
/**
* @brief Insert messages from \p srcq into \p dstq in their sorted
* position using insert-sort with \p cmp.
*/
static void
rd_kafka_msgq_insert_msgq_sort (rd_kafka_msgq_t *destq,
rd_kafka_msgq_t *srcq,
int (*cmp) (const void *a, const void *b)) {
rd_kafka_msg_t *rkm, *tmp;
TAILQ_FOREACH_SAFE(rkm, &srcq->rkmq_msgs, rkm_link, tmp) {
rd_kafka_msgq_enq_sorted0(destq, rkm, cmp);
}
rd_kafka_msgq_init(srcq);
}
void rd_kafka_msgq_insert_msgq (rd_kafka_msgq_t *destq,
rd_kafka_msgq_t *srcq,
int (*cmp) (const void *a, const void *b)) {
rd_kafka_msg_t *first, *dest_first;
first = TAILQ_FIRST(&srcq->rkmq_msgs);
if (unlikely(!first)) {
/* srcq is empty */
return;
}
dest_first = TAILQ_FIRST(&destq->rkmq_msgs);
/*
* Try to optimize insertion of source list.
*/
if (unlikely(!dest_first)) {
/* Dest queue is empty, simply move the srcq. */
rd_kafka_msgq_move(destq, srcq);
return;
}
/* See if we can optimize the insertion by bulk-loading
* the messages in place.
* We know that:
* - destq is sorted but might not be continous (1,2,3,7)
* - srcq is sorted but might not be continous (4,5,6)
* - there migt be overlap between the two, e.g:
* destq = (1,2,3,7), srcq = (4,5,6)
*/
rd_kafka_msgq_verify_order(NULL, destq, 0, rd_false);
rd_kafka_msgq_verify_order(NULL, srcq, 0, rd_false);
if (unlikely(rd_kafka_msgq_overlap(destq, srcq))) {
/* MsgId extents (first, last) in destq and srcq are
* overlapping, do insert-sort to maintain ordering. */
rd_kafka_msgq_insert_msgq_sort(destq, srcq, cmp);
} else if (cmp(first, dest_first) < 0) {
/* Prepend src to dest queue.
* First append existing dest queue to src queue,
* then move src queue to now-empty dest queue,
* effectively prepending src queue to dest queue. */
rd_kafka_msgq_prepend(destq, srcq);
} else if (cmp(first,
TAILQ_LAST(&destq->rkmq_msgs,
rd_kafka_msgs_head_s)) > 0) {
/* Append src to dest queue */
rd_kafka_msgq_concat(destq, srcq);
} else {
/* Source queue messages reside somewhere
* in the dest queue range, find the insert position. */
rd_kafka_msg_t *at;
at = rd_kafka_msgq_find_pos(destq, first, cmp);
rd_assert(at &&
*"Bug in msg_order_cmp(): "
"could not find insert position");
/* Insert input queue after 'at' position.
* We know that:
* - at is non-NULL
* - at is not the last element. */
TAILQ_INSERT_LIST(&destq->rkmq_msgs,
at, &srcq->rkmq_msgs,
rd_kafka_msgs_head_s,
rd_kafka_msg_t *, rkm_link);
destq->rkmq_msg_cnt += srcq->rkmq_msg_cnt;
destq->rkmq_msg_bytes += srcq->rkmq_msg_bytes;
rd_kafka_msgq_init(srcq);
}
rd_kafka_msgq_verify_order(NULL, destq, 0, rd_false);
rd_kafka_msgq_verify_order(NULL, srcq, 0, rd_false);
}
/**
* @brief Inserts messages from \p srcq according to their sorted position
* into \p destq, filtering out messages that can not be retried.
*
* @param incr_retry Increment retry count for messages.
* @param max_retries Maximum retries allowed per message.
* @param backoff Absolute retry backoff for retried messages.
*
* @returns 0 if all messages were retried, or 1 if some messages
* could not be retried.
*/
int rd_kafka_retry_msgq (rd_kafka_msgq_t *destq,
rd_kafka_msgq_t *srcq,
int incr_retry, int max_retries, rd_ts_t backoff,
rd_kafka_msg_status_t status,
int (*cmp) (const void *a, const void *b)) {
rd_kafka_msgq_t retryable = RD_KAFKA_MSGQ_INITIALIZER(retryable);
rd_kafka_msg_t *rkm, *tmp;
/* Scan through messages to see which ones are eligible for retry,
* move the retryable ones to temporary queue and
* set backoff time for first message and optionally
* increase retry count for each message.
* Sorted insert is not necessary since the original order
* srcq order is maintained. */
TAILQ_FOREACH_SAFE(rkm, &srcq->rkmq_msgs, rkm_link, tmp) {
if (rkm->rkm_u.producer.retries + incr_retry > max_retries)
continue;
rd_kafka_msgq_deq(srcq, rkm, 1);
rd_kafka_msgq_enq(&retryable, rkm);
rkm->rkm_u.producer.ts_backoff = backoff;
rkm->rkm_u.producer.retries += incr_retry;
/* Don't downgrade a message from any form of PERSISTED
* to NOT_PERSISTED, since the original cause of indicating
* PERSISTED can't be changed.
* E.g., a previous ack or in-flight timeout. */
if (likely(!(status == RD_KAFKA_MSG_STATUS_NOT_PERSISTED &&
rkm->rkm_status !=
RD_KAFKA_MSG_STATUS_NOT_PERSISTED)))
rkm->rkm_status = status;
}
/* No messages are retryable */
if (RD_KAFKA_MSGQ_EMPTY(&retryable))
return 0;
/* Insert retryable list at sorted position */
rd_kafka_msgq_insert_msgq(destq, &retryable, cmp);
return 1;
}
/**
* @brief Inserts messages from \p rkmq according to their sorted position
* into the partition's message queue.
*
* @param incr_retry Increment retry count for messages.
* @param status Set status on each message.
*
* @returns 0 if all messages were retried, or 1 if some messages
* could not be retried.
*
* @locality Broker thread (but not necessarily the leader broker thread)
*/
int rd_kafka_toppar_retry_msgq (rd_kafka_toppar_t *rktp, rd_kafka_msgq_t *rkmq,
int incr_retry, rd_kafka_msg_status_t status) {
rd_kafka_t *rk = rktp->rktp_rkt->rkt_rk;
rd_ts_t backoff = rd_clock() + (rk->rk_conf.retry_backoff_ms * 1000);
int r;
if (rd_kafka_terminating(rk))
return 1;
rd_kafka_toppar_lock(rktp);
r = rd_kafka_retry_msgq(&rktp->rktp_msgq, rkmq,
incr_retry, rk->rk_conf.max_retries,
backoff, status,
rktp->rktp_rkt->rkt_conf.msg_order_cmp);
rd_kafka_toppar_unlock(rktp);
return r;
}
/**
* @brief Insert sorted message list \p rkmq at sorted position in \p rktp 's
* message queue. The queues must not overlap.
* @remark \p rkmq will be cleared.
*/
void rd_kafka_toppar_insert_msgq (rd_kafka_toppar_t *rktp,
rd_kafka_msgq_t *rkmq) {
rd_kafka_toppar_lock(rktp);
rd_kafka_msgq_insert_msgq(&rktp->rktp_msgq, rkmq,
rktp->rktp_rkt->rkt_conf.msg_order_cmp);
rd_kafka_toppar_unlock(rktp);
}
/**
* Helper method for purging queues when removing a toppar.
* Locks: rd_kafka_toppar_lock() MUST be held
*/
void rd_kafka_toppar_purge_queues (rd_kafka_toppar_t *rktp) {
rd_kafka_q_disable(rktp->rktp_fetchq);
rd_kafka_q_purge(rktp->rktp_fetchq);
rd_kafka_q_disable(rktp->rktp_ops);
rd_kafka_q_purge(rktp->rktp_ops);
}
/**
* Migrate rktp from (optional) \p old_rkb to (optional) \p new_rkb.
* This is an async operation.
*
* Locks: rd_kafka_toppar_lock() MUST be held
*/
static void rd_kafka_toppar_broker_migrate (rd_kafka_toppar_t *rktp,
rd_kafka_broker_t *old_rkb,
rd_kafka_broker_t *new_rkb) {
rd_kafka_op_t *rko;
rd_kafka_broker_t *dest_rkb;
int had_next_leader = rktp->rktp_next_leader ? 1 : 0;
/* Update next leader */
if (new_rkb)
rd_kafka_broker_keep(new_rkb);
if (rktp->rktp_next_leader)
rd_kafka_broker_destroy(rktp->rktp_next_leader);
rktp->rktp_next_leader = new_rkb;
/* If next_leader is set it means there is already an async
* migration op going on and we should not send a new one
* but simply change the next_leader (which we did above). */
if (had_next_leader)
return;
/* Revert from offset-wait state back to offset-query
* prior to leaving the broker to avoid stalling
* on the new broker waiting for a offset reply from
* this old broker (that might not come and thus need
* to time out..slowly) */
if (rktp->rktp_fetch_state == RD_KAFKA_TOPPAR_FETCH_OFFSET_WAIT)
rd_kafka_toppar_offset_retry(rktp, 500,
"migrating to new leader");
if (old_rkb) {
/* If there is an existing broker for this toppar we let it
* first handle its own leave and then trigger the join for
* the next leader, if any. */
rko = rd_kafka_op_new(RD_KAFKA_OP_PARTITION_LEAVE);
dest_rkb = old_rkb;
} else {
/* No existing broker, send join op directly to new leader. */
rko = rd_kafka_op_new(RD_KAFKA_OP_PARTITION_JOIN);
dest_rkb = new_rkb;
}
rko->rko_rktp = rd_kafka_toppar_keep(rktp);
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "BRKMIGR",
"Migrating topic %.*s [%"PRId32"] %p from %s to %s "
"(sending %s to %s)",
RD_KAFKAP_STR_PR(rktp->rktp_rkt->rkt_topic),
rktp->rktp_partition, rktp,
old_rkb ? rd_kafka_broker_name(old_rkb) : "(none)",
new_rkb ? rd_kafka_broker_name(new_rkb) : "(none)",
rd_kafka_op2str(rko->rko_type),
rd_kafka_broker_name(dest_rkb));
rd_kafka_q_enq(dest_rkb->rkb_ops, rko);
}
/**
* Async toppar leave from broker.
* Only use this when partitions are to be removed.
*
* Locks: rd_kafka_toppar_lock() MUST be held
*/
void rd_kafka_toppar_broker_leave_for_remove (rd_kafka_toppar_t *rktp) {
rd_kafka_op_t *rko;
rd_kafka_broker_t *dest_rkb;
rktp->rktp_flags |= RD_KAFKA_TOPPAR_F_REMOVE;
if (rktp->rktp_next_leader)
dest_rkb = rktp->rktp_next_leader;
else if (rktp->rktp_leader)
dest_rkb = rktp->rktp_leader;
else {
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "TOPPARDEL",
"%.*s [%"PRId32"] %p not handled by any broker: "
"not sending LEAVE for remove",
RD_KAFKAP_STR_PR(rktp->rktp_rkt->rkt_topic),
rktp->rktp_partition, rktp);
return;
}
/* Revert from offset-wait state back to offset-query
* prior to leaving the broker to avoid stalling
* on the new broker waiting for a offset reply from
* this old broker (that might not come and thus need
* to time out..slowly) */
if (rktp->rktp_fetch_state == RD_KAFKA_TOPPAR_FETCH_OFFSET_WAIT)
rd_kafka_toppar_set_fetch_state(
rktp, RD_KAFKA_TOPPAR_FETCH_OFFSET_QUERY);
rko = rd_kafka_op_new(RD_KAFKA_OP_PARTITION_LEAVE);
rko->rko_rktp = rd_kafka_toppar_keep(rktp);
rd_kafka_dbg(rktp->rktp_rkt->rkt_rk, TOPIC, "BRKMIGR",
"%.*s [%"PRId32"] %p sending final LEAVE for removal by %s",
RD_KAFKAP_STR_PR(rktp->rktp_rkt->rkt_topic),
rktp->rktp_partition, rktp,
rd_kafka_broker_name(dest_rkb));
rd_kafka_q_enq(dest_rkb->rkb_ops, rko);
}