305     quicklistNode *forward = quicklist->head;  in __quicklistCompress()  local
310         quicklistDecompressNode(forward);  in __quicklistCompress()
313         if (forward == node || reverse == node)  in __quicklistCompress()
316         if (forward == reverse)  in __quicklistCompress()
319         forward = forward->next;  in __quicklistCompress()
328         quicklistCompressNode(forward);  in __quicklistCompress()
1230     int forward = idx < 0 ? 0 : 1; /* < 0 -> reverse, 0+ -> forward */  in quicklistIndex()  local
1235     if (!forward) {  in quicklistIndex()
1253             n = forward ? n->next : n->prev;  in quicklistIndex()
1264     if (forward) {  in quicklistIndex()
1482 static int _itrprintr(quicklist *ql, int print, int forward) {  in _itrprintr()  argument
1484         quicklistGetIterator(ql, forward ? AL_START_HEAD : AL_START_TAIL);  in _itrprintr()