-
Notifications
You must be signed in to change notification settings - Fork 500
/
cluster_slots.c
217 lines (193 loc) · 7.87 KB
/
cluster_slots.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
/* Cluster slots APIs and commands - to retrieve, update and process slot level data
* in association with Valkey cluster.
*
* Copyright (c) 2024, Kyle Kim <kimkyle at amazon dot com>, Amazon Web Services.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Valkey nor the names of its contributors may be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* 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 "server.h"
#include "cluster.h"
#include "cluster_legacy.h"
#define DEFAULT_SLOT -1
#define DEFAULT_STAT 0
#define UNASSIGNED_SLOT 0
#define ORDER_BY_KEY_COUNT 1
#define ORDER_BY_INVALID -1
/* -----------------------------------------------------------------------------
* CLUSTER SLOT-STATS command
* -------------------------------------------------------------------------- */
typedef struct sortedSlotStatEntry {
int slot;
uint64_t stat;
} sortedSlotStatEntry;
static int doesSlotBelongToMyShard(int slot) {
clusterNode *n = clusterNodeGetMaster(server.cluster->myself);
return server.cluster->slots[slot] == n;
}
static void markAssignedSlots(unsigned char *slots) {
for (int slot = 0; slot < CLUSTER_SLOTS; slot++) {
if (doesSlotBelongToMyShard(slot)) slots[slot]++;
}
}
static int countAssignedSlotsFromSlotsArray(unsigned char *slots) {
int count = 0;
for (int slot = 0; slot < CLUSTER_SLOTS; slot++) {
if (slots[slot]) count++;
}
return count;
}
static void checkSlotAssignment(unsigned char *slots, int start_slot, int end_slot) {
for (int slot = start_slot; slot <= end_slot; slot++) {
if (doesSlotBelongToMyShard(slot)) {
slots[slot]++;
}
}
}
static uint64_t getSingleSlotStat(int slot, int order_by) {
serverAssert(order_by != ORDER_BY_INVALID);
uint64_t singleSlotStat = 0;
if (order_by == ORDER_BY_KEY_COUNT) {
singleSlotStat = countKeysInSlot(slot);
}
return singleSlotStat;
}
static int slotStatEntryAscCmp(const void *a, const void *b) {
sortedSlotStatEntry entry_a = *((sortedSlotStatEntry *) a);
sortedSlotStatEntry entry_b = *((sortedSlotStatEntry *) b);
return entry_a.stat - entry_b.stat;
}
static int slotStatEntryDescCmp(const void *a, const void *b) {
sortedSlotStatEntry entry_a = *((sortedSlotStatEntry *) a);
sortedSlotStatEntry entry_b = *((sortedSlotStatEntry *) b);
return entry_b.stat - entry_a.stat;
}
static void sortSlotStats(sortedSlotStatEntry sorted[], int order_by, int desc) {
int i = 0;
for (int slot = 0; slot < CLUSTER_SLOTS; slot++) {
if (doesSlotBelongToMyShard(slot)) {
sorted[i].slot = slot;
sorted[i].stat = getSingleSlotStat(slot, order_by);
i++;
}
}
qsort(sorted, i, sizeof(sortedSlotStatEntry), (desc) ? slotStatEntryDescCmp : slotStatEntryAscCmp);
}
static void addReplySingleSlotStat(client *c, int slot) {
addReplyLongLong(c, slot);
addReplyMapLen(c, 1);
addReplyBulkCString(c, "key-count");
addReplyLongLong(c, countKeysInSlot(slot));
}
static void addReplySlotStats(client *c, unsigned char *slots) {
int num_slots_assigned = countAssignedSlotsFromSlotsArray(slots);
addReplyMapLen(c, num_slots_assigned);
for (int slot = 0; slot < CLUSTER_SLOTS; slot++) {
if (slots[slot]) addReplySingleSlotStat(c, slot);
}
}
static void addReplySortedSlotStats(client *c, sortedSlotStatEntry sorted[], long limit) {
int num_slots_assigned = getMyShardSlotCount();
int len = min(limit, num_slots_assigned);
addReplyMapLen(c, len);
for (int i = 0; i < len; i++) {
addReplySingleSlotStat(c, sorted[i].slot);
}
}
static void sortAndAddReplySlotStats(client *c, int order_by, long limit, int desc) {
sortedSlotStatEntry sorted[CLUSTER_SLOTS];
sortSlotStats(sorted, order_by, desc);
addReplySortedSlotStats(c, sorted, limit);
}
void clusterSlotStatsCommand(client *c) {
if (server.cluster_enabled == 0) {
addReplyError(c,"This instance has cluster support disabled");
return;
}
/* Initialize slot assignment array. */
unsigned char slots[CLUSTER_SLOTS]= {UNASSIGNED_SLOT};
/* No further arguments. */
if (c->argc == 2) {
/* CLUSTER SLOT-STATS */
markAssignedSlots(slots);
addReplySlotStats(c, slots);
return;
}
/* Parse additional arguments. */
if (!strcasecmp(c->argv[2]->ptr,"slotsrange") && c->argc == 5) {
/* CLUSTER SLOT-STATS SLOTSRANGE start-slot end-slot */
int startslot, endslot;
if ((startslot = getSlotOrReply(c,c->argv[3])) == C_ERR ||
(endslot = getSlotOrReply(c,c->argv[4])) == C_ERR) {
return;
}
if (startslot > endslot) {
addReplyErrorFormat(c,"start slot number %d is greater than end slot number %d", startslot, endslot);
return;
}
checkSlotAssignment(slots, startslot, endslot);
addReplySlotStats(c, slots);
} else if (!strcasecmp(c->argv[2]->ptr,"orderby") && c->argc >= 4) {
/* CLUSTER SLOT-STATS ORDERBY column [LIMIT limit] [ASC | DESC] */
int desc = 1, order_by = ORDER_BY_INVALID;
if (!strcasecmp(c->argv[3]->ptr, "key-count")) {
order_by = ORDER_BY_KEY_COUNT;
} else {
addReplyError(c, "unrecognized sort column for ORDER BY. The supported columns are: key-count.");
return;
}
int i = 4; /* Next argument index, following ORDERBY */
int limit_counter = 0, asc_desc_counter = 0;
long limit;
while(i < c->argc) {
int moreargs = c->argc > i+1;
if (!strcasecmp(c->argv[i]->ptr,"limit") && moreargs) {
if (getRangeLongFromObjectOrReply(
c, c->argv[i+1], 1, CLUSTER_SLOTS, &limit,
"limit has to lie in between 1 and 16384 (maximum number of slots)") != C_OK)
return;
i++;
limit_counter++;
} else if (!strcasecmp(c->argv[i]->ptr,"asc")) {
desc = 0;
asc_desc_counter++;
} else if (!strcasecmp(c->argv[i]->ptr,"desc")) {
desc = 1;
asc_desc_counter++;
} else {
addReplyErrorObject(c,shared.syntaxerr);
return;
}
if (limit_counter > 1 || asc_desc_counter > 1) {
addReplyError(c, "you cannot provide multiple filters of the same type.");
return;
}
i++;
}
sortAndAddReplySlotStats(c, order_by, limit, desc);
} else {
addReplySubcommandSyntaxError(c);
}
}