102     quicklist->fill = -2;  in quicklistCreate()
117 void quicklistSetFill(quicklist *quicklist, int fill) {  in quicklistSetFill()  argument
118     if (fill > FILL_MAX) {  in quicklistSetFill()
119         fill = FILL_MAX;  in quicklistSetFill()
120     } else if (fill < -5) {  in quicklistSetFill()
121         fill = -5;  in quicklistSetFill()
123     quicklist->fill = fill;  in quicklistSetFill()
126 void quicklistSetOptions(quicklist *quicklist, int fill, int depth) {  in quicklistSetOptions()  argument
127     quicklistSetFill(quicklist, fill);  in quicklistSetOptions()
132 quicklist *quicklistNew(int fill, int compress) {  in quicklistNew()  argument
134     quicklistSetOptions(quicklist, fill, compress);  in quicklistNew()
402                                                const int fill) {  in _quicklistNodeSizeMeetsOptimizationRequirement()  argument
403     if (fill >= 0)  in _quicklistNodeSizeMeetsOptimizationRequirement()
406     size_t offset = (-fill) - 1;  in _quicklistNodeSizeMeetsOptimizationRequirement()
421                                            const int fill, const size_t sz) {  in _quicklistNodeAllowInsert()  argument
442     if (likely(_quicklistNodeSizeMeetsOptimizationRequirement(new_sz, fill)))  in _quicklistNodeAllowInsert()
446     else if ((int)node->count < fill)  in _quicklistNodeAllowInsert()
454                                           const int fill) {  in _quicklistNodeAllowMerge()  argument
461     if (likely(_quicklistNodeSizeMeetsOptimizationRequirement(merge_sz, fill)))  in _quicklistNodeAllowMerge()
465     else if ((int)(a->count + b->count) <= fill)  in _quicklistNodeAllowMerge()
483             _quicklistNodeAllowInsert(quicklist->head, quicklist->fill, sz))) {  in quicklistPushHead()
506             _quicklistNodeAllowInsert(quicklist->tail, quicklist->fill, sz))) {  in quicklistPushTail()
566 quicklist *quicklistCreateFromZiplist(int fill, int compress,  in quicklistCreateFromZiplist()  argument
568     return quicklistAppendValuesFromZiplist(quicklistNew(fill, compress), zl);  in quicklistCreateFromZiplist()
735     int fill = quicklist->fill;  in _quicklistMergeNodes()  local
752     if (_quicklistNodeAllowMerge(prev, prev_prev, fill)) {  in _quicklistMergeNodes()
758     if (_quicklistNodeAllowMerge(next, next_next, fill)) {  in _quicklistMergeNodes()
764     if (_quicklistNodeAllowMerge(center, center->prev, fill)) {  in _quicklistMergeNodes()
773     if (_quicklistNodeAllowMerge(target, target->next, fill)) {  in _quicklistMergeNodes()
835     int fill = quicklist->fill;  in _quicklistInsert()  local
851     if (!_quicklistNodeAllowInsert(node, fill, sz)) {  in _quicklistInsert()
853           node->count, fill);  in _quicklistInsert()
860         if (!_quicklistNodeAllowInsert(node->next, fill, sz)) {  in _quicklistInsert()
869         if (!_quicklistNodeAllowInsert(node->prev, fill, sz)) {  in _quicklistInsert()
1189     copy = quicklistNew(orig->fill, orig->compress);  in quicklistDup()