354                                         quicklistNode *new_node, int after) {  in __quicklistInsertNode()  argument
355     if (after) {  in __quicklistInsertNode()
798                                                 int after) {  in _quicklistSplitNode()  argument
808     int orig_start = after ? offset + 1 : 0;  in _quicklistSplitNode()
809     int orig_extent = after ? -1 : offset;  in _quicklistSplitNode()
810     int new_start = after ? 0 : offset;  in _quicklistSplitNode()
811     int new_extent = after ? offset + 1 : -1;  in _quicklistSplitNode()
813     D("After %d (%d); ranges: [%d, %d], [%d, %d]", after, offset, orig_start,  in _quicklistSplitNode()
833                                    void *value, const size_t sz, int after) {  in _quicklistInsert()  argument
844         __quicklistInsertNode(quicklist, NULL, new_node, after);  in _quicklistInsert()
857     if (after && (entry->offset == node->count)) {  in _quicklistInsert()
866     if (!after && (entry->offset == 0)) {  in _quicklistInsert()
876     if (!full && after) {  in _quicklistInsert()
888     } else if (!full && !after) {  in _quicklistInsert()
895     } else if (full && at_tail && node->next && !full_next && after) {  in _quicklistInsert()
905     } else if (full && at_head && node->prev && !full_prev && !after) {  in _quicklistInsert()
915     } else if (full && ((at_tail && node->next && full_next && after) ||  in _quicklistInsert()
916                         (at_head && node->prev && full_prev && !after))) {  in _quicklistInsert()
924         __quicklistInsertNode(quicklist, node, new_node, after);  in _quicklistInsert()
930         new_node = _quicklistSplitNode(node, entry->offset, after);  in _quicklistInsert()
932                                    after ? ZIPLIST_HEAD : ZIPLIST_TAIL);  in _quicklistInsert()
935         __quicklistInsertNode(quicklist, node, new_node, after);  in _quicklistInsert()