|
| 1 | +// Copyright 2025 The Cockroach Authors. |
| 2 | +// |
| 3 | +// Use of this software is governed by the CockroachDB Software License |
| 4 | +// included in the /LICENSE file. |
| 5 | + |
| 6 | +package kvstorage |
| 7 | + |
| 8 | +import ( |
| 9 | + "testing" |
| 10 | + |
| 11 | + "github.com/cockroachdb/cockroach/pkg/keys" |
| 12 | + "github.com/cockroachdb/cockroach/pkg/kv/kvserver/spanset" |
| 13 | + "github.com/cockroachdb/cockroach/pkg/roachpb" |
| 14 | + "github.com/cockroachdb/cockroach/pkg/util/leaktest" |
| 15 | + "github.com/cockroachdb/cockroach/pkg/util/log" |
| 16 | + "github.com/stretchr/testify/require" |
| 17 | +) |
| 18 | + |
| 19 | +func TestValidateIsStateEngineSpan(t *testing.T) { |
| 20 | + defer leaktest.AfterTest(t)() |
| 21 | + defer log.Scope(t).Close(t) |
| 22 | + |
| 23 | + s := func(start, end roachpb.Key) roachpb.Span { |
| 24 | + return roachpb.Span{Key: start, EndKey: end} |
| 25 | + } |
| 26 | + testCases := []struct { |
| 27 | + span roachpb.Span |
| 28 | + notOk bool |
| 29 | + }{ |
| 30 | + // Full state engine spans. |
| 31 | + {span: s(roachpb.KeyMin, keys.LocalRangeIDPrefix.AsRawKey())}, |
| 32 | + {span: s(keys.RangeForceFlushKey(1), keys.RangeLeaseKey(1))}, |
| 33 | + {span: s(keys.LocalStoreMax, roachpb.KeyMax)}, |
| 34 | + |
| 35 | + // Full non-state engine spans. |
| 36 | + {span: s(roachpb.KeyMin, keys.MakeRangeIDUnreplicatedPrefix(1)), notOk: true}, // partial overlap |
| 37 | + {span: s(roachpb.KeyMin, roachpb.Key(keys.LocalStorePrefix).Next()), notOk: true}, |
| 38 | + {span: s(roachpb.KeyMin, keys.RaftTruncatedStateKey(1)), notOk: true}, |
| 39 | + {span: s(keys.LocalRangeIDPrefix.AsRawKey(), keys.LocalRangeIDPrefix.AsRawKey().PrefixEnd()), |
| 40 | + notOk: true}, |
| 41 | + {span: s(keys.RaftTruncatedStateKey(1), keys.RaftTruncatedStateKey(2)), notOk: true}, |
| 42 | + {span: s(keys.MakeRangeIDUnreplicatedPrefix(1).PrefixEnd(), roachpb.KeyMax), notOk: true}, // partial overlap |
| 43 | + {span: s(keys.MakeRangeIDUnreplicatedPrefix(1), |
| 44 | + keys.MakeRangeIDUnreplicatedPrefix(1).PrefixEnd()), notOk: true}, |
| 45 | + {span: s(keys.RangeTombstoneKey(1), keys.RaftTruncatedStateKey(1)), notOk: true}, |
| 46 | + {span: s(keys.RaftReplicaIDKey(1), keys.RaftTruncatedStateKey(1)), notOk: true}, |
| 47 | + {span: s(keys.RaftTruncatedStateKey(1), roachpb.KeyMax), notOk: true}, |
| 48 | + {span: s(keys.LocalStorePrefix, keys.LocalStoreMax), notOk: true}, |
| 49 | + {span: s(keys.StoreGossipKey(), keys.StoreIdentKey()), notOk: true}, |
| 50 | + {span: s(keys.LocalStoreMax.Prevish(1), roachpb.KeyMax), notOk: true}, |
| 51 | + |
| 52 | + // Point state engine spans. |
| 53 | + {span: s(roachpb.KeyMin, nil)}, |
| 54 | + {span: s(keys.LocalRangeIDPrefix.AsRawKey().Prevish(1), nil)}, |
| 55 | + {span: s(keys.RangeForceFlushKey(1), nil)}, |
| 56 | + {span: s(keys.MakeRangeIDUnreplicatedPrefix(1).Prevish(1), nil)}, |
| 57 | + {span: s(keys.RangeTombstoneKey(1), nil)}, |
| 58 | + {span: s(keys.RaftReplicaIDKey(1), nil)}, |
| 59 | + {span: s(keys.MakeRangeIDUnreplicatedPrefix(1).PrefixEnd(), nil)}, |
| 60 | + {span: s(keys.LocalRangeIDPrefix.AsRawKey().PrefixEnd(), nil)}, |
| 61 | + {span: s(roachpb.Key(keys.LocalStorePrefix).Prevish(1), nil)}, |
| 62 | + {span: s(keys.LocalStoreMax, nil)}, |
| 63 | + {span: s(keys.LocalStoreMax.Next(), nil)}, |
| 64 | + {span: s(roachpb.KeyMax, nil)}, |
| 65 | + |
| 66 | + // Point non-state engine spans. |
| 67 | + {span: s(keys.MakeRangeIDUnreplicatedPrefix(1), nil), notOk: true}, |
| 68 | + {span: s(keys.RaftTruncatedStateKey(1), nil), notOk: true}, |
| 69 | + {span: s(keys.RaftTruncatedStateKey(2), nil), notOk: true}, |
| 70 | + {span: s(keys.MakeRangeIDUnreplicatedPrefix(1).PrefixEnd().Prevish(1), nil), notOk: true}, |
| 71 | + {span: s(keys.LocalStorePrefix, nil), notOk: true}, |
| 72 | + {span: s(keys.StoreGossipKey(), nil), notOk: true}, |
| 73 | + {span: s(keys.LocalStoreMax.Prevish(1), nil), notOk: true}, |
| 74 | + |
| 75 | + // Tricky state engine spans. |
| 76 | + {span: s(nil, keys.LocalRangeIDPrefix.AsRawKey())}, |
| 77 | + {span: s(nil, keys.MakeRangeIDUnreplicatedPrefix(1))}, |
| 78 | + {span: s(nil, keys.RangeForceFlushKey(1))}, |
| 79 | + {span: s(nil, keys.MakeRangeIDUnreplicatedPrefix(1).PrefixEnd().Next())}, |
| 80 | + {span: s(nil, keys.LocalRangeIDPrefix.AsRawKey().PrefixEnd().Next())}, |
| 81 | + {span: s(nil, keys.LocalStorePrefix)}, |
| 82 | + {span: s(nil, keys.LocalStoreMax.Next())}, |
| 83 | + |
| 84 | + // Tricky non-state engine spans. |
| 85 | + {span: s(nil, keys.MakeRangeIDUnreplicatedPrefix(1).Next()), notOk: true}, |
| 86 | + {span: s(nil, keys.RaftTruncatedStateKey(1).Next()), notOk: true}, |
| 87 | + {span: s(nil, keys.RaftTruncatedStateKey(2).Next()), notOk: true}, |
| 88 | + {span: s(nil, keys.MakeRangeIDUnreplicatedPrefix(1).PrefixEnd()), notOk: true}, |
| 89 | + {span: s(nil, keys.LocalRangeIDPrefix.AsRawKey().PrefixEnd()), notOk: true}, // can't decode RangeID. |
| 90 | + {span: s(nil, roachpb.Key(keys.LocalStorePrefix).Next()), notOk: true}, |
| 91 | + {span: s(nil, keys.StoreGossipKey()), notOk: true}, |
| 92 | + {span: s(nil, keys.LocalStoreMax), notOk: true}, |
| 93 | + } |
| 94 | + |
| 95 | + for _, tc := range testCases { |
| 96 | + t.Run("", func(t *testing.T) { |
| 97 | + err := validateIsStateEngineSpan(spanset.TrickySpan(tc.span)) |
| 98 | + require.Equal(t, tc.notOk, err != nil, tc.span) |
| 99 | + }) |
| 100 | + } |
| 101 | +} |
| 102 | + |
| 103 | +func TestValidateIsRaftEngineSpan(t *testing.T) { |
| 104 | + defer leaktest.AfterTest(t)() |
| 105 | + defer log.Scope(t).Close(t) |
| 106 | + |
| 107 | + s := func(start, end roachpb.Key) roachpb.Span { |
| 108 | + return roachpb.Span{Key: start, EndKey: end} |
| 109 | + } |
| 110 | + testCases := []struct { |
| 111 | + span roachpb.Span |
| 112 | + notOk bool |
| 113 | + }{ |
| 114 | + // Full spans not overlapping with state engine spans. |
| 115 | + {span: s(keys.RangeTombstoneKey(1).Next(), keys.RaftReplicaIDKey(1))}, |
| 116 | + {span: s(keys.RaftReplicaIDKey(1).Next(), keys.RangeLastReplicaGCTimestampKey(1).Next())}, |
| 117 | + {span: s(keys.LocalStorePrefix, keys.LocalStoreMax)}, |
| 118 | + |
| 119 | + // Full spans overlapping with state engine spans. |
| 120 | + {span: s(keys.MinKey, keys.LocalStorePrefix), notOk: true}, |
| 121 | + {span: s(keys.RangeGCThresholdKey(1), keys.RangeVersionKey(1)), notOk: true}, |
| 122 | + {span: s(keys.RangeTombstoneKey(1), keys.RaftReplicaIDKey(1)), notOk: true}, |
| 123 | + {span: s(keys.RaftReplicaIDKey(1), keys.LocalRangeIDPrefix.AsRawKey().PrefixEnd()), notOk: true}, |
| 124 | + {span: s(keys.RangeGCThresholdKey(1), keys.RangeGCThresholdKey(2)), notOk: true}, |
| 125 | + {span: s(keys.LocalRangeIDPrefix.AsRawKey().PrefixEnd(), keys.LocalStorePrefix), notOk: true}, |
| 126 | + {span: s(keys.LocalStoreMax, keys.MaxKey), notOk: true}, |
| 127 | + |
| 128 | + // Point spans not overlapping with state engine spans. |
| 129 | + {span: s(keys.RaftLogKey(1, 1), nil)}, |
| 130 | + {span: s(keys.RangeTombstoneKey(1).Next(), nil)}, |
| 131 | + {span: s(keys.RaftReplicaIDKey(1).Next(), nil)}, |
| 132 | + {span: s(keys.RaftTruncatedStateKey(1).Next(), nil)}, |
| 133 | + {span: s(keys.LocalStorePrefix, nil)}, |
| 134 | + {span: s(roachpb.Key(keys.LocalStorePrefix).Next(), nil)}, |
| 135 | + {span: s(keys.LocalStoreMax.Prevish(1), nil)}, |
| 136 | + |
| 137 | + // Point spans overlapping with state engine spans. |
| 138 | + {span: s(keys.LocalRangeIDPrefix.AsRawKey(), nil), notOk: true}, // invalid start key |
| 139 | + {span: s(keys.RangeLeaseKey(1), nil), notOk: true}, |
| 140 | + {span: s(keys.RangeTombstoneKey(1), nil), notOk: true}, |
| 141 | + {span: s(keys.RaftReplicaIDKey(1), nil), notOk: true}, |
| 142 | + {span: s(keys.RangeTombstoneKey(2), nil), notOk: true}, |
| 143 | + {span: s(keys.RaftReplicaIDKey(2), nil), notOk: true}, |
| 144 | + {span: s(keys.LocalRangeIDPrefix.AsRawKey().PrefixEnd(), nil), notOk: true}, |
| 145 | + |
| 146 | + // Tricky spans not overlapping with state engine spans. |
| 147 | + {span: s(nil, keys.RaftLogKey(1, 1))}, |
| 148 | + {span: s(nil, keys.RangeTombstoneKey(1))}, |
| 149 | + {span: s(nil, keys.RaftReplicaIDKey(1))}, |
| 150 | + {span: s(nil, roachpb.Key(keys.LocalStorePrefix).PrefixEnd())}, |
| 151 | + |
| 152 | + // Tricky spans overlapping with state engine spans. |
| 153 | + {span: s(nil, keys.LocalRangeIDPrefix.AsRawKey()), notOk: true}, |
| 154 | + {span: s(nil, keys.LocalStorePrefix), notOk: true}, |
| 155 | + {span: s(nil, keys.RangeLeaseKey(1)), notOk: true}, |
| 156 | + {span: s(nil, keys.RangeTombstoneKey(1).Next()), notOk: true}, |
| 157 | + {span: s(nil, keys.RaftReplicaIDKey(1).Next()), notOk: true}, |
| 158 | + {span: s(nil, roachpb.Key(keys.LocalStorePrefix).PrefixEnd().Next()), notOk: true}, |
| 159 | + } |
| 160 | + |
| 161 | + for _, tc := range testCases { |
| 162 | + t.Run("", func(t *testing.T) { |
| 163 | + err := validateIsRaftEngineSpan(spanset.TrickySpan(tc.span)) |
| 164 | + require.Equal(t, tc.notOk, err != nil, tc.span) |
| 165 | + }) |
| 166 | + } |
| 167 | +} |
0 commit comments