Searched refs:node_base (Results 1 – 7 of 7) sorted by relevance
33 index = data->node_base[index].next; in check_circular_list()50 index = data->node_base[index].next; in check_circular_list()60 index = data->node_base[index].next; in check_circular_list()77 if (bitmap[data->node_base[pos].key]) { in check_redundant_key()79 (unsigned long long)data->node_base[pos].key); in check_redundant_key()82 bitmap[data->node_base[pos].key] = 1; in check_redundant_key()107 if (data->node_base[index].key > max) in odb_check_hash()108 max = data->node_base[index].key; in odb_check_hash()110 index = data->node_base[index].next; in odb_check_hash()
38 node = &data->node_base[new_node]; in add_node()68 node = &data->node_base[index]; in odb_update_node_with_offset()
53 result->total_count += data->node_base[index].value; in odb_hash_stat()54 index = data->node_base[index].next; in odb_hash_stat()
17 return odb->data->node_base + 1; in odb_get_iterator()
98 data->node_base = odb_to_node_base(data); in odb_grow_hashtable()123 odb_node_t * node = &data->node_base[pos]; in odb_grow_hashtable()258 data->node_base = odb_to_node_base(data); in odb_open()
76 odb_node_t * node_base; /**< base memory area of the page */ member
42 void ValidateNode(const RTreeBase::NodeBase* node_base, in ValidateNode() argument45 if (node_base->Level() >= 0) { in ValidateNode()47 static_cast<const RTreeBase::Node*>(node_base); in ValidateNode()