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
|
/* Copyright 2017 LinkedIn Corp. Licensed under the Apache License, Version
* 2.0 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package storage
import (
"container/ring"
"math/rand"
"regexp"
"sync"
"time"
"github.com/OneOfOne/xxhash"
"github.com/spf13/viper"
"go.uber.org/zap"
"github.com/linkedin/Burrow/core/protocol"
)
// InMemoryStorage is a storage module that maintains the entire data set in memory in a series of maps. It has a
// configurable number of worker goroutines to service requests, and for requests that are group-specific, the group
// and cluster name are used to hash the request to a consistent worker. This assures that requests for a group are
// processed in order.
type InMemoryStorage struct {
// App is a pointer to the application context. This stores the channel to the storage subsystem
App *protocol.ApplicationContext
// Log is a logger that has been configured for this module to use. Normally, this means it has been set up with
// fields that are appropriate to identify this coordinator
Log *zap.Logger
name string
intervals int
numWorkers int
expireGroup int64
minDistance int64
queueDepth int
requestChannel chan *protocol.StorageRequest
workersRunning sync.WaitGroup
mainRunning sync.WaitGroup
offsets map[string]clusterOffsets
groupWhitelist *regexp.Regexp
groupBlacklist *regexp.Regexp
workers []chan *protocol.StorageRequest
}
type brokerOffset struct {
Offset int64
Timestamp int64
}
type consumerPartition struct {
offsets *ring.Ring
owner string
clientID string
}
type consumerGroup struct {
// This lock is held when using the individual group, either for read or write
lock *sync.RWMutex
topics map[string][]*consumerPartition
lastCommit int64
}
type clusterOffsets struct {
broker map[string][]*ring.Ring
consumer map[string]*consumerGroup
// This lock is used when modifying broker topics or offsets
brokerLock *sync.RWMutex
// This lock is used when modifying the overall consumer list
// It does not need to be held for modifying an individual group
consumerLock *sync.RWMutex
}
// Configure validates the configuration for the module, creates a channel to receive requests on, and sets up the
// storage map. If no expiration time for groups is set, a default value of 7 days is used. If no interval count is
// set, a default of 10 intervals is used. If no worker count is set, a default of 20 workers is used.
func (module *InMemoryStorage) Configure(name string, configRoot string) {
module.Log.Info("configuring")
module.name = name
// Set defaults for configs if needed
viper.SetDefault(configRoot+".intervals", 10)
viper.SetDefault(configRoot+".expire-group", 604800)
viper.SetDefault(configRoot+".workers", 20)
viper.SetDefault(configRoot+".queue-depth", 1)
module.intervals = viper.GetInt(configRoot + ".intervals")
module.expireGroup = viper.GetInt64(configRoot + ".expire-group")
module.numWorkers = viper.GetInt(configRoot + ".workers")
module.minDistance = viper.GetInt64(configRoot + ".min-distance")
module.queueDepth = viper.GetInt(configRoot + ".queue-depth")
module.requestChannel = make(chan *protocol.StorageRequest, module.queueDepth)
module.workersRunning = sync.WaitGroup{}
module.mainRunning = sync.WaitGroup{}
module.offsets = make(map[string]clusterOffsets)
whitelist := viper.GetString(configRoot + ".group-whitelist")
if whitelist != "" {
re, err := regexp.Compile(whitelist)
if err != nil {
module.Log.Panic("Failed to compile group whitelist")
panic(err)
}
module.groupWhitelist = re
}
blacklist := viper.GetString(configRoot + ".group-blacklist")
if blacklist != "" {
re, err := regexp.Compile(blacklist)
if err != nil {
module.Log.Panic("Failed to compile group blacklist")
panic(err)
}
module.groupBlacklist = re
}
}
// GetCommunicationChannel returns the RequestChannel that has been setup for this module.
func (module *InMemoryStorage) GetCommunicationChannel() chan *protocol.StorageRequest {
return module.requestChannel
}
// Start sets up the rest of the storage map for each configured cluster. It then starts the configured number of
// worker routines to handle requests. Finally, it starts a main loop which will receive requests and hash them to the
// correct worker.
func (module *InMemoryStorage) Start() error {
module.Log.Info("starting")
for cluster := range viper.GetStringMap("cluster") {
module.
offsets[cluster] = clusterOffsets{
broker: make(map[string][]*ring.Ring),
consumer: make(map[string]*consumerGroup),
brokerLock: &sync.RWMutex{},
consumerLock: &sync.RWMutex{},
}
}
// Start the appropriate number of workers, with a channel for each
module.workers = make([]chan *protocol.StorageRequest, module.numWorkers)
for i := 0; i < module.numWorkers; i++ {
module.workers[i] = make(chan *protocol.StorageRequest, module.queueDepth)
module.workersRunning.Add(1)
go module.requestWorker(i, module.workers[i])
}
module.mainRunning.Add(1)
go module.mainLoop()
return nil
}
// Stop closes the incoming request channel, which will close the main loop. It then closes each of the worker
// channels, to close the workers, and waits for all goroutines to exit before returning.
func (module *InMemoryStorage) Stop() error {
module.Log.Info("stopping")
close(module.requestChannel)
module.mainRunning.Wait()
for i := 0; i < module.numWorkers; i++ {
close(module.workers[i])
}
module.workersRunning.Wait()
return nil
}
func (module *InMemoryStorage) requestWorker(workerNum int, requestChannel chan *protocol.StorageRequest) {
defer module.workersRunning.Done()
// Using a map for the request types avoids a bit of complexity below
var requestTypeMap = map[protocol.StorageRequestConstant]func(*protocol.StorageRequest, *zap.Logger){
protocol.StorageSetBrokerOffset: module.addBrokerOffset,
protocol.StorageSetConsumerOffset: module.addConsumerOffset,
protocol.StorageSetConsumerOwner: module.addConsumerOwner,
protocol.StorageSetDeleteTopic: module.deleteTopic,
protocol.StorageSetDeleteGroup: module.deleteGroup,
protocol.StorageFetchClusters: module.fetchClusterList,
protocol.StorageFetchConsumers: module.fetchConsumerList,
protocol.StorageFetchTopics: module.fetchTopicList,
protocol.StorageFetchConsumer: module.fetchConsumer,
protocol.StorageFetchTopic: module.fetchTopic,
protocol.StorageClearConsumerOwners: module.clearConsumerOwners,
protocol.StorageFetchConsumersForTopic: module.fetchConsumersForTopicList,
}
workerLogger := module.Log.With(zap.Int("worker", workerNum))
for r := range requestChannel {
if requestFunc, ok := requestTypeMap[r.RequestType]; ok {
requestFunc(r, workerLogger.With(
zap.String("cluster", r.Cluster),
zap.String("consumer", r.Group),
zap.String("topic", r.Topic),
zap.Int32("partition", r.Partition),
zap.Int32("topic_partition_count", r.TopicPartitionCount),
zap.Int64("offset", r.Offset),
zap.Int64("timestamp", r.Timestamp),
zap.String("owner", r.Owner),
zap.String("client_id", r.ClientID),
zap.String("request", r.RequestType.String())))
}
}
}
func (module *InMemoryStorage) mainLoop() {
defer module.mainRunning.Done()
for r := range module.requestChannel {
switch r.RequestType {
case protocol.StorageSetBrokerOffset, protocol.StorageSetDeleteTopic, protocol.StorageFetchClusters, protocol.StorageFetchConsumers, protocol.StorageFetchTopics, protocol.StorageFetchTopic, protocol.StorageFetchConsumersForTopic:
// Send to any worker
module.workers[int(rand.Int31n(int32(module.numWorkers)))] <- r
case protocol.StorageSetConsumerOffset, protocol.StorageSetConsumerOwner, protocol.StorageSetDeleteGroup, protocol.StorageClearConsumerOwners, protocol.StorageFetchConsumer:
// Hash to a consistent worker
module.workers[int(xxhash.ChecksumString64(r.Cluster+r.Group)%uint64(module.numWorkers))] <- r
default:
module.Log.Error("unknown storage request type",
zap.Int("request_type", int(r.RequestType)),
)
if r.Reply != nil {
close(r.Reply)
}
}
}
}
func (module *InMemoryStorage) addBrokerOffset(request *protocol.StorageRequest, requestLogger *zap.Logger) {
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
// Ignore offsets for clusters that we don't know about - should never happen anyways
requestLogger.Warn("unknown cluster")
return
}
clusterMap.brokerLock.Lock()
defer clusterMap.brokerLock.Unlock()
topicList, ok := clusterMap.broker[request.Topic]
if !ok {
clusterMap.broker[request.Topic] = make([]*ring.Ring, 0, request.TopicPartitionCount)
topicList = clusterMap.broker[request.Topic]
}
if request.TopicPartitionCount >= int32(len(topicList)) {
// The partition count has increased. Append enough extra partitions, with offset rings, to our slice
for i := int32(len(topicList)); i < request.TopicPartitionCount; i++ {
topicList = append(topicList, ring.New(module.intervals))
}
}
// Advance to the next ring entry (this means the pointer is always at the most recent entry, rather than the
// oldest entry)
topicList[request.Partition] = topicList[request.Partition].Next()
partitionEntry := topicList[request.Partition]
if partitionEntry.Value == nil {
partitionEntry.Value = &brokerOffset{
Offset: request.Offset,
Timestamp: request.Timestamp,
}
} else {
ringval, _ := partitionEntry.Value.(*brokerOffset)
ringval.Offset = request.Offset
ringval.Timestamp = request.Timestamp
}
requestLogger.Debug("ok")
clusterMap.broker[request.Topic] = topicList
}
func (module *InMemoryStorage) getBrokerOffset(clusterMap *clusterOffsets, topic string, partition int32, requestLogger *zap.Logger) (int64, int32) {
clusterMap.brokerLock.RLock()
defer clusterMap.brokerLock.RUnlock()
topicPartitionList, ok := clusterMap.broker[topic]
if !ok {
// We don't know about this topic from the brokers yet - skip consumer offsets for now
requestLogger.Debug("dropped", zap.String("reason", "no topic"))
return 0, 0
}
if partition < 0 {
// This should never happen, but if it does, log an warning with the offset information for review
requestLogger.Warn("negative partition")
return 0, 0
}
if partition >= int32(len(topicPartitionList)) {
// We know about the topic, but partitions have been expanded and we haven't seen that from the broker yet
requestLogger.Debug("dropped", zap.String("reason", "no broker partition"))
return 0, 0
}
if topicPartitionList[partition].Value == nil {
// We know about the topic and partition, but we haven't actually gotten the broker offset yet
requestLogger.Debug("dropped", zap.String("reason", "no broker offset"))
return 0, 0
}
return topicPartitionList[partition].Value.(*brokerOffset).Offset, int32(len(topicPartitionList))
}
func (module *InMemoryStorage) getPartitionRing(consumerMap *consumerGroup, topic string, partition int32, partitionCount int32, requestLogger *zap.Logger) *ring.Ring {
// Get or create the topic for the consumer
consumerTopicMap, ok := consumerMap.topics[topic]
if !ok {
consumerMap.topics[topic] = make([]*consumerPartition, 0, partitionCount)
consumerTopicMap = consumerMap.topics[topic]
}
// Get the partition specified
if int(partition) >= len(consumerTopicMap) {
// The partition count must have increased. Append enough extra partitions to our slice
for i := int32(len(consumerTopicMap)); i < partitionCount; i++ {
consumerTopicMap = append(consumerTopicMap, &consumerPartition{})
}
consumerMap.topics[topic] = consumerTopicMap
}
// Get or create the offsets ring for this partition
if consumerTopicMap[partition].offsets == nil {
consumerTopicMap[partition].offsets = ring.New(module.intervals)
}
return consumerTopicMap[partition].offsets
}
func (module *InMemoryStorage) acceptConsumerGroup(group string) bool {
if (module.groupWhitelist != nil) && (!module.groupWhitelist.MatchString(group)) {
return false
}
if (module.groupBlacklist != nil) && module.groupBlacklist.MatchString(group) {
return false
}
return true
}
func (module *InMemoryStorage) addConsumerOffset(request *protocol.StorageRequest, requestLogger *zap.Logger) {
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
// Ignore offsets for clusters that we don't know about - should never happen anyways
requestLogger.Warn("unknown cluster")
return
}
if request.Timestamp < ((time.Now().Unix() - module.expireGroup) * 1000) {
requestLogger.Debug("dropped", zap.String("reason", "old offset"))
return
}
if !module.acceptConsumerGroup(request.Group) {
requestLogger.Debug("dropped", zap.String("reason", "group not whitelisted"))
return
}
// Get the broker offset for this partition, as well as the partition count
brokerOffset, partitionCount := module.getBrokerOffset(&clusterMap, request.Topic, request.Partition, requestLogger)
if partitionCount == 0 {
// If the returned partitionCount is zero, there was an error that was already logged. Just stop processing
return
}
// Make the consumer group if it does not yet exist
clusterMap.consumerLock.Lock()
consumerMap, ok := clusterMap.consumer[request.Group]
if !ok {
clusterMap.consumer[request.Group] = &consumerGroup{
lock: &sync.RWMutex{},
topics: make(map[string][]*consumerPartition),
}
consumerMap = clusterMap.consumer[request.Group]
}
clusterMap.consumerLock.Unlock()
// For the rest of this, we need the write lock for the consumer group
consumerMap.lock.Lock()
defer consumerMap.lock.Unlock()
// Get the offset ring for this partition - it always points to the earliest offset (or where to insert a new value)
consumerPartitionRing := module.getPartitionRing(consumerMap, request.Topic, request.Partition, partitionCount, requestLogger)
if consumerPartitionRing.Prev().Value != nil {
// If the offset commit is faster than we are allowing (less than the min-distance config), rewind the ring by one spot
// This lets us store the offset commit without dropping an old one
if (request.Timestamp - consumerPartitionRing.Prev().Value.(*protocol.ConsumerOffset).Timestamp) < (module.minDistance * 1000) {
// We have to change both pointers here, as we're essentially rewinding the ring one spot to add this commit
consumerPartitionRing = consumerPartitionRing.Prev()
consumerMap.topics[request.Topic][request.Partition].offsets = consumerPartitionRing
// We also set the timestamp for the request to the STORED timestamp. The reason for this is that if we
// update the timestamp to the new timestamp, we may never create a new offset in the ring (consider the
// case where someone is auto-committing with a frequency lower than min-distance)
request.Timestamp = consumerPartitionRing.Value.(*protocol.ConsumerOffset).Timestamp
}
}
// Calculate the lag against the brokerOffset
var partitionLag uint64
if brokerOffset < request.Offset {
// Little bit of a hack - because we only get broker offsets periodically, it's possible the consumer offset could be ahead of where we think the broker
// is. In this case, just mark it as zero lag.
partitionLag = 0
} else {
partitionLag = uint64(brokerOffset - request.Offset)
}
// Update or create the ring value at the current pointer
if consumerPartitionRing.Value == nil {
consumerPartitionRing.Value = &protocol.ConsumerOffset{
Offset: request.Offset,
Timestamp: request.Timestamp,
Lag: partitionLag,
}
} else {
ringval, _ := consumerPartitionRing.Value.(*protocol.ConsumerOffset)
ringval.Offset = request.Offset
ringval.Timestamp = request.Timestamp
ringval.Lag = partitionLag
}
consumerMap.lastCommit = request.Timestamp
// Advance the ring pointer
requestLogger.Debug("ok", zap.Uint64("lag", partitionLag))
consumerMap.topics[request.Topic][request.Partition].offsets = consumerMap.topics[request.Topic][request.Partition].offsets.Next()
}
func (module *InMemoryStorage) addConsumerOwner(request *protocol.StorageRequest, requestLogger *zap.Logger) {
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
// Ignore offsets for clusters that we don't know about - should never happen anyways
requestLogger.Warn("unknown cluster")
return
}
if !module.acceptConsumerGroup(request.Group) {
requestLogger.Debug("dropped", zap.String("reason", "group not whitelisted"))
return
}
// Make the consumer group if it does not yet exist
clusterMap.consumerLock.Lock()
consumerMap, ok := clusterMap.consumer[request.Group]
if !ok {
clusterMap.consumer[request.Group] = &consumerGroup{
lock: &sync.RWMutex{},
topics: make(map[string][]*consumerPartition),
}
consumerMap = clusterMap.consumer[request.Group]
}
clusterMap.consumerLock.Unlock()
// Get the partition count for this partition (we don't need the actual broker offset)
_, partitionCount := module.getBrokerOffset(&clusterMap, request.Topic, request.Partition, requestLogger)
if partitionCount == 0 {
// If the returned partitionCount is zero, there was an error that was already logged. Just stop processing
return
}
// For the rest of this, we need the write lock for the consumer group
consumerMap.lock.Lock()
defer consumerMap.lock.Unlock()
// Get the offset ring for this partition - we don't need it, but it will properly create the topic and partitions for us
module.getPartitionRing(consumerMap, request.Topic, request.Partition, partitionCount, requestLogger)
if topic, ok := consumerMap.topics[request.Topic]; !ok || (int32(len(topic)) <= request.Partition) {
requestLogger.Debug("dropped", zap.String("reason", "no partition"))
return
}
// Write the owner for the given topic/partition
requestLogger.Debug("ok")
consumerMap.topics[request.Topic][request.Partition].owner = request.Owner
consumerMap.topics[request.Topic][request.Partition].clientID = request.ClientID
}
func (module *InMemoryStorage) clearConsumerOwners(request *protocol.StorageRequest, requestLogger *zap.Logger) {
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
// Ignore metadata for clusters that we don't know about - should never happen anyways
requestLogger.Warn("unknown cluster")
return
}
if !module.acceptConsumerGroup(request.Group) {
requestLogger.Debug("dropped", zap.String("reason", "group not whitelisted"))
return
}
// Make the consumer group if it does not yet exist
clusterMap.consumerLock.Lock()
consumerMap, ok := clusterMap.consumer[request.Group]
if !ok {
// Consumer group doesn't exist, so we can't clear owners for it
clusterMap.consumerLock.Unlock()
return
}
clusterMap.consumerLock.Unlock()
// For the rest of this, we need the write lock for the consumer group
consumerMap.lock.Lock()
defer consumerMap.lock.Unlock()
for topic, partitions := range consumerMap.topics {
for partitionID := range partitions {
consumerMap.topics[topic][partitionID].owner = ""
consumerMap.topics[topic][partitionID].clientID = ""
}
}
requestLogger.Debug("ok")
}
func (module *InMemoryStorage) deleteTopic(request *protocol.StorageRequest, requestLogger *zap.Logger) {
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
requestLogger.Warn("unknown cluster")
return
}
// Work backwards - remove the topic from consumer groups first
for _, consumerMap := range clusterMap.consumer {
consumerMap.lock.Lock()
// No need to check for existence
delete(consumerMap.topics, request.Topic)
consumerMap.lock.Unlock()
}
// Now remove the topic from the broker list
clusterMap.brokerLock.Lock()
delete(clusterMap.broker, request.Topic)
clusterMap.brokerLock.Unlock()
requestLogger.Debug("ok")
}
func (module *InMemoryStorage) deleteGroup(request *protocol.StorageRequest, requestLogger *zap.Logger) {
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
requestLogger.Warn("unknown cluster")
return
}
clusterMap.consumerLock.Lock()
delete(clusterMap.consumer, request.Group)
clusterMap.consumerLock.Unlock()
requestLogger.Debug("ok")
}
func (module *InMemoryStorage) fetchClusterList(request *protocol.StorageRequest, requestLogger *zap.Logger) {
defer close(request.Reply)
clusterList := make([]string, 0, len(module.offsets))
for cluster := range module.offsets {
clusterList = append(clusterList, cluster)
}
requestLogger.Debug("ok")
request.Reply <- clusterList
}
func (module *InMemoryStorage) fetchTopicList(request *protocol.StorageRequest, requestLogger *zap.Logger) {
defer close(request.Reply)
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
requestLogger.Warn("unknown cluster")
return
}
clusterMap.brokerLock.RLock()
topicList := make([]string, 0, len(clusterMap.broker))
for topic := range clusterMap.broker {
topicList = append(topicList, topic)
}
clusterMap.brokerLock.RUnlock()
requestLogger.Debug("ok")
request.Reply <- topicList
}
func (module *InMemoryStorage) fetchConsumerList(request *protocol.StorageRequest, requestLogger *zap.Logger) {
defer close(request.Reply)
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
requestLogger.Warn("unknown cluster")
return
}
clusterMap.consumerLock.RLock()
consumerList := make([]string, 0, len(clusterMap.consumer))
for consumer := range clusterMap.consumer {
consumerList = append(consumerList, consumer)
}
clusterMap.consumerLock.RUnlock()
requestLogger.Debug("ok")
request.Reply <- consumerList
}
func (module *InMemoryStorage) fetchTopic(request *protocol.StorageRequest, requestLogger *zap.Logger) {
defer close(request.Reply)
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
requestLogger.Warn("unknown cluster")
return
}
clusterMap.brokerLock.RLock()
topicList, ok := clusterMap.broker[request.Topic]
if !ok {
requestLogger.Warn("unknown topic")
clusterMap.brokerLock.RUnlock()
return
}
offsetList := make([]int64, 0, len(topicList))
for _, partition := range topicList {
offsetList = append(offsetList, partition.Value.(*brokerOffset).Offset)
}
clusterMap.brokerLock.RUnlock()
requestLogger.Debug("ok")
request.Reply <- offsetList
}
func getConsumerTopicList(consumerMap *consumerGroup) protocol.ConsumerTopics {
topicList := make(protocol.ConsumerTopics)
consumerMap.lock.RLock()
defer consumerMap.lock.RUnlock()
for topic, partitions := range consumerMap.topics {
topicList[topic] = make(protocol.ConsumerPartitions, len(partitions))
for partitionID, partition := range partitions {
consumerPartition := &protocol.ConsumerPartition{Owner: partition.owner, ClientID: partition.clientID}
if partition.offsets != nil {
offsetRing := partition.offsets
consumerPartition.Offsets = make([]*protocol.ConsumerOffset, offsetRing.Len())
ringPtr := offsetRing
for i := 0; i < offsetRing.Len(); i++ {
if ringPtr.Value == nil {
consumerPartition.Offsets[i] = nil
} else {
ringval, _ := ringPtr.Value.(*protocol.ConsumerOffset)
// Make a copy so that we can release the lock and be safe
consumerPartition.Offsets[i] = &protocol.ConsumerOffset{
Offset: ringval.Offset,
Lag: ringval.Lag,
Timestamp: ringval.Timestamp,
}
}
ringPtr = ringPtr.Next()
}
} else {
consumerPartition.Offsets = make([]*protocol.ConsumerOffset, 0)
}
topicList[topic][partitionID] = consumerPartition
}
}
return topicList
}
func (module *InMemoryStorage) fetchConsumer(request *protocol.StorageRequest, requestLogger *zap.Logger) {
defer close(request.Reply)
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
requestLogger.Warn("unknown cluster")
return
}
clusterMap.consumerLock.RLock()
consumerMap, ok := clusterMap.consumer[request.Group]
if !ok {
requestLogger.Warn("unknown consumer")
clusterMap.consumerLock.RUnlock()
return
}
// Lazily purge consumers that haven't committed in longer than the defined interval. Return as a 404
if ((time.Now().Unix() - module.expireGroup) * 1000) > consumerMap.lastCommit {
// Swap for a write lock
clusterMap.consumerLock.RUnlock()
clusterMap.consumerLock.Lock()
requestLogger.Debug("purge expired consumer", zap.Int64("last_commit", consumerMap.lastCommit))
delete(clusterMap.consumer, request.Group)
clusterMap.consumerLock.Unlock()
return
}
topicList := getConsumerTopicList(consumerMap)
clusterMap.consumerLock.RUnlock()
// Calculate the current lag for each now. We do this separate from getting the consumer info so we can avoid
// locking both the consumers and the brokers at the same time
clusterMap.brokerLock.RLock()
for topic, partitions := range topicList {
topicMap, ok := clusterMap.broker[topic]
if !ok {
// The topic may have just been deleted, so we'll skip this part and just return the consumer data we have
continue
}
for p, partition := range partitions {
// Build the slice of broker offsets to return
partition.BrokerOffsets = make([]int64, 0, module.intervals)
brokerOffsetPtr := topicMap[p].Next()
brokerOffsetPtr.Do(func(item interface{}) {
if item != nil {
partition.BrokerOffsets = append(partition.BrokerOffsets, item.(*brokerOffset).Offset)
}
})
if len(partition.Offsets) > 0 {
brokerOffset := partition.BrokerOffsets[len(partition.BrokerOffsets)-1]
lastOffset := partition.Offsets[len(partition.Offsets)-1]
if lastOffset != nil {
if brokerOffset < lastOffset.Offset {
// Little bit of a hack - because we only get broker offsets periodically, it's possible the consumer offset could be ahead of where we think the broker
// is. In this case, just mark it as zero lag.
partition.CurrentLag = 0
} else {
partition.CurrentLag = uint64(brokerOffset - lastOffset.Offset)
}
}
}
}
}
clusterMap.brokerLock.RUnlock()
requestLogger.Debug("ok")
request.Reply <- topicList
}
func (module *InMemoryStorage) fetchConsumersForTopicList(request *protocol.StorageRequest, requestLogger *zap.Logger) {
defer close(request.Reply)
clusterMap, ok := module.offsets[request.Cluster]
if !ok {
requestLogger.Warn("unknown cluster")
return
}
clusterMap.consumerLock.RLock()
consumerListForTopic := make([]string, 0)
for consumerGroup := range clusterMap.consumer {
consumerMap := clusterMap.consumer[consumerGroup]
topicList := getConsumerTopicList(consumerMap)
for topic := range topicList {
if topic == request.Topic {
consumerListForTopic = append(consumerListForTopic, consumerGroup)
break
}
}
}
clusterMap.consumerLock.RUnlock()
requestLogger.Debug("ok")
request.Reply <- consumerListForTopic
}
|