pike.git / src / post_modules / CritBit / tree_high.c

version» Context lines:

pike.git/src/post_modules/CritBit/tree_high.c:1:   static inline void cb_print_key(struct string_builder *, const cb_key);   static inline size_t _low_cb_check_node(cb_node_t node, const char *, int);      #ifdef DEBUG_CHECKS   # define cb_check_node(node) do { _low_cb_check_node(node, \    __FILE__, __LINE__); } while (0) + # define DEBUGCHECKUSED(X) X   #else   # define cb_check_node(node) do {} while(0) -  + # define DEBUGCHECKUSED(X) UNUSED(X)   #endif      #define CB_FATAL(x) Pike_error x      #include "tree_low.c"      #ifndef CB_FIRST_CHAR   #define CB_FIRST_CHAR(key) (0)   #endif   
pike.git/src/post_modules/CritBit/tree_high.c:136:    size_t bit = CB_GET_BIT(key.str, size);    if (CB_HAS_CHILD(node, bit))    return cb_print_path(buf, CB_CHILD(node, bit), key, size, depth+1,    end);    }       return 0;   }      static inline void cb_check(cb_node_t node, -  cb_node_t DEBUGUSED(last), +  cb_node_t DEBUGCHECKUSED(last),    char *issue) {   #ifdef DEBUG_CHECKS    if (CB_LT(node->key.len, last->key.len)) {    struct string_builder buf;    init_string_builder(&buf, 0);    push_text("ERROR AT %s: %s\n[%d, %d] is shorter than [%d, %d]\n");    push_text(issue);    cb_print_tree(&buf, last, 0);    push_string(finish_string_builder(&buf));    push_int(node->key.len.chars);