diskstore bug fixing and negative cache proper implementation

[redis.git] / src / ziplist.c

diff --git a/src/ziplist.c b/src/ziplist.c
index a9923d65917d6b8d972fbbfb6f1e40dfa9704108..a1a63478938e19a6c79349d6f533e437b9b9ee7f 100644 (file)
--- a/src/ziplist.c
+++ b/src/ziplist.c
@@ -595,7 +595,12 @@ unsigned char *ziplistIndex(unsigned char *zl, int index) {
     return (p[0] == ZIP_END || index > 0) ? NULL : p;
 }
 
-/* Return pointer to next entry in ziplist. */
+/* Return pointer to next entry in ziplist.
+ *
+ * zl is the pointer to the ziplist
+ * p is the pointer to the current element
+ *
+ * The element after 'p' is returned, otherwise NULL if we are at the end. */
 unsigned char *ziplistNext(unsigned char *zl, unsigned char *p) {
     ((void) zl);