Lines Matching refs:sz
81 (e)->sz = 0; \
143 node->sz = 0; in quicklistCreateNode()
184 if (node->sz < MIN_COMPRESS_BYTES) in __quicklistCompressNode()
187 quicklistLZF *lzf = zmalloc(sizeof(*lzf) + node->sz); in __quicklistCompressNode()
190 if (((lzf->sz = lzf_compress(node->zl, node->sz, lzf->compressed, in __quicklistCompressNode()
191 node->sz)) == 0) || in __quicklistCompressNode()
192 lzf->sz + MIN_COMPRESS_IMPROVE >= node->sz) { in __quicklistCompressNode()
197 lzf = zrealloc(lzf, sizeof(*lzf) + lzf->sz); in __quicklistCompressNode()
220 void *decompressed = zmalloc(node->sz); in __quicklistDecompressNode()
222 if (lzf_decompress(lzf->compressed, lzf->sz, decompressed, node->sz) == 0) { in __quicklistDecompressNode()
256 return lzf->sz; in quicklistGetLzf()
401 _quicklistNodeSizeMeetsOptimizationRequirement(const size_t sz, in _quicklistNodeSizeMeetsOptimizationRequirement() argument
408 if (sz <= optimization_level[offset]) { in _quicklistNodeSizeMeetsOptimizationRequirement()
418 #define sizeMeetsSafetyLimit(sz) ((sz) <= SIZE_SAFETY_LIMIT) argument
421 const int fill, const size_t sz) { in _quicklistNodeAllowInsert() argument
427 if (sz < 254) in _quicklistNodeAllowInsert()
433 if (sz < 64) in _quicklistNodeAllowInsert()
435 else if (likely(sz < 16384)) in _quicklistNodeAllowInsert()
441 unsigned int new_sz = node->sz + sz + ziplist_overhead; in _quicklistNodeAllowInsert()
460 unsigned int merge_sz = a->sz + b->sz - 11; in _quicklistNodeAllowMerge()
473 (node)->sz = ziplistBlobLen((node)->zl); \
480 int quicklistPushHead(quicklist *quicklist, void *value, size_t sz) { in quicklistPushHead() argument
483 _quicklistNodeAllowInsert(quicklist->head, quicklist->fill, sz))) { in quicklistPushHead()
485 ziplistPush(quicklist->head->zl, value, sz, ZIPLIST_HEAD); in quicklistPushHead()
489 node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD); in quicklistPushHead()
503 int quicklistPushTail(quicklist *quicklist, void *value, size_t sz) { in quicklistPushTail() argument
506 _quicklistNodeAllowInsert(quicklist->tail, quicklist->fill, sz))) { in quicklistPushTail()
508 ziplistPush(quicklist->tail->zl, value, sz, ZIPLIST_TAIL); in quicklistPushTail()
512 node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_TAIL); in quicklistPushTail()
530 node->sz = ziplistBlobLen(zl); in quicklistAppendZiplist()
545 unsigned int sz; in quicklistAppendValuesFromZiplist() local
550 while (ziplistGet(p, &value, &sz, &longval)) { in quicklistAppendValuesFromZiplist()
553 sz = ll2string(longstr, sizeof(longstr), longval); in quicklistAppendValuesFromZiplist()
556 quicklistPushTail(quicklist, value, sz); in quicklistAppendValuesFromZiplist()
668 int sz) { in quicklistReplaceAtIndex() argument
673 entry.node->zl = ziplistInsert(entry.node->zl, entry.zi, data, sz); in quicklistReplaceAtIndex()
799 size_t zl_sz = node->sz; in _quicklistSplitNode()
833 void *value, const size_t sz, int after) { in _quicklistInsert() argument
843 new_node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD); in _quicklistInsert()
851 if (!_quicklistNodeAllowInsert(node, fill, sz)) { in _quicklistInsert()
860 if (!_quicklistNodeAllowInsert(node->next, fill, sz)) { in _quicklistInsert()
869 if (!_quicklistNodeAllowInsert(node->prev, fill, sz)) { in _quicklistInsert()
881 node->zl = ziplistPush(node->zl, value, sz, ZIPLIST_TAIL); in _quicklistInsert()
883 node->zl = ziplistInsert(node->zl, next, value, sz); in _quicklistInsert()
891 node->zl = ziplistInsert(node->zl, entry->zi, value, sz); in _quicklistInsert()
901 new_node->zl = ziplistPush(new_node->zl, value, sz, ZIPLIST_HEAD); in _quicklistInsert()
911 new_node->zl = ziplistPush(new_node->zl, value, sz, ZIPLIST_TAIL); in _quicklistInsert()
921 new_node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD); in _quicklistInsert()
931 new_node->zl = ziplistPush(new_node->zl, value, sz, in _quicklistInsert()
943 void *value, const size_t sz) { in quicklistInsertBefore() argument
944 _quicklistInsert(quicklist, entry, value, sz, 0); in quicklistInsertBefore()
948 void *value, const size_t sz) { in quicklistInsertAfter() argument
949 _quicklistInsert(quicklist, entry, value, sz, 1); in quicklistInsertAfter()
1158 ziplistGet(entry->zi, &entry->value, &entry->sz, &entry->longval); in quicklistNext()
1197 size_t lzf_sz = sizeof(*lzf) + lzf->sz; in quicklistDup()
1201 node->zl = zmalloc(current->sz); in quicklistDup()
1202 memcpy(node->zl, current->zl, current->sz); in quicklistDup()
1207 node->sz = current->sz; in quicklistDup()
1275 ziplistGet(entry->zi, &entry->value, &entry->sz, &entry->longval); in quicklistIndex()
1290 unsigned int sz; in quicklistRotate() local
1292 ziplistGet(p, &value, &sz, &longval); in quicklistRotate()
1297 sz = ll2string(longstr, sizeof(longstr), longval); in quicklistRotate()
1302 quicklistPushHead(quicklist, value, sz); in quicklistRotate()
1325 unsigned int *sz, long long *sval, in quicklistPopCustom() argument
1326 void *(*saver)(unsigned char *data, unsigned int sz)) { in quicklistPopCustom() argument
1338 if (sz) in quicklistPopCustom()
1339 *sz = 0; in quicklistPopCustom()
1357 if (sz) in quicklistPopCustom()
1358 *sz = vlen; in quicklistPopCustom()
1372 REDIS_STATIC void *_quicklistSaver(unsigned char *data, unsigned int sz) { in _quicklistSaver() argument
1375 vstr = zmalloc(sz); in _quicklistSaver()
1376 memcpy(vstr, data, sz); in _quicklistSaver()
1386 unsigned int *sz, long long *slong) { in quicklistPop() argument
1398 if (sz) in quicklistPop()
1399 *sz = vlen; in quicklistPop()
1404 void quicklistPush(quicklist *quicklist, void *value, const size_t sz, in quicklistPush() argument
1407 quicklistPushHead(quicklist, value, sz); in quicklistPush()
1409 quicklistPushTail(quicklist, value, sz); in quicklistPush()
1496 printf("[%3d (%2d)]: [%.*s] (%lld)\n", i, p, entry.sz, in _itrprintr()
1581 at, ql->compress, low_raw, high_raw, ql->len, node->sz, in _ql_verify()
1591 at, ql->compress, low_raw, high_raw, ql->len, node->sz, in _ql_verify()
1764 unsigned int sz; in quicklistTest() local
1767 quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv); in quicklistTest()
1769 assert(sz == 32); in quicklistTest()
1771 ERR("Pop'd value (%.*s) didn't equal original value (%s)", sz, in quicklistTest()
1782 unsigned int sz; in quicklistTest() local
1785 quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv); in quicklistTest()
1799 unsigned int sz; in quicklistTest() local
1801 int ret = quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv); in quicklistTest()
1804 assert(sz == 32); in quicklistTest()
1807 sz, data, genstr("hello", 499 - i)); in quicklistTest()
1820 unsigned int sz; in quicklistTest() local
1822 int ret = quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv); in quicklistTest()
1826 assert(sz == 32); in quicklistTest()
1830 sz, data, genstr("hello", 499 - i)); in quicklistTest()
1952 ERR("Value 0 didn't match, instead got: %.*s", entry.sz, in quicklistTest()
1956 ERR("Value 1 didn't match, instead got: %.*s", entry.sz, in quicklistTest()
1960 ERR("Value 2 didn't match, instead got: %.*s", entry.sz, in quicklistTest()
1964 ERR("Value 3 didn't match, instead got: %.*s", entry.sz, in quicklistTest()
1968 ERR("Value 4 didn't match, instead got: %.*s", entry.sz, in quicklistTest()
1972 ERR("Value 5 didn't match, instead got: %.*s", entry.sz, in quicklistTest()
2112 ERR("Index found at 50 with 50 list: %.*s", entry.sz, in quicklistTest()
2247 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest() local
2248 quicklistPushTail(ql, num, sz); in quicklistTest()
2310 if (strncmp((char *)entry.value, result[i], entry.sz)) { in quicklistTest()
2312 i, entry.sz, entry.value, result[i]); in quicklistTest()
2347 entry.sz)) { in quicklistTest()
2349 i, entry.sz, entry.value, resultB[resB - 1 - i]); in quicklistTest()
2411 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest() local
2412 quicklistPushTail(ql, num, sz); in quicklistTest()
2438 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest() local
2439 quicklistPushTail(ql, num, sz); in quicklistTest()
2470 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest() local
2471 quicklistPushTail(ql, num, sz); in quicklistTest()
2495 entry.sz, entry.value); in quicklistTest()
2515 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest() local
2516 quicklistPushTail(ql, num, sz); in quicklistTest()
2544 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest() local
2545 quicklistPushTail(ql, num, sz); in quicklistTest()
2565 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest() local
2567 ziplistPush(zl, (unsigned char *)num, sz, ZIPLIST_TAIL); in quicklistTest()
2618 node->sz); in quicklistTest()
2626 node->sz, node->attempted_compress); in quicklistTest()