98     quicklist->head = quicklist->tail = NULL;  in quicklistCreate()
159     current = quicklist->head;  in quicklistRelease()
276         quicklistNode *h = quicklist->head, *t = quicklist->tail;  in __quicklistCompress()
283         quicklistNode *h = quicklist->head, *hn = h->next, *hnn = hn->next;  in __quicklistCompress()
305     quicklistNode *forward = quicklist->head;  in __quicklistCompress()
373         if (quicklist->head == old_node)  in __quicklistInsertNode()
374             quicklist->head = new_node;  in __quicklistInsertNode()
378         quicklist->head = quicklist->tail = new_node;  in __quicklistInsertNode()
481     quicklistNode *orig_head = quicklist->head;  in quicklistPushHead()
483             _quicklistNodeAllowInsert(quicklist->head, quicklist->fill, sz))) {  in quicklistPushHead()
484         quicklist->head->zl =  in quicklistPushHead()
485             ziplistPush(quicklist->head->zl, value, sz, ZIPLIST_HEAD);  in quicklistPushHead()
486         quicklistNodeUpdateSz(quicklist->head);  in quicklistPushHead()
492         _quicklistInsertNodeBefore(quicklist, quicklist->head, node);  in quicklistPushHead()
495     quicklist->head->count++;  in quicklistPushHead()
496     return (orig_head != quicklist->head);  in quicklistPushHead()
590     if (node == quicklist->head) {  in __quicklistDelNode()
591         quicklist->head = node->next;  in __quicklistDelNode()
1054         iter->current = quicklist->head;  in quicklistGetIterator()
1191     for (quicklistNode *current = orig->head; current;  in quicklistDup()
1240         n = quicklist->head;  in quicklistIndex()
1344     if (where == QUICKLIST_HEAD && quicklist->head) {  in quicklistPopCustom()
1345         node = quicklist->head;  in quicklistPopCustom()
1454     if (ql->head)  in ql_info()
1455         printf("\t(zsize head: %d)\n", ziplistLen(ql->head->zl));  in ql_info()
1554     if (ql->head && head_count != ql->head->count &&  in _ql_verify()
1555         head_count != ziplistLen(ql->head->zl)) {  in _ql_verify()
1558              head_count, ql->head->count, ziplistLen(ql->head->zl));  in _ql_verify()
1571         quicklistNode *node = ql->head;  in _ql_verify()
2606                     quicklistNode *node = ql->head;  in quicklistTest()