60 #define debugf(...)                                                            \  macro
69 #define debugf(...)  macro
400     debugf("Compress node: %.*s\n", (int)len,s);  in raxCompressNode()
515     debugf("### Insert %.*s with value %p\n", (int)len, s, data);  in raxGenericInsert()
524         debugf("### Insert: node representing key exists\n");  in raxGenericInsert()
676         debugf("ALGO 1: Stopped at compressed node %.*s (%p)\n",  in raxGenericInsert()
678         debugf("Still to insert: %.*s\n", (int)(len-i), s+i);  in raxGenericInsert()
679         debugf("Splitting at %d: '%c'\n", j, ((char*)h->data)[j]);  in raxGenericInsert()
680         debugf("Other (key) letter is '%c'\n", s[i]);  in raxGenericInsert()
686         debugf("Next is %p\n", (void*)next);  in raxGenericInsert()
687         debugf("iskey %d\n", h->iskey);  in raxGenericInsert()
689             debugf("key value is %p\n", raxGetData(h));  in raxGenericInsert()
783         debugf("ALGO 2: Stopped at compressed node %.*s (%p) j = %d\n",  in raxGenericInsert()
853             debugf("Inserting compressed node\n");  in raxGenericInsert()
864             debugf("Inserting normal node\n");  in raxGenericInsert()
919     debugf("### Lookup: %.*s\n", (int)len, s);  in raxFind()
985     debugf("raxRemoveChild tail len: %d\n", taillen);  in raxRemoveChild()
1024     debugf("### Delete: %.*s\n", (int)len, s);  in raxRemove()
1046         debugf("Key deleted in node without children. Cleanup needed.\n");  in raxRemove()
1050             debugf("Freeing child %p [%.*s] key:%d\n", (void*)child,  in raxRemove()
1060             debugf("Unlinking child %p from parent %p\n",  in raxRemove()
1135         debugf("After removing %.*s:\n", (int)len, s);  in raxRemove()
1137         debugf("Seek start node\n");  in raxRemove()
1211             debugf("Compressed %d nodes, %d total bytes\n",  in raxRemove()
1328             debugf("GO DEEPER\n");  in raxIteratorNextStep()
1383                         debugf("SCAN NEXT %c\n", it->node->data[i]);  in raxIteratorNextStep()
1389                         debugf("SCAN found a new node\n");  in raxIteratorNextStep()
1475                 debugf("SCAN PREV %c\n", it->node->data[i]);  in raxIteratorPrevStep()
1484                 debugf("SCAN found a new node\n");  in raxIteratorPrevStep()
1604         debugf("After initial seek: i=%d len=%d key=%.*s\n",  in raxSeek()
1613             debugf("Seek normal node on mismatch: %.*s\n",  in raxSeek()
1621             debugf("Compressed mismatch: %.*s\n",  in raxSeek()
1655             debugf("No mismatch: %.*s\n",  in raxSeek()
1922     debugf("Touching %p\n", (void*)n);  in raxTouch()