Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 11 additions & 21 deletions server/jetstream_cluster.go
Original file line number Diff line number Diff line change
Expand Up @@ -4352,28 +4352,18 @@ func (js *jetStream) processClusterCreateConsumer(ca *consumerAssignment, state
// Check if we already have this consumer running.
o := mset.lookupConsumer(consumer)

if !alreadyRunning {
Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Is it safe to remove this logic here?

Copy link
Copy Markdown
Member Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Yes, createRaftGroup knows if the Raft node already exists and only checks peer differences.

// Process the raft group and make sure its running if needed.
storage := mset.config().Storage
if ca.Config.MemoryStorage {
storage = MemoryStorage
}
// No-op if R1.
js.createRaftGroup(accName, rg, storage, pprofLabels{
"type": "consumer",
"account": mset.accName(),
"stream": ca.Stream,
"consumer": ca.Name,
})
} else {
// If we are clustered update the known peers.
js.mu.RLock()
node := rg.node
js.mu.RUnlock()
if node != nil {
node.UpdateKnownPeers(ca.Group.Peers)
}
// Process the raft group and make sure it's running if needed.
storage := mset.config().Storage
if ca.Config.MemoryStorage {
storage = MemoryStorage
}
// No-op if R1.
js.createRaftGroup(accName, rg, storage, pprofLabels{
"type": "consumer",
"account": mset.accName(),
"stream": ca.Stream,
"consumer": ca.Name,
})

// Check if we already have this consumer running.
var didCreate, isConfigUpdate, needsLocalResponse bool
Expand Down
53 changes: 40 additions & 13 deletions server/jetstream_cluster_4_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -5139,6 +5139,12 @@ func TestJetStreamClusterServerPeerRemovePeersDrift(t *testing.T) {
})
require_NoError(t, err)

_, err = js.AddConsumer("TEST", &nats.ConsumerConfig{
Durable: "CONSUMER",
Replicas: 3,
})
require_NoError(t, err)

var acc *Account
var mset *stream

Expand All @@ -5150,14 +5156,18 @@ func TestJetStreamClusterServerPeerRemovePeersDrift(t *testing.T) {
if err != nil {
return err
}
_, err = acc.lookupStream("TEST")
mset, err = acc.lookupStream("TEST")
if err != nil {
continue
}
o := mset.lookupConsumer("CONSUMER")
if o == nil {
continue
}
count++
}
if count != 3 {
return fmt.Errorf("expected 3 streams, got: %d", count)
return fmt.Errorf("expected 3 streams/consumers, got: %d", count)
}
return nil
})
Expand Down Expand Up @@ -5196,7 +5206,8 @@ func TestJetStreamClusterServerPeerRemovePeersDrift(t *testing.T) {
// Eventually there should again be a R3 stream and everyone should agree on the peers.
checkFor(t, 2*time.Second, 100*time.Millisecond, func() error {
count := 0
var ps []string
var streamPeers []string
var consumerPeers []string
for _, s := range c.servers {
if s == rs {
continue
Expand All @@ -5209,22 +5220,38 @@ func TestJetStreamClusterServerPeerRemovePeersDrift(t *testing.T) {
if err != nil {
return err
}
rn := mset.raftNode().(*raft)
rn.RLock()
peerNames := rn.peerNames()
rn.RUnlock()
slices.Sort(peerNames)
o := mset.lookupConsumer("CONSUMER")
if o == nil {
return fmt.Errorf("consumer not found on %s", s.Name())
}
mrn := mset.raftNode().(*raft)
mrn.RLock()
streamPeerNames := mrn.peerNames()
mrn.RUnlock()

orn := o.raftNode().(*raft)
orn.RLock()
consumerPeerNames := orn.peerNames()
orn.RUnlock()

slices.Sort(streamPeerNames)
slices.Sort(consumerPeerNames)
if count == 0 {
ps = peerNames
} else if !slices.Equal(ps, peerNames) {
streamPeers = streamPeerNames
consumerPeers = consumerPeerNames
} else if !slices.Equal(streamPeers, streamPeerNames) {
rsid := rs.NodeName()
containsOld := slices.Contains(streamPeers, rsid) || slices.Contains(streamPeerNames, rsid)
return fmt.Errorf("no equal stream peers, expected: %v, got: %v, contains old peer (%s): %v", streamPeers, streamPeerNames, rsid, containsOld)
} else if !slices.Equal(consumerPeers, consumerPeerNames) {
rsid := rs.NodeName()
containsOld := slices.Contains(ps, rsid) || slices.Contains(peerNames, rsid)
return fmt.Errorf("no equal peers, expected: %v, got: %v, contains old peer (%s): %v", ps, peerNames, rsid, containsOld)
containsOld := slices.Contains(consumerPeers, rsid) || slices.Contains(consumerPeerNames, rsid)
return fmt.Errorf("no equal consumer peers, expected: %v, got: %v, contains old peer (%s): %v", consumerPeers, consumerPeerNames, rsid, containsOld)
}
count++
}
if count != 3 {
return fmt.Errorf("expected 3 servers hosting stream, got: %d", count)
return fmt.Errorf("expected 3 servers hosting stream/consumer, got: %d", count)
}
return nil
})
Expand Down
Loading