]>
Commit | Line | Data |
---|---|---|
11ac6ff6 PN |
1 | /* Memory layout of a ziplist, containing "foo", "bar", "quux": |
2 | * <zlbytes><zllen><len>"foo"<len>"bar"<len>"quux" | |
3 | * | |
4 | * <zlbytes> is an unsigned integer to hold the number of bytes that | |
5 | * the ziplist occupies. This is stored to not have to traverse the ziplist | |
6 | * to know the new length when pushing. | |
7 | * | |
8 | * <zllen> is the number of items in the ziplist. When this value is | |
9 | * greater than 254, we need to traverse the entire list to know | |
10 | * how many items it holds. | |
11 | * | |
12 | * <len> is the number of bytes occupied by a single entry. When this | |
13 | * number is greater than 253, the length will occupy 5 bytes, where | |
14 | * the extra bytes contain an unsigned integer to hold the length. | |
15 | */ | |
16 | ||
17 | #include <stdio.h> | |
29b14d5f | 18 | #include <stdlib.h> |
11ac6ff6 PN |
19 | #include <string.h> |
20 | #include <assert.h> | |
29b14d5f | 21 | #include <limits.h> |
11ac6ff6 PN |
22 | #include "zmalloc.h" |
23 | #include "sds.h" | |
24 | #include "ziplist.h" | |
11ac6ff6 | 25 | |
dcb9cf4e PN |
26 | /* Important note: the ZIP_END value is used to depict the end of the |
27 | * ziplist structure. When a pointer contains an entry, the first couple | |
28 | * of bytes contain the encoded length of the previous entry. This length | |
29 | * is encoded as ZIP_ENC_RAW length, so the first two bits will contain 00 | |
30 | * and the byte will therefore never have a value of 255. */ | |
37fff074 | 31 | #define ZIP_END 255 |
aa549962 | 32 | #define ZIP_BIGLEN 254 |
37fff074 PN |
33 | |
34 | /* Entry encoding */ | |
35 | #define ZIP_ENC_RAW 0 | |
36 | #define ZIP_ENC_SHORT 1 | |
37 | #define ZIP_ENC_INT 2 | |
38 | #define ZIP_ENC_LLONG 3 | |
39 | #define ZIP_ENCODING(p) ((p)[0] >> 6) | |
40 | ||
41 | /* Length encoding for raw entries */ | |
42 | #define ZIP_LEN_INLINE 0 | |
43 | #define ZIP_LEN_UINT16 1 | |
44 | #define ZIP_LEN_UINT32 2 | |
45 | ||
46 | /* Utility macros */ | |
11ac6ff6 | 47 | #define ZIPLIST_BYTES(zl) (*((unsigned int*)(zl))) |
dcb9cf4e PN |
48 | #define ZIPLIST_TAIL_OFFSET(zl) (*((zl)+sizeof(unsigned int))) |
49 | #define ZIPLIST_LENGTH(zl) (*((zl)+2*sizeof(unsigned int))) | |
50 | #define ZIPLIST_HEADER_SIZE (2*sizeof(unsigned int)+1) | |
1ce81fa5 PN |
51 | #define ZIPLIST_ENTRY_HEAD(zl) ((zl)+ZIPLIST_HEADER_SIZE) |
52 | #define ZIPLIST_ENTRY_TAIL(zl) ((zl)+ZIPLIST_TAIL_OFFSET(zl)) | |
53 | #define ZIPLIST_ENTRY_END(zl) ((zl)+ZIPLIST_BYTES(zl)-1) | |
f6eb1747 | 54 | #define ZIPLIST_INCR_LENGTH(zl,incr) { \ |
aa549962 | 55 | if (ZIPLIST_LENGTH(zl) < ZIP_BIGLEN) ZIPLIST_LENGTH(zl)+=incr; } |
11ac6ff6 | 56 | |
a5456b2c PN |
57 | typedef struct zlentry { |
58 | unsigned int prevrawlensize, prevrawlen; | |
59 | unsigned int lensize, len; | |
60 | unsigned int headersize; | |
61 | unsigned char encoding; | |
0c0d0564 | 62 | unsigned char *p; |
a5456b2c PN |
63 | } zlentry; |
64 | ||
37fff074 PN |
65 | /* Return bytes needed to store integer encoded by 'encoding' */ |
66 | static unsigned int zipEncodingSize(char encoding) { | |
67 | if (encoding == ZIP_ENC_SHORT) { | |
68 | return sizeof(short int); | |
69 | } else if (encoding == ZIP_ENC_INT) { | |
70 | return sizeof(int); | |
71 | } else if (encoding == ZIP_ENC_LLONG) { | |
72 | return sizeof(long long); | |
73 | } | |
74 | assert(NULL); | |
75 | } | |
76 | ||
77 | /* Decode the encoded length pointed by 'p'. If a pointer to 'lensize' is | |
78 | * provided, it is set to the number of bytes required to encode the length. */ | |
79 | static unsigned int zipDecodeLength(unsigned char *p, unsigned int *lensize) { | |
80 | unsigned char encoding = ZIP_ENCODING(p), lenenc; | |
81 | unsigned int len; | |
82 | ||
83 | if (encoding == ZIP_ENC_RAW) { | |
84 | lenenc = (p[0] >> 4) & 0x3; | |
85 | if (lenenc == ZIP_LEN_INLINE) { | |
86 | len = p[0] & 0xf; | |
87 | if (lensize) *lensize = 1; | |
88 | } else if (lenenc == ZIP_LEN_UINT16) { | |
89 | len = p[1] | (p[2] << 8); | |
90 | if (lensize) *lensize = 3; | |
91 | } else { | |
92 | len = p[1] | (p[2] << 8) | (p[3] << 16) | (p[4] << 24); | |
93 | if (lensize) *lensize = 5; | |
94 | } | |
95 | } else { | |
96 | len = zipEncodingSize(encoding); | |
97 | if (lensize) *lensize = 1; | |
98 | } | |
99 | return len; | |
100 | } | |
101 | ||
102 | /* Encode the length 'l' writing it in 'p'. If p is NULL it just returns | |
103 | * the amount of bytes required to encode such a length. */ | |
104 | static unsigned int zipEncodeLength(unsigned char *p, char encoding, unsigned int rawlen) { | |
105 | unsigned char len = 1, lenenc, buf[5]; | |
106 | if (encoding == ZIP_ENC_RAW) { | |
107 | if (rawlen <= 0xf) { | |
108 | if (!p) return len; | |
109 | lenenc = ZIP_LEN_INLINE; | |
110 | buf[0] = rawlen; | |
111 | } else if (rawlen <= 0xffff) { | |
112 | len += 2; | |
113 | if (!p) return len; | |
114 | lenenc = ZIP_LEN_UINT16; | |
115 | buf[1] = (rawlen ) & 0xff; | |
116 | buf[2] = (rawlen >> 8) & 0xff; | |
117 | } else { | |
118 | len += 4; | |
119 | if (!p) return len; | |
120 | lenenc = ZIP_LEN_UINT32; | |
121 | buf[1] = (rawlen ) & 0xff; | |
122 | buf[2] = (rawlen >> 8) & 0xff; | |
123 | buf[3] = (rawlen >> 16) & 0xff; | |
124 | buf[4] = (rawlen >> 24) & 0xff; | |
125 | } | |
126 | buf[0] = (lenenc << 4) | (buf[0] & 0xf); | |
127 | } | |
128 | if (!p) return len; | |
129 | ||
130 | /* Apparently we need to store the length in 'p' */ | |
131 | buf[0] = (encoding << 6) | (buf[0] & 0x3f); | |
132 | memcpy(p,buf,len); | |
133 | return len; | |
134 | } | |
135 | ||
7b1f85c0 PN |
136 | /* Decode the length of the previous element stored at "p". */ |
137 | static unsigned int zipPrevDecodeLength(unsigned char *p, unsigned int *lensize) { | |
138 | unsigned int len = *p; | |
139 | if (len < ZIP_BIGLEN) { | |
140 | if (lensize) *lensize = 1; | |
141 | } else { | |
142 | if (lensize) *lensize = 1+sizeof(len); | |
143 | memcpy(&len,p+1,sizeof(len)); | |
144 | } | |
145 | return len; | |
146 | } | |
147 | ||
148 | /* Encode the length of the previous entry and write it to "p". Return the | |
149 | * number of bytes needed to encode this length if "p" is NULL. */ | |
150 | static unsigned int zipPrevEncodeLength(unsigned char *p, unsigned int len) { | |
151 | if (p == NULL) { | |
152 | return (len < ZIP_BIGLEN) ? 1 : sizeof(len)+1; | |
153 | } else { | |
154 | if (len < ZIP_BIGLEN) { | |
155 | p[0] = len; | |
156 | return 1; | |
157 | } else { | |
158 | p[0] = ZIP_BIGLEN; | |
159 | memcpy(p+1,&len,sizeof(len)); | |
160 | return 1+sizeof(len); | |
161 | } | |
162 | } | |
163 | } | |
164 | ||
dcb9cf4e PN |
165 | /* Return the difference in number of bytes needed to store the new length |
166 | * "len" on the entry pointed to by "p". */ | |
167 | static int zipPrevLenByteDiff(unsigned char *p, unsigned int len) { | |
168 | unsigned int prevlensize; | |
7b1f85c0 PN |
169 | zipPrevDecodeLength(p,&prevlensize); |
170 | return zipPrevEncodeLength(NULL,len)-prevlensize; | |
dcb9cf4e PN |
171 | } |
172 | ||
37fff074 PN |
173 | /* Check if string pointed to by 'entry' can be encoded as an integer. |
174 | * Stores the integer value in 'v' and its encoding in 'encoding'. | |
175 | * Warning: this function requires a NULL-terminated string! */ | |
176 | static int zipTryEncoding(unsigned char *entry, long long *v, char *encoding) { | |
177 | long long value; | |
178 | char *eptr; | |
179 | ||
180 | if (entry[0] == '-' || (entry[0] >= '0' && entry[0] <= '9')) { | |
fc2c0f7a | 181 | value = strtoll((char*)entry,&eptr,10); |
37fff074 PN |
182 | if (eptr[0] != '\0') return 0; |
183 | if (value >= SHRT_MIN && value <= SHRT_MAX) { | |
184 | *encoding = ZIP_ENC_SHORT; | |
185 | } else if (value >= INT_MIN && value <= INT_MAX) { | |
186 | *encoding = ZIP_ENC_INT; | |
187 | } else { | |
188 | *encoding = ZIP_ENC_LLONG; | |
189 | } | |
190 | *v = value; | |
191 | return 1; | |
192 | } | |
193 | return 0; | |
194 | } | |
195 | ||
196 | /* Store integer 'value' at 'p', encoded as 'encoding' */ | |
197 | static void zipSaveInteger(unsigned char *p, long long value, char encoding) { | |
198 | short int s; | |
199 | int i; | |
200 | long long l; | |
201 | if (encoding == ZIP_ENC_SHORT) { | |
202 | s = value; | |
203 | memcpy(p,&s,sizeof(s)); | |
204 | } else if (encoding == ZIP_ENC_INT) { | |
205 | i = value; | |
206 | memcpy(p,&i,sizeof(i)); | |
207 | } else if (encoding == ZIP_ENC_LLONG) { | |
208 | l = value; | |
209 | memcpy(p,&l,sizeof(l)); | |
210 | } else { | |
211 | assert(NULL); | |
212 | } | |
213 | } | |
214 | ||
215 | /* Read integer encoded as 'encoding' from 'p' */ | |
216 | static long long zipLoadInteger(unsigned char *p, char encoding) { | |
217 | short int s; | |
218 | int i; | |
219 | long long l, ret; | |
220 | if (encoding == ZIP_ENC_SHORT) { | |
221 | memcpy(&s,p,sizeof(s)); | |
222 | ret = s; | |
223 | } else if (encoding == ZIP_ENC_INT) { | |
224 | memcpy(&i,p,sizeof(i)); | |
225 | ret = i; | |
226 | } else if (encoding == ZIP_ENC_LLONG) { | |
227 | memcpy(&l,p,sizeof(l)); | |
228 | ret = l; | |
229 | } else { | |
230 | assert(NULL); | |
231 | } | |
232 | return ret; | |
233 | } | |
234 | ||
a5456b2c PN |
235 | /* Return a struct with all information about an entry. */ |
236 | static zlentry zipEntry(unsigned char *p) { | |
237 | zlentry e; | |
7b1f85c0 | 238 | e.prevrawlen = zipPrevDecodeLength(p,&e.prevrawlensize); |
a5456b2c PN |
239 | e.len = zipDecodeLength(p+e.prevrawlensize,&e.lensize); |
240 | e.headersize = e.prevrawlensize+e.lensize; | |
241 | e.encoding = ZIP_ENCODING(p+e.prevrawlensize); | |
0c0d0564 | 242 | e.p = p; |
a5456b2c PN |
243 | return e; |
244 | } | |
245 | ||
bb57b965 | 246 | /* Return the total number of bytes used by the entry at "p". */ |
37fff074 | 247 | static unsigned int zipRawEntryLength(unsigned char *p) { |
bb57b965 PN |
248 | zlentry e = zipEntry(p); |
249 | return e.headersize + e.len; | |
37fff074 PN |
250 | } |
251 | ||
11ac6ff6 PN |
252 | /* Create a new empty ziplist. */ |
253 | unsigned char *ziplistNew(void) { | |
254 | unsigned int bytes = ZIPLIST_HEADER_SIZE+1; | |
255 | unsigned char *zl = zmalloc(bytes); | |
256 | ZIPLIST_BYTES(zl) = bytes; | |
dcb9cf4e | 257 | ZIPLIST_TAIL_OFFSET(zl) = ZIPLIST_HEADER_SIZE; |
11ac6ff6 PN |
258 | ZIPLIST_LENGTH(zl) = 0; |
259 | zl[bytes-1] = ZIP_END; | |
260 | return zl; | |
261 | } | |
262 | ||
37fff074 | 263 | /* Resize the ziplist. */ |
11ac6ff6 | 264 | static unsigned char *ziplistResize(unsigned char *zl, unsigned int len) { |
37fff074 | 265 | zl = zrealloc(zl,len); |
11ac6ff6 PN |
266 | ZIPLIST_BYTES(zl) = len; |
267 | zl[len-1] = ZIP_END; | |
268 | return zl; | |
269 | } | |
270 | ||
0c0d0564 PN |
271 | /* Delete "num" entries, starting at "p". Returns pointer to the ziplist. */ |
272 | static unsigned char *__ziplistDelete(unsigned char *zl, unsigned char *p, int num) { | |
273 | unsigned int i, totlen, deleted = 0; | |
274 | int nextdiff = 0; | |
275 | zlentry first = zipEntry(p); | |
276 | for (i = 0; p[0] != ZIP_END && i < num; i++) { | |
277 | p += zipRawEntryLength(p); | |
278 | deleted++; | |
279 | } | |
280 | ||
281 | totlen = p-first.p; | |
282 | if (totlen > 0) { | |
283 | if (p[0] != ZIP_END) { | |
284 | /* Tricky: storing the prevlen in this entry might reduce or | |
285 | * increase the number of bytes needed, compared to the current | |
286 | * prevlen. Note that we can always store this length because | |
287 | * it was previously stored by an entry that is being deleted. */ | |
288 | nextdiff = zipPrevLenByteDiff(p,first.prevrawlen); | |
7b1f85c0 | 289 | zipPrevEncodeLength(p-nextdiff,first.prevrawlen); |
0c0d0564 PN |
290 | |
291 | /* Update offset for tail */ | |
292 | ZIPLIST_TAIL_OFFSET(zl) -= totlen+nextdiff; | |
293 | ||
294 | /* Move tail to the front of the ziplist */ | |
295 | memmove(first.p,p-nextdiff,ZIPLIST_BYTES(zl)-(p-zl)-1+nextdiff); | |
296 | } else { | |
297 | /* The entire tail was deleted. No need to move memory. */ | |
298 | ZIPLIST_TAIL_OFFSET(zl) = (first.p-zl)-first.prevrawlen; | |
299 | } | |
300 | ||
301 | /* Resize and update length */ | |
302 | zl = ziplistResize(zl, ZIPLIST_BYTES(zl)-totlen+nextdiff); | |
303 | ZIPLIST_INCR_LENGTH(zl,-deleted); | |
304 | } | |
305 | return zl; | |
11ac6ff6 PN |
306 | } |
307 | ||
6435c767 PN |
308 | /* Insert item at "p". */ |
309 | static unsigned char *__ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen) { | |
310 | unsigned int curlen = ZIPLIST_BYTES(zl), reqlen, prevlen = 0; | |
311 | unsigned int offset, nextdiff = 0; | |
312 | unsigned char *tail; | |
29b14d5f PN |
313 | char encoding = ZIP_ENC_RAW; |
314 | long long value; | |
6435c767 | 315 | zlentry entry; |
11ac6ff6 | 316 | |
6435c767 PN |
317 | /* Find out prevlen for the entry that is inserted. */ |
318 | if (p[0] != ZIP_END) { | |
319 | entry = zipEntry(p); | |
320 | prevlen = entry.prevrawlen; | |
dcb9cf4e | 321 | } else { |
1ce81fa5 | 322 | tail = ZIPLIST_ENTRY_TAIL(zl); |
6435c767 PN |
323 | if (tail[0] != ZIP_END) { |
324 | prevlen = zipRawEntryLength(tail); | |
325 | } | |
dcb9cf4e PN |
326 | } |
327 | ||
29b14d5f | 328 | /* See if the entry can be encoded */ |
6435c767 | 329 | if (zipTryEncoding(s,&value,&encoding)) { |
29b14d5f PN |
330 | reqlen = zipEncodingSize(encoding); |
331 | } else { | |
6435c767 | 332 | reqlen = slen; |
29b14d5f | 333 | } |
dcb9cf4e PN |
334 | |
335 | /* We need space for both the length of the previous entry and | |
336 | * the length of the payload. */ | |
7b1f85c0 | 337 | reqlen += zipPrevEncodeLength(NULL,prevlen); |
6435c767 PN |
338 | reqlen += zipEncodeLength(NULL,encoding,slen); |
339 | ||
340 | /* When the insert position is not equal to the tail, we need to | |
341 | * make sure that the next entry can hold this entry's length in | |
342 | * its prevlen field. */ | |
343 | nextdiff = p[0] != ZIP_END ? zipPrevLenByteDiff(p,reqlen) : 0; | |
344 | ||
345 | /* Store offset because a realloc may change the address of zl. */ | |
346 | offset = p-zl; | |
347 | zl = ziplistResize(zl,curlen+reqlen+nextdiff); | |
348 | p = zl+offset; | |
349 | ||
350 | /* Apply memory move when necessary and update tail offset. */ | |
351 | if (p[0] != ZIP_END) { | |
352 | /* Subtract one because of the ZIP_END bytes */ | |
353 | memmove(p+reqlen,p-nextdiff,curlen-offset-1+nextdiff); | |
354 | /* Encode this entry's raw length in the next entry. */ | |
7b1f85c0 | 355 | zipPrevEncodeLength(p+reqlen,reqlen); |
6435c767 PN |
356 | /* Update offset for tail */ |
357 | ZIPLIST_TAIL_OFFSET(zl) += reqlen+nextdiff; | |
11ac6ff6 | 358 | } else { |
6435c767 PN |
359 | /* This element will be the new tail. */ |
360 | ZIPLIST_TAIL_OFFSET(zl) = p-zl; | |
dcb9cf4e PN |
361 | } |
362 | ||
11ac6ff6 | 363 | /* Write the entry */ |
7b1f85c0 | 364 | p += zipPrevEncodeLength(p,prevlen); |
6435c767 | 365 | p += zipEncodeLength(p,encoding,slen); |
29b14d5f PN |
366 | if (encoding != ZIP_ENC_RAW) { |
367 | zipSaveInteger(p,value,encoding); | |
368 | } else { | |
6435c767 | 369 | memcpy(p,s,slen); |
29b14d5f | 370 | } |
f6eb1747 | 371 | ZIPLIST_INCR_LENGTH(zl,1); |
11ac6ff6 PN |
372 | return zl; |
373 | } | |
374 | ||
6435c767 PN |
375 | unsigned char *ziplistPush(unsigned char *zl, unsigned char *s, unsigned int slen, int where) { |
376 | unsigned char *p; | |
1ce81fa5 | 377 | p = (where == ZIPLIST_HEAD) ? ZIPLIST_ENTRY_HEAD(zl) : ZIPLIST_ENTRY_END(zl); |
6435c767 PN |
378 | return __ziplistInsert(zl,p,s,slen); |
379 | } | |
380 | ||
29b14d5f | 381 | unsigned char *ziplistPop(unsigned char *zl, sds *target, int where) { |
a5456b2c | 382 | zlentry entry; |
11ac6ff6 | 383 | unsigned char *p; |
29b14d5f PN |
384 | long long value; |
385 | if (target) *target = NULL; | |
11ac6ff6 PN |
386 | |
387 | /* Get pointer to element to remove */ | |
1ce81fa5 | 388 | p = (where == ZIPLIST_HEAD) ? ZIPLIST_ENTRY_HEAD(zl) : ZIPLIST_ENTRY_TAIL(zl); |
11ac6ff6 | 389 | if (*p == ZIP_END) return zl; |
dcb9cf4e | 390 | |
a5456b2c | 391 | entry = zipEntry(p); |
29b14d5f | 392 | if (target) { |
a5456b2c PN |
393 | if (entry.encoding == ZIP_ENC_RAW) { |
394 | *target = sdsnewlen(p+entry.headersize,entry.len); | |
29b14d5f | 395 | } else { |
a5456b2c | 396 | value = zipLoadInteger(p+entry.headersize,entry.encoding); |
29b14d5f PN |
397 | *target = sdscatprintf(sdsempty(), "%lld", value); |
398 | } | |
399 | } | |
11ac6ff6 | 400 | |
0c0d0564 | 401 | zl = __ziplistDelete(zl,p,1); |
11ac6ff6 PN |
402 | return zl; |
403 | } | |
404 | ||
08253bf4 PN |
405 | /* Returns an offset to use for iterating with ziplistNext. */ |
406 | unsigned char *ziplistIndex(unsigned char *zl, unsigned int index) { | |
407 | unsigned char *p = zl+ZIPLIST_HEADER_SIZE; | |
408 | unsigned int i = 0; | |
409 | for (; i < index; i++) { | |
410 | if (*p == ZIP_END) break; | |
411 | p += zipRawEntryLength(p); | |
412 | } | |
413 | return p; | |
414 | } | |
415 | ||
75d8978e PN |
416 | /* Return pointer to next entry in ziplist. */ |
417 | unsigned char *ziplistNext(unsigned char *p) { | |
418 | return *p == ZIP_END ? p : p+zipRawEntryLength(p); | |
419 | } | |
420 | ||
421 | /* Get entry pointer to by 'p' and store in either 'e' or 'v' depending | |
422 | * on the encoding of the entry. 'e' is always set to NULL to be able | |
423 | * to find out whether the string pointer or the integer value was set. | |
424 | * Return 0 if 'p' points to the end of the zipmap, 1 otherwise. */ | |
03e52931 | 425 | unsigned int ziplistGet(unsigned char *p, unsigned char **sstr, unsigned int *slen, long long *sval) { |
a5456b2c | 426 | zlentry entry; |
75d8978e | 427 | if (*p == ZIP_END) return 0; |
03e52931 | 428 | if (sstr) *sstr = NULL; |
dcb9cf4e | 429 | |
a5456b2c PN |
430 | entry = zipEntry(p); |
431 | if (entry.encoding == ZIP_ENC_RAW) { | |
03e52931 PN |
432 | if (sstr) { |
433 | *slen = entry.len; | |
434 | *sstr = p+entry.headersize; | |
75d8978e PN |
435 | } |
436 | } else { | |
03e52931 PN |
437 | if (sval) { |
438 | *sval = zipLoadInteger(p+entry.headersize,entry.encoding); | |
75d8978e | 439 | } |
08253bf4 | 440 | } |
75d8978e | 441 | return 1; |
08253bf4 PN |
442 | } |
443 | ||
ba5b4bde PN |
444 | /* Delete a range of entries from the ziplist. */ |
445 | unsigned char *ziplistDeleteRange(unsigned char *zl, unsigned int index, unsigned int num) { | |
0c0d0564 PN |
446 | unsigned char *p = ziplistIndex(zl,index); |
447 | return __ziplistDelete(zl,p,num); | |
779deb60 PN |
448 | } |
449 | ||
0f10458c PN |
450 | /* Delete a single entry from the ziplist, pointed to by *p. |
451 | * Also update *p in place, to be able to iterate over the | |
452 | * ziplist, while deleting entries. */ | |
453 | unsigned char *ziplistDelete(unsigned char *zl, unsigned char **p) { | |
0c0d0564 PN |
454 | unsigned int offset = *p-zl; |
455 | zl = __ziplistDelete(zl,*p,1); | |
0f10458c | 456 | |
0c0d0564 PN |
457 | /* Store pointer to current element in p, because ziplistDelete will |
458 | * do a realloc which might result in a different "zl"-pointer. */ | |
0f10458c PN |
459 | *p = zl+offset; |
460 | return zl; | |
461 | } | |
462 | ||
c09c2c3b | 463 | /* Compare entry pointer to by 'p' with 'entry'. Return 1 if equal. */ |
03e52931 | 464 | unsigned int ziplistCompare(unsigned char *p, unsigned char *sstr, unsigned int slen) { |
a5456b2c PN |
465 | zlentry entry; |
466 | unsigned char sencoding; | |
467 | long long val, sval; | |
c09c2c3b PN |
468 | if (*p == ZIP_END) return 0; |
469 | ||
a5456b2c PN |
470 | entry = zipEntry(p); |
471 | if (entry.encoding == ZIP_ENC_RAW) { | |
c09c2c3b | 472 | /* Raw compare */ |
a5456b2c | 473 | if (entry.len == slen) { |
03e52931 | 474 | return memcmp(p+entry.headersize,sstr,slen) == 0; |
c09c2c3b PN |
475 | } else { |
476 | return 0; | |
477 | } | |
c4aace90 | 478 | } else { |
d593c488 | 479 | /* Try to compare encoded values */ |
03e52931 | 480 | if (zipTryEncoding(sstr,&sval,&sencoding)) { |
d593c488 PN |
481 | if (entry.encoding == sencoding) { |
482 | val = zipLoadInteger(p+entry.headersize,entry.encoding); | |
483 | return val == sval; | |
484 | } | |
c4aace90 | 485 | } |
c09c2c3b | 486 | } |
c4aace90 | 487 | return 0; |
c09c2c3b PN |
488 | } |
489 | ||
6205b463 PN |
490 | /* Return length of ziplist. */ |
491 | unsigned int ziplistLen(unsigned char *zl) { | |
492 | unsigned int len = 0; | |
493 | if (ZIPLIST_LENGTH(zl) < ZIP_BIGLEN) { | |
494 | len = ZIPLIST_LENGTH(zl); | |
495 | } else { | |
496 | unsigned char *p = zl+ZIPLIST_HEADER_SIZE; | |
497 | while (*p != ZIP_END) { | |
498 | p += zipRawEntryLength(p); | |
499 | len++; | |
500 | } | |
501 | ||
502 | /* Re-store length if small enough */ | |
503 | if (len < ZIP_BIGLEN) ZIPLIST_LENGTH(zl) = len; | |
504 | } | |
505 | return len; | |
506 | } | |
507 | ||
4812cf28 PN |
508 | /* Return size in bytes of ziplist. */ |
509 | unsigned int ziplistSize(unsigned char *zl) { | |
510 | return ZIPLIST_BYTES(zl); | |
511 | } | |
512 | ||
11ac6ff6 | 513 | void ziplistRepr(unsigned char *zl) { |
c8d9e7f4 PN |
514 | unsigned char *p; |
515 | zlentry entry; | |
11ac6ff6 | 516 | |
29b14d5f | 517 | printf("{total bytes %d} {length %u}\n",ZIPLIST_BYTES(zl), ZIPLIST_LENGTH(zl)); |
1ce81fa5 | 518 | p = ZIPLIST_ENTRY_HEAD(zl); |
11ac6ff6 | 519 | while(*p != ZIP_END) { |
c8d9e7f4 PN |
520 | entry = zipEntry(p); |
521 | printf("{offset %ld, header %u, payload %u} ",p-zl,entry.headersize,entry.len); | |
522 | p += entry.headersize; | |
523 | if (entry.encoding == ZIP_ENC_RAW) { | |
524 | fwrite(p,entry.len,1,stdout); | |
29b14d5f | 525 | } else { |
c8d9e7f4 | 526 | printf("%lld", zipLoadInteger(p,entry.encoding)); |
29b14d5f | 527 | } |
11ac6ff6 | 528 | printf("\n"); |
c8d9e7f4 | 529 | p += entry.len; |
11ac6ff6 PN |
530 | } |
531 | printf("{end}\n\n"); | |
532 | } | |
533 | ||
534 | #ifdef ZIPLIST_TEST_MAIN | |
11ac6ff6 | 535 | |
08253bf4 PN |
536 | unsigned char *createList() { |
537 | unsigned char *zl = ziplistNew(); | |
11ac6ff6 | 538 | zl = ziplistPush(zl, (unsigned char*)"foo", 3, ZIPLIST_TAIL); |
11ac6ff6 | 539 | zl = ziplistPush(zl, (unsigned char*)"quux", 4, ZIPLIST_TAIL); |
11ac6ff6 | 540 | zl = ziplistPush(zl, (unsigned char*)"hello", 5, ZIPLIST_HEAD); |
75d8978e | 541 | zl = ziplistPush(zl, (unsigned char*)"1024", 4, ZIPLIST_TAIL); |
08253bf4 PN |
542 | return zl; |
543 | } | |
544 | ||
29b14d5f PN |
545 | unsigned char *createIntList() { |
546 | unsigned char *zl = ziplistNew(); | |
547 | char buf[32]; | |
548 | ||
549 | sprintf(buf, "100"); | |
550 | zl = ziplistPush(zl, buf, strlen(buf), ZIPLIST_TAIL); | |
551 | sprintf(buf, "128000"); | |
552 | zl = ziplistPush(zl, buf, strlen(buf), ZIPLIST_TAIL); | |
553 | sprintf(buf, "-100"); | |
554 | zl = ziplistPush(zl, buf, strlen(buf), ZIPLIST_HEAD); | |
555 | sprintf(buf, "4294967296"); | |
556 | zl = ziplistPush(zl, buf, strlen(buf), ZIPLIST_HEAD); | |
557 | sprintf(buf, "non integer"); | |
558 | zl = ziplistPush(zl, buf, strlen(buf), ZIPLIST_TAIL); | |
559 | sprintf(buf, "much much longer non integer"); | |
560 | zl = ziplistPush(zl, buf, strlen(buf), ZIPLIST_TAIL); | |
561 | return zl; | |
562 | } | |
563 | ||
08253bf4 | 564 | int main(int argc, char **argv) { |
0f10458c | 565 | unsigned char *zl, *p, *q, *entry; |
335d16bc | 566 | unsigned int elen; |
75d8978e | 567 | long long value; |
08253bf4 PN |
568 | sds s; |
569 | ||
29b14d5f PN |
570 | zl = createIntList(); |
571 | ziplistRepr(zl); | |
572 | ||
08253bf4 | 573 | zl = createList(); |
11ac6ff6 PN |
574 | ziplistRepr(zl); |
575 | ||
576 | zl = ziplistPop(zl, &s, ZIPLIST_TAIL); | |
577 | printf("Pop tail: %s (length %ld)\n", s, sdslen(s)); | |
578 | ziplistRepr(zl); | |
579 | ||
580 | zl = ziplistPop(zl, &s, ZIPLIST_HEAD); | |
581 | printf("Pop head: %s (length %ld)\n", s, sdslen(s)); | |
582 | ziplistRepr(zl); | |
583 | ||
dcb9cf4e PN |
584 | zl = ziplistPop(zl, &s, ZIPLIST_TAIL); |
585 | printf("Pop tail: %s (length %ld)\n", s, sdslen(s)); | |
586 | ziplistRepr(zl); | |
587 | ||
588 | zl = ziplistPop(zl, &s, ZIPLIST_TAIL); | |
589 | printf("Pop tail: %s (length %ld)\n", s, sdslen(s)); | |
590 | ziplistRepr(zl); | |
591 | ||
08253bf4 PN |
592 | printf("Iterate list from 0 to end:\n"); |
593 | { | |
594 | zl = createList(); | |
595 | p = ziplistIndex(zl, 0); | |
75d8978e | 596 | while (ziplistGet(p, &entry, &elen, &value)) { |
335d16bc | 597 | printf("Entry: "); |
75d8978e PN |
598 | if (entry) { |
599 | fwrite(entry,elen,1,stdout); | |
600 | } else { | |
601 | printf("%lld", value); | |
602 | } | |
603 | p = ziplistNext(p); | |
604 | printf("\n"); | |
08253bf4 PN |
605 | } |
606 | printf("\n"); | |
607 | } | |
608 | ||
609 | printf("Iterate list from 1 to end:\n"); | |
610 | { | |
611 | zl = createList(); | |
612 | p = ziplistIndex(zl, 1); | |
75d8978e | 613 | while (ziplistGet(p, &entry, &elen, &value)) { |
335d16bc | 614 | printf("Entry: "); |
75d8978e PN |
615 | if (entry) { |
616 | fwrite(entry,elen,1,stdout); | |
617 | } else { | |
618 | printf("%lld", value); | |
619 | } | |
620 | p = ziplistNext(p); | |
621 | printf("\n"); | |
08253bf4 PN |
622 | } |
623 | printf("\n"); | |
624 | } | |
625 | ||
626 | printf("Iterate list from 2 to end:\n"); | |
627 | { | |
628 | zl = createList(); | |
629 | p = ziplistIndex(zl, 2); | |
75d8978e | 630 | while (ziplistGet(p, &entry, &elen, &value)) { |
335d16bc | 631 | printf("Entry: "); |
75d8978e PN |
632 | if (entry) { |
633 | fwrite(entry,elen,1,stdout); | |
634 | } else { | |
635 | printf("%lld", value); | |
636 | } | |
637 | p = ziplistNext(p); | |
638 | printf("\n"); | |
08253bf4 PN |
639 | } |
640 | printf("\n"); | |
641 | } | |
642 | ||
643 | printf("Iterate starting out of range:\n"); | |
644 | { | |
645 | zl = createList(); | |
75d8978e PN |
646 | p = ziplistIndex(zl, 4); |
647 | if (!ziplistGet(p, &entry, &elen, &value)) { | |
08253bf4 PN |
648 | printf("No entry\n"); |
649 | } else { | |
650 | printf("ERROR\n"); | |
651 | } | |
779deb60 PN |
652 | printf("\n"); |
653 | } | |
654 | ||
655 | printf("Delete inclusive range 0,0:\n"); | |
656 | { | |
657 | zl = createList(); | |
ba5b4bde | 658 | zl = ziplistDeleteRange(zl, 0, 1); |
779deb60 PN |
659 | ziplistRepr(zl); |
660 | } | |
661 | ||
662 | printf("Delete inclusive range 0,1:\n"); | |
663 | { | |
664 | zl = createList(); | |
ba5b4bde | 665 | zl = ziplistDeleteRange(zl, 0, 2); |
779deb60 PN |
666 | ziplistRepr(zl); |
667 | } | |
668 | ||
669 | printf("Delete inclusive range 1,2:\n"); | |
670 | { | |
671 | zl = createList(); | |
ba5b4bde | 672 | zl = ziplistDeleteRange(zl, 1, 2); |
779deb60 PN |
673 | ziplistRepr(zl); |
674 | } | |
675 | ||
676 | printf("Delete with start index out of range:\n"); | |
677 | { | |
678 | zl = createList(); | |
ba5b4bde | 679 | zl = ziplistDeleteRange(zl, 5, 1); |
779deb60 PN |
680 | ziplistRepr(zl); |
681 | } | |
682 | ||
683 | printf("Delete with num overflow:\n"); | |
684 | { | |
685 | zl = createList(); | |
ba5b4bde | 686 | zl = ziplistDeleteRange(zl, 1, 5); |
779deb60 | 687 | ziplistRepr(zl); |
08253bf4 PN |
688 | } |
689 | ||
0f10458c PN |
690 | printf("Delete foo while iterating:\n"); |
691 | { | |
692 | zl = createList(); | |
693 | p = ziplistIndex(zl, 0); | |
75d8978e PN |
694 | while (ziplistGet(p, &entry, &elen, &value)) { |
695 | if (entry && strncmp("foo", entry, elen) == 0) { | |
0f10458c | 696 | printf("Delete foo\n"); |
75d8978e | 697 | zl = ziplistDelete(zl, &p); |
0f10458c PN |
698 | } else { |
699 | printf("Entry: "); | |
75d8978e PN |
700 | if (entry) { |
701 | fwrite(entry,elen,1,stdout); | |
702 | } else { | |
703 | printf("%lld", value); | |
704 | } | |
705 | p = ziplistNext(p); | |
706 | printf("\n"); | |
0f10458c PN |
707 | } |
708 | } | |
709 | printf("\n"); | |
710 | ziplistRepr(zl); | |
c09c2c3b PN |
711 | } |
712 | ||
713 | printf("Compare strings with ziplist entries:\n"); | |
714 | { | |
715 | zl = createList(); | |
716 | p = ziplistIndex(zl, 0); | |
717 | if (!ziplistCompare(p,"hello",5)) { | |
dcb9cf4e | 718 | printf("ERROR: not \"hello\"\n"); |
c09c2c3b PN |
719 | return; |
720 | } | |
721 | if (ziplistCompare(p,"hella",5)) { | |
dcb9cf4e | 722 | printf("ERROR: \"hella\"\n"); |
c09c2c3b PN |
723 | return; |
724 | } | |
725 | ||
726 | p = ziplistIndex(zl, 3); | |
727 | if (!ziplistCompare(p,"1024",4)) { | |
dcb9cf4e | 728 | printf("ERROR: not \"1024\"\n"); |
c09c2c3b PN |
729 | return; |
730 | } | |
731 | if (ziplistCompare(p,"1025",4)) { | |
dcb9cf4e | 732 | printf("ERROR: \"1025\"\n"); |
c09c2c3b PN |
733 | return; |
734 | } | |
735 | printf("SUCCESS\n"); | |
0f10458c PN |
736 | } |
737 | ||
11ac6ff6 PN |
738 | return 0; |
739 | } | |
740 | #endif |