Lines Matching refs:D

63 #define D(...)  macro
65 #define D(...) \ macro
698 D("Requested merge (a,b) (%u, %u)", a->count, b->count); in _quicklistZiplistMerge()
813 D("After %d (%d); ranges: [%d, %d], [%d, %d]", after, offset, orig_start, in _quicklistSplitNode()
824 D("After split lengths: orig (%d), new (%d)", node->count, new_node->count); in _quicklistSplitNode()
841 D("No node given!"); in _quicklistInsert()
852 D("Current node is full with count %d with requested fill %lu", in _quicklistInsert()
858 D("At Tail of current ziplist"); in _quicklistInsert()
861 D("Next node is full too."); in _quicklistInsert()
867 D("At Head"); in _quicklistInsert()
870 D("Prev node is full too."); in _quicklistInsert()
877 D("Not full, inserting after current position."); in _quicklistInsert()
889 D("Not full, inserting before current position."); in _quicklistInsert()
898 D("Full and tail, but next isn't full; inserting next node head"); in _quicklistInsert()
908 D("Full and head, but prev isn't full, inserting prev node tail"); in _quicklistInsert()
919 D("\tprovisioning new node..."); in _quicklistInsert()
928 D("\tsplitting node..."); in _quicklistInsert()
977 D("Quicklist delete request for start %ld, count %ld, extent: %ld", start, in quicklistDelRange()
1015 D("[%ld]: asking to del: %ld because offset: %d; (ENTIRE NODE: %d), " in quicklistDelRange()
1121 D("Returning because no iter!"); in quicklistNext()
1129 D("Returning because current node is NULL") in quicklistNext()
1166 D("Jumping to start of next node"); in quicklistNext()
1171 D("Jumping to end of previous node"); in quicklistNext()
1250 D("Skipping over (%p) %u at accum %lld", (void *)n, n->count, in quicklistIndex()
1260 D("Found node: %p at accum %llu, idx %llu, sub+ %llu, sub- %llu", (void *)n, in quicklistIndex()