Searched refs:ziplistLen (Results 1 – 5 of 5) sorted by relevance
49 unsigned int ziplistLen(unsigned char *zl);
1168 unsigned int ziplistLen(unsigned char *zl) { in ziplistLen() function1366 int len = ziplistLen(zl); in verify()1789 if (ziplistLen(zl4)) { in ziplistTest()1799 if (ziplistLen(zl2) != 8) { in ziplistTest()1800 printf("ERROR: Merged length not 8, but: %u\n", ziplistLen(zl2)); in ziplistTest()1901 assert(listLength(ref) == ziplistLen(zl)); in ziplistTest()
529 node->count = ziplistLen(node->zl); in quicklistAppendZiplist()712 keep->count = ziplistLen(keep->zl); in _quicklistZiplistMerge()817 node->count = ziplistLen(node->zl); in _quicklistSplitNode()821 new_node->count = ziplistLen(new_node->zl); in _quicklistSplitNode()1455 printf("\t(zsize head: %d)\n", ziplistLen(ql->head->zl)); in ql_info()1457 printf("\t(zsize tail: %d)\n", ziplistLen(ql->tail->zl)); in ql_info()1555 head_count != ziplistLen(ql->head->zl)) { in _ql_verify()1558 head_count, ql->head->count, ziplistLen(ql->head->zl)); in _ql_verify()1563 tail_count != ziplistLen(ql->tail->zl)) { in _ql_verify()1566 tail_count, ql->tail->count, ziplistLen(ql->tail->zl)); in _ql_verify()
315 length = ziplistLen(o->ptr) / 2; in hashTypeLength()
781 return ziplistLen(zl)/2; in zzlLength()