"Fossies" - the Fresh Open Source Software Archive  

Source code changes of the file "src/object.c" between
redis-6.2.4.tar.gz and redis-6.2.5.tar.gz

About: redis is an advanced key-value store. It is often referred to as a data structure server since keys can contain strings, hashes, lists, sets and sorted sets.

object.c  (redis-6.2.4):object.c  (redis-6.2.5)
skipping to change at line 883 skipping to change at line 883
elesize += sizeof(struct dictEntry); elesize += sizeof(struct dictEntry);
samples++; samples++;
} }
dictReleaseIterator(di); dictReleaseIterator(di);
if (samples) asize += (double)elesize/samples*dictSize(d); if (samples) asize += (double)elesize/samples*dictSize(d);
} else { } else {
serverPanic("Unknown hash encoding"); serverPanic("Unknown hash encoding");
} }
} else if (o->type == OBJ_STREAM) { } else if (o->type == OBJ_STREAM) {
stream *s = o->ptr; stream *s = o->ptr;
asize = sizeof(*o); asize = sizeof(*o)+sizeof(*s);
asize += streamRadixTreeMemoryUsage(s->rax); asize += streamRadixTreeMemoryUsage(s->rax);
/* Now we have to add the listpacks. The last listpack is often non /* Now we have to add the listpacks. The last listpack is often non
* complete, so we estimate the size of the first N listpacks, and * complete, so we estimate the size of the first N listpacks, and
* use the average to compute the size of the first N-1 listpacks, and * use the average to compute the size of the first N-1 listpacks, and
* finally add the real size of the last node. */ * finally add the real size of the last node. */
raxIterator ri; raxIterator ri;
raxStart(&ri,s->rax); raxStart(&ri,s->rax);
raxSeek(&ri,"^",NULL,0); raxSeek(&ri,"^",NULL,0);
size_t lpsize = 0, samples = 0; size_t lpsize = 0, samples = 0;
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added

Home  |  About  |  Features  |  All  |  Newest  |  Dox  |  Diffs  |  RSS Feeds  |  Screenshots  |  Comments  |  Imprint  |  Privacy  |  HTTP(S)