Max limit to 10k clients removed, this implements feature request on issue #194

[redis.git] / src / ziplist.c

diff --git a/src/ziplist.c b/src/ziplist.c
index 1c492f25dac15f814ffda5e7f061a4159e69af31..639e4b61ec3cc9c0e5f742448ff19c3420e5d2be 100644 (file)
--- a/src/ziplist.c
+++ b/src/ziplist.c
@@ -67,11 +67,10 @@
 #include <assert.h>
 #include <limits.h>
 #include "zmalloc.h"
 #include <assert.h>
 #include <limits.h>
 #include "zmalloc.h"

+#include "util.h"

 #include "ziplist.h"
 #include "endian.h"
 
 #include "ziplist.h"
 #include "endian.h"
 

-int ll2string(char *s, size_t len, long long value);
-

 #define ZIP_END 255
 #define ZIP_BIGLEN 254
 
 #define ZIP_END 255
 #define ZIP_BIGLEN 254
 


@@ -252,22 +251,9 @@ static int zipPrevLenByteDiff(unsigned char *p, unsigned int len) {
  * Stores the integer value in 'v' and its encoding in 'encoding'. */
 static int zipTryEncoding(unsigned char *entry, unsigned int entrylen, long long *v, unsigned char *encoding) {
     long long value;
  * Stores the integer value in 'v' and its encoding in 'encoding'. */
 static int zipTryEncoding(unsigned char *entry, unsigned int entrylen, long long *v, unsigned char *encoding) {
     long long value;

-    char *eptr;
-    char buf[32];

 
     if (entrylen >= 32 || entrylen == 0) return 0;
 
     if (entrylen >= 32 || entrylen == 0) return 0;

-    if (entry[0] == '-' || (entry[0] >= '0' && entry[0] <= '9')) {
-        int slen;
-
-        /* Perform a back-and-forth conversion to make sure that
-         * the string turned into an integer is not losing any info. */
-        memcpy(buf,entry,entrylen);
-        buf[entrylen] = '\0';
-        value = strtoll(buf,&eptr,10);
-        if (eptr[0] != '\0') return 0;
-        slen = ll2string(buf,32,value);
-        if (entrylen != (unsigned)slen || memcmp(buf,entry,slen)) return 0;
-
+    if (string2ll((char*)entry,entrylen,&value)) {

         /* Great, the string can be encoded. Check what's the smallest
          * of our encoding types that can hold this value. */
         if (value >= INT16_MIN && value <= INT16_MAX) {
         /* Great, the string can be encoded. Check what's the smallest
          * of our encoding types that can hold this value. */
         if (value >= INT16_MIN && value <= INT16_MAX) {


@@ -408,12 +394,17 @@ static unsigned char *__ziplistCascadeUpdate(unsigned char *zl, unsigned char *p
             offset = p-zl;
             extra = rawlensize-next.prevrawlensize;
             zl = ziplistResize(zl,curlen+extra);
             offset = p-zl;
             extra = rawlensize-next.prevrawlensize;
             zl = ziplistResize(zl,curlen+extra);

-            ZIPLIST_TAIL_OFFSET(zl) += extra;

             p = zl+offset;
 
             p = zl+offset;
 

-            /* Move the tail to the back. */
+            /* Current pointer and offset for next element. */

             np = p+rawlen;
             noffset = np-zl;
             np = p+rawlen;
             noffset = np-zl;

+
+            /* Update tail offset when next element is not the tail element. */
+            if ((zl+ZIPLIST_TAIL_OFFSET(zl)) != np)
+                ZIPLIST_TAIL_OFFSET(zl) += extra;
+
+            /* Move the tail to the back. */

             memmove(np+rawlensize,
                 np+next.prevrawlensize,
                 curlen-noffset-next.prevrawlensize-1);
             memmove(np+rawlensize,
                 np+next.prevrawlensize,
                 curlen-noffset-next.prevrawlensize-1);


@@ -498,7 +489,9 @@ static unsigned char *__ziplistInsert(unsigned char *zl, unsigned char *p, unsig
     size_t offset;
     int nextdiff = 0;
     unsigned char encoding = 0;
     size_t offset;
     int nextdiff = 0;
     unsigned char encoding = 0;

-    long long value;
+    long long value = 123456789; /* initialized to avoid warning. Using a value
+                                    that is easy to see if for some reason
+                                    we use it uninitialized. */

     zlentry entry, tail;
 
     /* Find out prevlen for the entry that is inserted. */
     zlentry entry, tail;
 
     /* Find out prevlen for the entry that is inserted. */


@@ -889,7 +882,7 @@ void pop(unsigned char *zl, int where) {
     }
 }
 
     }
 }
 

-void randstring(char *target, unsigned int min, unsigned int max) {
+int randstring(char *target, unsigned int min, unsigned int max) {

     int p, len = min+rand()%(max-min+1);
     int minval, maxval;
     switch(rand() % 3) {
     int p, len = min+rand()%(max-min+1);
     int minval, maxval;
     switch(rand() % 3) {


@@ -911,10 +904,9 @@ void randstring(char *target, unsigned int min, unsigned int max) {
 
     while(p < len)
         target[p++] = minval+rand()%(maxval-minval+1);
 
     while(p < len)
         target[p++] = minval+rand()%(maxval-minval+1);

-    return;
+    return len;

 }
 
 }
 

-

 int main(int argc, char **argv) {
     unsigned char *zl, *p;
     unsigned char *entry;
 int main(int argc, char **argv) {
     unsigned char *zl, *p;
     unsigned char *entry;


@@ -1247,6 +1239,7 @@ int main(int argc, char **argv) {
         int i,j,len,where;
         unsigned char *p;
         char buf[1024];
         int i,j,len,where;
         unsigned char *p;
         char buf[1024];

+        int buflen;

         list *ref;
         listNode *refnode;
 
         list *ref;
         listNode *refnode;
 


@@ -1255,10 +1248,6 @@ int main(int argc, char **argv) {
         unsigned int slen;
         long long sval;
 
         unsigned int slen;
         long long sval;
 

-        /* In the regression for the cascade bug, it was triggered
-         * with a random seed of 2. */
-        srand(2);
-

         for (i = 0; i < 20000; i++) {
             zl = ziplistNew();
             ref = listCreate();
         for (i = 0; i < 20000; i++) {
             zl = ziplistNew();
             ref = listCreate();


@@ -1268,31 +1257,32 @@ int main(int argc, char **argv) {
             /* Create lists */
             for (j = 0; j < len; j++) {
                 where = (rand() & 1) ? ZIPLIST_HEAD : ZIPLIST_TAIL;
             /* Create lists */
             for (j = 0; j < len; j++) {
                 where = (rand() & 1) ? ZIPLIST_HEAD : ZIPLIST_TAIL;

-                switch(rand() % 4) {
-                case 0:
-                    sprintf(buf,"%lld",(0LL + rand()) >> 20);
-                    break;
-                case 1:
-                    sprintf(buf,"%lld",(0LL + rand()));
-                    break;
-                case 2:
-                    sprintf(buf,"%lld",(0LL + rand()) << 20);
-                    break;
-                case 3:
-                    randstring(buf,0,256);
-                break;
-                default:
-                    assert(NULL);
+                if (rand() % 2) {
+                    buflen = randstring(buf,1,sizeof(buf)-1);
+                } else {
+                    switch(rand() % 3) {
+                    case 0:
+                        buflen = sprintf(buf,"%lld",(0LL + rand()) >> 20);
+                        break;
+                    case 1:
+                        buflen = sprintf(buf,"%lld",(0LL + rand()));
+                        break;
+                    case 2:
+                        buflen = sprintf(buf,"%lld",(0LL + rand()) << 20);
+                        break;
+                    default:
+                        assert(NULL);
+                    }

                 }
 
                 /* Add to ziplist */
                 }
 
                 /* Add to ziplist */

-                zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), where);
+                zl = ziplistPush(zl, (unsigned char*)buf, buflen, where);

 
                 /* Add to reference list */
                 if (where == ZIPLIST_HEAD) {
 
                 /* Add to reference list */
                 if (where == ZIPLIST_HEAD) {

-                    listAddNodeHead(ref,sdsnew(buf));
+                    listAddNodeHead(ref,sdsnewlen(buf, buflen));

                 } else if (where == ZIPLIST_TAIL) {
                 } else if (where == ZIPLIST_TAIL) {

-                    listAddNodeTail(ref,sdsnew(buf));
+                    listAddNodeTail(ref,sdsnewlen(buf, buflen));

                 } else {
                     assert(NULL);
                 }
                 } else {
                     assert(NULL);
                 }


@@ -1307,12 +1297,13 @@ int main(int argc, char **argv) {
 
                 assert(ziplistGet(p,&sstr,&slen,&sval));
                 if (sstr == NULL) {
 
                 assert(ziplistGet(p,&sstr,&slen,&sval));
                 if (sstr == NULL) {

-                    sprintf(buf,"%lld",sval);
+                    buflen = sprintf(buf,"%lld",sval);

                 } else {
                 } else {

-                    memcpy(buf,sstr,slen);
-                    buf[slen] = '\0';
+                    buflen = slen;
+                    memcpy(buf,sstr,buflen);
+                    buf[buflen] = '\0';

                 }
                 }

-                assert(strcmp(buf,listNodeValue(refnode)) == 0);
+                assert(memcmp(buf,listNodeValue(refnode),buflen) == 0);

             }
             zfree(zl);
             listRelease(ref);
             }
             zfree(zl);
             listRelease(ref);