////=================================================================== // // df_btree.h Pyramid / DFS / df-lib // // Copyright (C) 2008 Baidu.com, Inc. // // Created on 2008-01-05 by YANG Zhenkun (yangzhenkun@baidu.com) // // ------------------------------------------------------------------- // // Description // // declaration and implementation of dfs_btree_t (btree) template // // ------------------------------------------------------------------- // // Change Log // // updated on 2008-07-28 by YANG Zhenkun (yangzhenkun@baidu.com) // ////==================================================================== #ifndef __DFS_BTREE_INCLUDE_H_ #define __DFS_BTREE_INCLUDE_H_ //调试信息打印输出开关 //#ifndef DF_BT_PRINT_DEBUG_INFO //#define DF_BT_PRINT_DEBUG_INFO //#endif # if defined __x86_64__ # else # error "MUST COMPILED ON x86_64" # endif #include //#include "ul_def.h" //#include "df_common.h" #include "df_misc.h" #include "df_2d_ary.h" //zhangyan04@baidu.com #include "bsl_kv_btree_xmemcpy.h" //By yangzhenkun@baidu.com at 20090218 //先前：如果“get_mutation_counter() > _bt_get_max_cow_mutation_counter()”(可能还有其他条件) //则直接修改B树节点可能“使得一个正在读的节点被回收”。现在改为所有的修改都一直波及到根节点。 //#ifndef BT_ALLOW_SERIAL_READ_WRITE //#define BT_ALLOW_SERIAL_READ_WRITE //#endif //该宏可以减少B树结点一个uint64_t(用于记录mutation_cnt)，但同时也降低了robust， //反复考虑后暂不启用 yangzhenkun@baidu.com 2009/03/12 //#ifndef BT_NO_BT_NODE_BASE_MUTATION_COUNTER //#define BT_NO_BT_NODE_BASE_MUTATION_COUNTER //#endif // 功能：从文件位置filepos读或写data_len字节数据，然后把文件当前位置移动到读或写后的位置 // 参数：file_info：文件的控制信息，例如文件句柄，调用store或load时文件数据的位置等。 // filepos：文件读出或写入数据的起始位置(相对值)，该位置以store或load调用时为基准。 // data_len：数据长度，缓冲区的长度>=data_len // 返回：0 for success, other values for error (如果读写错或者没有读写到指定大小的数据) typedef int (*dfs_write_proc_t)( void * file_info, const int64_t filepos, const void * buf, const uint64_t data_len); typedef int (*dfs_read_proc_t)( void * file_info, const int64_t filepos, void * buf, const uint64_t data_len); //用户数据类型T需要支持以下接口： // 功能：获得该实例store的数据长度(字节)，该值不能超过MAX_T_STORE_SIZE // uint64_t get_store_size(void) const; // // 功能：存储该实例到buf // 输入：data_pos为存储数据的起始位置 // 输出：data_pos为存储T后新的起始位置 // 返回：0 for success, other values for error // int store(char * buf, const uint32_t buf_size, uint32_t & data_pos) const; // // 功能：获得该实例store的数据长度(字节)，该值不能超过MAX_T_STORE_SIZE // 输入：data_pos为存储数据的起始位置 // 输出：data_pos为存储T后新的起始位置 // 返回：0 for success, other values for error // int load(char * buf, const uint32_t buf_size, uint32_t & data_pos); // class dfs_file_rw_info_t { public: int fd; int reserved; int64_t orig_offset; //typically zero }; //int dfs_write_proc(void * file_info, const int64_t filepos, const void * buf, const uint64_t data_len); //int dfs_read_proc(void * file_info, const int64_t filepos, void * buf, uint64_t & data_len); inline int dfs_write_proc(void * file_info, const int64_t filepos, const void * buf, const uint64_t data_len) { int err = 0; if (NULL == file_info) { err = -1; } else { dfs_file_rw_info_t & rw_info = *((dfs_file_rw_info_t *)file_info); int64_t written_len = pwrite(rw_info.fd, buf, data_len, rw_info.orig_offset+filepos); err = (data_len == (uint64_t)written_len) ? 0 : -1; } return err; }; inline int dfs_read_proc(void * file_info, const int64_t filepos, void * buf, const uint64_t data_len) { int err = 0; if (NULL == file_info) { err = -1; } else { dfs_file_rw_info_t & rw_info = *((dfs_file_rw_info_t *)file_info); int64_t read_len = pread(rw_info.fd, buf, data_len, rw_info.orig_offset+filepos); err = (data_len == (uint64_t)read_len) ? 0 : -1; } return err; }; template class dfs_btree_node_base_t; template class dfs_btree_leaf_node_t; template class dfs_btree_mid_node_t; template class dfs_btree_node_base_t : public dfs_bt_const_t { friend class dfs_btree_leaf_node_t; friend class dfs_btree_mid_node_t; protected: enum cconst_protected { BT_HALF_FANOUT = FANOUT/2, //leaf or mid ATTR_MIDNODE_FLAG = 1, //this is a middle node instead of leaf node MAX_KEY_NUM = FANOUT-1 , }; private: uint16_t _attr; uint16_t _subkey_num; uint32_t _reserved; //保留 uint64_t _mutation_counter; //mutation counter，在申请时获得，以后都不修改 protected: uint64_t _subkey_index_ary[MAX_KEY_NUM]; //the first unit also servers as the next index when this unit is free private: //此类不单独使用，因此其构造及析构函数为private dfs_btree_node_base_t() { init(); }; ~dfs_btree_node_base_t() { }; dfs_btree_node_base_t(const dfs_btree_node_base_t & src) : dfs_btree_node_base_t() { *this = src; }; dfs_btree_node_base_t & operator=(const dfs_btree_node_base_t & src) { if (&src != this) { //zhangyan04 //memcpy(this, &src, sizeof(*this)); ZY::xmemcpy(this, &src, sizeof(*this)); } return *this; }; protected: void init(void) { int64_t j = 0; _attr = 0; _subkey_num = 0; _reserved = 0; _mutation_counter = 0; for (j = 0; j < (int64_t)df_len_of_ary(_subkey_index_ary); ++j) { _subkey_index_ary[j] = UNDEF_INDEX; } return; }; public: const uint64_t * get_subkey_ary(void) const { return _subkey_index_ary; }; uint32_t get_subkey_num(void) const { return _subkey_num; }; //return: 0 for success, other value for error int set_subkey_num(const uint32_t subkey_num) { int err = 0; if (subkey_num <= MAX_KEY_NUM) { _subkey_num = subkey_num; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_SUBKEY_NUM); } return err; }; void set_mutation_counter(const uint64_t mutation_counter) { _mutation_counter = mutation_counter; }; uint64_t get_mutation_counter(void) const { return _mutation_counter; }; bool is_leaf_node(void) const { return ((_attr & ATTR_MIDNODE_FLAG) == 0); }; bool is_mid_node(void) const { return ((_attr & ATTR_MIDNODE_FLAG) != 0); }; public: //insert an item into scr_buff but save result to tag_buff //There should be no overlap between tag_buff and src_buff. //return: 0 for success, other value for error static int insert( uint64_t * tag_buff, const uint32_t tag_buff_len, const uint64_t * src_buff, const uint32_t src_data_len, const uint32_t ins_pos, const uint64_t ins_data) { int err = 0; if (src_data_len < tag_buff_len && ins_pos <= src_data_len) { //zhangyan04 //memcpy(tag_buff, src_buff, ins_pos*sizeof(tag_buff[0])); ZY::xmemcpy(tag_buff, src_buff, ins_pos*sizeof(tag_buff[0])); tag_buff[ins_pos] = ins_data; //zhangyan04 //memcpy(tag_buff+ins_pos+1, src_buff+ins_pos, (src_data_len-ins_pos)*sizeof(tag_buff[0])); ZY::xmemcpy(tag_buff+ins_pos+1, src_buff+ins_pos, (src_data_len-ins_pos)*sizeof(tag_buff[0])); err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(dfs_bt_const_t::ERRNO_BT_NODE_POS); } return err; }; //delete an item from scr_buff but save result to tag_buff //There should be no overlap between tag_buff and src_buff. //return: 0 for success, other value for error static int del( uint64_t * tag_buff, const uint32_t tag_buff_len, const uint64_t * src_buff, const uint32_t src_data_len, const uint32_t del_pos) { int err = 0; if (del_pos < src_data_len && (src_data_len-1) <= tag_buff_len) { //zhangyan04 //memcpy(tag_buff, src_buff, del_pos*sizeof(tag_buff[0])); ZY::xmemcpy(tag_buff, src_buff, del_pos*sizeof(tag_buff[0])); //memcpy(tag_buff+del_pos,src_buff+(del_pos+1),(src_data_len-(del_pos+1))*sizeof(tag_buff[0])); ZY::xmemcpy(tag_buff+del_pos,src_buff+(del_pos+1),(src_data_len-(del_pos+1))*sizeof(tag_buff[0])); err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(dfs_bt_const_t::ERRNO_BT_NODE_POS); } return err; }; public: bool is_full(void) const { return (this->get_subkey_num() >= df_len_of_ary(this->_subkey_index_ary)); }; //return: key_index, UNDEF_INDEX for invalid pos uint64_t get_subkey_index(const uint32_t pos) const { uint64_t key_index = UNDEF_INDEX; int err = 0; if (pos < this->get_subkey_num()) { key_index = this->_subkey_index_ary[pos]; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); key_index = UNDEF_INDEX; } return key_index; }; int get_subkeys( uint64_t * buff, const uint32_t buff_len) const { int err = 0; if (this->get_subkey_num() < buff_len) { //zhangyan04 //memcpy(buff, this->_subkey_index_ary, this->get_subkey_num()*sizeof(buff[0])); ZY::xmemcpy(buff, this->_subkey_index_ary, this->get_subkey_num()*sizeof(buff[0])); err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(dfs_bt_const_t::ERRNO_BT_BUF_SIZE); } return err; }; //insert a key into this obj, but save the result to a buff //return: 0 for success, other value for error int insert_subkey( uint64_t * tag_buff, const uint32_t buff_len, const uint32_t ins_pos, const uint64_t ins_key_index) const { return insert( tag_buff, buff_len, this->_subkey_index_ary, this->get_subkey_num(), ins_pos, ins_key_index); }; //delete a key from this obj, but save the result to a buff //return: 0 for success, other value for error int del_subkey( uint64_t * tag_buff, const uint32_t buff_len, const uint32_t del_pos) const { return del( tag_buff, buff_len, this->_subkey_index_ary, this->get_subkey_num(), del_pos); }; }; template class dfs_btree_leaf_node_t : public dfs_btree_node_base_t { protected: enum cconst_protected { //FANOUT = dfs_btree_node_base_t::FANOUT, }; public: friend class dfs_btree_leaf_node_t; dfs_btree_leaf_node_t() { init(); }; dfs_btree_leaf_node_t(const dfs_btree_leaf_node_t & src) { *this = src; }; dfs_btree_leaf_node_t & operator=(const dfs_btree_leaf_node_t & src) { if (&src != this) { //zhangyan04 //memcpy(this, &src, sizeof(*this)); ZY::xmemcpy(this, &src, sizeof(*this)); } return *this; }; ~dfs_btree_leaf_node_t() { }; void init(void) { dfs_btree_node_base_t::init(); this->_attr &= ~(this->ATTR_MIDNODE_FLAG); }; public: //insert a key into this obj, but save the result to a buff //return: 0 for success, other value for error int insert_subkey( uint64_t * tag_buff, const uint32_t buff_len, const uint32_t ins_pos, const uint64_t ins_key_index) const { return insert( tag_buff, buff_len, this->_subkey_index_ary, this->get_subkey_num(), ins_pos, ins_key_index); }; //insert a key into this obj, but save the result to tag_node //return: 0 for success, other value for error int insert_subkey( dfs_btree_leaf_node_t & tag_node, const uint32_t ins_pos, const uint64_t ins_key_index) const { int err = 0; err = insert( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), ins_pos, ins_key_index); if (0 == err) { err = tag_node.set_subkey_num(this->get_subkey_num()+1); } return err; }; //insert a key into this obj, but save the result to tag_node //return: 0 for success, other value for error int insert_subkey( dfs_btree_leaf_node_t & tag_node, const uint32_t ins_pos, const uint64_t ins_key_index) const { int err = 0; err = insert( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), ins_pos, ins_key_index); if (0 == err) { err = tag_node.set_subkey_num(this->get_subkey_num()+1); } return err; }; //delete a key from this obj, but save the result to a buff //return: 0 for success, other value for error int del_subkey( uint64_t * tag_buff, const uint32_t buff_len, const uint32_t del_pos) const { return del( tag_buff, buff_len, this->_subkey_index_ary, this->get_subkey_num(), del_pos); }; //delete a key from this obj, but save the result to tag_node //return: 0 for success, other value for error int del_subkey( dfs_btree_leaf_node_t & tag_node, const uint32_t del_pos) const { int err = del( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), del_pos); if (0 == err) { err = tag_node.set_subkey_num(this->get_subkey_num()-1); } return err; }; //delete a key from this obj, but save the result to tag_node //return: 0 for success, other value for error int del_subkey( dfs_btree_leaf_node_t & tag_node, const uint32_t del_pos) const { int err = del( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), del_pos); if (0 == err) { err = tag_node.set_subkey_num(this->get_subkey_num()-1); } return err; }; //update a key of this obj //return: 0 for success, other value for error int update_subkey( const uint32_t update_key_pos, const uint64_t new_key_index, uint64_t & old_key_index) { int err = 0; if (update_key_pos < this->get_subkey_num()) { old_key_index = df_atomic_exchange(this->_subkey_index_ary+update_key_pos, new_key_index); err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update a key of this obj, but save the result to the tag obj //return: 0 for success, other value for error int update_subkey( dfs_btree_leaf_node_t & tag_node, const uint32_t update_key_pos, const uint64_t new_key_index) const { int err = 0; if (update_key_pos < this->get_subkey_num()) { tag_node = *this; tag_node._subkey_index_ary[update_key_pos] = new_key_index; err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //return: 0 for success, other value for error int put_subkeys( const uint64_t * buff, const uint32_t subkey_num) { int err = 0; if (subkey_num <= df_len_of_ary(this->_subkey_index_ary)) { //zhangyan04 //memcpy(this->_subkey_index_ary, buff, subkey_num*sizeof(this->_subkey_index_ary[0])); ZY::xmemcpy(this->_subkey_index_ary, buff, subkey_num*sizeof(this->_subkey_index_ary[0])); err = this->set_subkey_num(subkey_num); } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; public: //增加时所做的操作 //如果copy叶子节点的话,,那么可以不进行任何操作... inline int action_while_added(void * /*pgc_info*/, const uint64_t /*node_index*/) { return 0; }; //删除前所做的操作 inline int action_before_gc(void * /*pgc_info*/, const uint64_t /*node_index*/); }; template class dfs_btree_mid_node_t : public dfs_btree_node_base_t { protected: enum cconst_protected { //FANOUT = dfs_btree_node_base_t::FANOUT, }; public: friend class dfs_btree_mid_node_t; dfs_btree_mid_node_t() { init(); }; dfs_btree_mid_node_t(const dfs_btree_mid_node_t & src) : dfs_btree_node_base_t() { *this = src; }; dfs_btree_mid_node_t & operator=(const dfs_btree_mid_node_t & src) { if (&src != this) { //zhangyan04 //memcpy(this, &src, sizeof(*this)); ZY::xmemcpy(this, &src, sizeof(*this)); } return *this; }; ~dfs_btree_mid_node_t() { }; void init(void) { int64_t j = 0; dfs_btree_node_base_t::init(); this->_attr |= this->ATTR_MIDNODE_FLAG; for (j = 0; j < (int64_t)df_len_of_ary(_subnode_index_ary); ++j) { _subnode_index_ary[j] = UNDEF_INDEX; } return; }; protected: uint64_t _subnode_index_ary[FANOUT]; public: //return: key_index, UNDEF_INDEX for invalid pos uint64_t get_subnode_index(const uint32_t pos) const { uint64_t node_index = UNDEF_INDEX; int err = 0; if (pos <= this->get_subkey_num()) { node_index = this->_subnode_index_ary[pos]; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); node_index = UNDEF_INDEX; } return node_index; }; public: //说明：update_node_index更新update_pos处，然后在update_pos左边插入(left_key_index,left_son_node_index)对， // 结果保存在tag_node。 //return: 0 for success, other value for error int update_then_ins_to_left( dfs_btree_mid_node_t & tag_node, const uint32_t update_pos, const uint64_t left_key_index, const uint64_t left_node_index, const uint64_t update_node_index) const { int err = 0; if (this->get_subkey_num() < df_len_of_ary(this->_subkey_index_ary) && update_pos <= this->get_subkey_num()) { if ((err = insert( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), update_pos, left_key_index)) == 0 && (err = insert( tag_node._subnode_index_ary, df_len_of_ary(tag_node._subnode_index_ary), this->_subnode_index_ary, this->get_subkey_num()+1, update_pos, left_node_index)) == 0) { tag_node._subnode_index_ary[update_pos+1] = update_node_index; err = tag_node.set_subkey_num(this->get_subkey_num()+1); } } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //说明：update_node_index更新update_pos处，然后在update_pos左边插入(left_key_index,left_son_node_index)对， // 结果保存在tag_node。 //return: 0 for success, other value for error int update_then_ins_to_left( dfs_btree_mid_node_t & tag_node, const uint32_t update_pos, const uint64_t left_key_index, const uint64_t left_node_index, const uint64_t update_node_index) const { int err = 0; if (update_pos <= this->get_subkey_num()) { if ((err = insert (tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), update_pos, left_key_index)) == 0 && (err = insert( tag_node._subnode_index_ary, df_len_of_ary(tag_node._subnode_index_ary), this->_subnode_index_ary, this->get_subkey_num()+1, update_pos, left_node_index)) == 0) { tag_node._subnode_index_ary[update_pos+1] = update_node_index; err = tag_node.set_subkey_num(this->get_subkey_num()+1); } } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //说明：update_node_index更新update_pos处，然后在update_pos左边插入(left_key_index,left_son_node_index)对， // 结果保存在tag_key_buff和tag_node_buff。 //return: 0 for success, other value for error int update_then_ins_to_left( uint64_t * tag_key_buff, uint64_t * tag_node_buff, const uint32_t key_buff_len, //(node_buff_len >= key_buff_len+1) const uint32_t update_pos, const uint64_t left_key_index, const uint64_t left_node_index, const uint64_t update_node_index) const { int err = 0; if (this->get_subkey_num() < key_buff_len && update_pos <= this->get_subkey_num()) { if ((err = insert( tag_key_buff, key_buff_len, this->_subkey_index_ary, this->get_subkey_num(), update_pos, left_key_index)) == 0 && (err = insert( tag_node_buff, key_buff_len+1, this->_subnode_index_ary, this->get_subkey_num()+1, update_pos, left_node_index)) == 0) { tag_node_buff[update_pos+1] = update_node_index; err = 0; } } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //return: 0 for success, other value for error int put_pairs( const uint64_t * key_buff, const uint64_t * node_buff, const uint32_t subkey_num) { int err = 0; if (subkey_num <= df_len_of_ary(this->_subkey_index_ary)) { //zhangyan04 //memcpy(this->_subkey_index_ary,key_buff,subkey_num*sizeof(this->_subkey_index_ary[0])); ZY::xmemcpy(this->_subkey_index_ary,key_buff,subkey_num*sizeof(this->_subkey_index_ary[0])); //memcpy(this->_subnode_index_ary,node_buff,(subkey_num+1)*sizeof(this->_subnode_index_ary[0])); ZY::xmemcpy(this->_subnode_index_ary,node_buff,(subkey_num+1)*sizeof(this->_subnode_index_ary[0])); err = this->set_subkey_num(subkey_num); } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_BUF_SIZE); } return err; }; //export nodes to a buff //return: 0 for success, other value for error int export_subnode_index( uint64_t * tag_node_buff, const uint32_t node_buff_len) const { int err = 0; if ((this->get_subkey_num()+1) <= node_buff_len) { //zhangyan04 //memcpy(tag_node_buff,this->_subnode_index_ary,(this->get_subkey_num()+1)*sizeof(tag_node_buff[0])); ZY::xmemcpy(tag_node_buff,this->_subnode_index_ary,(this->get_subkey_num()+1)*sizeof(tag_node_buff[0])); err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_BUF_SIZE); } return err; }; //insert a key into this obj, but save the result to a buff //return: 0 for success, other value for error int insert_subkey( uint64_t * tag_buff, const uint32_t buff_len, const uint32_t ins_pos, const uint64_t ins_key_index) const { return insert( tag_buff, buff_len, this->_subkey_index_ary, this->get_subkey_num(), ins_pos, ins_key_index); }; //update a key of this obj //return: 0 for success, other value for error int update_subkey( const uint32_t update_key_pos, const uint64_t new_key_index, uint64_t & old_key_index) { int err = 0; if (update_key_pos < this->get_subkey_num()) { old_key_index = df_atomic_exchange(this->_subkey_index_ary+update_key_pos, new_key_index); } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update a subnode of this obj //return: 0 for success, other value for failure int update_subnode( const uint32_t update_subnode_pos, const uint64_t new_subnode_index, uint64_t & old_subnode_index) { int err = 0; if (update_subnode_pos <= this->get_subkey_num()) { old_subnode_index = df_atomic_exchange(this->_subnode_index_ary+update_subnode_pos, new_subnode_index); err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update a key of this obj, but save the result to the tag obj //return: 0 for success, other value for error int update_subkey( dfs_btree_mid_node_t & tag_node, const uint32_t update_key_pos, const uint64_t new_key_index) const { int err = 0; if (update_key_pos < this->get_subkey_num()) { tag_node = *this; tag_node._subkey_index_ary[update_key_pos] = new_key_index; err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update a subnode of this obj, but save the result to the tag obj //return: 0 for success, other value for failure int update_subnode( dfs_btree_mid_node_t & tag_node, const uint32_t update_pos, const uint64_t new_subnode_index) const { int err = 0; if (update_pos <= this->get_subkey_num()) { tag_node = *this; tag_node._subnode_index_ary[update_pos] = new_subnode_index; err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update a (key,node) pair as well as a followed node of this obj, but save the result to the tag obj //return: 0 for success, other value for error int update_brothers( dfs_btree_mid_node_t & tag_node, const uint32_t update_pos, const uint64_t new_key_index, const uint64_t new_node_index, const uint64_t new_right_node_index) const { int err = 0; if (update_pos < this->get_subkey_num()) { tag_node = *this; tag_node._subkey_index_ary[update_pos] = new_key_index; tag_node._subnode_index_ary[update_pos] = new_node_index; tag_node._subnode_index_ary[update_pos+1] = new_right_node_index; err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update a (key,node) pair as well as a followed node of this obj, but save the result to the tag buff //return: 0 for success, other value for error int update_brothers( uint64_t * tag_key_buff, uint64_t * tag_node_buff, const uint32_t key_buff_len, //(node_buff_len >= key_buff_len+1) const uint32_t update_pos, const uint64_t new_key_index, const uint64_t new_node_index, const uint64_t new_right_node_index) const { int err = 0; if (update_pos < this->get_subkey_num() && key_buff_len >= this->get_subkey_num()) { //zhangyan04 //memcpy(tag_key_buff,this->_subkey_index_ary,this->get_subkey_num()*sizeof(tag_key_buff[0])); ZY::xmemcpy(tag_key_buff,this->_subkey_index_ary,this->get_subkey_num()*sizeof(tag_key_buff[0])); //memcpy(tag_node_buff,this->_subnode_index_ary,(this->get_subkey_num()+1)*sizeof(tag_node_buff[0])); ZY::xmemcpy(tag_node_buff,this->_subnode_index_ary,(this->get_subkey_num()+1)*sizeof(tag_node_buff[0])); tag_key_buff[update_pos] = new_key_index; tag_node_buff[update_pos] = new_node_index; tag_node_buff[update_pos+1] = new_right_node_index; err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; ////update a (key,node) pair, but save the result to the tag obj ////return: 0 for success, other value for error //int update_pair( // dfs_btree_mid_node_t & tag_node, // const uint32_t update_pos, // const uint64_t new_key_index, // const uint64_t new_node_index) const //{ // int err = 0; // if (update_pos < this->get_subkey_num()) // { // tag_node = *this; // tag_node._subkey_index_ary[update_pos] = new_key_index; // tag_node._subnode_index_ary[update_pos] = new_node_index; // err = 0; // } // else // { // err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); // } // return err; //}; //delete a pair from this obj, but save the result to a buff //return: 0 for success, other value for error int del_pair( uint64_t * tag_key_buff, uint64_t * tag_node_buff, const uint32_t key_buff_len, //(node_buff_len >= key_buff_len+1) const uint32_t del_pos) const { int err = 0; if (del_pos < this->get_subkey_num() && (key_buff_len+1) >= this->get_subkey_num()) { del( tag_key_buff, key_buff_len, this->_subkey_index_ary, this->get_subkey_num(), del_pos); del( tag_node_buff, key_buff_len+1, this->_subnode_index_ary, this->get_subkey_num()+1, del_pos); err = 0; } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //delete a pair from this obj, but save the result to a tag obj //return: 0 for success, other value for error int del_pair( dfs_btree_mid_node_t & tag_node, const uint32_t del_pos) const { int err = 0; if (del_pos < this->get_subkey_num()) { del( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), del_pos); del( tag_node._subnode_index_ary, df_len_of_ary(tag_node._subnode_index_ary), this->_subnode_index_ary, this->get_subkey_num()+1, del_pos); err = tag_node.set_subkey_num(this->get_subkey_num()-1); } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update a subnode pointed by update_pos and delete its left pair, but save the result to a tag obj int update_then_del_left( dfs_btree_mid_node_t & tag_node, const uint32_t update_pos, const uint64_t new_node_index) const { int err = 0; if (0 < update_pos && update_pos <= this->get_subkey_num()) { del( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), update_pos-1); del( tag_node._subnode_index_ary, df_len_of_ary(tag_node._subnode_index_ary), this->_subnode_index_ary, this->get_subkey_num()+1, update_pos-1); tag_node._subnode_index_ary[update_pos-1] = new_node_index; err = tag_node.set_subkey_num(this->get_subkey_num()-1); } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update a subnode pointed by update_pos and delete its left pair, but save the result to a tag obj int update_then_del_left( dfs_btree_mid_node_t & tag_node, const uint32_t update_pos, const uint64_t new_node_index) const { int err = 0; if (0 < update_pos && update_pos <= this->get_subkey_num()) { del( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), update_pos-1); del( tag_node._subnode_index_ary, df_len_of_ary(tag_node._subnode_index_ary), this->_subnode_index_ary, this->get_subkey_num()+1, update_pos-1); tag_node._subnode_index_ary[update_pos-1] = new_node_index; err = tag_node.set_subkey_num(this->get_subkey_num()-1); } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update the left pair and the right subnode and delete myself pair, but save the result to a tag obj int update_both_sides_then_del_mid( dfs_btree_mid_node_t & tag_node, const uint32_t update_pos, const uint64_t new_left_key_index, const uint64_t new_left_subnode_index, const uint64_t new_right_subnode_index) const { int err = 0; if (0 < update_pos && (update_pos+1) <= this->get_subkey_num()) { del( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), update_pos); del( tag_node._subnode_index_ary, df_len_of_ary(tag_node._subnode_index_ary), this->_subnode_index_ary, this->get_subkey_num()+1, update_pos); tag_node._subkey_index_ary[update_pos-1] = new_left_key_index; tag_node._subnode_index_ary[update_pos-1] = new_left_subnode_index; tag_node._subnode_index_ary[update_pos] = new_right_subnode_index; err = tag_node.set_subkey_num(this->get_subkey_num()-1); } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; //update the left pair and the right subnode and delete myself pair, but save the result to a tag obj int update_both_sides_then_del_mid( dfs_btree_mid_node_t & tag_node, const uint32_t update_pos, const uint64_t new_left_key_index, const uint64_t new_left_subnode_index, const uint64_t new_right_subnode_index) const { int err = 0; if (0 < update_pos && (update_pos+1) <= this->get_subkey_num()) { del( tag_node._subkey_index_ary, df_len_of_ary(tag_node._subkey_index_ary), this->_subkey_index_ary, this->get_subkey_num(), update_pos); del( tag_node._subnode_index_ary, df_len_of_ary(tag_node._subnode_index_ary), this->_subnode_index_ary, this->get_subkey_num()+1, update_pos); tag_node._subkey_index_ary[update_pos-1] = new_left_key_index; tag_node._subnode_index_ary[update_pos-1] = new_left_subnode_index; tag_node._subnode_index_ary[update_pos] = new_right_subnode_index; err = tag_node.set_subkey_num(this->get_subkey_num()-1); } else { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NODE_POS); } return err; }; public: //增加时所做的操作 inline int action_while_added(void * /*pgc_info*/, const uint64_t /*node_index*/) { return 0; }; //删除前所做的操作 inline int action_before_gc(void * /*pgc_info*/, const uint64_t /*node_index*/); }; //单一B树的根节点 class dfs_sbt_root_t { //single btree root private: uint64_t _root_node_index; uint64_t _next_allocate_id; uint64_t _mutation_counter; public: dfs_sbt_root_t() { init(); }; ~dfs_sbt_root_t() { }; public: inline const dfs_sbt_root_t & operator=(const dfs_sbt_root_t & src) { if (&src != this) { _root_node_index = src._root_node_index ; _next_allocate_id = src._next_allocate_id ; _mutation_counter = src._mutation_counter ; } return *this; }; public: inline void set_value(const dfs_sbt_root_t & src) { *this = src; }; public: dfs_sbt_root_t(const dfs_sbt_root_t & src) : _root_node_index(src._root_node_index), _next_allocate_id(src._next_allocate_id), _mutation_counter(src._mutation_counter) { }; void init(void) { _root_node_index = UNDEF_INDEX; //从编号1开始进行分配... _next_allocate_id = 1; //skip NULL_ID _mutation_counter = 0; return; }; public: //输入：new_root_index //return: 0 for success, other values for error int set_root_node_index(uint64_t & old_root_index, const uint64_t new_root_index) { int log_level = DF_UL_LOG_NONE; int err = 0; if (UNDEF_INDEX == new_root_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_root_index"); err = DF_BT_SET_INTERNAL_ERR(dfs_bt_const_t::ERRNO_BT_INVALID_INDEX); } else { old_root_index = df_atomic_exchange(&_root_node_index, new_root_index); } return 0; }; uint64_t get_root_node_index(void) const { return _root_node_index; }; public: bool is_invalid_id(const uint64_t id) const { return (NULL_ID == id || UNDEF_ID == id || ((_next_allocate_id > 1) && (id >= _next_allocate_id))); }; uint64_t alloc_id(void) { return df_atomic_inc(&_next_allocate_id)-1; }; void set_next_allocate_id(const uint64_t next_allocate_id) { df_atomic_exchange(&_next_allocate_id, next_allocate_id); return; }; uint64_t get_next_allocate_id(void) const { return _next_allocate_id; }; uint64_t get_mutation_counter(void) const { return _mutation_counter; }; void set_mutation_counter(const uint64_t mutation_counter) { _mutation_counter = mutation_counter; return ; }; //uint64_t inc_mutation_counter(void) //{ // return ++_mutation_counter; //}; }; class dfs_btree_t; // //根节点信息 class dfs_bt_root_t : public dfs_bt_const_t { private: //dfs_btree_t * _pbtree; //这个多个单根实例...:). //fp最高可能到4. dfs_sbt_root_t _sbt_root_ary[MAX_BT_INSTANCE_NUM]; public: dfs_bt_root_t() { // : _pbtree(NULL) //init(); }; ~dfs_bt_root_t() { }; const dfs_bt_root_t & operator=(const dfs_bt_root_t & src) { if (&src != this) { //memcpy(this, &src, sizeof(*this)); for (int64_t j = 0; j < (int64_t)df_len_of_ary(_sbt_root_ary); ++j) { _sbt_root_ary[j] = src._sbt_root_ary[j]; } } return *this; }; dfs_bt_root_t(const dfs_bt_root_t & src) { //memcpy(this, &src, sizeof(*this)); for (int64_t j = 0; j < (int64_t)df_len_of_ary(_sbt_root_ary); ++j) { _sbt_root_ary[j] = src._sbt_root_ary[j]; } }; void init(void) { for (int64_t j = 0; j < (int64_t)df_len_of_ary(_sbt_root_ary); ++j) { _sbt_root_ary[j].init(); } return; }; public: //void set_btree(dfs_btree_t * pbtree) //{ // _pbtree = pbtree; //}; //输入：new_root_node_index(might be UNDEF_INDEX) //return: 0 for success, other values for error int set_root(const dfs_sbt_root_t & sbt_root, const uint32_t pos) { int log_level = DF_UL_LOG_NONE; int err = 0; if (pos >= df_len_of_ary(_sbt_root_ary)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pos >= df_len_of_ary(_sbt_root_ary)"); DF_WRITE_LOG_US(log_level, "pos=%d", pos); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); } _sbt_root_ary[pos%df_len_of_ary(_sbt_root_ary)].set_value(sbt_root); return err; }; const dfs_sbt_root_t & get_root(const uint32_t pos) const { int log_level = DF_UL_LOG_NONE; int err = 0; if (pos >= df_len_of_ary(_sbt_root_ary)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pos >= df_len_of_ary(_sbt_root_ary)"); DF_WRITE_LOG_US(log_level, "pos=%d", pos); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); } return _sbt_root_ary[pos%df_len_of_ary(_sbt_root_ary)]; }; public: //输入：new_root_index //return: 0 for success, other values for error int set_root_node_index(uint64_t & old_root_index, const uint64_t new_root_index, const uint32_t pos) { int log_level = DF_UL_LOG_NONE; int err = 0; if (pos >= df_len_of_ary(_sbt_root_ary)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pos >= df_len_of_ary(_sbt_root_ary)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); DF_WRITE_LOG_US(log_level, "new_root_index=0x%lx, pos=%u", new_root_index, pos); } else if (UNDEF_INDEX == new_root_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_root_index"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); DF_WRITE_LOG_US(log_level, "new_root_index=0x%lx, pos=%u", new_root_index, pos); } else if ((err = _sbt_root_ary[pos%df_len_of_ary(_sbt_root_ary)].set_root_node_index( old_root_index, new_root_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_sbt_root_ary[].set_root_node_index() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "new_root_index=0x%lx, pos=%u", new_root_index, pos); } return err; }; uint64_t get_root_node_index(const uint32_t pos) const { int log_level = DF_UL_LOG_NONE; int err = 0; if (pos >= df_len_of_ary(_sbt_root_ary)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pos >= df_len_of_ary(_sbt_root_ary)"); DF_WRITE_LOG_US(log_level, "pos=%d", pos); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); } return _sbt_root_ary[pos%df_len_of_ary(_sbt_root_ary)].get_root_node_index(); }; //int set_mutation_counter(const uint64_t mutation_counter, const uint32_t pos) //{ // int log_level = DF_UL_LOG_NONE; // int err = 0; // // if (pos >= df_len_of_ary(_root_info_ary)) // { // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "pos >= df_len_of_ary(_root_info_ary)"); // DF_WRITE_LOG_US(log_level, "pos=%d", pos); // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); // } // // return _root_info_ary[pos%df_len_of_ary(_root_info_ary)].set_mutation_counter(mutation_counter); //}; //uint64_t get_mutation_counter(const uint32_t pos) const //{ // int log_level = DF_UL_LOG_NONE; // int err = 0; // // if (pos >= df_len_of_ary(_root_info_ary)) // { // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "pos >= df_len_of_ary(_root_info_ary)"); // DF_WRITE_LOG_US(log_level, "pos=%d", pos); // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); // } // // return _root_info_ary[pos%df_len_of_ary(_root_info_ary)].get_mutation_counter(); //}; bool is_invalid_id(const uint64_t id, const uint32_t pos) const { int log_level = DF_UL_LOG_NONE; int err = 0; if (pos >= df_len_of_ary(_sbt_root_ary)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pos >= df_len_of_ary(_sbt_root_ary)"); DF_WRITE_LOG_US(log_level, "pos=%d", pos); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); } return _sbt_root_ary[pos%df_len_of_ary(_sbt_root_ary)].is_invalid_id(id); }; uint64_t alloc_id(const uint32_t pos) { int log_level = DF_UL_LOG_NONE; int err = 0; if (pos >= df_len_of_ary(_sbt_root_ary)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pos >= df_len_of_ary(_sbt_root_ary)"); DF_WRITE_LOG_US(log_level, "pos=%d", pos); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); } return _sbt_root_ary[pos%df_len_of_ary(_sbt_root_ary)].alloc_id(); }; public: //增加/减少根节点引用计数 //????. //????. inline int action_while_added(void * pgc_info, const uint64_t node_index); inline int action_before_gc(void * pgc_info, const uint64_t node_index); }; //当删除操作发生在中间节点时，dfs_btree_drill_t中对应的node_index被替换成一个新的， //对应位置的key_index被替换成其子树的最大的key_index class dfs_btree_drill_t : public dfs_bt_const_t { protected: int _drill_ptr; int _del_mid_drill_ptr; //删除所在中间节点 uint64_t _del_mid_old_node_index; //删除所在中间节点原来的node_index uint64_t _btree_mutation_counter; //inc whenever there is an update,修改的计数范围... uint64_t _subnode_index_ary[MAX_BT_DEPTH]; //the node history for drilling down...node to drill down.. uint32_t _ins_pos_ary[MAX_BT_DEPTH]; //insert pos in the node (_subnode_index_ary[]) of btree public: dfs_btree_drill_t() { init(); }; ~dfs_btree_drill_t() { }; dfs_btree_drill_t & operator=(const dfs_btree_drill_t & src) { if (&src != this) { //zhangyan04 //memcpy(this, &src, sizeof(*this)); ZY::xmemcpy(this, &src, sizeof(*this)); } return *this; }; bool operator==(const dfs_btree_drill_t & src) const { return (_drill_ptr == src._drill_ptr && memcmp( _subnode_index_ary, src._subnode_index_ary, (_drill_ptr+1)*sizeof(_subnode_index_ary[0])) == 0 && memcmp( _ins_pos_ary, src._ins_pos_ary, (_drill_ptr+1)*sizeof(_ins_pos_ary[0])) == 0); }; bool operator!=(const dfs_btree_drill_t & src) const { return !(operator==(src)); }; void init(void) { int64_t j = 0; _drill_ptr = -1; _del_mid_drill_ptr = MAX_BT_DEPTH; //????. _del_mid_old_node_index = UNDEF_INDEX; _btree_mutation_counter = 0; for (j = 0; j < (int64_t)df_len_of_ary(_subnode_index_ary); ++j) { _subnode_index_ary[j] = UNDEF_INDEX; } for (j = 0; j < (int64_t)df_len_of_ary(_ins_pos_ary); ++j) { _ins_pos_ary[j] = 0; } return; }; public: //return: 0 for success, other value for error int push(const uint32_t ins_pos, const uint64_t node_index) { int err = 0; if (_drill_ptr < ((int)df_len_of_ary(_subnode_index_ary)-1)) { ++_drill_ptr; _subnode_index_ary[_drill_ptr] = node_index; _ins_pos_ary[_drill_ptr] = ins_pos; err = 0; } else { DF_WRITE_LOG_US(DF_UL_LOG_FATAL, "error: push drill overflow _drill_ptr=%d", _drill_ptr); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_OVERFLOW); } return err; }; //return: 0 for success, other value for error int pop(void) { int err = 0; if (_drill_ptr >= 0) { _subnode_index_ary[_drill_ptr] = UNDEF_INDEX; --_drill_ptr; err = 0; } else { DF_WRITE_LOG_US(DF_UL_LOG_FATAL, "error: pop drill underflow _drill_ptr=%d", _drill_ptr); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_UNDERFLOW); } return err; }; public: int get_drill_ptr(void) const { return _drill_ptr; }; //return: node_index，UNDEF_INDEX for invalid drill_pos uint64_t get_node_index(const int drill_pos) const { uint64_t node_index = UNDEF_INDEX; int log_level = DF_UL_LOG_NONE; int err = 0; if (drill_pos >= 0 && drill_pos <= _drill_ptr) { if ((node_index = _subnode_index_ary[drill_pos]) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_NODE_INDEX); } } else { log_level = DF_UL_LOG_TRACE; DF_WRITE_LOG_US(log_level, "drill_pos < 0 || drill_pos > _drill_ptr"); err = DF_BT_SET_NORMAL_ERR(this->ERRNO_BT_DRILL_POS); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_pos=%d, _drill_ptr=%d, node_index=0x%lx", drill_pos, _drill_ptr, node_index) } return node_index; }; //return: node_index，UNDEF_INDEX for invalid drill_pos uint64_t get_last_node_index(void) const { uint64_t node_index = UNDEF_INDEX; int log_level = DF_UL_LOG_NONE; int err = 0; if (_drill_ptr >= 0 && _drill_ptr < (int)df_len_of_ary(_subnode_index_ary)) { if ((node_index = _subnode_index_ary[_drill_ptr]) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_NODE_INDEX); } } else { log_level = DF_UL_LOG_TRACE; DF_WRITE_LOG_US(log_level, "_drill_ptr < 0 || _drill_ptr >= df_len_of_ary(_subnode_index_ary)"); err = DF_BT_SET_NORMAL_ERR(this->ERRNO_BT_DRILL_POS); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "_drill_ptr=%d, node_index=0x%lx", _drill_ptr, node_index) } return node_index; } //return: ins_pos, UNDEF_POS for invalid drill_pos uint32_t get_ins_pos(const int drill_pos) const { uint32_t ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if (drill_pos >= 0 && drill_pos <= _drill_ptr) { if ((ins_pos = _ins_pos_ary[drill_pos]) >= BT_FANOUT) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ins_pos >= BT_FANOUT"); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_INS_POS); } } else { log_level = DF_UL_LOG_TRACE; DF_WRITE_LOG_US(log_level, "drill_pos < 0 || drill_pos > _drill_ptr"); err = DF_BT_SET_NORMAL_ERR(this->ERRNO_BT_DRILL_POS); ins_pos = UNDEF_POS; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_pos=%d, _drill_ptr=%d, ins_pos=%d", drill_pos, _drill_ptr, ins_pos) } return ins_pos; }; //return: ins_pos, UNDEF_POS for invalid drill_pos uint32_t get_last_ins_pos(void) const { uint32_t ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if (_drill_ptr >= 0 && _drill_ptr < (int)df_len_of_ary(_ins_pos_ary)) { if ((ins_pos = _ins_pos_ary[_drill_ptr]) >= BT_FANOUT) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ins_pos >= BT_FANOUT"); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_INS_POS); } } else { log_level = DF_UL_LOG_TRACE; DF_WRITE_LOG_US(log_level, "_drill_ptr < 0 || _drill_ptr >= df_len_of_ary(_ins_pos_ary)"); err = DF_BT_SET_NORMAL_ERR(this->ERRNO_BT_DRILL_POS); ins_pos = UNDEF_POS; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "_drill_ptr=%d, ins_pos=%d", _drill_ptr, ins_pos) } return ins_pos; }; //return: 0 for success, otherwise error int inc_last_ins_pos(void) { int log_level = DF_UL_LOG_NONE; int err = 0; if (_drill_ptr >= 0 && _drill_ptr < (int)df_len_of_ary(_ins_pos_ary)) { ++_ins_pos_ary[_drill_ptr]; if (_ins_pos_ary[_drill_ptr] >= BT_FANOUT) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_ins_pos_ary[_drill_ptr] >= BT_FANOUT"); DF_WRITE_LOG_US(log_level, "_ins_pos_ary[_drill_ptr]=%d", _ins_pos_ary[_drill_ptr]); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_INS_POS); } } else { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_drill_ptr < 0 || _drill_ptr >= df_len_of_ary(_ins_pos_ary)"); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_POS); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "_drill_ptr=%d", _drill_ptr); } return err; } //return: 0 for success, otherwise error int dec_last_ins_pos(void) { int log_level = DF_UL_LOG_NONE; int err = 0; if (_drill_ptr >= 0 && _drill_ptr < (int)df_len_of_ary(_ins_pos_ary)) { if (_ins_pos_ary[_drill_ptr] <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_ins_pos_ary[_drill_ptr] <= 0"); DF_WRITE_LOG_US(log_level, "_ins_pos_ary[_drill_ptr]=%d", _ins_pos_ary[_drill_ptr]); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_INS_POS); } else { --_ins_pos_ary[_drill_ptr]; } } else { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_drill_ptr < 0 || _drill_ptr >= df_len_of_ary(_ins_pos_ary)"); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_POS); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "_drill_ptr=%d", _drill_ptr); } return err; }; //void empty(void) //{ // init(); //}; //bool is_empty(void) const //{ // return (_drill_ptr < 0); //}; //bool is_only_one_step(void) const //{ // return (0 == _drill_ptr); //}; public: void set_btree_mutation_counter(const uint64_t btree_mutation_counter) { _btree_mutation_counter = btree_mutation_counter; }; uint64_t get_btree_mutation_counter(void) const { return _btree_mutation_counter; }; public: //要删除的key所在的B树节点在drill_info中的位置 //被删除点位于中间节点时，原来的node_index int set_del_mid_drill_info(const int del_mid_drill_ptr, const uint64_t del_mid_new_node_index) { int err = 0; if ((_del_mid_drill_ptr = del_mid_drill_ptr) >= 0 && _del_mid_drill_ptr < _drill_ptr) { _del_mid_old_node_index = _subnode_index_ary[_del_mid_drill_ptr]; _subnode_index_ary[_del_mid_drill_ptr] = del_mid_new_node_index; } else { DF_WRITE_LOG_US(DF_UL_LOG_FATAL, "error del_mid_drill_ptr=%d, _drill_ptr=%d", del_mid_drill_ptr, _drill_ptr); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_DRILL_DEL_NODE_POS); } return err; }; //要删除的key所在的B树节点在drill_info中的位置 int get_del_mid_drill_ptr(void) const { return _del_mid_drill_ptr; }; //被删除点位于中间节点时，原来的node_index uint64_t get_del_mid_old_node_index(void) const { return _del_mid_old_node_index; }; public: //bool is_match_tree(const uint64_t root_index, const uint64_t mutation_counter) const //{ // return (get_drill_ptr() >= 0 // && get_btree_mutation_counter() == mutation_counter // && get_node_index(0) == root_index); //}; //???what doest it mean??. bool not_match_tree(const dfs_sbt_root_t & sbt_root) const { return (get_drill_ptr() < 0 || get_btree_mutation_counter() != sbt_root.get_mutation_counter() || get_node_index(0) != sbt_root.get_root_node_index()); }; }; //对节点更新(插入/删除)后的结果 class dfs_btree_node_mutate_t : public dfs_bt_const_t { public: enum cconst_public { //节点操作类型 MUTATE_NOTHING = 0 , //没有更新操作 UPDATE_NODE , //插入或删除而导致产生了新节点 SPLIT_NODE , //节点分裂了(产生了两个新节点) REBALANCE_LEFT , //与左兄弟进行了平衡(产生了新的左节点和新的本节点) REBALANCE_RIGHT , //与右兄弟进行了平衡(产生了新的本节点和新的右节点) MERGE_LEFT , //因为删除而与左兄弟进行合并(左兄弟被删除) MERGE_RIGHT , //因为删除而与右兄弟进行了合并(本节点被删除) MERGE_BOTH , //因为删除而同时与左右兄弟进行了合并(本节点被删除) }; protected: int _mutate_type; int _unused; uint64_t _new_key_index ; uint64_t _new_1st_node_index ; uint64_t _new_2nd_node_index ; public: dfs_btree_node_mutate_t() { _mutate_type = 0; _unused = 0; _new_key_index = UNDEF_INDEX; _new_1st_node_index = UNDEF_INDEX; _new_2nd_node_index = UNDEF_INDEX; }; ~dfs_btree_node_mutate_t() { }; dfs_btree_node_mutate_t(const dfs_btree_node_mutate_t & src) { *this = src; }; dfs_btree_node_mutate_t & operator=(const dfs_btree_node_mutate_t & src) { if (&src != this) { //zhangyan04 //memcpy(this, &src, sizeof(*this)); ZY::xmemcpy(this, &src, sizeof(*this)); } return *this; }; public: int get_update_type(void) const { return _mutate_type; }; void set_mutate_nothing(void) { _mutate_type = MUTATE_NOTHING; _new_key_index = UNDEF_INDEX; _new_1st_node_index = UNDEF_INDEX; _new_2nd_node_index = UNDEF_INDEX; }; void set_update_node_info(const uint64_t new_node_index) { _mutate_type = UPDATE_NODE; _new_key_index = UNDEF_INDEX; _new_1st_node_index = new_node_index; _new_2nd_node_index = UNDEF_INDEX; }; int get_update_node_info(uint64_t & node_index) const { int err = 0; if (get_update_type() != UPDATE_NODE) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_MUTATE_TYPE); node_index = UNDEF_INDEX; } else { node_index = _new_1st_node_index; err = 0; } return err; }; void set_split_node_info( const uint64_t new_left_key_index, const uint64_t new_left_node_index, const uint64_t new_right_node_index) { _mutate_type = SPLIT_NODE; _new_key_index = new_left_key_index; _new_1st_node_index = new_left_node_index; _new_2nd_node_index = new_right_node_index; }; int get_split_node_info( uint64_t & new_left_key_index, uint64_t & new_left_node_index, uint64_t & new_right_node_index) const { int err = 0; if (get_update_type() != SPLIT_NODE) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_MUTATE_TYPE); new_left_key_index = UNDEF_INDEX; new_left_node_index = UNDEF_INDEX; new_right_node_index = UNDEF_INDEX; } else { new_left_key_index = _new_key_index; new_left_node_index = _new_1st_node_index; new_right_node_index = _new_2nd_node_index; err = 0; } return err; }; void set_rebalance_left_info( const uint64_t new_left_key_index, const uint64_t new_left_node_index, const uint64_t new_myself_node_index) { _mutate_type = REBALANCE_LEFT; _new_key_index = new_left_key_index; _new_1st_node_index = new_left_node_index; _new_2nd_node_index = new_myself_node_index; }; int get_rebalance_left_info( uint64_t & new_left_key_index, uint64_t & new_left_node_index, uint64_t & new_myself_node_index) const { int err = 0; if (get_update_type() != REBALANCE_LEFT) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_MUTATE_TYPE); new_left_key_index = UNDEF_INDEX; new_left_node_index = UNDEF_INDEX; new_myself_node_index = UNDEF_INDEX; } else { new_left_key_index = _new_key_index; new_left_node_index = _new_1st_node_index; new_myself_node_index = _new_2nd_node_index; err = 0; } return err; }; void set_rebalance_right_info( const uint64_t new_myself_key_index, const uint64_t new_myself_node_index, const uint64_t new_right_node_index) { _mutate_type = REBALANCE_RIGHT; _new_key_index = new_myself_key_index; _new_1st_node_index = new_myself_node_index; _new_2nd_node_index = new_right_node_index; }; int get_rebalance_right_info( uint64_t & new_myself_key_index, uint64_t & new_myself_node_index, uint64_t & new_right_node_index) const { int err = 0; if (get_update_type() != REBALANCE_RIGHT) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_MUTATE_TYPE); new_myself_key_index = UNDEF_INDEX; new_myself_node_index = UNDEF_INDEX; new_right_node_index = UNDEF_INDEX; } else { new_myself_key_index = _new_key_index; new_myself_node_index = _new_1st_node_index; new_right_node_index = _new_2nd_node_index; err = 0; } return err; }; void set_merge_left_info(const uint64_t new_myself_node_index) { _mutate_type = MERGE_LEFT; _new_key_index = UNDEF_INDEX; _new_1st_node_index = new_myself_node_index; _new_2nd_node_index = UNDEF_INDEX; }; int get_merge_left_info(uint64_t & new_myself_node_index) const { int err = 0; if (get_update_type() != MERGE_LEFT) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_MUTATE_TYPE); new_myself_node_index = UNDEF_INDEX; } else { new_myself_node_index = _new_1st_node_index; err = 0; } return err; }; void set_merge_right_info(const uint64_t new_right_node_index) { _mutate_type = MERGE_RIGHT; _new_key_index = UNDEF_INDEX; _new_1st_node_index = new_right_node_index; _new_2nd_node_index = UNDEF_INDEX; }; int get_merge_right_info(uint64_t & new_right_node_index) const { int err = 0; if (get_update_type() != MERGE_RIGHT) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_MUTATE_TYPE); new_right_node_index = UNDEF_INDEX; } else { new_right_node_index = _new_1st_node_index; err = 0; } return err; }; void set_merge_both_info( const uint64_t new_left_key_index, const uint64_t new_left_node_index, const uint64_t new_right_node_index) { _mutate_type = MERGE_BOTH; _new_key_index = new_left_key_index; _new_1st_node_index = new_left_node_index ; _new_2nd_node_index = new_right_node_index; }; int get_merge_both_info( uint64_t & new_left_key_index, uint64_t & new_left_node_index, uint64_t & new_right_node_index) const { int err = 0; if (get_update_type() != MERGE_BOTH) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_MUTATE_TYPE); new_left_key_index = UNDEF_INDEX; new_left_node_index = UNDEF_INDEX; new_right_node_index = UNDEF_INDEX; } else { new_left_key_index = _new_key_index; new_left_node_index = _new_1st_node_index ; new_right_node_index = _new_2nd_node_index ; err = 0; } return err; }; }; class dfs_btree_fhead_base_t { public: uint32_t size; //sizeof of the head (not only the base part) uint32_t ver; int64_t total_data_len; //including the head uint32_t major_tag; //“大树”的类型，如'fpbt', 'idbt' uint32_t minor_tag; //“小树”的类型，如'fpbt'下有'fpbt'和'idbt' uint64_t reserve10; }; //btree自己保存的头信息，各种不同btree(ID,FP,NS,XZ)还会保存自己的头信息 class dfs_btree_fhead_ext_t { public: uint64_t total_leaf_node_num; uint64_t total_mid_node_num; uint64_t total_key_num; int32_t store_t_type; //STORE_T_INDEX, STORE_T_VALUE or STORE_T_VALUE_KEEP_T_INDEX uint32_t reserve20; uint64_t reserve21[24]; }; //btree自己保存的头信息，各种不同btree(ID,FP,NS,XZ)还会保存自己的头信息 class dfs_btree_fhead_t : public dfs_btree_fhead_base_t, public dfs_btree_fhead_ext_t { public: enum cconst_public { STORE_T_INDEX = 0 , STORE_T_VALUE , STORE_T_VALUE_KEEP_T_INDEX , //STORE_T_AND_KEEP_T_INDEX shoud > STORE_T_ONLY CORE_BT_VER = 0x00000002, //Hihg-16-bit: main ver; CORE_BT_TAG = (((int)'b')<<24) | (((int)'t')<<16) | (((int)'r')<<8) | (((int)'e')), //"btree" ATTR_MIDNODE_FLAG = 1, //this is a middle node instead of leaf node }; }; class dfs_btree_store_info_t : virtual public dfs_bt_const_t, public dfs_s_ary_t { public: enum cconst_public { STORE_T_INDEX = dfs_btree_fhead_t::STORE_T_INDEX , STORE_T_VALUE = dfs_btree_fhead_t::STORE_T_VALUE , STORE_T_VALUE_KEEP_T_INDEX = dfs_btree_fhead_t::STORE_T_VALUE_KEEP_T_INDEX , }; private: dfs_init_t _init_state; const dfs_write_proc_t _write_proc; const pvoid _file_info; int64_t _file_offset; char * _buf; const uint64_t _buf_size; uint64_t _data_pos; uint64_t _total_leaf_node_num; uint64_t _total_mid_node_num; uint64_t _total_key_num; uint32_t _major_tag; int32_t _store_t_type; //STORE_T_INDEX, STORE_T_VALUE or STORE_T_VALUE_KEEP_T_INDEX uint64_t _kept_key_num; //uint64_t _max_kept_key_index; public: dfs_btree_store_info_t( const dfs_write_proc_t write_proc, const pvoid file_info, const uint64_t buf_size) : dfs_s_ary_t(UNDEF_INDEX), _write_proc(write_proc), _file_info(file_info), _buf_size(buf_size) { _buf = NULL; init(); }; ~dfs_btree_store_info_t() { flush_data(); if (NULL != _buf) { delete [] _buf; _buf = NULL; } }; int init(void) { int log_level = DF_UL_LOG_NONE; int err = 0; if (_init_state.is_not_init_yet()) { _file_offset = 0; _data_pos = 0; _total_leaf_node_num = 0; _total_mid_node_num = 0; _total_key_num = 0; _store_t_type = STORE_T_VALUE; _kept_key_num = 0; //_max_kept_key_index = 0; if ((err = dfs_s_ary_t::init()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "dfs_s_ary_t::init() returns 0x%x", err); } else if (NULL != _buf) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NOT_NULL_BUF_POINTER); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "NULL != _buf"); } else if ((_buf = new char[_buf_size]) == NULL) { err = DF_BT_SET_NORMAL_ERR(this->ERRNO_BT_NOMEM); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, ERRINFO_BT_NOMEM, "_buf"); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "_buf=0x%p, _buf_size=%ld", _buf, _buf_size); } _init_state.set_init_result(err); } else { err = _init_state.get_init_result(); } return err; }; void init_counters(void) { _total_leaf_node_num = 0; _total_mid_node_num = 0; _total_key_num = 0; }; public: void set_major_tag(const uint32_t major_tag) { _major_tag = major_tag; }; uint32_t get_major_tag(void) const { return _major_tag; }; //uint64_t get_mutation_counter(void) const //{ // return _mutation_counter; //}; //void set_mutation_counter(const uint64_t mutation_counter) //{ // _mutation_counter = mutation_counter; //}; uint64_t get_total_leaf_node_num(void) const { return _total_leaf_node_num; }; uint64_t get_total_mid_node_num(void) const { return _total_mid_node_num; }; uint64_t get_total_key_num(void) const { return _total_key_num; }; public: uint64_t inc_total_leaf_node_num(void) { return ++_total_leaf_node_num; }; uint64_t inc_total_mid_node_num(void) { return ++_total_mid_node_num; }; uint64_t add_total_key_num(const uint32_t key_num) { _total_key_num += key_num; return _total_key_num; }; public: //void set_file_offset(const int64_t file_offset) //{ // _file_offset = file_offset; //}; int64_t get_cur_file_offset(void) const { return (_file_offset+(int64_t)_data_pos); }; int32_t get_store_t_type(void) const { return _store_t_type; }; void set_store_t_index(void) { _store_t_type = STORE_T_INDEX; }; void set_store_t_value(void) { _store_t_type = STORE_T_VALUE; }; void set_store_t_value_keep_t_index(void) { _store_t_type = STORE_T_VALUE_KEEP_T_INDEX; }; public: int flush_data(void) { int err = 0; if (_data_pos > 0) { if ((err = _write_proc(_file_info, _file_offset, _buf, _data_pos)) != 0) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_WRITE_FILE); } _file_offset += _data_pos; _data_pos = 0; } return err; }; int padding(void) { //to purpose for padding: 1. makes decode_num() always has at least 9 bytes; 2. alignment uint64_t padding_num = 0x20 -(get_cur_file_offset() & 0xf); int err = require_space(padding_num); if (0 == err) { memset(_buf+_data_pos, 0, padding_num); _data_pos += padding_num; //err = flush_data(); } return err; }; int rewrite_data(const void * buf, const uint64_t data_len, const int64_t file_offset) { //refill the head int err = flush_data(); if (0 == err) { if ((err = _write_proc(_file_info, file_offset, buf, data_len)) != 0) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_WRITE_FILE); } } return err; }; uint64_t get_avail_space(void) const { return (_buf_size-_data_pos); }; int require_space(const uint64_t space_len) { int err = 0; if (get_avail_space() <= space_len) { if ((err = flush_data()) == 0 && get_avail_space() <= space_len) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_BUF_POS); } } return err; }; int encode_num(const uint64_t num) { int err = require_space(9); if (0 == err) { err = dfs_bt_const_t::encode_num(num,_buf,_buf_size,_data_pos); } return err; }; //encode the length of data and also guarantee there enough buf space for the data int encode_data_len(const uint64_t data_len) { int err = require_space(9+data_len); if (0 == err) { err = dfs_bt_const_t::encode_num(data_len,_buf,_buf_size,_data_pos); } return err; }; int store_data(const uint64_t data) { int err = require_space(sizeof(data)); if (0 == err) { *((uint64_t *)(_buf+_data_pos)) = data; _data_pos += sizeof(data); } return err; }; int store_data(const uint32_t data) { int err = require_space(sizeof(data)); if (0 == err) { *((uint32_t *)(_buf+_data_pos)) = data; _data_pos += sizeof(data); } return err; }; int store_buf(const void * buf, const uint32_t data_len) { int err = require_space(data_len); if (0 == err) { //zhangyan04 //memcpy(_buf+_data_pos, buf, data_len); ZY::xmemcpy(_buf+_data_pos, buf, data_len); _data_pos += data_len; } return err; }; public: char * get_buf(void) const { return _buf; }; uint64_t get_buf_size(void) const { return _buf_size; }; uint64_t & get_data_pos(void) { return _data_pos; }; public: int keep_obj_index(const uint64_t key_index) { int log_level = DF_UL_LOG_NONE; int err = 0; if (UNDEF_INDEX == key_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == key_index"); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_INVALID_INDEX); } else if ((err = dfs_s_ary_t::put_t(key_index, _kept_key_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "dfs_s_ary_t::put_t() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "key_index=0x%lx, _kept_key_num=%ld", key_index, _kept_key_num); } else { ++_kept_key_num; } return err; }; int get_kept_obj_seq(const uint64_t key_index, uint64_t & key_seq) { int log_level = DF_UL_LOG_NONE; int err = 0; key_seq = UNDEF_INDEX; if (UNDEF_INDEX == key_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == key_index"); err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_INVALID_INDEX); } else if ((err = dfs_s_ary_t::get_t(key_index, key_seq)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "dfs_s_ary_t::get_t() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "key_index=0x%lx, _kept_key_num=%ld, key_seq=%ld", key_index, _kept_key_num, key_seq); } return err; } //int clear_kept_key_index(void) //{ // return dfs_s_ary_t::clear(); //}; int clear_session_nums(void) { _total_leaf_node_num = 0; _total_mid_node_num = 0; _total_key_num = 0; _kept_key_num = 0; //_max_kept_key_index = 0; return dfs_s_ary_t::clear(); }; }; class dfs_btree_load_info_t : virtual public dfs_bt_const_t, public dfs_s_ary_t { public: enum cconst_public { STORE_T_INDEX = dfs_btree_fhead_t::STORE_T_INDEX , STORE_T_VALUE = dfs_btree_fhead_t::STORE_T_VALUE , STORE_T_VALUE_KEEP_T_INDEX = dfs_btree_fhead_t::STORE_T_VALUE_KEEP_T_INDEX , }; private: dfs_init_t _init_state; const dfs_read_proc_t _read_proc; const pvoid _file_info; int64_t _file_offset; int64_t _max_file_offset; //根据total_data_len计算出来的最终数据位置 char * _buf; const uint64_t _buf_size; uint64_t _data_len; uint64_t _data_pos; uint64_t _total_leaf_node_num; uint64_t _total_mid_node_num; uint64_t _total_key_num; uint32_t _major_tag; int _store_t_type; //STORE_T_INDEX, STORE_T_VALUE or STORE_T_VALUE_KEEP_T_INDEX uint64_t _kept_key_num; //uint64_t _max_kept_key_index; public: dfs_btree_load_info_t( const dfs_read_proc_t read_proc, const pvoid file_info, const uint64_t buf_size) : dfs_s_ary_t(UNDEF_INDEX), _read_proc(read_proc), _file_info(file_info), _buf_size(buf_size) { _buf = NULL; init(); }; ~dfs_btree_load_info_t() { if (NULL != _buf) { delete [] _buf; _buf = NULL; } }; int init(void) { int log_level = DF_UL_LOG_NONE; int err = 0; if (_init_state.is_not_init_yet()) { _file_offset = 0; _max_file_offset = 0; _data_len = 0; _data_pos = 0; _total_leaf_node_num = 0; _total_mid_node_num = 0; _total_key_num = 0; _store_t_type = STORE_T_VALUE; _kept_key_num = 0; //_max_kept_key_index = 0; if ((err = dfs_s_ary_t::init()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "dfs_s_ary_t::init() returns 0x%x", err); } else if (NULL != _buf) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_NOT_NULL_BUF_POINTER); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "NULL != _buf"); } else if ((_buf = new char[_buf_size]) == NULL) { err = DF_BT_SET_NORMAL_ERR(this->ERRNO_BT_NOMEM); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, ERRINFO_BT_NOMEM, "_buf"); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "_buf=0x%p, _buf_size=%ld", _buf, _buf_size); } _init_state.set_init_result(err); } else { err = _init_state.get_init_result(); } return err; }; public: void set_major_tag(const uint32_t major_tag) { _major_tag = major_tag; }; uint32_t get_major_tag(void) const { return _major_tag; }; //uint64_t get_mutation_counter(void) const //{ // return _mutation_counter; //}; //void set_mutation_counter(const uint64_t mutation_counter) //{ // _mutation_counter = mutation_counter; //}; uint64_t get_total_leaf_node_num(void) const { return _total_leaf_node_num; }; uint64_t get_total_mid_node_num(void) const { return _total_mid_node_num; }; uint64_t get_total_key_num(void) const { return _total_key_num; }; public: uint64_t dec_total_leaf_node_num(void) { return --_total_leaf_node_num; }; uint64_t dec_total_mid_node_num(void) { return --_total_mid_node_num; }; uint64_t sub_total_key_num(const uint32_t key_num) { _total_key_num -= key_num; return _total_key_num; }; public: void set_total_nums( const uint64_t total_leaf_node_num, const uint64_t total_mid_node_num, const uint64_t total_key_num) { _total_leaf_node_num = total_leaf_node_num ; _total_mid_node_num = total_mid_node_num ; _total_key_num = total_key_num ; }; public: //void set_file_offset(const int64_t file_offset) //{ // _file_offset = file_offset; //}; void set_max_file_offset(const int64_t max_file_offset) { _max_file_offset = max_file_offset; }; int64_t get_cur_file_offset(void) const { return (_file_offset-(int64_t)get_avail_data_len()); }; int64_t get_max_file_offset(void) const { return _max_file_offset; }; int file_seek(const int64_t file_offset) { int err = 0; if (file_offset == _file_offset) { _data_pos = 0; _data_len = 0; } else if (file_offset != get_cur_file_offset()) { if (file_offset <= 0) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_FILE_POS); } else { _file_offset = file_offset; if ((err = _read_proc(_file_info, _file_offset-1, _buf, 1)) != 0) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_READ_FILE); } _data_pos = 0; _data_len = 0; } } return err; }; int32_t get_store_t_type(void) const { return _store_t_type; }; void set_store_t_type(const int store_t_type) { _store_t_type = store_t_type; }; public: int read_data(void) { uint64_t read_len = 0; int err = 0; if (_file_offset < _max_file_offset) { if (_data_pos > 0) { memmove(_buf, _buf+_data_pos, (_data_len-_data_pos)); _data_len -= _data_pos; _data_pos = 0; } read_len = MIN((int64_t)(_buf_size-_data_len),(_max_file_offset-_file_offset)); if ((err = _read_proc(_file_info, _file_offset, _buf+_data_len, read_len)) != 0) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_READ_FILE); } _file_offset += read_len; _data_len += read_len; } return err; }; uint64_t get_avail_data_len(void) const { return (_data_len-_data_pos); }; int require_data_len(const uint64_t data_len) { int err = 0; if (get_avail_data_len() < data_len) { if ((err = read_data()) == 0 && get_avail_data_len() < data_len) { err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_FILE_POS); } } return err; }; int decode_num(uint64_t & num) { int err = require_data_len(9); if (0 == err) { err = dfs_bt_const_t::decode_num(num,_buf,_data_len,_data_pos); } return err; }; //decode the length of data and also guarantee the data in the buf int decode_data_len(uint64_t & data_len) { int err = require_data_len(9); if (0 == err) { err = dfs_bt_const_t::decode_num(data_len,_buf,_data_len,_data_pos); if (0 == err) { err = require_data_len(data_len); } } return err; }; int load_data(uint64_t & data) { int err = require_data_len(sizeof(data)); if (0 == err) { data = *((uint64_t *)(_buf+_data_pos)); _data_pos += sizeof(data); } return err; }; int load_data(uint32_t & data) { int err = require_data_len(sizeof(data)); if (0 == err) { data = *((uint32_t *)(_buf+_data_pos)); _data_pos += sizeof(data); } return err; }; int load_buf(void * buf, const uint32_t data_len) { int err = 0; if ((err = require_data_len(data_len)) == 0) { //zhangyan04 //memcpy(buf, _buf+_data_pos, data_len); ZY::xmemcpy(buf, _buf+_data_pos, data_len); _data_pos += data_len; } return err; }; int load_data_len(uint32_t & data_len) { int err = load_data(data_len); if (0 == err) { err = require_data_len(data_len); } return err; }; int skip_data_len(const uint32_t data_len) { int err = require_data_len(data_len); if (0 == err) { _data_pos += data_len; } return err; } public: char * get_buf(void) const { return _buf; }; uint64_t get_data_len(void) const { return _data_len; }; uint64_t & get_data_pos(void) { return _data_pos; }; public: int keep_obj_index(const uint64_t key_index) { int err = dfs_s_ary_t::put_t(_kept_key_num, key_index); //if (key_index > _max_kept_key_index) //{ // _max_kept_key_index = key_index; //} ++_kept_key_num; return err; }; int get_kept_key_index(const uint64_t key_seq, uint64_t & key_index) { int err = 0; key_index = UNDEF_INDEX; //if (key_seq >= _kept_key_num) //{ // err = DF_BT_SET_INTERNAL_ERR(this->ERRNO_BT_SUBKEY_NUM); //} //else //{ err = dfs_s_ary_t::get_t(key_seq, key_index); //} return err; } //int clear_kept_key_index(void) //{ // return dfs_s_ary_t::clear(); //}; int clear_session_nums(void) { _total_leaf_node_num = 0; _total_mid_node_num = 0; _total_key_num = 0; _kept_key_num = 0; //_max_kept_key_index = 0; return dfs_s_ary_t::clear(); }; }; //enum bt_ckp_state_t //{ // BT_CKP_STATE_OFF = 0 , // BT_CKP_STATE_ON = 1 , // BT_CKP_STATE_STORING = 2 , // BT_CKP_STATE_LOADING = 3 , //}; // //dfs_btree_t是B树的基本部分，完成B树元素的插入和删除以及由此导致的树的平衡操作。 class dfs_btree_t : virtual public dfs_bt_const_t, public dfs_bt2d_ary_t< dfs_btree_leaf_node_t, dfs_bt_const_t::BT_LEAF_ROW_SIZE>, public dfs_bt2d_ary_t< dfs_btree_mid_node_t, dfs_bt_const_t::BT_MID_ROW_SIZE> { friend class dfs_bt_root_t; private: enum cconst_private { STATE_INIT_FAIL = -2 , STATE_INIT_NOT_YES = -1 , STATE_INIT_SUCCEED = 0 , LEAF_NODE_FLAG_BIT = 63 , //COW_NUM_BITS = 10 , //lowest bits }; static const uint32_t BT_FANOUT = dfs_bt_const_t::BT_FANOUT; static const uint32_t BT_LEAF_ROW_SIZE = dfs_bt_const_t::BT_LEAF_ROW_SIZE; static const uint32_t BT_MID_ROW_SIZE = dfs_bt_const_t::BT_MID_ROW_SIZE; static const uint32_t BT_HALF_FANOUT = (BT_FANOUT-1)/2; static const uint64_t MAX_MID_INDEX = MAX_U_INT64/4-2; static const uint64_t MAX_LEAF_INDEX = MAX_U_INT64/4-2; static const uint64_t LEAF_NODE_FLAG = ((uint64_t)0x1)< node_base_t; typedef dfs_btree_leaf_node_t leaf_node_t; typedef dfs_btree_mid_node_t mid_node_t; typedef dfs_bt2d_ary_t, BT_LEAF_ROW_SIZE> leaf_ary_t; typedef dfs_bt2d_ary_t, BT_MID_ROW_SIZE> mid_ary_t; protected: typedef void * pvoid; private: static uint64_t _add_leaf_flag_bit(const uint64_t node_index) { return (node_index|LEAF_NODE_FLAG); }; static uint64_t _add_mid_flag_bit(const uint64_t node_index) { return node_index; }; static uint64_t _remove_node_flag_bit(const uint64_t node_index) { return (node_index&~LEAF_NODE_FLAG); }; protected: static bool _is_leaf_node(const uint64_t node_index) { return ((node_index&LEAF_NODE_FLAG) != 0); }; static bool _is_mid_node(const uint64_t node_index) { return ((node_index&LEAF_NODE_FLAG) == 0); }; protected: enum cconst_protected { COW_LOG_LEVEL = DF_UL_LOG_NOTICE, CKP_LOG_LEVEL = COW_LOG_LEVEL, VERIFY_LOG_LEVEL = COW_LOG_LEVEL, }; private: dfs_init_t _init_state; //dfs_sbt_root_t _wr_sbt_root; //修改的root volatile uint64_t _mutation_counter; //需要copy-on-write的最大mutation_counter volatile uint64_t _max_cow_mutation_counter; volatile uint32_t _is_reserved_leaf_node_acquired; volatile uint32_t _is_reserved_mid_node_acquired; volatile uint32_t _is_cancel_checkpointing; //取消正在进行中的store/load checkpointing //当前实例序号... uint32_t _bt_instance_pos; //本树在一系列实例中的序号，一般为0，fp_btree中为0~3，ns_btree为0~1 public: dfs_btree_t() { //_wr_sbt_root.init(); _mutation_counter = 0; //需要copy-on-write的最大mutation_counter??? _max_cow_mutation_counter = 0; _is_reserved_leaf_node_acquired = 0; _is_reserved_mid_node_acquired = 0; _is_cancel_checkpointing = 0; _bt_instance_pos = UNDEF_POS; //init(); }; virtual ~dfs_btree_t() { _init_state.set_destructed(); }; //输出：初始化根节点 int init(const uint32_t bt_instance_pos, dfs_bt_root_t & new_wr_bt_root); protected: inline uint32_t _bt_get_instance_pos(void) const; //int _bt_set_bt_instance_pos(const uint32_t bt_instance_pos); inline const dfs_sbt_root_t & _bt_get_sbt_root(const dfs_bt_root_t & bt_root) const; inline int _bt_set_sbt_root( dfs_bt_root_t & bt_root, const dfs_sbt_root_t & sbt_root) const; private: //Disable operator=() and copy constructor const dfs_btree_t & operator=(const dfs_btree_t & src); dfs_btree_t(const dfs_btree_t & src); //const dfs_btree_t & operator=(const dfs_btree_t & src) //{ // return *this; //}; //dfs_btree_t(const dfs_btree_t & src) : // leaf_ary_t(), mid_ary_t() //{ //}; protected: ////获得wr_root //const dfs_sbt_root_t & _bt_get_wr_root(void); ////回滚并加减对应根节点引用计数(用于load checkpoint等) //int _bt_rollback_wr_root(const dfs_sbt_root_t & sbt_root); protected: //inline uint64_t _bt_alloc_id(void); //inline bool _bt_is_invalid_id(const uint64_t id) const; protected: //inline uint64_t _bt_inc_mutation_counter(void); inline uint64_t _bt_update_mutation_counter(const bool is_batch_mode); inline uint64_t _bt_get_mutation_counter(void) const; inline uint64_t _bt_get_max_cow_mutation_counter(void) const; //把_max_cow_mutation_counter设置为当前的mutation_counter inline void _bt_update_max_cow_mutation_counter(void) const; inline bool _bt_is_cancel_checkpointing(void) const; //return previous state inline bool _bt_set_cancel_checkpointing(const bool is_cancel); inline int _bt_inc_root_ref_counter(const dfs_bt_root_t & bt_root) const; inline int _bt_dec_root_ref_counter(const dfs_bt_root_t & bt_root) const; protected: //store all contents of a tree to file int _bt_store_tree( const dfs_bt_root_t & bt_root, dfs_btree_store_info_t & store_info, dfs_btree_fhead_t & btree_fhead) const; // int _bt_load_tree( dfs_bt_root_t & new_wr_bt_root, dfs_btree_load_info_t & load_info, dfs_btree_fhead_t & btree_fhead); private: //store all contents of a subtree to file int _store_subtree( const uint64_t subtree_root, dfs_btree_store_info_t & store_info) const; int _store_subkeys( const uint64_t node_index, dfs_btree_store_info_t & store_info) const; int _store_fhead( dfs_btree_store_info_t & store_info, int64_t & file_head_offset, dfs_btree_fhead_t & btree_fhead) const; int _update_stored_fhead( dfs_btree_store_info_t & store_info, const int64_t file_head_offset, dfs_btree_fhead_t & btree_fhead) const; int _load_fhead( dfs_btree_load_info_t & load_info, int64_t & file_head_offset, dfs_btree_fhead_t & btree_fhead) const; int _load_subtree( uint64_t & subtree_root, dfs_btree_load_info_t & load_info); int _load_subkeys( uint64_t * subkey_index_ary, const uint32_t ary_len, uint32_t & subkey_num, bool & is_mid_node, dfs_btree_load_info_t & load_info); private: //return: 0 for success(be a valid index), other value for error inline int _get_leaf_node_for_mutate(const uint64_t final_node_index, leaf_node_t ** ppleaf) const; //return: 0 for success(be a valid index), other value for error inline int _get_mid_node_for_mutate(const uint64_t final_node_index, mid_node_t ** ppmid) const; //return: 0 for success(be a valid index), other value for error inline int _get_leaf_node(const uint64_t final_node_index, const leaf_node_t ** ppleaf) const; //return: 0 for success(be a valid index), other value for error inline int _get_mid_node(const uint64_t final_node_index, const mid_node_t ** ppmid) const; //return: 0 for success(be a valid index), other value for error inline int _get_node(const uint64_t final_node_index, const node_base_t ** ppbase) const; //return: 0 for success(be a valid index), other value for error inline int _valid_leaf_node_index_verify(const uint64_t final_node_index) const; //return: 0 for success(be a valid index), other value for error inline int _valid_mid_node_index_verify(const uint64_t final_node_index) const; //功能：获得node(leaf or mid)在pos处的key_index //Return: 0 for success, other value for error inline int _get_key_of_node(const uint64_t node_index, const uint32_t pos, uint64_t & key_index) const; //功能：获得mid node在pos处的subnode //Return: 0 for success, other value for error inline int _get_subnode_of_mid_node(const uint64_t node_index, const uint32_t pos, uint64_t & subnode_index) const; private: //relase node由dfs_2d_ary自动进行(根据ref_counter) int _acquire_leaf_node(uint64_t & final_node_index, leaf_node_t ** ppleaf_node); int _acquire_reserved_leaf_node(uint64_t & final_node_index, leaf_node_t ** ppleaf_node); //return: 0 for success, other values for failure int _release_reserved_leaf_node(const uint64_t final_node_index); //relase node由dfs_2d_ary自动进行(根据ref_counter) int _acquire_mid_node(uint64_t & final_node_index, mid_node_t ** ppmid_node); int _acquire_reserved_mid_node(uint64_t & final_node_index, mid_node_t ** ppmid_node); //return: 0 for success, other values for failure int _release_reserved_mid_node(const uint64_t final_node_index); int _get_leaf_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) const; int _get_mid_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) const; int _get_node_ref_counter(const uint64_t node_index, uint64_t & ref_counter) const { return ((_is_leaf_node(node_index)) ? _get_leaf_node_ref_counter(node_index, ref_counter) : _get_mid_node_ref_counter(node_index, ref_counter)); }; //return: 0 for success, other value for error int _inc_leaf_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter); int _inc_leaf_node_ref_counter_if_not_zero(const uint64_t final_node_index, uint64_t & ref_counter); int _inc_mid_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter); int _inc_mid_node_ref_counter_if_not_zero(const uint64_t final_node_index, uint64_t & ref_counter); int _inc_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) { return ((_is_mid_node(final_node_index)) ? _inc_mid_node_ref_counter(final_node_index, ref_counter) : _inc_leaf_node_ref_counter(final_node_index, ref_counter)); }; int _inc_node_ref_counter_if_not_zero(const uint64_t final_node_index, uint64_t & ref_counter) { return ((_is_mid_node(final_node_index)) ? _inc_mid_node_ref_counter_if_not_zero(final_node_index, ref_counter) : _inc_leaf_node_ref_counter_if_not_zero(final_node_index, ref_counter)); }; int _dec_leaf_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter); int _dec_mid_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter); int _dec_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) { return ((_is_mid_node(final_node_index)) ? _dec_mid_node_ref_counter(final_node_index, ref_counter) : _dec_leaf_node_ref_counter(final_node_index, ref_counter)); }; //功能：计算新增一个节点引起的(key_index和B树节点)引用计数 //Return: 0 for success, other value for error int _inc_pointed_ref_counter(const uint64_t final_node_index); //功能：计算删除一个节点引起的(key_index和B树节点)引用计数 //Return: 0 for success, other value for error int _dec_pointed_ref_counter(const uint64_t final_node_index); public: int action_before_leaf_node_gc(const uint64_t internal_node_index); int action_before_mid_node_gc(const uint64_t internal_node_index); private: ////功能：增加或删除一个值导致上溢或下溢时，确定是与左或右兄弟平衡，还是独自分裂成为两个节点 //// left_brother_node_index不等于UNDEF_INDEX则与之平衡，right_brother_node_index不等于UNDEF_INDEX则与之平衡， //// 否则独自分裂成两节点 //int _choose_rebalance_brother(const uint32_t new_key_number, // uint64_t & left_brother_node_index, uint64_t & right_brother_node_index, // const dfs_btree_drill_t & drill_info, const int drill_ptr); //功能：增加或删除一个值导致上溢或下溢时，确定是与左或右兄弟平衡，还是独自分裂成为两个节点 // left_brother_key_num,right_brother_key_num：左右兄弟的key的个数，为0表示不存在 //返回：0 for success, other values for failure int _get_left_right_brothers_info( uint32_t & left_brother_key_num, uint32_t & right_brother_key_num, const dfs_btree_drill_t & drill_info, const int drill_ptr); private: //功能：根据mutate_result对B树操作且返回新的根节点，但不替换当前树的根节点 //输入：mutate_result及root_info //返回：0 for success, other value for failure int _op_tree( const dfs_bt_root_t & old_wr_bt_root, dfs_bt_root_t & new_wr_bt_root, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); private: //功能：当一个节点因插入或删除项后，与其左边兄弟节点平衡，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int _leaf_rebalance_left( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result); //功能：当一个节点因插入或删除项后，与其右边兄弟节点平衡，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int _leaf_rebalance_right( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result); //功能：当一个节点因插入项后，进行分裂，结果记录在mutate_result //输入输入：mutate_result //返回：0 for success, other values for failure int _leaf_split( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result); //功能：当一个节点因删除项下溢后，与其左边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int _leaf_merge_left( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result); //功能：当一个节点因删除项下溢后，与其右边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int _leaf_merge_right( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result); //功能：当一个节点因删除项下溢后，与其左右边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //返回：0 for success, other values for failure int _leaf_merge_both( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result); private: //功能：因子节点插入或删除导致了新节点(没有分裂或左右平衡)而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int _op_mid_node_of_sub_update( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：子节点因插入或删除项而与左兄弟平衡后，更新本节点。 //输入输入：mutate_result //返回：0 for success, other values for failure int _op_mid_node_of_sub_rebalance_left( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：子节点因插入或删除项而与右左兄弟平衡后，更新本节点。 //输入输入：mutate_result //返回：0 for success, other values for failure int _op_mid_node_of_sub_rebalance_right( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：因子节点插入导致分裂而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int _op_mid_node_of_sub_split( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：因子节点与左兄弟合并而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int _op_mid_node_of_sub_merge_left( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：因子节点与右兄弟合并而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int _op_mid_node_of_sub_merge_right( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：因子节点与左右兄弟合并而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int _op_mid_node_of_sub_merge_both( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); private: //功能：更新一个叶节点的一个subkey，结果写入mutate_result //返回：0 for success, other value for failure int _update_leaf_node_subkey( const uint64_t node_index, const uint32_t ins_pos, const uint64_t new_key_index, dfs_btree_node_mutate_t & mutate_result); //功能：更新一个中间节点的一个subkey，结果写入mutate_result //返回：0 for success, other value for failure int _update_mid_node_subkey( const uint64_t node_index, const uint32_t ins_pos, const uint64_t new_key_index, dfs_btree_node_mutate_t & mutate_result); private: //功能：本节点(因插入或删除子项后)，与其左边兄弟节点平衡，结果记录在mutate_result // updated_myself_node：插入或删除子项后的节点 //返回：0 for success, other values for failure int _mid_rebalance_left( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：本节点(因插入或删除子项后)，与其右边兄弟节点平衡，结果记录在mutate_result // updated_myself_node：插入或删除子项后的节点 //返回：0 for success, other values for failure int _mid_rebalance_right( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：本节点因插入子项后，进行分裂，结果记录在mutate_result // updated_myself_node：插入或删除子项后的节点 //返回：0 for success, other values for failure int _mid_split( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：当一个节点因删除项下溢后，与其左边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int _mid_merge_left( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：当一个节点因删除项下溢后，与其右边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int _mid_merge_right( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); //功能：当一个节点因删除项下溢后，与其左右边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //返回：0 for success, other values for failure int _mid_merge_both( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result); private: //功能：在B树叶节点中插入或删除一个项(仅操作叶节点)，把需要对其父节点的操作记录在mutate_result // ins_key_index为插入项的key_index或者UNDEF_INDEX(删除项时) // 如果drill_info.del_drill_ptr不等于-1，则表明是删除操作，当del_drill_ptr < drill_ptr时， // 表示删除发生在中间节点上，但需要把对应子树的最大key_index提升到中间节点的对应位置。 //返回：0 for success, other value for failure int _ins_del_leaf_node( const uint64_t ins_key_index, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result); protected: //功能：在B树中插入一个项且返回新的根节点，但不替换当前树的根节点 //输入：root_info //返回：0 for success, other value for failure int _insert_to_btree( const dfs_bt_root_t & old_wr_bt_root, dfs_bt_root_t & new_wr_bt_root, const uint64_t ins_obj_index, const dfs_btree_drill_t & drill_info); //功能：在B树中更新一个项，drill_ptr >= 0并可能指向叶节点或中间节点。 //输入：root_info //说明：调用者需要保证更新前后的项有相同的key。 //返回：0 for success, other value for failure int _update_of_btree( const dfs_bt_root_t & old_wr_bt_root, dfs_bt_root_t & new_wr_bt_root, const uint64_t new_obj_index, const dfs_btree_drill_t & drill_info); //功能：在B树中删除一个项，drill_ptr >= 0并可能指向叶节点或中间节点。 //输入：root_info //返回：0 for success, other value for failure int _del_from_btree( const dfs_bt_root_t & old_wr_bt_root, dfs_bt_root_t & new_wr_bt_root, const dfs_btree_drill_t & drill_info); //功能：生成一个内容为空的根节点(以便用来通过_update_root()清空树) // return: 0 for success, other values for error int _acquire_empty_root( dfs_bt_root_t & new_wr_bt_root); protected: // 功能：获得B树最小元素并填充drill_info // 输出：若存在(B树非空)，则pct指向它且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使树空)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int _get_smallest( const dfs_bt_root_t & bt_root, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; // // 功能：获得B树最大元素并填充drill_info // 输出：若存在(B树非空)，则pct指向它且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使树空)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int _get_largest( const dfs_bt_root_t & bt_root, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const ; // // 功能：获得一棵子树的最小元素，并追加drill_info中(与search一样) // 输出：若存在(子树非空)，则pct指向它且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使子树空且为根节点)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int _get_subtree_smallest( const uint64_t subtree_root, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; // // 功能：获得一棵子树的最大元素，并追加drill_info中(与search一样) // 输出：若存在(子树非空)，则pct指向它且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使子树空且为根节点)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int _get_subtree_largest( const uint64_t subtree_root, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; // // 功能：根据drill_info获得比当前项小的项，并更新drill_info指向之 // 若存在则pct指向之且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使没有更小元素)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int _get_smaller(dfs_btree_drill_t & drill_info, uint64_t & obj_indext) const; // // 功能：根据drill_info获得比当前项大的项，并更新drill_info指向之 // 若存在则pct指向之且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使没有更大元素)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int _get_larger(dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; // // 功能：获得刚好比输入项srct小的元素 // 输入：srct不需要在B树中存在 // 输出：如果较小元素存在，pct指向它，否则pct为NULL，drill_info指向搜索srct的结果。 // 返回：0 for no error, other values for error int _get_smaller_by_key( const dfs_bt_root_t & bt_root, const void * pkey, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; int _get_smaller_by_obj( const dfs_bt_root_t & bt_root, const void * pobj, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; // 功能：获得刚好比输入的srct大的元素 // 输入：srct不需要在B树中存在 // 输出：如果较大元素存在，pct指向它，否则pct为NULL，drill_info指向搜索srct的结果。 // 返回：0 for no error, other values for error int _get_larger_by_key( const dfs_bt_root_t & bt_root, const void * pkey, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; int _get_larger_by_obj( const dfs_bt_root_t & bt_root, const void * pobj, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; protected: // 功能：搜索整个树，结果写入到drill_info中。drill_info中还包含当前的mutation信息 // 若存在，则drill_info以及pct都指向它，key_index为其key_index， // 否则drill_info指向它插入后的位置，key_index和pct分别为UNDEF_INDEX和NULL。 // return: 0 for success, other values for error // this object may or may not in the btree int _search_by_index( const dfs_bt_root_t & bt_root, const uint64_t i_obj_index, dfs_btree_drill_t & drill_info, uint64_t & o_obj_index) const; int _search_by_obj( const dfs_bt_root_t & bt_root, const void * pobj, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; int _search_by_key( const dfs_bt_root_t & bt_root, const void * pkey, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; protected: // 功能：搜索某个子树，结果追加到drill_info中 // 如果该元素存在，则drill_info中信息指向它，否则指向它插入后的位置。 // 返回：0 for success, other values for error int _search_subtree_by_index( const dfs_bt_root_t & bt_root, const uint64_t subtree_root, const uint64_t src_index, //this object may or may not in the btree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; int _search_subtree_by_obj( const dfs_bt_root_t & bt_root, const uint64_t subtree_root, const void * pobj, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; int _search_subtree_by_key( const dfs_bt_root_t & bt_root, const uint64_t subtree_root, const void * pkey, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; // 功能：搜索B树的一个节点，结果加入到drill_info中 // 返回：0 for success, other values for error int _search_node_by_index( const dfs_bt_root_t & bt_root, const uint64_t node_index, const uint64_t src_index, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; int _search_node_by_obj( const dfs_bt_root_t & bt_root, const uint64_t node_index, //this object may or may not in the btree const void * pobj, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; int _search_node_by_key( const dfs_bt_root_t & bt_root, const uint64_t node_index, const void * pkey, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const; protected: //return: 0 for success, other values for error int _get_drill_last_obj( const dfs_btree_drill_t & drill_info, uint64_t & last_obj_index) const; protected: //// Return: 0 for success, other values for error //virtual int vir_get_total_obj_ref_counter_in_ary( // const dfs_bt_root_t & bt_root, // uint64_t & total_ref_counter) const = 0; // return: 0 for success, other values for error virtual int vir_get_total_in_use_obj_num_in_ary(uint64_t & total_in_use_obj_num) const = 0; // Return: 0 for success, other values for error virtual int vir_obj_store_size( const uint64_t obj_index, uint64_t & store_size, dfs_btree_store_info_t & store_info) const = 0; // return: 0 for success, other values for error virtual int vir_store_obj( const uint64_t obj_index, dfs_btree_store_info_t & store_info) const = 0; // return: 0 for success, other values for error virtual int vir_load_obj( uint64_t & obj_index, dfs_btree_load_info_t & load_info) = 0; // return: 0 for success, other values for error //virtual int vir_get_obj_ref_counter(const uint64_t obj_index, uint64_t & ref_counter) const = 0; virtual int vir_inc_obj_ref_counter(const uint64_t obj_index) = 0; virtual int vir_dec_obj_ref_counter(const uint64_t obj_index) = 0; virtual int vir_inc_obj_ary_ref_counter(const uint64_t * obj_index_ary, const int32_t obj_num) = 0; virtual int vir_dec_obj_ary_ref_counter(const uint64_t * obj_index_ary, const int32_t obj_num) = 0; // // return: 0 for success, other values for error // cmp: -1, 0, 1 for less than, equal, great than //virtual int vir_compare_index_index( // const dfs_bt_root_t & bt_root, // const uint64_t obj1_index, // const uint64_t obj2_index, // int & cmp) const = 0; virtual int vir_compare_index_obj( const dfs_bt_root_t & bt_root, const uint64_t obj1_index, const void * pobj2, int & cmp) const = 0; virtual int vir_compare_index_key( const dfs_bt_root_t & bt_root, const uint64_t obj1_index, const void * pkey2, int & cmp) const = 0; virtual int vir_search_ary_by_index( const dfs_bt_root_t & bt_root, const uint64_t * obj_index_ary, const int32_t obj_num, const uint64_t obj2_index, int & ins_pos, uint64_t & obj_index) const = 0; virtual int vir_search_ary_by_obj( const dfs_bt_root_t & bt_root, const uint64_t * obj_index_ary, const int32_t obj_num, const void * pobj2, int & ins_pos, uint64_t & obj_index) const = 0; virtual int vir_search_ary_by_key( const dfs_bt_root_t & bt_root, const uint64_t * obj_index_ary, const int32_t obj_num, const void * pkey2, int & ins_pos, uint64_t & obj_index) const = 0; virtual int vir_verify_index_ary( const dfs_bt_root_t & bt_root, const uint64_t * obj_index_ary, const int32_t obj_num, bool & is_inc_order) const = 0; protected: //增加/减少根节点引用计数 virtual int vir_inc_root_ref_counter(const dfs_bt_root_t & bt_root) const; virtual int vir_dec_root_ref_counter(const dfs_bt_root_t & bt_root) const; private: //uint64_t _get_max_verified_mutaiont_counter(void) const; //int _set_max_verified_mutaiont_counter(const uint64_t mutaiont_counter) const; // 功能：验证某个子树的顺序和每个节点分支个数 // 输入：subtree_root：子树根节点 // left_brother_key_index：子树的左兄弟，如果不等于UNDEF_INDEX，则<=子树的所有项 // right_brother_key_index：子树的右兄弟，如果不等于UNDEF_INDEX，则>=子树的所有项 // 返回：返回0如果验证通过，返回非0(错误代码)如果验证失败 int _verify_subtree( const dfs_bt_root_t & bt_root, const uint64_t father_mutation_counter, const uint64_t subtree_root, const uint64_t left_brother_obj_index, const uint64_t right_brother_obj_index) const; public: // 功能：验证整个树的顺序和每个节点分支个数 // 返回：返回0如果验证通过，返回非0(错误代码)如果验证失败 int bt_verify_tree(const dfs_bt_root_t & bt_root) const; private: // return: 0 for success, other values for error int _get_subtree_total_num( const uint64_t subtree_root, uint64_t & total_key_num, uint64_t & total_leaf_node_num, uint64_t & total_mid_node_num) const; public: // return: 0 for success, other values for error int bt_get_total_num( const dfs_bt_root_t & bt_root, uint64_t & total_key_num, uint64_t & total_leaf_node_num, uint64_t & total_mid_node_num) const; // return: 0 for success, other values for error int bt_get_in_use_node_num_in_2d_ary( uint64_t & in_use_leaf_node_num, uint64_t & in_use_mid_node_num) const; protected: // return: 0 for success, other values for error // Should be called in locked state and without checkpointing or other COW(load or store) int _bt_sanitary_check(const dfs_bt_root_t & bt_root) const; protected: void _bt_clear_statistic_info(void) { leaf_ary_t::clear_statistic_info(); mid_ary_t::clear_statistic_info(); return; }; void _bt_log_statistic_info( const int log_level, const char * filename, const int lineno, const char * funcname, const char * btreename) const { leaf_ary_t::log_statistic_info(log_level, filename, lineno, funcname, btreename, "leaf"); mid_ary_t::log_statistic_info(log_level, filename, lineno, funcname, btreename, "mid"); return; }; void _bt_log_debug_info( const int log_level, const char * filename, const int lineno, const char * funcname, const char * btreename) const { DF_WRITE_LOG_US(log_level, "%s,%d,%s", filename, lineno, funcname); DF_WRITE_LOG_US(log_level, "%s", btreename); DF_WRITE_LOG_US(log_level, "mutation_counter=%ld", _bt_get_mutation_counter()); DF_WRITE_LOG_US(log_level, "max_cow_mutaiont_counter=%ld", _bt_get_max_cow_mutation_counter()); }; uint64_t _bt_get_mem_size(void) const { return (leaf_ary_t::get_mem_size()+mid_ary_t::get_mem_size()); }; }; inline uint32_t dfs_btree_t::_bt_get_instance_pos(void) const { uint32_t bt_instance_pos = _bt_instance_pos; int log_level = DF_UL_LOG_NONE; int err = 0; if (bt_instance_pos >= MAX_BT_INSTANCE_NUM) { bt_instance_pos = DEF_BT_INSTANCE_POS; log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "bt_instance_pos >= MAX_BT_INSTANCE_NUM"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_BUF_POS); } return bt_instance_pos; }; //inline int dfs_btree_t::_bt_set_bt_instance_pos(const uint32_t bt_instance_pos) //{ // int log_level = DF_UL_LOG_NONE; // int err = 0; // // if (UNDEF_POS != _bt_instance_pos) // { // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "UNDEF_POS != _bt_instance_pos"); // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_BUF_POS); // } // else if (bt_instance_pos >= MAX_BT_INSTANCE_NUM) // { // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "bt_instance_pos >= MAX_BT_INSTANCE_NUM"); // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_BUF_POS); // } // else // { // _bt_instance_pos = bt_instance_pos; // } // // return err; //}; inline const dfs_sbt_root_t & dfs_btree_t::_bt_get_sbt_root(const dfs_bt_root_t & bt_root) const { return bt_root.get_root(_bt_get_instance_pos()); }; inline int dfs_btree_t::_bt_set_sbt_root( dfs_bt_root_t & bt_root, const dfs_sbt_root_t & sbt_root) const { int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = bt_root.set_root(sbt_root, _bt_get_instance_pos())) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "bt_root.set_root() returns 0x%x", err); } return err; }; //return: 0 for success(be a valid index), other value for error inline int dfs_btree_t::_get_leaf_node_for_mutate(const uint64_t final_node_index, leaf_node_t ** ppleaf) const { leaf_node_t * pleaf = NULL; const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL != ppleaf) { *ppleaf = NULL; } if ((err = leaf_ary_t::get_exist_t_unit(inter_node_index, pleaf)) != 0 || NULL == pleaf) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::get_exist_t_unit() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "inter_node_index=0x%lx, final_node_index=0x%lx, pleaf=0x%p", inter_node_index, final_node_index, pleaf); err = DF_BT_SET_NORMAL_ERR(ERRNO_BT_INVALID_INDEX); } else { if (NULL != ppleaf) { *ppleaf = pleaf; } } return err; }; //return: 0 for success(be a valid index), other value for error inline int dfs_btree_t::_get_mid_node_for_mutate(const uint64_t final_node_index, mid_node_t ** ppmid) const { mid_node_t * pmid = NULL; const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL != ppmid) { *ppmid = NULL; } if ((err = mid_ary_t::get_exist_t_unit(inter_node_index, pmid)) != 0 || NULL == pmid) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::get_exist_t_unit() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "inter_node_index=0x%lx, final_node_index=0x%lx, pmid=0x%p", inter_node_index, final_node_index, pmid); err = DF_BT_SET_NORMAL_ERR(ERRNO_BT_INVALID_INDEX); } else { if (NULL != ppmid) { *ppmid = pmid; } } return err; }; //return: 0 for success(be a valid index), other value for error inline int dfs_btree_t::_get_leaf_node(const uint64_t final_node_index, const leaf_node_t ** ppleaf) const { leaf_node_t * pleaf = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _get_leaf_node_for_mutate(final_node_index, &pleaf)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node_for_mutate() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx", final_node_index); if (NULL != ppleaf) { *ppleaf = NULL; } } else { if (NULL != ppleaf) { *ppleaf = pleaf; } } return err; }; //return: 0 for success(be a valid index), other value for error inline int dfs_btree_t::_get_mid_node(const uint64_t final_node_index, const mid_node_t ** ppmid) const { mid_node_t * pmid = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _get_mid_node_for_mutate(final_node_index, &pmid)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node_for_mutate() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx", final_node_index); if (NULL != ppmid) { *ppmid = NULL; } } else { if (NULL != ppmid) { *ppmid = pmid; } } return err; }; //return: 0 for success(be a valid index), other value for error inline int dfs_btree_t::_get_node(const uint64_t final_node_index, const node_base_t ** ppbase) const { const leaf_node_t * pleaf = NULL; const mid_node_t * pmid = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL != ppbase) { *ppbase = NULL; } if (_is_mid_node(final_node_index)) { if ((err = _get_mid_node(final_node_index, &pmid)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx", final_node_index); } else if (NULL != ppbase) { *ppbase = (node_base_t *)pmid; } } else { if ((err = _get_leaf_node(final_node_index, &pleaf)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx", final_node_index); } else if (NULL != ppbase) { *ppbase = (node_base_t *)pleaf; } } return err; }; //return: 0 for success(be a valid index), other value for error inline int dfs_btree_t::_valid_leaf_node_index_verify(const uint64_t final_node_index) const { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; if (!_is_leaf_node(final_node_index)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "Invalid leaf node index"); } else if ((err = leaf_ary_t::valid_t_index_verify(inter_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::valid_t_index_verify() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx", final_node_index, inter_node_index); } return err; }; //return: 0 for success(be a valid index), other value for error inline int dfs_btree_t::_valid_mid_node_index_verify(const uint64_t final_node_index) const { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; if (!_is_mid_node(final_node_index)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "Invalid leaf node index"); } else if ((err = mid_ary_t::valid_t_index_verify(inter_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::valid_t_index_verify() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx", final_node_index, inter_node_index); } return err; }; //功能：获得node(leaf or mid)在pos处的key_index //Return: 0 for success, other value for error inline int dfs_btree_t::_get_key_of_node(const uint64_t node_index, const uint32_t pos, uint64_t & key_index) const { const node_base_t * pnode = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; key_index = UNDEF_INDEX; if ((err = _get_node(node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (pos >= pnode->get_subkey_num()) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pos >= pnode->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); } else { key_index = pnode->get_subkey_index(pos); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, pos=%d", node_index, pos); } return err; }; //功能：获得mid node在pos处的subnode //Return: 0 for success, other value for error inline int dfs_btree_t::_get_subnode_of_mid_node(const uint64_t node_index, const uint32_t pos, uint64_t & subnode_index) const { const mid_node_t * pmid_node = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; subnode_index = UNDEF_INDEX; if ((err = _get_mid_node(node_index, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else if (pos > pmid_node->get_subkey_num()) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pos > pmid_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_POS); } else { subnode_index = pmid_node->get_subnode_index(pos); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, pos=%d", node_index, pos); } return err; }; //inline uint64_t dfs_btree_t::_bt_inc_mutation_counter(void) //{ // return df_atomic_inc(&_mutation_counter); //}; inline uint64_t dfs_btree_t::_bt_update_mutation_counter(const bool is_batch_mode) { df_atomic_inc(&_mutation_counter); if (!is_batch_mode) { //TODO..??? df_atomic_exchange(&_max_cow_mutation_counter, _mutation_counter); } return _mutation_counter; } inline uint64_t dfs_btree_t::_bt_get_mutation_counter(void) const { return _mutation_counter; }; inline uint64_t dfs_btree_t::_bt_get_max_cow_mutation_counter(void) const { return _max_cow_mutation_counter; }; inline void dfs_btree_t::_bt_update_max_cow_mutation_counter(void) const { df_atomic_exchange(&(((dfs_btree_t *)this)->_max_cow_mutation_counter), _mutation_counter); return; }; inline bool dfs_btree_t::_bt_is_cancel_checkpointing(void) const { return (_is_cancel_checkpointing != 0); }; //return previous state inline bool dfs_btree_t::_bt_set_cancel_checkpointing(const bool is_cancel) { uint32_t pre_state = df_atomic_exchange(&_is_cancel_checkpointing, (is_cancel) ? 1 : 0); return (pre_state != 0); }; //not necessary in locked state //_root_node_index might be UNDEF_INDEX inline int dfs_btree_t::_bt_inc_root_ref_counter(const dfs_bt_root_t & bt_root) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); const uint64_t root_index = sbt_root.get_root_node_index(); uint64_t ref_counter = UNDEF_REF_COUNTER; int log_level = DF_UL_LOG_NONE; int err = 0; if (UNDEF_INDEX != root_index) { if ((err = ((dfs_btree_t *)this)->_inc_node_ref_counter(root_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_node_ref_counter() returns 0x%x", err); } } return err; }; inline int dfs_btree_t::_bt_dec_root_ref_counter(const dfs_bt_root_t & bt_root) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); const uint64_t root_index = sbt_root.get_root_node_index(); uint64_t ref_counter = UNDEF_REF_COUNTER; int log_level = DF_UL_LOG_NONE; int err = 0; if (UNDEF_INDEX != root_index) { if ((err = ((dfs_btree_t *)this)->_dec_node_ref_counter(root_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_dec_node_ref_counter() returns 0x%x", err); } } return err; }; ////for mutation operation //inline int dfs_btree_t::_bt_copy_root(dfs_cell_root_t & bt_root) const //{ // _bt_set_own_root_info(bt_root, _root_info); // return 0; //}; //inline int dfs_btree_t::_bt_update_root( // dfs_cell_root_t & cur_root_info_ary, // const dfs_cell_root_t & new_root_info_ary) //{ // const dfs_root_info_t & new_root_info = _bt_get_own_root_info(new_root_info_ary); // const uint64_t new_root_index = new_root_info.get_root_node_index(); // uint64_t old_root_index = _root_info.get_root_node_index(); // uint64_t tmp_root_index = UNDEF_INDEX; // int log_level = DF_UL_LOG_NONE; // int err = 0; // // if (UNDEF_INDEX == new_root_index) // { // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_root_info.get_root_node_index()"); // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); // } // else // { // _root_info.set_next_allocate_id(new_root_info.get_next_allocate_id()); // _root_info.set_root_node_index(old_root_index, new_root_index); // } // _bt_set_own_root_node_index(cur_root_info_ary, tmp_root_index, old_root_index); // // if (DF_UL_LOG_NONE != log_level) // { // DF_WRITE_LOG_US(log_level, // "old_root_index=0x%lx, new_root_index=0x%lx", // old_root_index, new_root_index); // } // // return err; //}; //回收之前的动作... template inline int dfs_btree_leaf_node_t::action_before_gc(void * pgc_info, const uint64_t node_index) { dfs_btree_t * pbtree = (dfs_btree_t *)pgc_info; int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL == pbtree) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "NULL == pbtree"); err = DF_BT_SET_INTERNAL_ERR(dfs_bt_const_t::ERRNO_BT_SET_GC_INFO); } else if((err = pbtree->action_before_leaf_node_gc(node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pbtree->action_before_leaf_node_gc() returns 0x%x", err); } return err; }; template inline int dfs_btree_mid_node_t::action_before_gc(void * pgc_info, const uint64_t node_index) { dfs_btree_t * pbtree = (dfs_btree_t *)pgc_info; int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL == pbtree) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "NULL == pbtree"); err = DF_BT_SET_INTERNAL_ERR(dfs_bt_const_t::ERRNO_BT_SET_GC_INFO); } else if((err = pbtree->action_before_mid_node_gc(node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pbtree->action_before_mid_node_gc() returns 0x%x", err); } return err; }; //增加前所做的操作 inline int dfs_bt_root_t::action_while_added(void * pgc_info, const uint64_t /*node_index*/) { dfs_btree_t * pbtree = (dfs_btree_t *)pgc_info; //uint64_t ref_counter = 0; int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL == pbtree) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "NULL == pbtree"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SET_GC_INFO); //增加根的操作..... } else if ((err = pbtree->vir_inc_root_ref_counter(*this)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pbtree->vir_inc_root_ref_counter() returns 0x%x", err); } return err; }; //删除前所做的操作 //根节点删除之前... inline int dfs_bt_root_t::action_before_gc(void * pgc_info, const uint64_t /*node_index*/) { dfs_btree_t * pbtree = (dfs_btree_t *)pgc_info; //uint64_t ref_counter = 0; int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL == pbtree) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "NULL == pbtree"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SET_GC_INFO); } else if ((err = pbtree->vir_dec_root_ref_counter(*this)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pbtree->vir_dec_root_ref_counter() returns 0x%x", err); } return err; }; class dfs_btree_lock_hold_t : public dfs_mutex_hold_t { }; class dfs_btree_lock_t : public dfs_mutex_lock_t { public: int init(void) const { return 0; }; //protected: // inline int _acquire_mutate_lock( // dfs_btree_lock_hold_t & lock_hold, // const int64_t wait_microsecond = 0) const; // inline int _release_mutate_lock(dfs_btree_lock_hold_t & lock_hold) const; // inline int _verify_mutate_locker(const dfs_btree_lock_hold_t & lock_hold) const; public: inline int acquire_mutate_lock( dfs_btree_lock_hold_t & lock_hold, const int64_t wait_microsecond = 0) const { return dfs_mutex_lock_t::_acquire_lock(lock_hold, wait_microsecond); }; inline int release_mutate_lock(dfs_btree_lock_hold_t & lock_hold) const { return dfs_mutex_lock_t::_release_lock(lock_hold); }; inline bool verify_lock_hold(const dfs_btree_lock_hold_t & lock_hold) const { //??? return _verify_hold(lock_hold); }; ////Begin: Obsolete interface: //protected: // dfs_btree_lock_hold_t _lock_hold; // inline int _acquire_mutate_lock(const int64_t wait_microsecond = 0) const // { // return acquire_mutate_lock((dfs_btree_lock_hold_t &)_lock_hold, wait_microsecond); // }; // inline int _release_mutate_lock(void) const // { // return release_mutate_lock((dfs_btree_lock_hold_t &)_lock_hold); // }; ////End: Obsolete interface: }; #define BT_MUTATE_LOCK_ACQUIRE(hold_ptr, hold_inst, max_time_in_us) \ ((NULL == hold_ptr) ? this->acquire_mutate_lock(hold_inst, max_time_in_us) : \ this->_acquire_hold(*hold_ptr)) #define BT_MUTATE_LOCK_RELEASE(hold_ptr, hold_inst) \ ((NULL == hold_ptr) ? this->release_mutate_lock(hold_inst) : \ this->_release_hold(*hold_ptr)) #define BT_MUTATE_LOCK_ACQUIRE_ERR_INFO "BT_MUTATE_LOCK_ACQUIRE() returns error" #define BT_MUTATE_LOCK_RELEASE_ERR_INFO "BT_MUTATE_LOCK_RELEASE() returns error" //======================================================================================================================== //======================================================================================================================== //======================================================================================================================== //======================================================================================================================== //原来做为df_btree.cpp单独存在,现在提出来... //放在一个头文件进行管理. //输出：初始化根节点 int dfs_btree_t::init(const uint32_t bt_instance_pos, dfs_bt_root_t & new_wr_bt_root) { dfs_sbt_root_t sbt_root; uint64_t final_node_index = UNDEF_INDEX; uint64_t old_node_index = UNDEF_INDEX; //uint64_t ref_counter = UNDEF_REF_COUNTER; int log_level = DF_UL_LOG_NONE; int err = 0; if (_init_state.is_not_init_yet()) { //DFS_BT_DEBUG_TRAP; if ((err = leaf_ary_t::init()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::init() returns 0x%x", err); } //gc对象就是this... else if ((err = leaf_ary_t::set_gc_info(this)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::set_gc_info() returns 0x%x", err); } else if ((err = mid_ary_t::init()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::init() returns 0x%x", err); } else if ((err = mid_ary_t::set_gc_info(this)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::set_gc_info() returns 0x%x", err); } //leaf_node: 保留unit 0，目前暂时未使用 //mid_niode: 保留unit 0，在删除中间节点时，用于临时保存更新的中间节点(但整棵树还未更新) //root node else if ((err = _acquire_leaf_node(final_node_index, NULL)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node() returns 0x%x", err); } else if (UNDEF_INDEX == final_node_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == final_node_index"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = sbt_root.set_root_node_index(old_node_index, final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.set_root_node_index() returns 0x%x", err); } else if (UNDEF_POS != _bt_instance_pos) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_POS != _bt_instance_pos"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_BUF_POS); } else if (bt_instance_pos >= MAX_BT_INSTANCE_NUM) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "bt_instance_pos >= MAX_BT_INSTANCE_NUM"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_BUF_POS); } else { _bt_instance_pos = bt_instance_pos; sbt_root.set_mutation_counter(_bt_get_mutation_counter()); if ((err = _bt_set_sbt_root(new_wr_bt_root, sbt_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_bt_set_sbt_root() returns 0x%x", err); } } _init_state.set_init_result(err); } else { err = _init_state.get_init_result(); } if (DF_UL_LOG_NONE != log_level) { //DF_WRITE_LOG_US(log_level, //"final_node_index=0x%lx, old_node_index=0x%lx, ref_counter=%ld", //final_node_index, old_node_index, ref_counter); DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, old_node_index=0x%lx, ref_counter=%ld", final_node_index, old_node_index, UNDEF_REF_COUNTER); } return err; }; //增加/减少根节点引用计数 int dfs_btree_t::vir_inc_root_ref_counter( const dfs_bt_root_t & bt_root) const { DFS_BT_DEBUG_TRAP; return this->_bt_inc_root_ref_counter(bt_root); }; int dfs_btree_t::vir_dec_root_ref_counter( const dfs_bt_root_t & bt_root) const { DFS_BT_DEBUG_TRAP; return this->_bt_dec_root_ref_counter(bt_root); }; int dfs_btree_t::_get_leaf_node_ref_counter( const uint64_t final_node_index, uint64_t & ref_counter) const { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; ref_counter = UNDEF_REF_COUNTER; if ((err = _valid_leaf_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_leaf_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_INDEX); } else if ((err = leaf_ary_t::get_t_ref_counter(inter_node_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::get_t_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx, ref_counter=%ld", final_node_index, inter_node_index, ref_counter); } return err; }; int dfs_btree_t::_get_mid_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) const { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; ref_counter = UNDEF_REF_COUNTER; if ((err = _valid_mid_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_mid_node_index_verify() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_INDEX); } else if ((err = mid_ary_t::get_t_ref_counter(inter_node_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::get_t_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx, ref_counter=%ld", final_node_index, inter_node_index, ref_counter); } return err; }; //relase node由dfs_2d_ary自动进行(根据ref_counter) int dfs_btree_t::_acquire_leaf_node(uint64_t & final_node_index, leaf_node_t ** ppleaf_node) { uint64_t inter_node_index = UNDEF_INDEX; leaf_node_t * pleaf_node = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = leaf_ary_t::acquire_t(NULL, inter_node_index, &pleaf_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::acquire_t() returns 0x%x", err); } else if (UNDEF_INDEX == inter_node_index || NULL == pleaf_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == inter_node_index || NULL == pleaf_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else { final_node_index = _add_leaf_flag_bit(inter_node_index); pleaf_node->set_mutation_counter(_bt_get_mutation_counter()); //_bt_get_mutation_counter()+1; yangzhenkun@baidu.com @ 20090830 } if (0 == err) { if (NULL != ppleaf_node) { *ppleaf_node = pleaf_node; } } else { final_node_index = UNDEF_INDEX; if (NULL != ppleaf_node) { *ppleaf_node = NULL; } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "pleaf_node=0x%p, final_node_index=0x%lx, inter_node_index=0x%lx", pleaf_node, final_node_index, inter_node_index); } return err; }; //relase node由dfs_2d_ary自动进行(根据ref_counter) int dfs_btree_t::_acquire_reserved_leaf_node(uint64_t & final_node_index, leaf_node_t ** ppleaf_node) { leaf_node_t * pleaf_node = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; final_node_index = UNDEF_INDEX; if (NULL != ppleaf_node) { *ppleaf_node = NULL; } if (df_atomic_compare_exchange(&_is_reserved_leaf_node_acquired, 1, 0) == 0) { final_node_index = _add_leaf_flag_bit(NULL_INDEX); if ((err = _get_leaf_node_for_mutate(final_node_index, &pleaf_node)) != 0 || NULL == pleaf_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == inter_node_index || NULL == pleaf_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else { pleaf_node->set_mutation_counter(_bt_get_mutation_counter()); } if (0 == err) { if (NULL != ppleaf_node) { *ppleaf_node = pleaf_node; } } else { final_node_index = UNDEF_INDEX; } } return final_node_index; }; //return: 0 for success, other values for failure //????.. int dfs_btree_t::_release_reserved_leaf_node(const uint64_t final_node_index) { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL_INDEX != inter_node_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "NULL_INDEX != inter_node_index"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_RESERVED_LEAF_NODE); } else if (df_atomic_compare_exchange(&_is_reserved_leaf_node_acquired, 0, 1) != 1) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "release not acquired reserved_leaf_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_RESERVED_LEAF_NODE); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx", final_node_index, inter_node_index); } return err; }; //relase node由dfs_2d_ary自动进行(根据ref_counter) int dfs_btree_t::_acquire_mid_node(uint64_t & final_node_index, mid_node_t ** ppmid_node) { uint64_t inter_node_index = UNDEF_INDEX; mid_node_t * pmid_node = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; final_node_index = UNDEF_INDEX; if ((err = mid_ary_t::acquire_t(NULL, inter_node_index, &pmid_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::acquire_t() returns 0x%x", err); } else if (UNDEF_INDEX == inter_node_index || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == inter_node_index || NULL == pmid_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_ACQUIRE); } else { final_node_index = _add_mid_flag_bit(inter_node_index); pmid_node->set_mutation_counter(_bt_get_mutation_counter()); //_bt_get_mutation_counter()+1; yangzhenkun@baidu.com @ 20090830 } if (0 == err) { if (NULL != ppmid_node) { *ppmid_node = pmid_node; } } else { final_node_index = UNDEF_INDEX; if (NULL != ppmid_node) { *ppmid_node = NULL; } } return err; }; int dfs_btree_t::_acquire_reserved_mid_node(uint64_t & final_node_index, mid_node_t ** ppmid_node) { mid_node_t * pmid_node = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; final_node_index = UNDEF_INDEX; if (NULL != ppmid_node) { *ppmid_node = NULL; } if (df_atomic_compare_exchange(&_is_reserved_mid_node_acquired, 1, 0) == 0) { final_node_index = _add_mid_flag_bit(NULL_INDEX); if ((err = _get_mid_node_for_mutate(final_node_index, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == inter_node_index || NULL == pmid_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else { pmid_node->set_mutation_counter(_bt_get_mutation_counter()); } if (0 == err) { if (NULL != ppmid_node) { *ppmid_node = pmid_node; } } else { final_node_index = UNDEF_INDEX; } } return final_node_index; }; //return: 0 for success, other values for failure int dfs_btree_t::_release_reserved_mid_node(const uint64_t final_node_index) { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; if (NULL_INDEX != inter_node_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "reserved_mid_node is not NULL_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_RESERVED_MID_NODE); } else if (df_atomic_compare_exchange(&_is_reserved_mid_node_acquired, 0, 1) != 1) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "release not acquired reserved_mid_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_RESERVED_MID_NODE); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx", final_node_index, inter_node_index); } return err; }; //return: 0 for success, other value for error int dfs_btree_t::_inc_leaf_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; ref_counter = UNDEF_REF_COUNTER; if ((err = _valid_leaf_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_leaf_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_INDEX); } else if ((err = leaf_ary_t::inc_t_ref_counter(inter_node_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::inc_t_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx, ref_counter=%ld", final_node_index, inter_node_index, ref_counter); } return err; }; int dfs_btree_t::_inc_leaf_node_ref_counter_if_not_zero( const uint64_t final_node_index, uint64_t & ref_counter) { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; ref_counter = 0; if ((err = _valid_leaf_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_leaf_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_INDEX); } else if ((err = leaf_ary_t::inc_t_ref_counter_if_not_zero(inter_node_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::inc_t_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx, ref_counter=%ld", final_node_index, inter_node_index, ref_counter); } return err; }; int dfs_btree_t::_inc_mid_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; ref_counter = UNDEF_REF_COUNTER; if ((err = _valid_mid_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_mid_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_INDEX); } else if ((err = mid_ary_t::inc_t_ref_counter(inter_node_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::inc_t_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx, ref_counter=%ld", final_node_index, inter_node_index, ref_counter); } return err; }; int dfs_btree_t::_inc_mid_node_ref_counter_if_not_zero( const uint64_t final_node_index, uint64_t & ref_counter) { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; ref_counter = 0; if ((err = _valid_mid_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_mid_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_INDEX); } else if ((err = mid_ary_t::inc_t_ref_counter_if_not_zero(inter_node_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::inc_t_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx, ref_counter=%ld", final_node_index, inter_node_index, ref_counter); } return err; }; int dfs_btree_t::_dec_leaf_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; ref_counter = UNDEF_REF_COUNTER; if ((err = _valid_leaf_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_leaf_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_INDEX); } else if ((err = leaf_ary_t::dec_t_ref_counter(inter_node_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::dec_t_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx, ref_counter=%ld", final_node_index, inter_node_index, ref_counter); } return err; }; int dfs_btree_t::_dec_mid_node_ref_counter(const uint64_t final_node_index, uint64_t & ref_counter) { const uint64_t inter_node_index = _remove_node_flag_bit(final_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; ref_counter = UNDEF_REF_COUNTER; if ((err = _valid_mid_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_mid_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_INDEX); } else if ((err = mid_ary_t::dec_t_ref_counter(inter_node_index, ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::dec_t_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "final_node_index=0x%lx, inter_node_index=0x%lx, ref_counter=%ld", final_node_index, inter_node_index, ref_counter); } return err; }; //功能：计算新增一个节点引起的(key_index和B树节点)引用计数 //Return: 0 for success, other value for error //假设新增final node index所引起的引用计数增加. int dfs_btree_t::_inc_pointed_ref_counter(const uint64_t final_node_index) { const node_base_t * pnode = NULL; uint64_t ref_counter = UNDEF_REF_COUNTER; uint32_t subkey_num = 0; uint32_t j = 0; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _get_node(final_node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node(final_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = vir_inc_obj_ary_ref_counter( pnode->get_subkey_ary(), pnode->get_subkey_num())) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_inc_obj_ary_ref_counter() returns 0x%x", err); } else if (_is_mid_node(final_node_index)) { const mid_node_t * pmid_node = NULL; if ((err = _get_mid_node(final_node_index, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(final_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else { //增加每个节点的ref cnt.. subkey_num = pmid_node->get_subkey_num(); for (j = 0; j <= subkey_num; ++j) { if ((err = _inc_node_ref_counter(pmid_node->get_subnode_index(j), ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_node_ref_counter returns 0x%x,", err); break; } } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, subkey_num=%d", final_node_index, subkey_num); } return err; }; //功能：计算删除一个节点引起的(key_index和B树节点)引用计数 //Return: 0 for success, other value for error int dfs_btree_t::_dec_pointed_ref_counter(const uint64_t final_node_index) { const node_base_t * pnode = NULL; uint64_t ref_counter = UNDEF_REF_COUNTER; uint32_t subkey_num = 0; uint32_t j = 0; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _get_node(final_node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node(final_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = vir_dec_obj_ary_ref_counter( pnode->get_subkey_ary(), pnode->get_subkey_num())) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_dec_obj_ary_ref_counter() returns 0x%x", err); } else if (_is_mid_node(final_node_index)) { const mid_node_t * pmid_node = NULL; if ((err = _get_mid_node(final_node_index, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(final_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else { subkey_num = pmid_node->get_subkey_num(); for (j = 0; j <= subkey_num; ++j) { if ((err = _dec_node_ref_counter(pmid_node->get_subnode_index(j), ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_dec_node_ref_counter returns 0x%x", err); DF_WRITE_LOG_US(log_level, "j=%d, pmid_node->get_subnode_index(j)=0x%lx", j, pmid_node->get_subnode_index(j)); break; } } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, subkey_num=%d", final_node_index, subkey_num); } return err; }; int dfs_btree_t::action_before_leaf_node_gc(const uint64_t internal_node_index) { const uint64_t final_node_index = _add_leaf_flag_bit(internal_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _valid_leaf_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_leaf_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_INDEX); } //去减少这个节点下面的引用计数.... else if ((err = _dec_pointed_ref_counter(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_dec_pointed_ref_counter() returns 0x%x", err); } return err; }; int dfs_btree_t::action_before_mid_node_gc(const uint64_t internal_node_index) { const uint64_t final_node_index = _add_mid_flag_bit(internal_node_index); int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _valid_mid_node_index_verify(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_valid_leaf_node_index_check() returns 0x%x", err); //err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_INDEX); } else if ((err = _dec_pointed_ref_counter(final_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_dec_pointed_ref_counter() returns 0x%x", err); } return err; }; //drill last object...,得到一个index.. int dfs_btree_t::_get_drill_last_obj( const dfs_btree_drill_t & drill_info, uint64_t & last_obj_index) const { const node_base_t * pnode = NULL; const uint64_t last_node_index = drill_info.get_last_node_index(); const uint32_t last_ins_pos = drill_info.get_last_ins_pos(); uint32_t subkey_num = 0; int log_level = DF_UL_LOG_NONE; int err = 0; last_obj_index = UNDEF_INDEX; if (UNDEF_INDEX == last_node_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_last_node_index() returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if (UNDEF_POS == last_ins_pos) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_last_ins_pos() returns UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((err = _get_node(last_node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (last_ins_pos >= (subkey_num = pnode->get_subkey_num())) { last_obj_index = UNDEF_INDEX; } else if ((last_obj_index = pnode->get_subkey_index(last_ins_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnode->get_subkey_index() returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_KEY_INDEX); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, last_ins_pos=%d, subkey_num=%d, last_node_index=0x%lx", drill_info.get_drill_ptr(), last_ins_pos, subkey_num, last_node_index); } return err; }; //健康检查... //主要是检查节点是否一致... // return: 0 for success, other values for error // Should be called in locked state and without checkpointing or other COW(load or store) int dfs_btree_t::_bt_sanitary_check(const dfs_bt_root_t & bt_root) const { uint64_t obj_num_in_btree = 0; uint64_t in_use_obj_num_in_2d_ary = 0; uint64_t leaf_node_num_in_btree = 0; uint64_t in_use_leaf_node_num_in_2d_ary = 0; uint64_t mid_node_num_in_btree = 0; uint64_t in_use_mid_node_num_in_2d_ary = 0; int log_level = DF_UL_LOG_NONE; int err = 0; //从btree结构中得到... //obj num in btree==total key number... if ((err = bt_get_total_num( bt_root, obj_num_in_btree, leaf_node_num_in_btree, mid_node_num_in_btree)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "bt_get_total_num() returns: 0x%x", err); } else if ((err = bt_get_in_use_node_num_in_2d_ary( in_use_leaf_node_num_in_2d_ary, in_use_mid_node_num_in_2d_ary)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "bt_get_in_use_node_num_in_2d_ary() returns: 0x%x", err); } else if ((err = vir_get_total_in_use_obj_num_in_ary(in_use_obj_num_in_2d_ary)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_get_total_in_use_obj_num_in_ary() returns: 0x%x", err); } else if ((obj_num_in_btree+1) != in_use_obj_num_in_2d_ary) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(obj_num_in_btree+1) != in_use_obj_num_in_2d_ary"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_T_LEAK); } else if ((leaf_node_num_in_btree+1) != in_use_leaf_node_num_in_2d_ary) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(leaf_node_num_in_btree+1) != in_use_leaf_node_num_in_2d_ary"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_T_LEAK); } else if ((mid_node_num_in_btree+1) != in_use_mid_node_num_in_2d_ary) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(mid_node_num_in_btree+1) != in_use_mid_node_num_in_2d_ary"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_T_LEAK); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "obj_num_in_btree=%ld, leaf_node_num_in_btree=%ld, mid_node_num_in_btree=%ld", obj_num_in_btree, leaf_node_num_in_btree, mid_node_num_in_btree); DF_WRITE_LOG_US(log_level, "in_use_leaf_node_num_in_2d_ary=%ld,in_use_mid_node_num_in_2d_ary=%ld", in_use_leaf_node_num_in_2d_ary, in_use_mid_node_num_in_2d_ary); DF_WRITE_LOG_US(log_level, "in_use_obj_num_in_2d_ary=%ld", in_use_obj_num_in_2d_ary); } return err; }; //功能：生成一个内容为空的根节点(以便用来通过_update_root()清空树) // return: 0 for success, other values for error int dfs_btree_t::_acquire_empty_root( dfs_bt_root_t & new_wr_bt_root) { dfs_sbt_root_t sbt_root = _bt_get_sbt_root(new_wr_bt_root); uint64_t new_root_index = UNDEF_INDEX; uint64_t tmp_root_index = UNDEF_INDEX; int log_level = DF_UL_LOG_NONE; int err = 0; //_bt_inc_mutation_counter(); if ((err = _acquire_leaf_node(new_root_index, NULL)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node() returns: 0x%x", err); } else if (UNDEF_INDEX == new_root_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "new_root_index is UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } //获得了叶子节点作为根节点后,那么需要修改root index.. else if ((err = sbt_root.set_root_node_index(tmp_root_index, new_root_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.set_root_node_index() returns 0x%x", err); } else { sbt_root.set_mutation_counter(_bt_get_mutation_counter()); if ((err = _bt_set_sbt_root(new_wr_bt_root, sbt_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_bt_set_sbt_root() returns 0x%x", err); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_root_index=0x%lx, tmp_root_index=0x%lx", new_root_index, tmp_root_index); } return err; }; //功能：在B树中插入一个项且返回新的根节点，但不替换当前树的根节点 //输入：bt_root //返回：0 for success, other value for failure //返回根节点,但是并不替换当前... int dfs_btree_t::_insert_to_btree( const dfs_bt_root_t & cur_wr_bt_root, dfs_bt_root_t & new_wr_bt_root, const uint64_t ins_obj_index, const dfs_btree_drill_t & drill_info) { int log_level = DF_UL_LOG_NONE; int err = 0; dfs_btree_node_mutate_t mutate_result; //_bt_inc_mutation_counter(); //使用drill info来插入一个叶子节点... //并且更新mutate result.. //需要来插入和删除叶子节点... //在叶子上直接操作 //然后 if ((err = _ins_del_leaf_node(ins_obj_index, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_ins_del_leaf_node() returns: 0x%x", err); } else if ((err = _op_tree( cur_wr_bt_root, new_wr_bt_root, drill_info, drill_info.get_drill_ptr()-1, mutate_result)) != 0) //然后操作cur和new节点的树... { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_tree() returns: 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "ins_obj_index=0x%lx, drill_info.get_drill_ptr()=%d", ins_obj_index, drill_info.get_drill_ptr()); DF_WRITE_LOG_US(log_level, "get_update_type()=%d", mutate_result.get_update_type()); } return err; }; //功能：在B树中更新一个项，drill_ptr >= 0并可能指向叶节点或中间节点。 //输入：bt_root //说明：调用者需要保证更新前后的项有相同的key。 //返回：0 for success, other value for failure int dfs_btree_t::_update_of_btree( const dfs_bt_root_t & cur_wr_bt_root, dfs_bt_root_t & new_wr_bt_root, const uint64_t new_obj_index, const dfs_btree_drill_t & drill_info) { dfs_btree_node_mutate_t mutate_result; const uint64_t myself_node_index = drill_info.get_last_node_index(); const uint32_t myself_ins_pos = drill_info.get_last_ins_pos(); int log_level = DF_UL_LOG_NONE; int err = 0; //_bt_inc_mutation_counter(); if (UNDEF_POS == myself_ins_pos) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_POS == myself_ins_pos"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if (UNDEF_INDEX == myself_node_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == myself_node_index"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else { if (_is_mid_node(myself_node_index)) { //中间节点 if ((err = _update_mid_node_subkey( myself_node_index, myself_ins_pos, new_obj_index, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_update_mid_node_subkey() returns: 0x%x", err); } } else { //叶节点 if ((err = _update_leaf_node_subkey( myself_node_index, myself_ins_pos, new_obj_index, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_update_leaf_node_subkey() returns: 0x%x", err); } } if (0 == err) { if ((err = _op_tree( cur_wr_bt_root, new_wr_bt_root, drill_info, drill_info.get_drill_ptr()-1, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_tree() returns: 0x%x", err); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_obj_index=0x%lx, drill_info.get_drill_ptr()=%d", new_obj_index, drill_info.get_drill_ptr()); DF_WRITE_LOG_US(log_level, "get_update_type()=%d", mutate_result.get_update_type()); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, myself_ins_pos=%d", myself_node_index, myself_ins_pos); } return err; }; //功能：在B树中删除一个项，drill_ptr >= 0并可能指向叶节点或中间节点。 //输入：bt_root //返回：0 for success, other value for failure int dfs_btree_t::_del_from_btree( const dfs_bt_root_t & cur_wr_bt_root, dfs_bt_root_t & new_wr_bt_root, const dfs_btree_drill_t & drill_info) { uint64_t del_node_index = UNDEF_INDEX; uint64_t new_mid_node_ref_counter = UNDEF_REF_COUNTER; uint64_t ref_counter = UNDEF_REF_COUNTER; dfs_btree_node_mutate_t mutate_result; dfs_btree_drill_t ext_drill_info(drill_info); uint64_t subtree_largest_obj_index = UNDEF_INDEX; mid_node_t * pnew_mid_node = NULL; uint64_t new_mid_node_index = UNDEF_INDEX; const mid_node_t * pmid_node = NULL; const uint64_t myself_node_index = drill_info.get_last_node_index(); const uint32_t myself_ins_pos = drill_info.get_last_ins_pos(); bool is_reserved_mid_node_acquired = false; int log_level = DF_UL_LOG_NONE; int err = 0; int err1 = 0; //_bt_inc_mutation_counter(); if (UNDEF_POS == myself_ins_pos) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_POS == myself_ins_pos"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if (UNDEF_INDEX == myself_node_index) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == myself_node_index"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else { if (_is_mid_node(myself_node_index)) { //中间节点 //用该子节点下挂的子树的最大obj来替换被删除的obj //太牛了...直接替换.... //然后规约到删除叶子节点...:) if ((err = _get_mid_node(myself_node_index, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns: 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else if ((del_node_index = pmid_node->get_subnode_index(myself_ins_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "del_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); } else if ((err = _get_subtree_largest( del_node_index, ext_drill_info, subtree_largest_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns: 0x%x", err); } //Using a reserved node to temporarily keep this node else if ((err = _acquire_reserved_mid_node(new_mid_node_index, &pnew_mid_node)) == 0) { //Using a reserved node to temporarily keep this node //????... is_reserved_mid_node_acquired = true; if ((err = pmid_node->update_subkey( *pnew_mid_node, myself_ins_pos, subtree_largest_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->update_subkey() returns: 0x%x", err); } //重新设置删除的位置.... else if ((err = ext_drill_info.set_del_mid_drill_info( drill_info.get_drill_ptr(), new_mid_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ext_drill_info.set_del_mid_drill_info() returns: 0x%x", err); } } //???... //貌似会把节点给冲吊.... else if ((err = _acquire_mid_node(new_mid_node_index, &pnew_mid_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node() returns 0x%x", err); } //Using an acquired node to temporarily keep this node else { //Using an acquired node to temporarily keep this node is_reserved_mid_node_acquired = false; if ((err = pmid_node->update_subkey( *pnew_mid_node, myself_ins_pos, subtree_largest_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->update_subkey() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_mid_node_index)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter() returns 0x%x", err); } else if ((err = _inc_mid_node_ref_counter(new_mid_node_index, new_mid_node_ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_mid_node_ref_counter() returns 0x%x", err); } else if ((err = ext_drill_info.set_del_mid_drill_info( drill_info.get_drill_ptr(), new_mid_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ext_drill_info.set_del_mid_drill_info() returns 0x%x", err); } } } } if (0 == err) { if ((err = _ins_del_leaf_node(UNDEF_INDEX, ext_drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_ins_del_leaf_node() returns 0x%x", err); } else if ((err = _op_tree( cur_wr_bt_root, new_wr_bt_root, ext_drill_info, ext_drill_info.get_drill_ptr()-1, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_tree() returns 0x%x", err); } } if (NULL != pnew_mid_node) { if (is_reserved_mid_node_acquired) { //释放...中间节点... //reversed mid node... if ((err1 = _release_reserved_mid_node(new_mid_node_index)) != 0) { err = err1; log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_release_reserved_mid_node() returns 0x%x", err); } } else { //释放该节点 if ((err1 = _dec_mid_node_ref_counter(new_mid_node_index, ref_counter)) != 0) { err = err1; log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_dec_mid_node_ref_counter() returns 0x%x", err); } else if (0 != ref_counter) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "0 != ref_counter"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_REF_COUNTER); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "is_reserved_mid_node_acquired=%d", is_reserved_mid_node_acquired); DF_WRITE_LOG_US(log_level, "drill_info.get_drill_ptr()=%d, myself_ins_pos=%d, myself_node_index=0x%lx", drill_info.get_drill_ptr(), myself_ins_pos, myself_node_index); DF_WRITE_LOG_US(log_level, "del_node_index=0x%lx, new_mid_node_ref_counter=%ld, ref_counter=%ld", del_node_index, new_mid_node_ref_counter, ref_counter); DF_WRITE_LOG_US(log_level, "get_update_type()=%d", mutate_result.get_update_type()); DF_WRITE_LOG_US(log_level, "new_mid_node_index=0x%lx, subtree_largest_obj_index=0x%lx", new_mid_node_index, subtree_largest_obj_index); } return err; }; // 功能：获得B树最小元素并填充drill_info // 输出：若存在(B树非空)，则pct指向它且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使树空)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int dfs_btree_t::_get_smallest( const dfs_bt_root_t & bt_root, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); uint64_t ref_counter = UNDEF_REF_COUNTER; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; drill_info.init(); if (UNDEF_INDEX == sbt_root.get_root_node_index()) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == sbt_root.get_root_node_index()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if ((err = _get_node_ref_counter(sbt_root.get_root_node_index(), ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node_ref_counter() returns 0x%x", err); } else if (ref_counter <= 0 || UNDEF_REF_COUNTER == ref_counter) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ref_counter <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_REF_COUNTER); } //得到子树的最小值... else if ((err = _get_subtree_smallest( sbt_root.get_root_node_index(), drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_subtree_smallest() returns 0x%x", err); } else { drill_info.set_btree_mutation_counter(sbt_root.get_mutation_counter()); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "obj_index=0x%lx, drill_info.get_drill_ptr()=%d", obj_index, drill_info.get_drill_ptr()); } return err; }; // // 功能：获得B树最大元素并填充drill_info // 输出：若存在(B树非空)，则pct指向它且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使树空)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int dfs_btree_t::_get_largest( const dfs_bt_root_t & bt_root, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); uint64_t ref_counter = UNDEF_REF_COUNTER; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; drill_info.init(); if (UNDEF_INDEX == sbt_root.get_root_node_index()) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == sbt_root.get_root_node_index()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if ((err = _get_node_ref_counter(sbt_root.get_root_node_index(), ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node_ref_counter() returns 0x%x", err); } else if (ref_counter <= 0 || UNDEF_REF_COUNTER == ref_counter) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ref_counter <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_REF_COUNTER); } else if ((err = _get_subtree_largest( sbt_root.get_root_node_index(), drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_subtree_largest() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "obj_index=0x%lx, drill_info.get_drill_ptr()=%d", obj_index, drill_info.get_drill_ptr()); } return err; }; // 功能：获得一棵子树的最小元素，并追加drill_info中(与search一样) // 输出：若存在(子树非空)，则pct指向它且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使子树空且为根节点)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int dfs_btree_t::_get_subtree_smallest( const uint64_t subtree_root, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { uint64_t cur_subtree_root = subtree_root; uint64_t nex_subtree_root = subtree_root; const node_base_t * pnode = NULL; const mid_node_t * pmid_node = NULL; uint32_t subkey_num = 0; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; while (0 == err) { if ((err = _get_node(cur_subtree_root, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); break; } else if ((subkey_num = pnode->get_subkey_num()) <= 0) { //节点没有元素(只有根节点是唯一叶节点时才有这种情况) if (drill_info.get_drill_ptr() >= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "empty btree, but _drill_ptr >= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((err = drill_info.push(0, cur_subtree_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.push() returns 0x%x", err); } break; } else if (pnode->is_mid_node()) { if ((err = drill_info.push(0, cur_subtree_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.push() returns 0x%x", err); } else if ((err = _get_mid_node(cur_subtree_root, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); break; } else if ((nex_subtree_root = pmid_node->get_subnode_index(0)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->get_subnode_index(0) returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); break; } else { cur_subtree_root = nex_subtree_root; } } //leaf node, no further search needed else { if ((err = drill_info.push(0, cur_subtree_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.push() returns 0x%x", err); } else if ((obj_index = pnode->get_subkey_index(0)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnode->get_subkey_index(0) returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); } break; } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "subtree_root=0x%lx, cur_subtree_root=0x%lx, subkey_num=%d", subtree_root, cur_subtree_root, subkey_num); DF_WRITE_LOG_US(log_level, "drill_info.get_drill_ptr()=0x%x", drill_info.get_drill_ptr()); } return err; }; // 功能：获得一棵子树的最大元素，并追加drill_info中(与search一样) // 输出：若存在(子树非空)，则pct指向它且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使子树空且为根节点)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int dfs_btree_t::_get_subtree_largest( const uint64_t subtree_root, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { uint64_t cur_subtree_root = subtree_root; uint64_t nex_subtree_root = subtree_root; const node_base_t * pnode = NULL; const mid_node_t * pmid_node = NULL; uint32_t subkey_num = 0; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; while (0 == err) { if ((err = _get_node(cur_subtree_root, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); break; } else if ((subkey_num = pnode->get_subkey_num()) <= 0) { //节点没有元素(只有根节点是唯一叶节点时才有这种情况) if (drill_info.get_drill_ptr() >= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "empty btree, but _drill_ptr >= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((err = drill_info.push(0, cur_subtree_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.push() returns 0x%x", err); } break; } else if (pnode->is_mid_node()) { if ((err = drill_info.push(subkey_num, cur_subtree_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.push() returns 0x%x", err); break; } else if ((err = _get_mid_node(cur_subtree_root, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); break; } else if ((nex_subtree_root = pmid_node->get_subnode_index(subkey_num)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->get_subnode_index(subkey_num) returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); break; } else { cur_subtree_root = nex_subtree_root; } } //leaf node, no further search needed else { if ((err = drill_info.push(subkey_num-1, cur_subtree_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.push() returns 0x%x", err); break; } else if ((obj_index = pnode->get_subkey_index(subkey_num-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnode->get_subkey_index(subkey_num-1) returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_KEY_INDEX); } break; } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "subtree_root=0x%lx, cur_subtree_root=0x%lx, subkey_num=%d", subtree_root, cur_subtree_root, subkey_num); DF_WRITE_LOG_US(log_level, "drill_info.get_drill_ptr()=0x%x", drill_info.get_drill_ptr()); } return err; }; // 功能：根据drill_info获得比当前项小的项，并更新drill_info指向之 // 若存在则pct指向之且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使没有更小元素)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int dfs_btree_t::_get_smaller( dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const node_base_t * pnode = NULL; const mid_node_t * pmid_node = NULL; uint64_t last_node_index = UNDEF_INDEX; uint64_t next_node_index = UNDEF_INDEX; uint32_t subkey_num = 0; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if (drill_info.get_drill_ptr() >= 0) { if ((last_node_index = drill_info.get_last_node_index()) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_last_node_index() returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if (_is_leaf_node(last_node_index)) { //叶节点 if (drill_info.get_last_ins_pos() > 0) { if ((err = drill_info.dec_last_ins_pos()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.dec_last_ins_pos() returns 0x%x", err); } } else { while (0 == err) { //到最左边则向根回退上一层 if ((err = drill_info.pop()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.pop() returns 0x%x", err); break; } else if (drill_info.get_drill_ptr() < 0) { break; } else if (drill_info.get_last_ins_pos() > 0) { if ((err = drill_info.dec_last_ins_pos()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.dec_last_ins_pos() returns 0x%x", err); } break; } } } if (drill_info.get_drill_ptr() >= 0) { if ((next_node_index = drill_info.get_last_node_index()) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_last_node_index() returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_node(next_node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { subkey_num = pnode->get_subkey_num(); if ((obj_index = pnode->get_subkey_index(drill_info.get_last_ins_pos())) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnode->get_subkey_index(drill_info.get_last_ins_pos()) UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_KEY_INDEX); } } } } else { //中间节点 if ((err = _get_mid_node(last_node_index, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else { subkey_num = pmid_node->get_subkey_num(); if ((next_node_index = pmid_node->get_subnode_index(drill_info.get_last_ins_pos())) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->get_subnode_index(drill_info.get_last_ins_pos()) returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_subtree_largest( next_node_index, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_subtree_largest() returns 0x%x", err); } } } } else { //没有更小的项 obj_index = UNDEF_INDEX; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_info.get_last_node_index()=0x%lx, drill_ptr=%d, last_ins_pos=%d", drill_info.get_last_node_index(), drill_info.get_drill_ptr(), drill_info.get_last_ins_pos()); DF_WRITE_LOG_US(log_level, "last_node_index=0x%lx, next_node_index=0x%lx, subkey_num=%d", last_node_index, next_node_index, subkey_num); } return err; }; // 功能：根据drill_info获得比当前项大的项，并更新drill_info指向之 // 若存在则pct指向之且key_index为其值，否则pct为NULL且key_index为UNDEF_INDEX // 返回: 成功(即使没有更大元素)返回0, 其他值错误(ERRNO_BT_DRILL_OBSOLETE则树有新的修改) int dfs_btree_t::_get_larger( dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const node_base_t * pnode = NULL; const mid_node_t * pmid_node = NULL; uint64_t last_node_index = UNDEF_INDEX; uint64_t next_node_index = UNDEF_INDEX; uint32_t subkey_num = 0; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if (drill_info.get_drill_ptr() >= 0) { if ((last_node_index = drill_info.get_last_node_index()) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_last_node_index() returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_node(last_node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (_is_leaf_node(last_node_index)) { //叶节点 if ((drill_info.get_last_ins_pos()+1) < pnode->get_subkey_num()) { if ((err = drill_info.inc_last_ins_pos()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.inc_last_ins_pos() returns 0x%x", err); } } else if ((err = drill_info.pop()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.pop() returns 0x%x", err); } else { while (0 == err) { if (drill_info.get_drill_ptr() < 0) { break; } if ((last_node_index = drill_info.get_last_node_index()) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_last_node_index() returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); break; } else if ((err = _get_node(last_node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); break; } else if (drill_info.get_last_ins_pos() < (subkey_num = pnode->get_subkey_num())) { break; } //到最左边则向根回退上一层 else if ((err = drill_info.pop()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.pop() returns 0x%x", err); } } } if (drill_info.get_drill_ptr() >= 0) { if ((next_node_index = drill_info.get_last_node_index()) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_last_node_index() returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_node(next_node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((obj_index = pnode->get_subkey_index(drill_info.get_last_ins_pos())) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnode->get_subkey_index(drill_info.get_last_ins_pos()) returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } } } else { //中间节点 if ((err = _get_mid_node(last_node_index, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else if (drill_info.get_last_ins_pos() >= pmid_node->get_subkey_num()) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_last_ins_pos() >= pmid_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((err = drill_info.inc_last_ins_pos()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.inc_last_ins_pos() returns 0x%x", err); } else if ((next_node_index = pmid_node->get_subnode_index(drill_info.get_last_ins_pos())) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->get_subnode_index(drill_info.get_last_ins_pos()) returns UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_subtree_smallest( next_node_index, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_subtree_smallest() returns 0x%x",err); } } } else { //没有更大的项 obj_index = UNDEF_INDEX; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_info.get_last_node_index()=0x%lx, drill_ptr=%d, last_ins_pos=%d", drill_info.get_last_node_index(), drill_info.get_drill_ptr(), drill_info.get_last_ins_pos()); DF_WRITE_LOG_US(log_level, "last_node_index=0x%lx, next_node_index=0x%lx, subkey_num=%d", last_node_index, next_node_index, subkey_num); } return err; }; // 功能：获得刚好比输入项srct小的元素 // 输入：srct不需要在B树中存在 // 输出：如果较小元素存在，pct指向它，否则pct为NULL，drill_info指向搜索srct的结果。 // 返回：0 for no error, other values for error int dfs_btree_t::_get_smaller_by_key( const dfs_bt_root_t & bt_root, const void * pkey, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); bool is_search = false; int cmp = -2; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if (sbt_root.get_root_node_index() == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.get_root_node_index() == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if (drill_info.not_match_tree(sbt_root)) { //需要重新搜索... is_search = true; } else if ((err = _get_drill_last_obj(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_drill_last_obj() returns 0x%x", err); } else if (UNDEF_INDEX == obj_index) { is_search = true; } else if ((err = vir_compare_index_key(bt_root, obj_index, pkey, cmp)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_compare_index_key() returns 0x%x", err); } else if (0 != cmp) { is_search = true; } if (0 == err && is_search) { //需要重新搜索 drill_info.init(); drill_info.set_btree_mutation_counter(sbt_root.get_mutation_counter()); //首先搜索到,然后再取稍微小一点的值...:)..... if ((err = _search_by_key(bt_root, pkey, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_by_key() returns 0x%x", err); } } if (0 == err && (err = _get_smaller(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_smaller() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "drill_info._drill_ptr=%d,obj_index=0x%lx", drill_info.get_drill_ptr(), obj_index); } return err; }; int dfs_btree_t::_get_smaller_by_obj( const dfs_bt_root_t & bt_root, const void * pobj, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); bool is_search = false; int cmp = -2; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if (sbt_root.get_root_node_index() == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.get_root_node_index() == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if (drill_info.not_match_tree(sbt_root)) { is_search = true; } else if ((err = _get_drill_last_obj(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_drill_last_obj() returns 0x%x", err); } else if (UNDEF_INDEX == obj_index) { is_search = true; } else if ((err = vir_compare_index_obj(bt_root, obj_index, pobj, cmp)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_compare_index_key() returns 0x%x", err); } else if (0 != cmp) { is_search = true; } if (0 == err && is_search) { //需要重新搜索 drill_info.init(); drill_info.set_btree_mutation_counter(sbt_root.get_mutation_counter()); if ((err = _search_by_obj(bt_root, pobj, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_by_key() returns 0x%x", err); } } if (0 == err && (err = _get_smaller(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_smaller() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "sbt_root:root_node_index/mutation_counter=0x%lx/%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "drill_info._drill_ptr=%d,obj_index=0x%lx", drill_info.get_drill_ptr(), obj_index); } return err; }; // 功能：获得刚好比输入的srct大的元素 // 输入：srct不需要在B树中存在 // 输出：如果较大元素存在，pct指向它，否则pct为NULL，drill_info指向搜索srct的结果。 // 返回：0 for no error, other values for error int dfs_btree_t::_get_larger_by_key( const dfs_bt_root_t & bt_root, const void * pkey, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); bool is_next = false; bool is_search = false; int cmp = -2; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if (sbt_root.get_root_node_index() == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.get_root_node_index() == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if (drill_info.not_match_tree(sbt_root)) { is_search = true; } else if ((err = _get_drill_last_obj(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_drill_last_obj() returns 0x%x", err); } else if (UNDEF_INDEX == obj_index) { is_search = true; } else if ((err = vir_compare_index_key(bt_root, obj_index, pkey, cmp)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_compare_index_key() returns 0x%x", err); } else if (0 != cmp) { is_search = true; } if (0 == err && is_search) { //需要重新搜索 drill_info.init(); drill_info.set_btree_mutation_counter(sbt_root.get_mutation_counter()); if ((err = _search_by_key(bt_root, pkey, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_by_key() returns 0x%x", err); } } if (0 == err) { //搜索到了，则下一项是较大项； //没有搜索到，假如所指项不是node的最后一项(无key)，则就是较大项，否则是下一项； is_next = false; //搜索到了，则下一项是较大项； if (UNDEF_INDEX != obj_index) { is_next = true; } else if ((err = _get_drill_last_obj(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_drill_last_obj() returns 0x%x", err); } //没有搜索到，但所指项无key(node的最后一项)，也是下一项是较大项 else if (UNDEF_INDEX == obj_index) { is_next = true; } if (0 == err && is_next && (err = _get_larger(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_larger() returns 0x%x", err); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "sbt_root:root_node_index/mutation_counter=0x%lx/%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "drill_info._drill_ptr=%d, obj_index=0x%lx", drill_info.get_drill_ptr(), obj_index); } return err; }; int dfs_btree_t::_get_larger_by_obj( const dfs_bt_root_t & bt_root, const void * pobj, dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); bool is_next = false; bool is_search = false; int cmp = -2; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if (sbt_root.get_root_node_index() == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.get_root_node_index() == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if (drill_info.not_match_tree(sbt_root)) { is_search = true; } else if ((err = _get_drill_last_obj(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_drill_last_obj() returns 0x%x", err); } else if (UNDEF_INDEX == obj_index) { is_search = true; } //vir=virtual... else if ((err = vir_compare_index_obj(bt_root, obj_index, pobj, cmp)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_compare_index_key() returns 0x%x", err); } else if (0 != cmp) { is_search = true; } if (0 == err && is_search) { //需要重新搜索 drill_info.init(); drill_info.set_btree_mutation_counter(sbt_root.get_mutation_counter()); if ((err = _search_by_obj(bt_root, pobj, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_by_key() returns 0x%x", err); } } if (0 == err) { //搜索到了，则下一项是较大项； //没有搜索到，假如所指项不是node的最后一项(无key)，则就是较大项，否则是下一项； is_next = false; //搜索到了，则下一项是较大项； if (UNDEF_INDEX != obj_index) { is_next = true; } else if ((err = _get_drill_last_obj(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_drill_last_obj() returns 0x%x", err); } //没有搜索到，但所指项无key(node的最后一项)，也是下一项是较大项 else if (UNDEF_INDEX == obj_index) { is_next = true; } if (0 == err && is_next && (err = _get_larger(drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_larger() returns 0x%x", err); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "sbt_root:root_node_index/mutation_counter=0x%lx/%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "drill_info._drill_ptr=%d, obj_index=0x%lx", drill_info.get_drill_ptr(), obj_index); } return err; }; //功能：更新一个叶节点的一个subkey，结果写入mutate_result //返回：0 for success, other value for failure int dfs_btree_t::_update_leaf_node_subkey( const uint64_t node_index, const uint32_t ins_pos, const uint64_t new_obj_index, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; leaf_node_t * pleaf_node = NULL; if ((err = _get_leaf_node_for_mutate(node_index, &pleaf_node)) != 0 || NULL == pleaf_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node_for_mutate() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else if (pleaf_node->get_mutation_counter() > _bt_get_max_cow_mutation_counter()) { //直接修改 uint64_t old_obj_index = UNDEF_INDEX; if ((err = pleaf_node->update_subkey(ins_pos, new_obj_index, old_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleaf_node->update_subkey() returns 0x%x", err); } else if ((err = vir_inc_obj_ref_counter(new_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_inc_obj_ref_counter() returns 0x%x", err); } else if ((err = vir_dec_obj_ref_counter(old_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_dec_obj_ref_counter() returns 0x%x", err); } mutate_result.set_mutate_nothing(); if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "old_obj_index=0x%lx", old_obj_index); } } else { //copy-on-write leaf_node_t * pnew_leaf_node = NULL; uint64_t new_leaf_node_index = UNDEF_INDEX; if ((err = _acquire_leaf_node(new_leaf_node_index, &pnew_leaf_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_leaf_node_index || NULL == pnew_leaf_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_leaf_node_index || NULL == pnew_leaf_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pleaf_node->update_subkey( *pnew_leaf_node, ins_pos, new_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleaf_node->update_subkey() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_leaf_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter() returns 0x%x", err); } else { mutate_result.set_update_node_info(new_leaf_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_leaf_node_index=0x%lx, pnew_leaf_node=0x%p", new_leaf_node_index, pnew_leaf_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, ins_pos=%d, new_obj_index=0x%lx, pleaf_node=0x%p", node_index, ins_pos, new_obj_index, pleaf_node); } return err; }; //功能：更新一个中间节点的一个subkey，结果写入mutate_result //返回：0 for success, other value for failure int dfs_btree_t::_update_mid_node_subkey( const uint64_t node_index, const uint32_t ins_pos, const uint64_t new_obj_index, dfs_btree_node_mutate_t & mutate_result) { int err = 0; int log_level = DF_UL_LOG_NONE; mid_node_t * pmid_node = NULL; if ((err = _get_mid_node_for_mutate(node_index, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node_for_mutate() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else if (pmid_node->get_mutation_counter() > _bt_get_max_cow_mutation_counter()) { //直接修改 uint64_t old_obj_index = UNDEF_INDEX; if ((err = pmid_node->update_subkey(ins_pos, new_obj_index, old_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->update_subkey() returns 0x%x", err); } else if ((err = vir_inc_obj_ref_counter(new_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_inc_obj_ref_counter() returns 0x%x", err); } else if ((err = vir_dec_obj_ref_counter(old_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_dec_obj_ref_counter() returns 0x%x", err); } mutate_result.set_mutate_nothing(); if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "old_obj_index=0x%lx", old_obj_index); } } else { //copy-on-write mid_node_t * pnew_mid_node = NULL; uint64_t new_mid_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_mid_node_index, &pnew_mid_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_mid_node_index || NULL == pnew_mid_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_mid_node_index || NULL == pnew_mid_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_ACQUIRE); } else if ((err = pmid_node->update_subkey( *pnew_mid_node, ins_pos, new_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->update_subkey() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_mid_node_index)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter() returns 0x%x", err); } else { mutate_result.set_update_node_info(new_mid_node_index); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_mid_node_index=0x%lx, pnew_mid_node=0x%p", new_mid_node_index, pnew_mid_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, ins_pos=%d, new_obj_index=0x%lx, pmid_node=0x%p", node_index, ins_pos, new_obj_index, pmid_node); } return err; }; //功能：根据mutate_result对B树操作且返回新的根节点，但不替换当前树的根节点 //输入：mutate_result及bt_root //返回：0 for success, other value for failure int dfs_btree_t::_op_tree( const dfs_bt_root_t & /*old_wr_bt_root*/, dfs_bt_root_t & new_wr_bt_root, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { uint64_t tmp_root_index = UNDEF_INDEX; mid_node_t * pnew_root_node = NULL; //新增的节点.... dfs_sbt_root_t sbt_root = _bt_get_sbt_root(new_wr_bt_root); uint64_t new_root_index = sbt_root.get_root_node_index(); int cur_drill_ptr = drill_ptr; int log_level = DF_UL_LOG_NONE; int err = 0; while (0 == err && cur_drill_ptr >= 0 && mutate_result.get_update_type() != dfs_btree_node_mutate_t::MUTATE_NOTHING) //如果为NOTHINg的话,那么就不进行任何的更新..... { switch(mutate_result.get_update_type()) { //子节点插入或删除而导致产生了新节点 case dfs_btree_node_mutate_t::UPDATE_NODE : if ((err = _op_mid_node_of_sub_update( drill_info, cur_drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_mid_node_of_sub_update() returns 0x%x", err); } break; //子节点分裂了(产生了两个新节点) case dfs_btree_node_mutate_t::SPLIT_NODE : if ((err = _op_mid_node_of_sub_split( drill_info, cur_drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_mid_node_of_sub_split() returns 0x%x", err); } break; //子节点与左兄弟进行了平衡(产生了新的左节点和新的本节点) case dfs_btree_node_mutate_t::REBALANCE_LEFT : if ((err = _op_mid_node_of_sub_rebalance_left( drill_info, cur_drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_mid_node_of_sub_rebalance_left() returns 0x%x", err); } break; //子节点与右兄弟进行了平衡(产生了新的本节点和新的右节点) case dfs_btree_node_mutate_t::REBALANCE_RIGHT: if ((err = _op_mid_node_of_sub_rebalance_right( drill_info, cur_drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_mid_node_of_sub_rebalance_right() returns 0x%x", err); } break; //子节点与左兄弟进行了合并 case dfs_btree_node_mutate_t::MERGE_LEFT : if ((err = _op_mid_node_of_sub_merge_left( drill_info, cur_drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_mid_node_of_sub_merge_left() returns 0x%x", err); } break; //子节点与右兄弟进行了合并 case dfs_btree_node_mutate_t::MERGE_RIGHT: if ((err = _op_mid_node_of_sub_merge_right( drill_info, cur_drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_mid_node_of_sub_merge_right() returns 0x%x", err); } break; case dfs_btree_node_mutate_t::MERGE_BOTH: //子节点与左右兄弟进行了合并 if ((err = _op_mid_node_of_sub_merge_both( drill_info, cur_drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_op_mid_node_of_sub_merge_both() returns 0x%x", err); } break; default: log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "Unknow mutate_type=%d", mutate_result.get_update_type()); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MUTATE_TYPE); break; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "cur_drill_ptr=%d", cur_drill_ptr); } if (0 != err) { break; } --cur_drill_ptr; } if (0 == err && -1 == cur_drill_ptr) { //波及到了根节点 //根节点可能：1.变成一个新根节点；2.分裂，B树长高；3.合并，B树变矮；4.不变化 switch(mutate_result.get_update_type()) { case dfs_btree_node_mutate_t::MUTATE_NOTHING : err = 0; break; //子节点插入或删除而导致产生了新节点 case dfs_btree_node_mutate_t::UPDATE_NODE : //最新的树节点.... if ((err = mutate_result.get_update_node_info(new_root_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_update_node_info() returns 0x%x", err); } break; //子节点分裂了(产生了两个新节点) case dfs_btree_node_mutate_t::SPLIT_NODE : if ((err = _acquire_mid_node(new_root_index, &pnew_root_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_root_index || NULL == pnew_root_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_root_index || NULL == pnew_root_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_ACQUIRE); } else { uint64_t new_obj_index = UNDEF_INDEX; uint64_t node_ary[2]; if ((err = mutate_result.get_split_node_info( new_obj_index, node_ary[0], node_ary[1])) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_split_node_info() returns 0x%x", err); } else if ((err = pnew_root_node->put_pairs(&new_obj_index, node_ary, 1)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_root_node->put_pairs() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_root_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_obj_index=0x%lx, node_ary[0]=0x%lx, node_ary[1]=0x%lx", new_obj_index, node_ary[0], node_ary[1]); } } break; default: log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "Unknow mutate_type=%d", mutate_result.get_update_type()); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MUTATE_TYPE); break; } } if (0 == err) { if ((err = sbt_root.set_root_node_index(tmp_root_index, new_root_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.set_root_node_index() returns 0x%x", err); } else { sbt_root.set_mutation_counter(_bt_get_mutation_counter()); if ((err = _bt_set_sbt_root(new_wr_bt_root, sbt_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_bt_set_sbt_root() returns 0x%x", err); } } } else { //如果出错，则把new_wr_bt_root置为old_wr_bt_root //里面还是...原来的树... if ((err = _bt_set_sbt_root(new_wr_bt_root, sbt_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_bt_set_sbt_root() returns 0x%x", err); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, cur_drill_ptr=%d", drill_ptr, cur_drill_ptr); } return err; }; //功能：在B树叶节点中插入或删除一个项(仅操作叶节点)，把需要对其父节点的操作记录在mutate_result // ins_key_index为插入项的key_index或者UNDEF_INDEX(删除项时) //设置删除的drill ptr:).. // 如果drill_info.del_drill_ptr不等于-1，则表明是删除操作，当del_drill_ptr < drill_ptr时， // 表示删除发生在中间节点上，但需要把对应子树的最大key_index提升到中间节点的对应位置。 //返回：0 for success, other value for failure int dfs_btree_t::_ins_del_leaf_node( //UNDEF.. const uint64_t ins_obj_index, //!=-1表明删除... const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; uint32_t myself_ins_pos = 0; uint64_t myself_node_index = UNDEF_INDEX; const leaf_node_t * pmyself_node = NULL; //插入项不是原子操作，不能修改原来的节点 //插入是写操作...:). uint32_t left_brother_key_num = 0; uint32_t right_brother_key_num = 0; dfs_btree_leaf_node_t super_node; //临时变量... if (drill_info.get_drill_ptr() < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_drill_ptr() < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_ins_pos = drill_info.get_last_ins_pos()) == UNDEF_POS) { //插入位置... log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_node_index = drill_info.get_last_node_index()) == UNDEF_INDEX) { //插入 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_node_index == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_leaf_node(myself_node_index, &pmyself_node)) != 0 || NULL == pmyself_node) { //得到最后的节点.. log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_NULL_POINTER); } else if (UNDEF_INDEX != ins_obj_index) { //插入节点 if (drill_info.get_del_mid_old_node_index() != UNDEF_INDEX) { //确实要删除... log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_del_mid_old_node_index() != UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_DEL_NODE_INDEX); } else if (pmyself_node->is_full()) { //节点已满，不能插入项，需要与左右兄弟平衡或分裂 //保存在super node这个临时节点上... //插入ins pos 和ins obj index.. if ((err = pmyself_node->insert_subkey(super_node, myself_ins_pos, ins_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->insert_subkey() returns 0x%x", err); } //得到左右节点信息... else if ((err = _get_left_right_brothers_info( left_brother_key_num, right_brother_key_num, drill_info, drill_info.get_drill_ptr())) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_left_right_brothers_info() returns 0x%x", err); } //尝试左右节点子树进行平衡.... else if (left_brother_key_num > 0 && left_brother_key_num < (BT_FANOUT-1) && (left_brother_key_num <= right_brother_key_num || 0 == right_brother_key_num)) { if ((err = _leaf_rebalance_left(super_node, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_leaf_rebalance_left() returns 0x%x", err); } } else if (right_brother_key_num > 0 && right_brother_key_num < (BT_FANOUT-1)) { if ((err = _leaf_rebalance_right(super_node, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_leaf_rebalance_right() returns 0x%x", err); } } else { if ((err = _leaf_split(super_node, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_leaf_split() returns 0x%x", err); } } } else { //节点未满，直接插入 leaf_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_leaf_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->insert_subkey( *pnew_myself_node, myself_ins_pos, ins_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->insert_subkey() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter() returns 0x%x", err); } else { //仅仅是更新,把这个节点更新...:).. mutate_result.set_update_node_info(new_myself_node_index); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } } else { //if (UNDEF_INDEX == ins_key_index) //删除节点 if (pmyself_node->get_subkey_num() <= BT_HALF_FANOUT && drill_info.get_drill_ptr() > 0) { //节点半满且非根节点，不能删除项，需与左右兄弟平衡或合并 if ((err = pmyself_node->del_subkey(super_node, myself_ins_pos)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->del_subkey() returns 0x%x", err); } else if ((err = _get_left_right_brothers_info( left_brother_key_num, right_brother_key_num, drill_info, drill_info.get_drill_ptr())) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_left_right_brothers_info() returns 0x%x", err); } else if (left_brother_key_num > BT_HALF_FANOUT && left_brother_key_num >= right_brother_key_num) { if ((err = _leaf_rebalance_left(super_node, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_leaf_rebalance_left() returns 0x%x", err); } } else if (right_brother_key_num > BT_HALF_FANOUT) { if ((err = _leaf_rebalance_right(super_node, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_leaf_rebalance_right() returns 0x%x", err); } } //总是尝试首先合并两个... else if (left_brother_key_num > 0 && right_brother_key_num > 0) { if ((err = _leaf_merge_both(super_node, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_leaf_merge_both() returns 0x%x", err); } } //如果right brother key num==0的话... else if (left_brother_key_num > 0) { if ((err = _leaf_merge_left(super_node, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_leaf_merge_left() returns 0x%x", err); } } //相反...那么来进行右节点的合并.. else if (right_brother_key_num > 0) { if ((err = _leaf_merge_right(super_node, drill_info, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_leaf_merge_right() returns 0x%x", err); } } else { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "wrong condition"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } } else { //节点超过半满或者是根节点，直接删除 leaf_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; //还是需要重新分配一个节点... if ((err = _acquire_leaf_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->del_subkey(*pnew_myself_node, myself_ins_pos)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->del_subkey() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter() returns 0x%x", err); } else { mutate_result.set_update_node_info(new_myself_node_index); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "ins_obj_index=0x%lx, drill_info._drill_ptr=%d, mutate_result.get_update_type()=%d", ins_obj_index, drill_info.get_drill_ptr(), mutate_result.get_update_type()); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, myself_ins_pos=%d", myself_node_index, myself_ins_pos); DF_WRITE_LOG_US(log_level, "left_brother_key_num=%d, right_brother_key_num=%d", left_brother_key_num, right_brother_key_num); DF_WRITE_LOG_US(log_level, "super_node.get_subkey_num()=0x%x", super_node.get_subkey_num()); } return err; }; //功能：增加或删除一个值导致上溢或下溢时，确定是与左或右兄弟平衡，还是独自分裂成为两个节点 // left_brother_node_index不等于UNDEF_INDEX则与之平衡，right_brother_node_index不等于UNDEF_INDEX则与之平衡， // 否则独自分裂成两节点 int dfs_btree_t::_get_left_right_brothers_info( uint32_t & left_brother_key_num, uint32_t & right_brother_key_num, const dfs_btree_drill_t & drill_info, const int drill_ptr) { int log_level = DF_UL_LOG_NONE; int err = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; uint64_t left_node_index = UNDEF_INDEX; uint64_t right_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; const node_base_t * pleft_node = NULL; const node_base_t * pright_node = NULL; left_brother_key_num = 0; //左边兄弟的项的个数 right_brother_key_num = 0; //右边兄弟的项的个数 if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if (0 == drill_ptr) { ; //没有父节点，则一定没有左右兄弟 } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else { //存在左子树... if (myself_in_father_pos > 0) { //left brother: if there is a left brother if ((left_node_index = pfather_node->get_subnode_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pfather_node->get_subnode_index(...-1) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); } else if ((err = _get_node(left_node_index, &pleft_node)) != 0 || NULL == pleft_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { //left brother key number... left_brother_key_num = pleft_node->get_subkey_num(); } } if ((myself_in_father_pos+1) <= pfather_node->get_subkey_num()) { //right brother: if there is a right brother if ((right_node_index = pfather_node->get_subnode_index(myself_in_father_pos+1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pfather_node->get_subnode_index(...+1) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); } else if ((err = _get_node(right_node_index, &pright_node)) != 0 || NULL == pright_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { right_brother_key_num = pright_node->get_subkey_num(); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d", drill_ptr, myself_in_father_pos); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "left_node_index=0x%lx, pleft_node=0x%p", left_node_index, pleft_node); DF_WRITE_LOG_US(log_level, "right_node_index=0x%lx, pright_node=0x%p", right_node_index, pright_node); DF_WRITE_LOG_US(log_level, "left_brother_key_num=%d, right_brother_key_num=%d", left_brother_key_num, right_brother_key_num); } return err; }; //功能：当一个节点因插入或删除项后，与其左边兄弟节点平衡，结果记录在mutate_result //输入：updated_myself_node：插入或删除后的本节点 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_leaf_rebalance_left( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; const int drill_ptr = drill_info.get_drill_ptr(); uint32_t subkey_num = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t left_brother_node_index = UNDEF_INDEX; uint64_t left_brother_key_index = UNDEF_INDEX; const leaf_node_t * pleft_brother_node = NULL; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_NULL_POINTER); } else if (myself_in_father_pos > pfather_node->get_subkey_num() || //插入位置不能超出父节点的subkey_num myself_in_father_pos <= 0) { //there should be 1+ left brother log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos > pfather_node->get_subkey_num() || <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((left_brother_key_index = pfather_node->get_subkey_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((left_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_leaf_node(left_brother_node_index, &pleft_brother_node)) != 0 || NULL == pleft_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else if ((err = pleft_brother_node->insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, pleft_brother_node->get_subkey_num(), left_brother_key_index)) != 0) //把left brother对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->insert_subkey() returns 0x%x", err); } else { subkey_num += pleft_brother_node->get_subkey_num() + 1; //也是copy过去... if ((err = updated_myself_node.get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkeys() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num(); if (subkey_num < (BT_HALF_FANOUT*2+1)) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < (BT_HALF_FANOUT*2+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (2*(BT_FANOUT-1)+1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > (2*(BT_FANOUT-1)+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } //check point也必须使用原有节点而不是使用新节点... //都是必须创建新的节点...... if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 leaf_node_t * pnew_left_node = NULL; leaf_node_t * pnew_myself_node = NULL; uint64_t new_left_node_index = UNDEF_INDEX; uint64_t new_myself_node_index = UNDEF_INDEX; uint32_t ptr = subkey_num/2; if ((err = _acquire_leaf_node(new_left_node_index, &pnew_left_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = _acquire_leaf_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_left_node->put_subkeys(key_index_ary, ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_left_node->put_subkeys() returns 0x%x", err); } else if ((err = pnew_myself_node->put_subkeys(key_index_ary+ptr+1, subkey_num-(ptr+1))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_myself_node->put_subkeys() returns 0x%x", err); } //从最上面加一次引用计数... //写内容... else if ((err = _inc_pointed_ref_counter(new_left_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_left_node_index) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { //左转平衡... mutate_result.set_rebalance_left_info( //key index... key_index_ary[ptr], new_left_node_index, new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_left_node_index=0x%lx, pnew_left_node=0x%p", new_left_node_index, pnew_left_node); DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); DF_WRITE_LOG_US(log_level, "ptr=%d", ptr); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "left_brother_node_index=0x%lx, pleft_brother_node=0x%p", left_brother_node_index, pleft_brother_node); DF_WRITE_LOG_US(log_level, "left_brother_key_index=0x%lx", left_brother_key_index); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); } return err; } //功能：本节点(因插入或删除子项后)，与其左边兄弟节点平衡，结果记录在mutate_result // updated_myself_node：插入或删除子项后的节点 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_mid_rebalance_left( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t node_index_ary[(BT_FANOUT+1)*2]; uint64_t left_brother_node_index = UNDEF_INDEX; uint64_t left_brother_key_index = UNDEF_INDEX; const mid_node_t * pleft_brother_node = NULL; uint32_t subkey_num = 0; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(father_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else if (myself_in_father_pos > pfather_node->get_subkey_num() || //插入位置不能超出父节点的subkey_num myself_in_father_pos <= 0) { //there should be 1+ left brother log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos > pfather_node->get_subkey_num() || <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((left_brother_key_index = pfather_node->get_subkey_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((left_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_mid_node(left_brother_node_index, &pleft_brother_node)) != 0 || NULL == pleft_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(left_brother_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else if ((err = pleft_brother_node->insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, pleft_brother_node->get_subkey_num(), left_brother_key_index)) != 0) //把left brother对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->insert_subkey() returns 0x%x", err); } else if ((err = pleft_brother_node->export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->export_subnode_index() returns 0x%x", err); } else { subkey_num += pleft_brother_node->get_subkey_num() + 1; if ((err = updated_myself_node.get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkeys() returns 0x%x", err); } else if ((err = updated_myself_node.export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.export_subnode_index() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num(); if (subkey_num < (BT_HALF_FANOUT*2+1)) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < (BT_HALF_FANOUT*2+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (2*(BT_FANOUT-1)+1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > (2*(BT_FANOUT-1)+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 mid_node_t * pnew_left_node = NULL; mid_node_t * pnew_myself_node = NULL; uint64_t new_left_node_index = UNDEF_INDEX; uint64_t new_myself_node_index = UNDEF_INDEX; uint32_t ptr = subkey_num/2; if ((err = _acquire_mid_node(new_left_node_index, &pnew_left_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_left_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_left_node->put_pairs(key_index_ary, node_index_ary, ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_left_node->put_pairs() returns 0x%x", err); } else if ((err = pnew_myself_node->put_pairs(key_index_ary+ptr+1, node_index_ary+ptr+1, subkey_num-(ptr+1))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_myself_node->put_pairs() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_left_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_left_node_index) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_rebalance_left_info( key_index_ary[ptr], new_left_node_index, new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_left_node_index=0x%lx, pnew_left_node=0x%p", new_left_node_index, pnew_left_node); DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); DF_WRITE_LOG_US(log_level, "ptr=%d", ptr); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "left_brother_node_index=0x%lx, pleft_brother_node=0x%p", left_brother_node_index, pleft_brother_node); DF_WRITE_LOG_US(log_level, "left_brother_key_index=0x%lx", left_brother_key_index); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); BT_DF_WRITE_LOG_INT64S(log_level, "node_index_ary", node_index_ary, subkey_num+1); } return err; } //功能：当一个节点因插入或删除项后，与其右边兄弟节点平衡，结果记录在mutate_result //输入：updated_myself_node：插入或删除后的本节点 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_leaf_rebalance_right( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; const int drill_ptr = drill_info.get_drill_ptr(); uint32_t subkey_num = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t right_brother_node_index = UNDEF_INDEX; uint64_t myself_key_index = UNDEF_INDEX; const leaf_node_t * pright_brother_node = NULL; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_MID_NODE_NULL_POINTER); } else if ((myself_in_father_pos+1) > pfather_node->get_subkey_num()) { //should be 1+ right brothe log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(myself_in_father_pos+1) > pfather_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_key_index = pfather_node->get_subkey_index(myself_in_father_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((right_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos+1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "right_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_leaf_node(right_brother_node_index, &pright_brother_node)) != 0 || NULL == pright_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else if ((err = updated_myself_node.insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, updated_myself_node.get_subkey_num(), myself_key_index)) != 0) //把myself对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.insert_subkey() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num() + 1; if ((err = pright_brother_node->get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->get_subkeys() returns 0x%x", err); } else { subkey_num += pright_brother_node->get_subkey_num(); if (subkey_num < (BT_HALF_FANOUT*2+1)) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < (BT_HALF_FANOUT*2+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (2*(BT_FANOUT-1)+1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > (2*(BT_FANOUT-1)+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 leaf_node_t * pnew_myself_node = NULL; leaf_node_t * pnew_right_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; uint64_t new_right_node_index = UNDEF_INDEX; uint32_t ptr = subkey_num/2; if ((err = _acquire_leaf_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = _acquire_leaf_node(new_right_node_index, &pnew_right_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node(new_right_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_myself_node->put_subkeys(key_index_ary, ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_myself_node->put_subkeys() returns 0x%x", err); } else if ((err = pnew_right_node->put_subkeys( key_index_ary+ptr+1, subkey_num-(ptr+1))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_right_node->put_subkeys() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_right_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_right_node_index) returns 0x%x", err); } else { mutate_result.set_rebalance_right_info( key_index_ary[ptr], new_myself_node_index, new_right_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_right_node_index=0x%lx, pnew_right_node=0x%p", new_right_node_index, pnew_right_node); DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); DF_WRITE_LOG_US(log_level, "ptr=%d", ptr); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "right_brother_node_index=0x%lx, pright_brother_node=0x%p", right_brother_node_index, pright_brother_node); DF_WRITE_LOG_US(log_level, "myself_key_index=0x%lx", myself_key_index); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); } return err; } //功能：本节点(因插入或删除子项后)，与其右边兄弟节点平衡，结果记录在mutate_result // updated_myself_node：插入或删除子项后的节点 //输入输入：mutate_result //说明：若是因为删除导致，则此时myself的key_index可能需要替换 //返回：0 for success, other values for failure int dfs_btree_t::_mid_rebalance_right( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t node_index_ary[(BT_FANOUT+1)*2]; uint64_t myself_key_index = UNDEF_INDEX; uint64_t right_brother_node_index = UNDEF_INDEX; const mid_node_t * pright_brother_node = NULL; uint32_t subkey_num = 0; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(father_node_index) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((myself_in_father_pos+1) > pfather_node->get_subkey_num()) { //should be 1+ right brothe log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(myself_in_father_pos+1) > pfather_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_key_index = pfather_node->get_subkey_index(myself_in_father_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((right_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos+1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "right_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_mid_node(right_brother_node_index, &pright_brother_node)) != 0 || NULL == pright_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(right_brother_node_index) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else if((err = updated_myself_node.insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, updated_myself_node.get_subkey_num(), myself_key_index)) != 0) //把myself对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.insert_subkey() returns 0x%x", err); } else if ((err = updated_myself_node.export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.export_subnode_index() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num() + 1; if ((err = pright_brother_node->get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->get_subkeys() returns 0x%x", err); } else if ((err = pright_brother_node->export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->export_subnode_index() returns 0x%x", err); } else { subkey_num += pright_brother_node->get_subkey_num(); if (subkey_num < (BT_HALF_FANOUT*2+1)) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < (BT_HALF_FANOUT*2+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (2*(BT_FANOUT-1)+1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > (2*(BT_FANOUT-1)+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 mid_node_t * pnew_right_node = NULL; mid_node_t * pnew_myself_node = NULL; uint64_t new_right_node_index = UNDEF_INDEX; uint64_t new_myself_node_index = UNDEF_INDEX; uint32_t ptr = subkey_num/2; if ((err = _acquire_mid_node(new_right_node_index, &pnew_right_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_right_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_myself_node->put_pairs(key_index_ary, node_index_ary, ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_myself_node->put_pairs() returns 0x%x", err); } else if ((err = pnew_right_node->put_pairs(key_index_ary+ptr+1, node_index_ary+ptr+1, subkey_num-(ptr+1))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_right_node->put_pairs() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_right_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_right_node_index) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_rebalance_right_info( key_index_ary[ptr], new_myself_node_index, new_right_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_right_node_index=0x%lx, pnew_right_node=0x%p", new_right_node_index, pnew_right_node); DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); DF_WRITE_LOG_US(log_level, "ptr=%d", ptr); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "right_brother_node_index=0x%lx, pright_brother_node=0x%p", right_brother_node_index, pright_brother_node); DF_WRITE_LOG_US(log_level, "myself_key_index=0x%lx", myself_key_index); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); BT_DF_WRITE_LOG_INT64S(log_level, "node_index_ary", node_index_ary, subkey_num+1); } return err; } //功能：当一个节点因插入项后，进行分裂，结果记录在mutate_result //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_leaf_split( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; const int drill_ptr = drill_info.get_drill_ptr(); uint32_t subkey_num = 0; uint64_t key_index_ary[BT_FANOUT+2]; if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if (updated_myself_node.get_subkey_num() < (BT_HALF_FANOUT*2+1)) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkey_num() < (BT_HALF_FANOUT*2+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if ((err = updated_myself_node.get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkeys() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num(); } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 leaf_node_t * pnew_left_node = NULL; leaf_node_t * pnew_right_node = NULL; uint64_t new_left_node_index = UNDEF_INDEX; uint64_t new_right_node_index = UNDEF_INDEX; uint32_t ptr = subkey_num/2; if ((err = _acquire_leaf_node(new_left_node_index, &pnew_left_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node(new_left_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = _acquire_leaf_node(new_right_node_index, &pnew_right_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node(new_right_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_left_node->put_subkeys(key_index_ary, ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_left_node->put_subkeys() returns 0x%x", err); } else if ((err = pnew_right_node->put_subkeys(key_index_ary+ptr+1, subkey_num-(ptr+1))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_right_node->put_subkeys() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_left_node_index)) != 0) { //???.. log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_left_node_index) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_right_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_right_node_index) returns 0x%x", err); } else { //根据B树的顺序关系，当一个节点分裂成左右两个节点后，其新右节点代替原节点在父节点中位置， //其新左节点将插入其在原父节点中位置的左侧。 mutate_result.set_split_node_info( key_index_ary[ptr], new_left_node_index, new_right_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_left_node_index=0x%lx, pnew_left_node=0x%p", new_left_node_index, pnew_left_node); DF_WRITE_LOG_US(log_level, "new_right_node_index=0x%lx, pnew_right_node=0x%p", new_right_node_index, pnew_right_node); DF_WRITE_LOG_US(log_level, "ptr=%d", ptr); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, subkey_num=%d", drill_ptr, subkey_num); DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkey_num()=%d", updated_myself_node.get_subkey_num()); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); } return err; } //功能：本节点因插入子项后，进行分裂，结果记录在mutate_result // updated_myself_node：插入子项后的节点 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_mid_split( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & /*drill_info*/, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; uint32_t subkey_num = 0; uint64_t key_index_ary[BT_FANOUT+2]; uint64_t node_index_ary[BT_FANOUT+2]; if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if (updated_myself_node.get_subkey_num() < (BT_HALF_FANOUT*2+1)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkey_num() < (BT_HALF_FANOUT*2+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if ((err = updated_myself_node.get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkeys() returns 0x%x", err); } else if ((err = updated_myself_node.export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.export_subnode_index() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num(); } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 mid_node_t * pnew_left_node = NULL; mid_node_t * pnew_right_node = NULL; uint64_t new_left_node_index = UNDEF_INDEX; uint64_t new_right_node_index = UNDEF_INDEX; uint32_t ptr = subkey_num/2; if ((err = _acquire_mid_node(new_left_node_index, &pnew_left_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_left_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = _acquire_mid_node(new_right_node_index, &pnew_right_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_right_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_left_node->put_pairs(key_index_ary, node_index_ary, ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_left_node->put_pairs() returns 0x%x", err); } else if ((err = pnew_right_node->put_pairs( key_index_ary+ptr+1, node_index_ary+ptr+1, subkey_num-(ptr+1))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_right_node->put_pairs() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_left_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_left_node_index) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_right_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_right_node_index) returns 0x%x", err); } else { //根据B树的顺序关系，当一个节点分裂成左右两个节点后，其新右节点代替原节点在父节点中位置， //其新左节点将插入其在原父节点中位置的左侧。 mutate_result.set_split_node_info( key_index_ary[ptr], new_left_node_index, new_right_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_left_node_index=0x%lx, pnew_left_node=0x%p", new_left_node_index, pnew_left_node); DF_WRITE_LOG_US(log_level, "new_right_node_index=0x%lx, pnew_right_node=0x%p", new_right_node_index, pnew_right_node); DF_WRITE_LOG_US(log_level, "ptr=%d", ptr); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, subkey_num=%d", drill_ptr, subkey_num); DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkey_num()=%d", updated_myself_node.get_subkey_num()); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); } return err; } //功能：当一个节点因删除项下溢后，与其左边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int dfs_btree_t::_leaf_merge_left( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; const int drill_ptr = drill_info.get_drill_ptr(); uint32_t subkey_num = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t left_brother_node_index = UNDEF_INDEX; uint64_t left_brother_key_index = UNDEF_INDEX; const leaf_node_t * pleft_brother_node = NULL; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(father_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (myself_in_father_pos > pfather_node->get_subkey_num() || //插入位置不能超出父节点的subkey_num myself_in_father_pos <= 0) { //there should be 1+ left brother log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos > pfather_node->get_subkey_num() || <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((left_brother_key_index = pfather_node->get_subkey_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((left_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_leaf_node(left_brother_node_index, &pleft_brother_node)) != 0 || NULL == pleft_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else if ((err = pleft_brother_node->insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, pleft_brother_node->get_subkey_num(), left_brother_key_index)) != 0) //把left brother对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->insert_subkey() returns 0x%x", err); } else { subkey_num += pleft_brother_node->get_subkey_num() + 1; if ((err = updated_myself_node.get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkeys() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num(); if (subkey_num < BT_HALF_FANOUT) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < BT_HALF_FANOUT"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (BT_FANOUT-1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > (BT_FANOUT-1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 leaf_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_leaf_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_myself_node->put_subkeys(key_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_myself_node->put_subkeys() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_merge_left_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "left_brother_node_index=0x%lx, pleft_brother_node=0x%p", left_brother_node_index, pleft_brother_node); DF_WRITE_LOG_US(log_level, "left_brother_key_index=0x%lx, updated_myself_node..get_subkey_num()=%d", left_brother_key_index, updated_myself_node.get_subkey_num()); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); } return err; }; //功能：当一个节点因删除项下溢后，与其左边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int dfs_btree_t::_mid_merge_left( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t node_index_ary[(BT_FANOUT+1)*2]; uint64_t left_brother_node_index = UNDEF_INDEX; uint64_t left_brother_key_index = UNDEF_INDEX; const mid_node_t * pleft_brother_node = NULL; uint32_t subkey_num = 0; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(father_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (myself_in_father_pos > pfather_node->get_subkey_num() || //插入位置不能超出父节点的subkey_num myself_in_father_pos <= 0) { //there should be 1+ left brother log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos > pfather_node->get_subkey_num() || <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((left_brother_key_index = pfather_node->get_subkey_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((left_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_mid_node(left_brother_node_index, &pleft_brother_node)) != 0 || NULL == pleft_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(left_brother_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = pleft_brother_node->insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, pleft_brother_node->get_subkey_num(), left_brother_key_index)) != 0) //把left brother对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->insert_subkey() returns 0x%x", err); } else if ((err = pleft_brother_node->export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->export_subnode_index() returns 0x%x", err); } else { subkey_num += pleft_brother_node->get_subkey_num() + 1; if ((err = updated_myself_node.get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.get_subkeys() returns 0x%x", err); } else if ((err = updated_myself_node.export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.export_subnode_index() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num(); if (subkey_num < BT_HALF_FANOUT) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < BT_HALF_FANOUT"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (BT_FANOUT-1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > (BT_FANOUT-1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 mid_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node() returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_myself_node->put_pairs( key_index_ary, node_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_myself_node->put_pairs() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_merge_left_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "left_brother_node_index=0x%lx, pleft_brother_node=0x%p", left_brother_node_index, pleft_brother_node); DF_WRITE_LOG_US(log_level, "left_brother_key_index=0x%lx, updated_myself_node..get_subkey_num()=%d", left_brother_key_index, updated_myself_node.get_subkey_num()); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); BT_DF_WRITE_LOG_INT64S(log_level, "node_index_ary", node_index_ary, subkey_num+1); } return err; }; //功能：当一个节点因删除项下溢后，与其右边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int dfs_btree_t::_leaf_merge_right( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; const int drill_ptr = drill_info.get_drill_ptr(); uint32_t subkey_num = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t right_brother_node_index = UNDEF_INDEX; uint64_t myself_key_index = UNDEF_INDEX; const leaf_node_t * pright_brother_node = NULL; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(father_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((myself_in_father_pos+1) > pfather_node->get_subkey_num()) { //should be 1+ right brothe log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(myself_in_father_pos+1) > pfather_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_key_index = pfather_node->get_subkey_index(myself_in_father_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((right_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos+1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "right_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_leaf_node(right_brother_node_index, &pright_brother_node)) != 0 || NULL == pright_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node(right_brother_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else if ((err = updated_myself_node.insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, updated_myself_node.get_subkey_num(), myself_key_index)) != 0) //把myself对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.insert_subkey() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num() + 1; if ((err = pright_brother_node->get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->get_subkeys() returns 0x%x", err); } else { subkey_num += pright_brother_node->get_subkey_num(); if (subkey_num < BT_HALF_FANOUT) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < BT_HALF_FANOUT"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (BT_FANOUT-1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > (BT_FANOUT-1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 leaf_node_t * pnew_right_node = NULL; uint64_t new_right_node_index = UNDEF_INDEX; if ((err = _acquire_leaf_node(new_right_node_index, &pnew_right_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node(new_right_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_right_node->put_subkeys(key_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_right_node->put_subkeys() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_right_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_right_node_index) returns 0x%x", err); } else { mutate_result.set_merge_right_info(new_right_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_right_node_index=0x%lx, pnew_right_node=0x%p", new_right_node_index, pnew_right_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "right_brother_node_index=0x%lx, pright_brother_node=0x%p", right_brother_node_index, pright_brother_node); DF_WRITE_LOG_US(log_level, "myself_key_index=0x%lx, updated_myself_node..get_subkey_num()=%d", myself_key_index, updated_myself_node.get_subkey_num()); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); } return err; }; //功能：当一个节点因删除项下溢后，与其右边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //输入：updated_myself_node：插入或删除后的本节点 //返回：0 for success, other values for failure int dfs_btree_t::_mid_merge_right( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t node_index_ary[(BT_FANOUT+1)*2]; uint64_t myself_key_index = UNDEF_INDEX; uint64_t right_brother_node_index = UNDEF_INDEX; const mid_node_t * pright_brother_node = NULL; uint32_t subkey_num = 0; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(father_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((myself_in_father_pos+1) > pfather_node->get_subkey_num()) { //should be 1+ right brothe log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(myself_in_father_pos+1) > pfather_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_key_index = pfather_node->get_subkey_index(myself_in_father_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((right_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos+1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "right_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_mid_node(right_brother_node_index, &pright_brother_node)) != 0 || NULL == pright_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(right_brother_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = updated_myself_node.insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, updated_myself_node.get_subkey_num(), myself_key_index)) != 0) //把myself对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.insert_subkey() returns 0x%x", err); } else if ((err = updated_myself_node.export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.export_subnode_index() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num() + 1; if ((err = pright_brother_node->get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->get_subkeys() returns 0x%x", err); } else if ((err = pright_brother_node->export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->export_subnode_index() returns 0x%x", err); } else { subkey_num += pright_brother_node->get_subkey_num(); if (subkey_num < BT_HALF_FANOUT) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < BT_HALF_FANOUT"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (BT_FANOUT-1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > (BT_FANOUT-1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 mid_node_t * pnew_right_node = NULL; uint64_t new_right_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_right_node_index, &pnew_right_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_right_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_right_node->put_pairs( key_index_ary, node_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_right_node->put_pairs() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_right_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_right_node_index) returns 0x%x", err); } else { mutate_result.set_merge_right_info(new_right_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_right_node_index=0x%lx, pnew_right_node=0x%p", new_right_node_index, pnew_right_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "right_brother_node_index=0x%lx, pright_brother_node=0x%p", right_brother_node_index, pright_brother_node); DF_WRITE_LOG_US(log_level, "myself_key_index=0x%lx, updated_myself_node..get_subkey_num()=%d", myself_key_index, updated_myself_node.get_subkey_num()); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); BT_DF_WRITE_LOG_INT64S(log_level, "node_index_ary", node_index_ary, subkey_num+1); } return err; }; //功能：当一个节点因删除项下溢后，与其左右边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //返回：0 for success, other values for failure //合并之后立刻分拆成为两个节点... int dfs_btree_t::_leaf_merge_both( const dfs_btree_leaf_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; const int drill_ptr = drill_info.get_drill_ptr(); uint32_t subkey_num = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t left_brother_node_index = UNDEF_INDEX; uint64_t left_brother_key_index = UNDEF_INDEX; const leaf_node_t * pleft_brother_node = NULL; uint64_t myself_key_index = UNDEF_INDEX; uint64_t right_brother_node_index = UNDEF_INDEX; const leaf_node_t * pright_brother_node = NULL; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(father_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (myself_in_father_pos <= 0 || (myself_in_father_pos+1) > pfather_node->get_subkey_num()) //there should be 1+ left and 1+ right brother { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos <= 0 || (...+1) > pfather_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((left_brother_key_index = pfather_node->get_subkey_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((left_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((myself_key_index = pfather_node->get_subkey_index(myself_in_father_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((right_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos+1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "right_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_leaf_node(left_brother_node_index, &pleft_brother_node)) != 0 || NULL == pleft_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node(left_brother_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else if ((err = _get_leaf_node(right_brother_node_index, &pright_brother_node)) != 0 || NULL == pright_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node(right_brother_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_NULL_POINTER); } else if ((err = pleft_brother_node->insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, pleft_brother_node->get_subkey_num(), left_brother_key_index)) != 0) //把left brother对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->insert_subkey() returns 0x%x", err); } else { subkey_num += pleft_brother_node->get_subkey_num() + 1; if ((err = updated_myself_node.insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, updated_myself_node.get_subkey_num(), myself_key_index)) != 0) //把myself对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.insert_subkey() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num() + 1; if ((err = pright_brother_node->get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->get_subkeys() returns 0x%x", err); } else { subkey_num += pright_brother_node->get_subkey_num(); if (subkey_num < (BT_HALF_FANOUT*2+1)) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < (BT_HALF_FANOUT*2+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (2*(BT_FANOUT-1)+1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < (2*(BT_FANOUT-1)+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 leaf_node_t * pnew_left_node = NULL; leaf_node_t * pnew_right_node = NULL; uint64_t new_left_node_index = UNDEF_INDEX; uint64_t new_right_node_index = UNDEF_INDEX; uint32_t ptr = subkey_num/2; if ((err = _acquire_leaf_node(new_left_node_index, &pnew_left_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node(new_left_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = _acquire_leaf_node(new_right_node_index, &pnew_right_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node(new_right_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_left_node->put_subkeys(key_index_ary, ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_left_node->put_subkeys() returns 0x%x", err); } else if ((err = pnew_right_node->put_subkeys(key_index_ary+ptr+1, subkey_num-(ptr+1))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_right_node->put_subkeys() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_left_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_left_node_index) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_right_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_right_node_index) returns 0x%x", err); } else { mutate_result.set_merge_both_info( key_index_ary[ptr], new_left_node_index, new_right_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_left_node_index=0x%lx, pnew_left_node=0x%p", new_left_node_index, pnew_left_node); DF_WRITE_LOG_US(log_level, "new_right_node_index=0x%lx, pnew_right_node=0x%p", new_right_node_index, pnew_right_node); DF_WRITE_LOG_US(log_level, "ptr=%d", ptr); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "left_brother_node_index=0x%lx, pleft_brother_node=0x%p", left_brother_node_index, pleft_brother_node); DF_WRITE_LOG_US(log_level, "right_brother_node_index=0x%lx, pright_brother_node=0x%p", right_brother_node_index, pright_brother_node); DF_WRITE_LOG_US(log_level, "myself_key_index=0x%lx, updated_myself_node.get_subkey_num()=%d", myself_key_index, updated_myself_node.get_subkey_num()); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); } return err; }; //功能：当一个节点因删除项下溢后，与其左右边兄弟节点合并，结果记录在mutate_result //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_mid_merge_both( const dfs_btree_mid_node_t & updated_myself_node, const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { int log_level = DF_UL_LOG_NONE; int err = 0; uint32_t myself_in_father_pos = UNDEF_POS; uint64_t father_node_index = UNDEF_INDEX; const mid_node_t * pfather_node = NULL; uint64_t key_index_ary[(BT_FANOUT+1)*2]; uint64_t node_index_ary[(BT_FANOUT+1)*2]; uint64_t left_brother_node_index = UNDEF_INDEX; uint64_t left_brother_key_index = UNDEF_INDEX; const mid_node_t * pleft_brother_node = NULL; uint64_t myself_key_index = UNDEF_INDEX; uint64_t right_brother_node_index = UNDEF_INDEX; const mid_node_t * pright_brother_node = NULL; uint32_t subkey_num = 0; if (drill_ptr <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_in_father_pos = drill_info.get_ins_pos(drill_ptr-1)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((father_node_index = drill_info.get_node_index(drill_ptr-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "father_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(father_node_index, &pfather_node)) != 0 || NULL == pfather_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(father_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (myself_in_father_pos <= 0 || (myself_in_father_pos+1) > pfather_node->get_subkey_num()) //there should be 1+ left and 1+ right brother { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_in_father_pos <= 0 || (...+1) > pfather_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((left_brother_key_index = pfather_node->get_subkey_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((left_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos-1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "left_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((myself_key_index = pfather_node->get_subkey_index(myself_in_father_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_key_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_INDEX); } else if ((right_brother_node_index = pfather_node->get_subnode_index(myself_in_father_pos+1)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "right_brother_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); } else if ((err = _get_mid_node(left_brother_node_index, &pleft_brother_node)) != 0 || NULL == pleft_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(left_brother_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = _get_mid_node(right_brother_node_index, &pright_brother_node)) != 0 || NULL == pright_brother_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(right_brother_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = pleft_brother_node->insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, pleft_brother_node->get_subkey_num(), left_brother_key_index)) != 0) //把left brother对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->insert_subkey() returns 0x%x", err); } else if ((err = pleft_brother_node->export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleft_brother_node->export_subnode_index() returns 0x%x", err); } else { subkey_num += pleft_brother_node->get_subkey_num() + 1; if ((err = updated_myself_node.insert_subkey( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num, updated_myself_node.get_subkey_num(), myself_key_index)) != 0) //把myself对应的key_index插入到最后 { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.insert_subkey() returns 0x%x", err); } else if ((err = updated_myself_node.export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "updated_myself_node.export_subnode_index() returns 0x%x", err); } else { subkey_num += updated_myself_node.get_subkey_num() + 1; if ((err = pright_brother_node->get_subkeys( key_index_ary+subkey_num, df_len_of_ary(key_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->get_subkeys() returns 0x%x", err); } else if ((err = pright_brother_node->export_subnode_index( node_index_ary+subkey_num, df_len_of_ary(node_index_ary)-subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pright_brother_node->export_subnode_index() returns 0x%x", err); } else { subkey_num += pright_brother_node->get_subkey_num(); if (subkey_num < (BT_HALF_FANOUT*2+1)) { //下溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < (BT_HALF_FANOUT*2+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else if (subkey_num > (2*(BT_FANOUT-1)+1)) { //上溢 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num < (2*(BT_FANOUT-1)+1)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } } } } if (0 == err) { //不论是否checkpointing都得使用新节点而不能直接修改原有节点 mid_node_t * pnew_left_node = NULL; mid_node_t * pnew_right_node = NULL; uint64_t new_left_node_index = UNDEF_INDEX; uint64_t new_right_node_index = UNDEF_INDEX; uint32_t ptr = subkey_num/2; if ((err = _acquire_mid_node(new_left_node_index, &pnew_left_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_left_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_left_node_index || NULL == pnew_left_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = _acquire_mid_node(new_right_node_index, &pnew_right_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_right_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node) { //leaf_node log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_right_node_index || NULL == pnew_right_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pnew_left_node->put_pairs(key_index_ary, node_index_ary, ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_left_node->put_pairs() returns 0x%x", err); } else if ((err = pnew_right_node->put_pairs( key_index_ary+ptr+1, node_index_ary+ptr+1, subkey_num-(ptr+1))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnew_right_node->put_pairs() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_left_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_left_node_index) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_right_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_right_node_index) returns 0x%x", err); } else { //根据B树的顺序关系，当一个节点分裂成左右两个节点后，其新右节点代替原节点在父节点中位置， //其新左节点将插入其在原父节点中位置的左侧。 mutate_result.set_merge_both_info( key_index_ary[ptr], new_left_node_index, new_right_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_left_node_index=0x%lx, pnew_left_node=0x%p", new_left_node_index, pnew_left_node); DF_WRITE_LOG_US(log_level, "new_right_node_index=0x%lx, pnew_right_node=0x%p", new_right_node_index, pnew_right_node); DF_WRITE_LOG_US(log_level, "ptr=%d", ptr); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_in_father_pos=%d, subkey_num=%d", drill_ptr, myself_in_father_pos, subkey_num); DF_WRITE_LOG_US(log_level, "father_node_index=0x%lx, pfather_node=0x%p", father_node_index, pfather_node); DF_WRITE_LOG_US(log_level, "left_brother_node_index=0x%lx, pleft_brother_node=0x%p", left_brother_node_index, pleft_brother_node); DF_WRITE_LOG_US(log_level, "right_brother_node_index=0x%lx, pright_brother_node=0x%p", right_brother_node_index, pright_brother_node); DF_WRITE_LOG_US(log_level, "myself_key_index=0x%lx, updated_myself_node.get_subkey_num()=%d", myself_key_index, updated_myself_node.get_subkey_num()); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, subkey_num); BT_DF_WRITE_LOG_INT64S(log_level, "node_index_ary", node_index_ary, subkey_num+1); } return err; }; //功能：因子节点插入或删除导致了新节点(没有分裂或左右平衡)而对本节点更新 //输入输入：mutate_result //说明：若是因为删除导致，则此时myself的key_index可能需要替换 //返回：0 for success, other values for failure int dfs_btree_t::_op_mid_node_of_sub_update( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { uint64_t new_subnode_index = UNDEF_INDEX; uint64_t old_subnode_index = UNDEF_INDEX; uint64_t new_subnode_ref_counter = UNDEF_REF_COUNTER; uint64_t old_subnode_ref_counter = UNDEF_REF_COUNTER; uint64_t myself_node_index = UNDEF_INDEX; mid_node_t * pmyself_node = NULL; uint32_t myself_ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = mutate_result.get_update_node_info(new_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_update_node_info() returns 0x%x", err); } else if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_ins_pos = drill_info.get_ins_pos(drill_ptr)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_node_index = drill_info.get_node_index(drill_ptr)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node_for_mutate(myself_node_index, &pmyself_node)) != 0 || NULL == pmyself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node_for_mutate(myself_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } //如果修改的节点在要删除的节点之上，就可以直接修改 //可以直接进行修改... else if (pmyself_node->get_mutation_counter() > _bt_get_max_cow_mutation_counter() && drill_ptr < drill_info.get_del_mid_drill_ptr()) { //直接修改 if ((err = pmyself_node->update_subnode( myself_ins_pos, new_subnode_index, old_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_subnode() returns 0x%x", err); } //增加... else if ((err = _inc_node_ref_counter(new_subnode_index, new_subnode_ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_node_ref_counter(new_subnode_index) returns 0x%x", err); } else if ((err = _dec_node_ref_counter(old_subnode_index, old_subnode_ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_dec_node_ref_counter(old_subnode_index) returns 0x%x", err); } else { //设置0... mutate_result.set_mutate_nothing(); err = 0; } } else { //copy-on-write mid_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->update_subnode(*pnew_myself_node, myself_ins_pos, new_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_subnode() returns 0x%x", err); } //增加这个index...的引用计数... else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_update_node_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_ins_pos=%d", drill_ptr, myself_ins_pos); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, pmyself_node=0x%p", myself_node_index, pmyself_node); DF_WRITE_LOG_US(log_level, "new_subnode_index=0x%lx, old_subnode_index=0x%lx", new_subnode_index, old_subnode_index); DF_WRITE_LOG_US(log_level, "new_subnode_ref_counter=%ld, old_subnode_ref_counter=%ld", new_subnode_ref_counter, old_subnode_ref_counter); DF_WRITE_LOG_US(log_level, "mutate_result.get_update_type()=%d", mutate_result.get_update_type()); } return err; } //功能：子节点因插入或删除项而与左兄弟平衡后，更新本节点。 //输入输入：mutate_result //说明：若是因为删除导致，则此时myself的key_index可能需要替换 //返回：0 for success, other values for failure int dfs_btree_t::_op_mid_node_of_sub_rebalance_left( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { uint64_t new_left_subkey_index = UNDEF_INDEX; uint64_t new_left_subnode_index = UNDEF_INDEX; uint64_t new_myself_subnode_index = UNDEF_INDEX; uint64_t myself_node_index = UNDEF_INDEX; const mid_node_t * pmyself_node = NULL; uint32_t myself_ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = mutate_result.get_rebalance_left_info( new_left_subkey_index, new_left_subnode_index, new_myself_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_rebalance_left_info() returns 0x%x", err); } else if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_ins_pos = drill_info.get_ins_pos(drill_ptr)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_node_index = drill_info.get_node_index(drill_ptr)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(myself_node_index, &pmyself_node)) != 0 || NULL == pmyself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(myself_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { //不能用原子操作一次更新，必须copy-on-write mid_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX;; if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->update_brothers(*pnew_myself_node, myself_ins_pos-1, new_left_subkey_index, new_left_subnode_index, new_myself_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_brothers(...) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_update_node_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_ins_pos=%d", drill_ptr, myself_ins_pos); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, pmyself_node=0x%p", myself_node_index, pmyself_node); DF_WRITE_LOG_US(log_level, "new_left_subkey_index=0x%lx, new_left_subnode_index=0x%lx", new_left_subkey_index, new_left_subnode_index); DF_WRITE_LOG_US(log_level, "new_myself_subnode_index=0x%lx", new_myself_subnode_index); DF_WRITE_LOG_US(log_level, "mutate_result.get_update_type()=%d", mutate_result.get_update_type()); } return err; } //功能：子节点因插入或删除项而与右兄弟平衡后，更新本节点。 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_op_mid_node_of_sub_rebalance_right( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { uint64_t new_myself_subkey_index = UNDEF_INDEX; uint64_t new_myself_subnode_index = UNDEF_INDEX; uint64_t new_right_subnode_index = UNDEF_INDEX; uint64_t myself_node_index = UNDEF_INDEX; const mid_node_t * pmyself_node = NULL; uint32_t myself_ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = mutate_result.get_rebalance_right_info( new_myself_subkey_index, new_myself_subnode_index, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_rebalance_right_info() returns 0x%x", err); } else if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_ins_pos = drill_info.get_ins_pos(drill_ptr)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_node_index = drill_info.get_node_index(drill_ptr)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(myself_node_index, &pmyself_node)) != 0 || NULL == pmyself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node_for_mutate(myself_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { //不能用原子操作一次更新，必须copy-on-write mid_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->update_brothers( *pnew_myself_node, myself_ins_pos, new_myself_subkey_index, new_myself_subnode_index, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_brothers(...) returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_update_node_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_ins_pos=%d", drill_ptr, myself_ins_pos); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, pmyself_node=0x%p", myself_node_index, pmyself_node); DF_WRITE_LOG_US(log_level, "new_myself_subkey_index=0x%lx, new_myself_subnode_index=0x%lx", new_myself_subkey_index, new_myself_subnode_index); DF_WRITE_LOG_US(log_level, "new_right_subnode_index=0x%lx", new_right_subnode_index); DF_WRITE_LOG_US(log_level, "mutate_result.get_update_type()=%d", mutate_result.get_update_type()); } return err; } //功能：因子节点插入导致分裂而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_op_mid_node_of_sub_split( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { uint64_t new_left_subkey_index = UNDEF_INDEX; uint64_t new_left_subnode_index = UNDEF_INDEX; uint64_t new_right_subnode_index = UNDEF_INDEX; uint64_t myself_node_index = UNDEF_INDEX; const mid_node_t * pmyself_node = NULL; uint32_t myself_ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = mutate_result.get_split_node_info( new_left_subkey_index, new_left_subnode_index, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_split_node_info() returns 0x%x", err); } else if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_ins_pos = drill_info.get_ins_pos(drill_ptr)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_node_index = drill_info.get_node_index(drill_ptr)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(myself_node_index, &pmyself_node)) != 0 || NULL == pmyself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(myself_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { // 根据B树的顺序关系，当一个节点分裂成左右两个节点后，其新右节点代替原节点在父节点中位置， // 其新左节点将插入其在原父节点中位置的左侧。 if (pmyself_node->is_full()) { //节点满，需要与左兄弟或右兄弟平衡或分裂 uint32_t left_brother_key_num = 0; uint32_t right_brother_key_num = 0; dfs_btree_mid_node_t super_node; //类似于 if ((err = pmyself_node->update_then_ins_to_left( super_node, myself_ins_pos, new_left_subkey_index, new_left_subnode_index, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_then_ins_to_left() returns 0x%x", err); } else if ((err = _get_left_right_brothers_info( left_brother_key_num, right_brother_key_num, drill_info, drill_ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_left_right_brothers_info() returns 0x%x", err); } else if (left_brother_key_num > 0 && left_brother_key_num < (BT_FANOUT-1) && (left_brother_key_num <= right_brother_key_num || 0 == right_brother_key_num)) { if ((err = _mid_rebalance_left(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_rebalance_left() returns 0x%x", err); } } else if (right_brother_key_num > 0 && right_brother_key_num < (BT_FANOUT-1)) { if ((err = _mid_rebalance_right(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_rebalance_right() returns 0x%x", err); } } else { if ((err = _mid_split(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_split() returns 0x%x", err); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "left_brother_key_num=%d, right_brother_key_num=%d", left_brother_key_num, right_brother_key_num); } } else { //节点未满，直接插入 mid_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->update_then_ins_to_left( *pnew_myself_node, myself_ins_pos, new_left_subkey_index, new_left_subnode_index, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_then_ins_to_left() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_update_node_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_ins_pos=%d", drill_ptr, myself_ins_pos); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, pmyself_node=0x%p", myself_node_index, pmyself_node); DF_WRITE_LOG_US(log_level, "new_left_subkey_index=0x%lx, new_left_subnode_index=0x%lx", new_left_subkey_index, new_left_subnode_index); DF_WRITE_LOG_US(log_level, "new_right_subnode_index=0x%lx", new_right_subnode_index); DF_WRITE_LOG_US(log_level, "mutate_result.get_update_type()=%d", mutate_result.get_update_type()); } return err; } //功能：因子节点与左兄弟合并而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_op_mid_node_of_sub_merge_left( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { uint64_t new_myself_subnode_index = UNDEF_INDEX; uint64_t myself_node_index = UNDEF_INDEX; const mid_node_t * pmyself_node = NULL; uint32_t myself_ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = mutate_result.get_merge_left_info(new_myself_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_merge_left_info() returns 0x%x", err); } else if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_ins_pos = drill_info.get_ins_pos(drill_ptr)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_node_index = drill_info.get_node_index(drill_ptr)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(myself_node_index, &pmyself_node)) != 0 || NULL == pmyself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(myself_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (myself_ins_pos <= 0 || myself_ins_pos > pmyself_node->get_subkey_num()) { //at least one left brother log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos <= 0 || ... > pmyself_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } //不能用原子操作一次更新，必须copy-on-write else if (pmyself_node->get_subkey_num() <= BT_HALF_FANOUT && drill_ptr > 0) { //节点下溢，需要与左兄弟或右兄弟平衡或合并 uint32_t left_brother_key_num = 0; uint32_t right_brother_key_num = 0; dfs_btree_mid_node_t super_node; if ((err = pmyself_node->update_then_del_left( super_node, myself_ins_pos, new_myself_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_then_del_left() returns 0x%x", err); } else if ((err = _get_left_right_brothers_info( left_brother_key_num, right_brother_key_num, drill_info, drill_ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_left_right_brothers_info() returns 0x%x", err); } else if (left_brother_key_num > BT_HALF_FANOUT && left_brother_key_num >= right_brother_key_num) { if ((err = _mid_rebalance_left(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_rebalance_left() returns 0x%x", err); } } else if (right_brother_key_num > BT_HALF_FANOUT) { if ((err = _mid_rebalance_right(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_rebalance_right() returns 0x%x", err); } } else if (left_brother_key_num > 0) { if (right_brother_key_num > 0) { if ((err = _mid_merge_both(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_both() returns 0x%x", err); } } else { if ((err = _mid_merge_left(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_left() returns 0x%x", err); } } } else if (right_brother_key_num > 0) { if ((err = _mid_merge_right(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_right() returns 0x%x", err); } } else { //both left_brother_key_num and right_brother_key_num <= 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "both left_brother_key_num and right_brother_key_num <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "left_brother_key_num=%d, right_brother_key_num=%d", left_brother_key_num, right_brother_key_num); } } else if (pmyself_node->get_subkey_num() > 1) { //节点未下溢或者是根节点且subkey_num>1，直接删除 mid_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->update_then_del_left( *pnew_myself_node, myself_ins_pos, new_myself_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_then_del_left() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index...) returns 0x%x", err); } else { mutate_result.set_update_node_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } else { //根节点且subkey_num == 1 mutate_result.set_update_node_info(new_myself_subnode_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_ins_pos=%d", drill_ptr, myself_ins_pos); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, pmyself_node=0x%p", myself_node_index, pmyself_node); DF_WRITE_LOG_US(log_level, "new_myself_subnode_index=0x%lx", new_myself_subnode_index); DF_WRITE_LOG_US(log_level, "mutate_result.get_update_type()=%d", mutate_result.get_update_type()); } return err; }; //功能：因子节点与右兄弟合并而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_op_mid_node_of_sub_merge_right( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { uint64_t new_right_subnode_index = UNDEF_INDEX; uint64_t myself_node_index = UNDEF_INDEX; const mid_node_t * pmyself_node = NULL; uint32_t myself_ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = mutate_result.get_merge_right_info(new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_merge_right_info() returns 0x%x", err); } else if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_ins_pos = drill_info.get_ins_pos(drill_ptr)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_node_index = drill_info.get_node_index(drill_ptr)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(myself_node_index, &pmyself_node)) != 0 || NULL == pmyself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(myself_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((myself_ins_pos+1) > pmyself_node->get_subkey_num()) { //at least one right brother log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(myself_ins_pos+1) > pmyself_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } //不能用原子操作一次更新，必须copy-on-write else if (pmyself_node->get_subkey_num() <= BT_HALF_FANOUT && drill_ptr > 0) { //节点下溢，需要与左兄弟或右兄弟平衡或合并 uint32_t left_brother_key_num = 0; uint32_t right_brother_key_num = 0; dfs_btree_mid_node_t super_node; if ((err = pmyself_node->update_then_del_left( super_node, myself_ins_pos+1, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_then_del_left() returns 0x%x", err); } else if ((err = _get_left_right_brothers_info( left_brother_key_num, right_brother_key_num, drill_info, drill_ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_left_right_brothers_info() returns 0x%x", err); } else if (left_brother_key_num > BT_HALF_FANOUT && left_brother_key_num >= right_brother_key_num) { if ((err = _mid_rebalance_left(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_rebalance_left() returns 0x%x", err); } } else if (right_brother_key_num > BT_HALF_FANOUT) { if ((err = _mid_rebalance_right(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_rebalance_right() returns 0x%x", err); } } else if (left_brother_key_num > 0) { if (right_brother_key_num > 0) { if ((err = _mid_merge_both(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_both() returns 0x%x", err); } } else { if ((err = _mid_merge_left(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_left() returns 0x%x", err); } } } else if (right_brother_key_num > 0) { if ((err = _mid_merge_right(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_right() returns 0x%x", err); } } else { //both left_brother_key_num and right_brother_key_num <= 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "both left_brother_key_num and right_brother_key_num <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } } else if (pmyself_node->get_subkey_num() > 1) { //节点未下溢或者是根节点且subkey_num>1，直接删除 mid_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->update_then_del_left( *pnew_myself_node, myself_ins_pos+1, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_then_del_left() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index...) returns 0x%x", err); } else { mutate_result.set_update_node_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } else { //根节点且subkey_num == 1 mutate_result.set_update_node_info(new_right_subnode_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_ins_pos=%d", drill_ptr, myself_ins_pos); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, pmyself_node=0x%p", myself_node_index, pmyself_node); DF_WRITE_LOG_US(log_level, "new_right_subnode_index=0x%lx", new_right_subnode_index); DF_WRITE_LOG_US(log_level, "mutate_result.get_update_type()=%d", mutate_result.get_update_type()); } return err; }; //功能：因子节点与左右兄弟合并而对本节点更新 //输入输入：mutate_result //返回：0 for success, other values for failure int dfs_btree_t::_op_mid_node_of_sub_merge_both( const dfs_btree_drill_t & drill_info, const int drill_ptr, dfs_btree_node_mutate_t & mutate_result) { uint64_t new_left_key_index = UNDEF_INDEX; uint64_t new_left_subnode_index = UNDEF_INDEX; uint64_t new_right_subnode_index = UNDEF_INDEX; uint64_t myself_node_index = UNDEF_INDEX; const mid_node_t * pmyself_node = NULL; uint32_t myself_ins_pos = UNDEF_POS; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = mutate_result.get_merge_both_info( new_left_key_index, new_left_subnode_index, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mutate_result.get_merge_both_info() returns 0x%x", err); } else if (drill_ptr < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_ptr < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else if ((myself_ins_pos = drill_info.get_ins_pos(drill_ptr)) == UNDEF_POS) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos == UNDEF_POS"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } else if ((myself_node_index = drill_info.get_node_index(drill_ptr)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_node_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_NODE_INDEX); } else if ((err = _get_mid_node(myself_node_index, &pmyself_node)) != 0 || NULL == pmyself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(myself_node_index...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (myself_ins_pos <= 0 || (myself_ins_pos+1) > pmyself_node->get_subkey_num()) { //at least one left brother and one right brother log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "myself_ins_pos <= 0 || (...+1) > pmyself_node->get_subkey_num()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_INS_POS); } //不能用原子操作一次更新，必须copy-on-write else if (pmyself_node->get_subkey_num() <= BT_HALF_FANOUT && drill_ptr > 0) { //节点下溢，需要与左兄弟或右兄弟平衡或合并 uint32_t left_brother_key_num = 0; uint32_t right_brother_key_num = 0; dfs_btree_mid_node_t super_node; if ((err = pmyself_node->update_both_sides_then_del_mid( super_node, myself_ins_pos, new_left_key_index, new_left_subnode_index, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_both_sides_then_del_mid() returns 0x%x", err); } else if ((err = _get_left_right_brothers_info( left_brother_key_num, right_brother_key_num, drill_info, drill_ptr)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_left_right_brothers_info() returns 0x%x", err); } else if (left_brother_key_num > BT_HALF_FANOUT && left_brother_key_num >= right_brother_key_num) { if ((err = _mid_rebalance_left(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_rebalance_left() returns 0x%x", err); } } else if (right_brother_key_num > BT_HALF_FANOUT) { if ((err = _mid_rebalance_right(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_rebalance_right() returns 0x%x", err); } } else if (left_brother_key_num > 0) { if (right_brother_key_num > 0) { if ((err = _mid_merge_both(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_both() returns 0x%x", err); } } else { if ((err = _mid_merge_left(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_left() returns 0x%x", err); } } } else if (right_brother_key_num > 0) { if ((err = _mid_merge_right(super_node, drill_info, drill_ptr, mutate_result)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_mid_merge_right() returns 0x%x", err); } } else { //both left_brother_key_num and right_brother_key_num <= 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "both left_brother_key_num and right_brother_key_num <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "left_brother_key_num=%d, right_brother_key_num=%d", left_brother_key_num, right_brother_key_num); } } else { //节点未下溢，直接删除 mid_node_t * pnew_myself_node = NULL; uint64_t new_myself_node_index = UNDEF_INDEX; if ((err = _acquire_mid_node(new_myself_node_index, &pnew_myself_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(new_myself_node_index...) returns 0x%x", err); } else if (UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == new_myself_node_index || NULL == pnew_myself_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmyself_node->update_both_sides_then_del_mid( *pnew_myself_node, myself_ins_pos, new_left_key_index, new_left_subnode_index, new_right_subnode_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmyself_node->update_then_del_left() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(new_myself_node_index)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(new_myself_node_index) returns 0x%x", err); } else { mutate_result.set_update_node_info(new_myself_node_index); err = 0; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "new_myself_node_index=0x%lx, pnew_myself_node=0x%p", new_myself_node_index, pnew_myself_node); } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "drill_ptr=%d, myself_ins_pos=%d", drill_ptr, myself_ins_pos); DF_WRITE_LOG_US(log_level, "myself_node_index=0x%lx, pmyself_node=0x%p", myself_node_index, pmyself_node); DF_WRITE_LOG_US(log_level, "new_left_key_index=0x%lx, new_left_subnode_index=0x%lx", new_left_key_index, new_left_subnode_index); DF_WRITE_LOG_US(log_level, "new_right_subnode_index=0x%lx", new_right_subnode_index); DF_WRITE_LOG_US(log_level, "mutate_result.get_update_type()=%d", mutate_result.get_update_type()); } return err; }; //按照index来检索... int dfs_btree_t::_search_by_index( const dfs_bt_root_t & bt_root, const uint64_t i_obj_index, dfs_btree_drill_t & drill_info, uint64_t & o_obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); uint64_t ref_counter = UNDEF_REF_COUNTER; uint64_t tag_obj_index = UNDEF_INDEX; int log_level = DF_UL_LOG_NONE; int err = 0; //此处不能初始化：为了避免src_index与obj_index其实是同一变量，搜索的目的是为了获得drill_info //obj_index = UNDEF_INDEX; drill_info.init(); if (sbt_root.get_root_node_index() == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.get_root_node_index() == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if ((err = _get_node_ref_counter(sbt_root.get_root_node_index(), ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node_ref_counter() returns 0x%x", err); } else if (ref_counter <= 0 || UNDEF_REF_COUNTER == ref_counter) { //检查一下refer count... log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ref_counter <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_REF_COUNTER); } else if ((err = _search_subtree_by_index( bt_root, sbt_root.get_root_node_index(), i_obj_index, drill_info, tag_obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_subtree() returns 0x%x", err); } else if (drill_info.get_drill_ptr() < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_drill_ptr() < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } else { //检索到的tag给o.. o_obj_index = tag_obj_index; } //mutation_counter is used to check the validness of the drill_info, //mutation counter来保证drill info和sbt_root一致... drill_info.set_btree_mutation_counter(sbt_root.get_mutation_counter()); if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "i_obj_index=0x%lx, ref_counter=%ld, drill_ptr=%d", i_obj_index, ref_counter, drill_info.get_drill_ptr()); } return err; }; int dfs_btree_t::_search_by_obj( const dfs_bt_root_t & bt_root, const void * pobj, //may not in the tree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); uint64_t ref_counter = UNDEF_REF_COUNTER; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; drill_info.init(); if (sbt_root.get_root_node_index() == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.get_root_node_index() == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if ((err = _get_node_ref_counter(sbt_root.get_root_node_index(), ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node_ref_counter() returns 0x%x", err); } else if (ref_counter <= 0 || UNDEF_REF_COUNTER == ref_counter) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ref_counter <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_REF_COUNTER); } else if ((err = _search_subtree_by_obj( bt_root, sbt_root.get_root_node_index(), pobj, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_subtree() returns 0x%x", err); } else if (drill_info.get_drill_ptr() < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_drill_ptr() < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } //mutation_counter is used to check the validness of the drill_info, drill_info.set_btree_mutation_counter(sbt_root.get_mutation_counter()); if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "pobj=0x%p, ref_counter=%ld, drill_ptr=%d", pobj, ref_counter, drill_info.get_drill_ptr()); } return err; }; int dfs_btree_t::_search_by_key( const dfs_bt_root_t & bt_root, const void * pkey, //may not in the tree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); uint64_t ref_counter = UNDEF_REF_COUNTER; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; drill_info.init(); if (sbt_root.get_root_node_index() == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.get_root_node_index() == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if ((err = _get_node_ref_counter(sbt_root.get_root_node_index(), ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node_ref_counter() returns 0x%x", err); } else if (ref_counter <= 0 || UNDEF_REF_COUNTER == ref_counter) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "ref_counter <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_REF_COUNTER); } else if ((err = _search_subtree_by_key( bt_root, sbt_root.get_root_node_index(), pkey, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_subtree() returns 0x%x", err); } else if (drill_info.get_drill_ptr() < 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "drill_info.get_drill_ptr() < 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_DRILL_POS); } //mutation_counter is used to check the validness of the drill_info, drill_info.set_btree_mutation_counter(sbt_root.get_mutation_counter()); if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "pkey=0x%lx, ref_counter=%ld, drill_ptr=%d", (uint64_t)pkey, ref_counter, drill_info.get_drill_ptr()); } return err; }; // 功能：搜索某个子树，结果追加到drill_info中 // 如果该元素存在，则drill_info中信息指向它，否则指向它插入后的位置。 // return: 0 for success, other values for error int dfs_btree_t::_search_subtree_by_index( const dfs_bt_root_t & bt_root, const uint64_t subtree_root, const uint64_t src_index, //may not in the tree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { uint64_t cur_subtree_root = subtree_root; const mid_node_t * pmid_node = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; while (UNDEF_INDEX == obj_index) { //搜索结构自动追加到drill_info if ((err = _search_node_by_index( bt_root, cur_subtree_root, src_index, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_node() returns 0x%x", err); break; } else if (UNDEF_INDEX == obj_index && _is_mid_node(cur_subtree_root)) { //not found & is_mid_node if ((err = _get_mid_node(cur_subtree_root, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); break; } //需要在这个sub index下面继续find... else if ((cur_subtree_root = pmid_node->get_subnode_index(drill_info.get_last_ins_pos())) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->get_subnode_index() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "last_ins_pos=%d; get_subkey_num()=%d", drill_info.get_last_ins_pos(), pmid_node->get_subkey_num()); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); break; } } else { //叶子节点或者是found... //found or leaf node break; } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "src_index=0x%lx, subtree_root=0x%lx, drill_ptr=%d", src_index, subtree_root, drill_info.get_drill_ptr()); } return err; }; int dfs_btree_t::_search_subtree_by_obj( const dfs_bt_root_t & bt_root, const uint64_t subtree_root, const void * pobj, //may not in the tree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { uint64_t cur_subtree_root = subtree_root; const mid_node_t * pmid_node = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; while (UNDEF_INDEX == obj_index) { //搜索结构自动追加到drill_info if ((err = _search_node_by_obj(bt_root, cur_subtree_root, pobj, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_node() returns 0x%x", err); break; } else if (UNDEF_INDEX == obj_index && _is_mid_node(cur_subtree_root)) { //not found & is_mid_node if ((err = _get_mid_node(cur_subtree_root, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); break; } else if ((cur_subtree_root = pmid_node->get_subnode_index(drill_info.get_last_ins_pos())) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->get_subnode_index() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "last_ins_pos=%d; get_subkey_num()=%d", drill_info.get_last_ins_pos(), pmid_node->get_subkey_num()); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); break; } } else { //found or leaf node break; } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "pobj=0x%p, subtree_root=0x%lx", pobj, subtree_root); DF_WRITE_LOG_US(log_level, "cur_subtree_root=0x%lx, drill_ptr=%d", cur_subtree_root, drill_info.get_drill_ptr()); } return err; }; int dfs_btree_t::_search_subtree_by_key( const dfs_bt_root_t & bt_root, const uint64_t subtree_root, const void * pkey, //may not in the tree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { uint64_t cur_subtree_root = subtree_root; const mid_node_t * pmid_node = NULL; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; while (UNDEF_INDEX == obj_index) { //搜索结构自动追加到drill_info if ((err = _search_node_by_key(bt_root, cur_subtree_root, pkey, drill_info, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_search_node() returns 0x%x", err); break; } else if (UNDEF_INDEX == obj_index && _is_mid_node(cur_subtree_root)) { //not found & is_mid_node if ((err = _get_mid_node(cur_subtree_root, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); break; } else if ((cur_subtree_root = pmid_node->get_subnode_index(drill_info.get_last_ins_pos())) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->get_subnode_index() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "last_ins_pos=%d; get_subkey_num()=%d", drill_info.get_last_ins_pos(), pmid_node->get_subkey_num()); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_INDEX); break; } } else { //found or leaf node break; } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "subtree_root=0x%lx, pkey=0x%p", subtree_root, pkey); DF_WRITE_LOG_US(log_level, "cur_subtree_root=0x%lx, drill_ptr=%d", cur_subtree_root, drill_info.get_drill_ptr()); } return err; }; //搜索B树的一个节点，结果加入到drill_info中 //return: 0 for success, other values for error int dfs_btree_t::_search_node_by_index( const dfs_bt_root_t & bt_root, const uint64_t node_index, const uint64_t src_index, //may not in the tree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const node_base_t * pnode = NULL; int32_t ins_pos = 0; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if ((err = _get_node(node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = vir_search_ary_by_index( bt_root, pnode->get_subkey_ary(), pnode->get_subkey_num(), src_index, ins_pos, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_search_ary_by_index() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "subkey_num=%d", pnode->get_subkey_num()); } else { drill_info.push(ins_pos, node_index); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, src_index=0x%lx", node_index, src_index); DF_WRITE_LOG_US(log_level, "ins_pos=%d, pnode=0x%p", ins_pos, pnode); } return err; }; int dfs_btree_t::_search_node_by_obj( const dfs_bt_root_t & bt_root, const uint64_t node_index, const void * pobj, //may not in the tree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const node_base_t * pnode = NULL; int32_t ins_pos = 0; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if ((err = _get_node(node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = vir_search_ary_by_obj( bt_root, pnode->get_subkey_ary(), pnode->get_subkey_num(), pobj, ins_pos, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_search_ary_by_key() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "subkey_num=%d", pnode->get_subkey_num()); } else { drill_info.push(ins_pos, node_index); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, pobj=0x%p", node_index, pobj); DF_WRITE_LOG_US(log_level, "ins_pos=%d, pnode=0x%p", ins_pos, pnode); } return err; }; int dfs_btree_t::_search_node_by_key( const dfs_bt_root_t & bt_root, const uint64_t node_index, const void * pkey, //may not in the tree dfs_btree_drill_t & drill_info, uint64_t & obj_index) const { const node_base_t * pnode = NULL; int32_t ins_pos = 0; int log_level = DF_UL_LOG_NONE; int err = 0; obj_index = UNDEF_INDEX; if ((err = _get_node(node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if ((err = vir_search_ary_by_key( bt_root, pnode->get_subkey_ary(), pnode->get_subkey_num(), pkey, ins_pos, obj_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_search_ary_by_key() returns 0x%x", err); DF_WRITE_LOG_US(log_level, "subkey_num=%d", pnode->get_subkey_num()); } else { drill_info.push(ins_pos, node_index); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, pkey=0x%p", node_index, pkey); DF_WRITE_LOG_US(log_level, "ins_pos=%d, pnode=0x%p", ins_pos, pnode); } return err; }; //功能：验证某个子树的顺序和每个节点分支个数 //输入：subtree_root：子树根节点 // left_brother_key_index：子树的左兄弟，如果不等于UNDEF_INDEX，则<=子树的所有项 // right_brother_key_index：子树的右兄弟，如果不等于UNDEF_INDEX，则>=子树的所有项 //返回：返回0如果验证通过，返回非0(错误代码)如果验证失败 int dfs_btree_t::_verify_subtree( const dfs_bt_root_t & bt_root, const uint64_t /*father_mutation_counter*/, const uint64_t subtree_root, const uint64_t left_brother_key_index, const uint64_t right_brother_key_index) const { uint64_t key_index_ary[BT_FANOUT+2]; const node_base_t * pnode = NULL; uint64_t mutation_counter = 0; bool is_inc_order = false; uint32_t j = 0; uint32_t j1 = (UNDEF_INDEX != left_brother_key_index) ? 0 : 1; uint32_t j2 = (UNDEF_INDEX != right_brother_key_index) ? 0 : 1; uint32_t n = 0; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _get_node(subtree_root, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (pnode->get_subkey_num() > (BT_FANOUT-1)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnode->get_subkey_num() > (BT_FANOUT-1)"); DF_WRITE_LOG_US(log_level, "pnode->get_subkey_num()=%d", pnode->get_subkey_num()); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_OVERFLOW); } else if (pnode->get_subkey_num() < (BT_FANOUT-1)/2 && (UNDEF_INDEX != left_brother_key_index || UNDEF_INDEX != right_brother_key_index)) { //none-root node should owns at least this number of keys. log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnode->get_subkey_num() < (BT_FANOUT-1)/2 && ..."); DF_WRITE_LOG_US(log_level, "pnode->get_subkey_num()=%d", pnode->get_subkey_num()); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_UNDERFLOW); } else { j = 0; key_index_ary[j++] = left_brother_key_index; if ((err = pnode->get_subkeys(key_index_ary+j, df_len_of_ary(key_index_ary)-j)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pnode->get_subkeys() returns 0x%x", err); } else { j += pnode->get_subkey_num(); key_index_ary[j++] = right_brother_key_index; j2 = j - j2; } mutation_counter = pnode->get_mutation_counter(); if (0 == err) { if ((err = vir_verify_index_ary( bt_root, key_index_ary+j1, j2-j1, is_inc_order)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_verify_index_ary() returns 0x%x", err); } //同时判断是否为升序... else if (!is_inc_order) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "!is_from_s_to_l"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_ORDER); } } if (0 == err && _is_mid_node(subtree_root)) { const mid_node_t * pmid_node = NULL; uint64_t subnode_index = UNDEF_INDEX; if ((err = _get_mid_node(subtree_root, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(subtree_root...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { n = pnode->get_subkey_num()+1; for (j = 0; j < n; ++j) { if ((subnode_index = pmid_node->get_subnode_index(j)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subnode_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); break; } else if (_is_leaf_node(pmid_node->get_subnode_index(0)) && !_is_leaf_node(subnode_index)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_is_leaf_node(subnode_index[0]) && !_is_leaf_node(subnode_index)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_HETEROGENEOUS_MID_NODE); break; } else if (_is_mid_node(pmid_node->get_subnode_index(0)) && !_is_mid_node(subnode_index)) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_is_mid_node(subnode_index[0]) && !_is_mid_node(subnode_index)"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_HETEROGENEOUS_MID_NODE); break; } else if ((err = _verify_subtree( bt_root, mutation_counter, subnode_index, key_index_ary[j], key_index_ary[j+1])) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_verify_subtree() returns 0x%x", err); break; } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "subnode_index=0x%lx, pmid_node=0x%p", subnode_index, pmid_node); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "subtree_root=0x%lx, left_brother_key_index=0x%lx, right_brother_key_index=0x%lx", subtree_root, left_brother_key_index, right_brother_key_index); DF_WRITE_LOG_US(log_level, "pnode=0x%lx, father_mutation_counter=%lu, mutation_counter=%lu", (uint64_t)pnode, father_mutation_counter, mutation_counter); DF_WRITE_LOG_US(log_level, "is_inc_order=%d, j=%d, j1=%d, j2=%d, n=%d", is_inc_order, j, j1, j2, n); BT_DF_WRITE_LOG_INT64S(log_level, "key_index_ary", key_index_ary, df_len_of_ary(key_index_ary)); } return err; }; // 功能：验证整个树的顺序和每个节点分支个数 // 返回：返回0如果验证通过，返回非0(错误代码)如果验证失败 int dfs_btree_t::bt_verify_tree(const dfs_bt_root_t & bt_root) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _verify_subtree( bt_root, sbt_root.get_mutation_counter(), sbt_root.get_root_node_index(), UNDEF_INDEX, UNDEF_INDEX)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_verify_subtree() returns 0x%x", err); } //else if ((err = _set_max_verified_mutaiont_counter(sbt_root.get_mutation_counter())) != 0) //{ // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "_set_max_verified_mutaiont_counter() returns 0x%x", err); //} if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); } return err; }; //Return: 0 for success, other values for error int dfs_btree_t::_get_subtree_total_num( const uint64_t subtree_root, uint64_t & total_key_num, uint64_t & total_leaf_node_num, uint64_t & total_mid_node_num) const { const leaf_node_t * pleaf_node = NULL; const mid_node_t * pmid_node = NULL; uint64_t subnode_index = UNDEF_INDEX; uint32_t n = 0; uint32_t j = 0; int log_level = DF_UL_LOG_NONE; int err = 0; if (_is_mid_node(subtree_root)) { if ((err = _get_mid_node(subtree_root, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node(subtree_root...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { total_key_num += pmid_node->get_subkey_num(); n = pmid_node->get_subkey_num()+1; for (j = 0; j < n; ++j) { if ((subnode_index = pmid_node->get_subnode_index(j)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subnode_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); break; } else if ((err = _get_subtree_total_num( subnode_index, total_key_num, total_leaf_node_num, total_mid_node_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_subtree_total_num() returns 0x%x", err); break; } } } ++total_mid_node_num; } else { //leaf node if ((err = _get_leaf_node(subtree_root, &pleaf_node)) != 0 || NULL == pleaf_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_leaf_node(subtree_root...) returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { total_key_num += pleaf_node->get_subkey_num(); } ++total_leaf_node_num; } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "subtree_root=0x%lx, subnode_index=0x%lx", subtree_root, subnode_index); DF_WRITE_LOG_US(log_level, "total_key_num=%ld, total_leaf_node_num=%ld, total_mid_node_num=%ld", total_key_num, total_leaf_node_num, total_mid_node_num); DF_WRITE_LOG_US(log_level, "pleaf_node=0x%p, pleaf_node=0x%p", pleaf_node, pleaf_node); DF_WRITE_LOG_US(log_level, "j=%d, n=%d", j, n); } return err; }; int dfs_btree_t::bt_get_total_num( const dfs_bt_root_t & bt_root, uint64_t & total_key_num, uint64_t & total_leaf_node_num, uint64_t & total_mid_node_num) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); int log_level = DF_UL_LOG_NONE; int err = 0; total_key_num = 0; total_leaf_node_num = 0; total_mid_node_num = 0; if (UNDEF_INDEX == sbt_root.get_root_node_index()) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == sbt_root.get_root_node_index()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if ((err = _get_subtree_total_num( sbt_root.get_root_node_index(), total_key_num, total_leaf_node_num, total_mid_node_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_subtree_total_num() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "total_key_num=%ld, total_leaf_node_num=%ld, total_mid_node_num=%ld", total_key_num, total_leaf_node_num, total_mid_node_num); } return err; }; int dfs_btree_t::bt_get_in_use_node_num_in_2d_ary( uint64_t & in_use_leaf_node_num, uint64_t & in_use_mid_node_num) const { int log_level = DF_UL_LOG_NONE; int err = 0; int err1 = 0; if ((err1 = leaf_ary_t::get_in_use_num(in_use_leaf_node_num)) != 0) { err = err1; log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "leaf_ary_t::get_in_use_num() returns 0x%x", err); } if ((err1 = mid_ary_t::get_in_use_num(in_use_mid_node_num)) != 0) { err = err1; log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "mid_ary_t::get_in_use_num() returns 0x%x", err); } return err; }; // //should be called in locked state //int dfs_btree_t::_bt_set_ckp_state(const uint32_t ckp_state) //{ // uint64_t ckp_root_index = UNDEF_INDEX; // uint64_t ckp_mutation_counter = 0; // dfs_bt_root_t bt_root; // int log_level = DF_UL_LOG_NONE; // int err = 0; // int err1 = 0; // // ckp_root_index = _ckp_sbt_root.get_root_node_index(); // ckp_mutation_counter = _ckp_sbt_root.get_mutation_counter(); // switch ((_ckp_state<<4) | (ckp_state & 0xf)) // { // case ((BT_CKP_STATE_OFF<<4)|BT_CKP_STATE_OFF ) : // //do nothing // break; // case ((BT_CKP_STATE_OFF<<4)|BT_CKP_STATE_ON ) : // //_inc_mutation_counter(); // if (UNDEF_INDEX != ckp_root_index || ckp_mutation_counter > 0) // { // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_CKP_ROOT); // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, ERRINFO_BT_CKP_ROOT); // } // //串行读写时候禁止设置checkpoint // else if (_get_serial_read_write_state()) // { // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_CKP_SERIAL_READ_WRITE); // log_level = DF_UL_LOG_NOTICE; // DF_WRITE_LOG_US(log_level, ERRINFO_BT_CKP_SERIAL_READ_WRITE); // } // //cow ==> copy-on-write // else if ((err = _bt_set_ckp_root()) != 0) // { // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "_bt_set_ckp_root() returns 0x%x", err); // } // else // { // df_atomic_exchange(&_ckp_state, ckp_state); // }; // break; // case ((BT_CKP_STATE_OFF<<4 )|BT_CKP_STATE_LOADING ) : // //_inc_mutation_counter(); // df_atomic_exchange(&_ckp_state, ckp_state); // break; // case ((BT_CKP_STATE_ON <<4)|BT_CKP_STATE_STORING ) : // // ckp_set => storing // //_inc_mutation_counter(); // df_atomic_exchange(&_ckp_state, ckp_state); // break; // case ((BT_CKP_STATE_ON <<4)|BT_CKP_STATE_OFF ) : // if (UNDEF_INDEX == ckp_root_index || ckp_mutation_counter <= 0) // { // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_CKP_ROOT); // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, ERRINFO_BT_CKP_ROOT); // } // else if ((err = _bt_xchg_ckp_root(bt_root)) = 0) // { // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "_bt_xchg_ckp_root() returns 0x%x", err); // } // //cow ==> copy-on-write // else if ((err = _bt_remove_cow(bt_root)) != 0) // { // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "_bt_remove_cow() returns 0x%x", err); // } // else // { // df_atomic_exchange(&_ckp_state, ckp_state); // }; // break; // case ((BT_CKP_STATE_STORING<<4)|BT_CKP_STATE_OFF ) : // df_atomic_exchange(&_ckp_state, ckp_state); // break; // case ((BT_CKP_STATE_LOADING <<4)|BT_CKP_STATE_OFF ) : // //取消loading时设置_ckp_mutation_counter为0 // df_atomic_exchange(&_ckp_state, ckp_state); // break; // case ((BT_CKP_STATE_ON <<4)|BT_CKP_STATE_ON ) : // case ((BT_CKP_STATE_ON <<4)|BT_CKP_STATE_LOADING ) : // case ((BT_CKP_STATE_STORING <<4)|BT_CKP_STATE_ON ) : // case ((BT_CKP_STATE_LOADING <<4)|BT_CKP_STATE_ON ) : // //先取消，再设置ckp // if ((err1 = _bt_set_ckp_state(BT_CKP_STATE_OFF)) != 0) // { // err = err1; // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "_bt_set_ckp_state(BT_CKP_STATE_OFF) returns 0x%x", err); // } // if ((err1 = _bt_set_ckp_state(ckp_state)) != 0) // { // err = err1; // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, "_bt_set_ckp_state(ckp_state) returns 0x%x", err); // } // break; // case ((BT_CKP_STATE_STORING <<4)|BT_CKP_STATE_STORING ) : // case ((BT_CKP_STATE_STORING <<4)|BT_CKP_STATE_LOADING ) : // case ((BT_CKP_STATE_LOADING <<4)|BT_CKP_STATE_LOADING ) : // case ((BT_CKP_STATE_LOADING <<4)|BT_CKP_STATE_STORING ) : // case ((BT_CKP_STATE_OFF<<4)|BT_CKP_STATE_STORING ) : // default: // //error state // err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_CKP_STATE); // log_level = DF_UL_LOG_FATAL; // DF_WRITE_LOG_US(log_level, ERRINFO_BT_CKP_STATE); // break; // } // // if (DF_UL_LOG_NONE != log_level) // { // DF_WRITE_LOG_US(log_level, // "ckp_root_index/ckp_mutation_counter=0x%lx/%lu", // ckp_root_index, ckp_mutation_counter); // DF_WRITE_LOG_US(log_level, // "_ckp_state=%d, ckp_state=%d", // _ckp_state, ckp_state); // } // // return err; //}; //store all contents of a tree to file int dfs_btree_t::_bt_store_tree( const dfs_bt_root_t & bt_root, dfs_btree_store_info_t & store_info, dfs_btree_fhead_t & btree_fhead) const { const dfs_sbt_root_t & sbt_root = _bt_get_sbt_root(bt_root); const node_base_t * pnode = NULL; int64_t file_head_offset = 0; int log_level = DF_UL_LOG_NONE; int err = 0; log_level = this->CKP_LOG_LEVEL; memset(&btree_fhead, 0, sizeof(btree_fhead)); store_info.init_counters(); if (UNDEF_INDEX == sbt_root.get_root_node_index()) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == sbt_root.get_root_node_index()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_INVALID_INDEX); } else if ((err = _get_node(sbt_root.get_root_node_index(), &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } //空的树也要保存文件后和节点信息 else { //if (pnode->get_subkey_num() >= 0) //首先写头... //保存一下是在什么位置上面改写的:).. if ((err = _store_fhead(store_info, file_head_offset, btree_fhead)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_store_fhead() returns 0x%x", err); } else { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); //然后保存子树... if ((err = _store_subtree(sbt_root.get_root_node_index(), store_info)) != 0) { log_level = (ERRNO_BT_CKP_CANCELLED == err) ? DF_UL_LOG_NOTICE : DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_store_subtree() returns 0x%x", err); } //然后往store_info里面进行padding. else if ((err = store_info.padding()) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "store_info.padding() returns 0x%x", err); } } if (0 == err) { //然后更新一下btree头把..:).. if ((err = _update_stored_fhead(store_info, file_head_offset, btree_fhead)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_update_stored_fhead() returns 0x%x", err); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "root_index=0x%lx, mutation_counter=%lu", sbt_root.get_root_node_index(), sbt_root.get_mutation_counter()); DF_WRITE_LOG_US(log_level, "file_head_offset=%ld", file_head_offset); if (NULL != pnode) { DF_WRITE_LOG_US(log_level, "pnode->get_subkey_num()=%d", pnode->get_subkey_num()); } } return err; }; // int dfs_btree_t::_bt_load_tree( dfs_bt_root_t & new_wr_bt_root, dfs_btree_load_info_t & load_info, dfs_btree_fhead_t & btree_fhead) { dfs_sbt_root_t sbt_root = _bt_get_sbt_root(new_wr_bt_root); uint64_t tmp_root_index = UNDEF_INDEX; uint64_t new_root_index = UNDEF_INDEX; int64_t file_head_offset = 0; int log_level = DF_UL_LOG_NONE; int err = 0; log_level = this->CKP_LOG_LEVEL; memset(&btree_fhead, 0, sizeof(btree_fhead)); if ((err = _load_fhead(load_info, file_head_offset, btree_fhead)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_load_fhead() returns 0x%x", err); } //会得到load info的index...:).. else if ((err = _load_subtree(new_root_index, load_info)) != 0) { log_level = (ERRNO_BT_CKP_CANCELLED == err) ? DF_UL_LOG_NOTICE : DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_load_subtree() returns 0x%x", err); } else if (0 != load_info.get_total_leaf_node_num() || 0 != load_info.get_total_mid_node_num() || 0 != load_info.get_total_key_num()) { err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LOAD_KEY_NODE_NUM); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, ERRINFO_BT_LOAD_KEY_NODE_NUM); } else if ((err = load_info.file_seek(file_head_offset+btree_fhead.total_data_len)) != 0) { //move the file to the correct position log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "load_info.file_seek() returns 0x%x", err); } if (0 == err) { if ((err = sbt_root.set_root_node_index(tmp_root_index, new_root_index)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "sbt_root.set_root_node_index() returns 0x%x", err); } else { sbt_root.set_mutation_counter(_bt_get_mutation_counter()); if ((err = _bt_set_sbt_root(new_wr_bt_root, sbt_root)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_bt_set_sbt_root() returns 0x%x", err); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "tmp_root_index=0x%lx, new_root_index=0x%lx, file_head_offset=0x%lx", tmp_root_index, new_root_index, file_head_offset); DF_WRITE_LOG_US(log_level, "leaf_node_num=%ld, mid_node_num=%ld, key_num=%ld", load_info.get_total_leaf_node_num(), load_info.get_total_mid_node_num(), load_info.get_total_key_num()); } return err; }; //store all contents of a subtree to file int dfs_btree_t::_store_subtree( const uint64_t subtree_root, dfs_btree_store_info_t & store_info) const { const mid_node_t * pmid_node = NULL; uint64_t subnode_index = UNDEF_INDEX; uint32_t subnode_num = 0; uint32_t subnode_pos = 0; int log_level = DF_UL_LOG_NONE; int err = 0; //在checkpointing过程中，一旦检测到_ckp_state变化，则中止该checkpointing。 if (_bt_is_cancel_checkpointing()) { log_level = DF_UL_LOG_NOTICE; DF_WRITE_LOG_US(log_level, "storing checkpointing cancelled"); err = DF_BT_SET_NORMAL_ERR(ERRNO_BT_CKP_CANCELLED); } else if ((err = _store_subkeys(subtree_root, store_info)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_store_subkeys() returns 0x%x", err); } else if (_is_mid_node(subtree_root)) { if ((err = _get_mid_node(subtree_root, &pmid_node)) != 0 || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_mid_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else if (pmid_node->get_subkey_num() <= 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->get_subkey_num() <= 0"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_NUM); } else { subnode_num = pmid_node->get_subkey_num()+1; for (subnode_pos = 0; subnode_pos < subnode_num; ++subnode_pos) { if ((subnode_index = pmid_node->get_subnode_index(subnode_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subnode_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBNODE_INDEX); break; } else if ((err = _store_subtree(subnode_index, store_info)) != 0) { log_level = (ERRNO_BT_CKP_CANCELLED == err) ? DF_UL_LOG_NOTICE : DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_store_subtree() returns 0x%x", err); break; } } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "subtree_root=0x%lx, subnode_index=0x%lx", subtree_root, subnode_index); DF_WRITE_LOG_US(log_level, "subnode_num=%d, subnode_pos=%d", subnode_num, subnode_pos); if (NULL != pmid_node) { DF_WRITE_LOG_US(log_level, "pmid_node->get_subkey_num()=%d", pmid_node->get_subkey_num()); } } return err; }; //load all contents of a subtree to file int dfs_btree_t::_load_subtree( uint64_t & subtree_root, dfs_btree_load_info_t & load_info) { uint64_t subkey_index_ary[BT_FANOUT-1]; uint64_t subnode_index_ary[BT_FANOUT]; uint64_t ref_counter = UNDEF_REF_COUNTER; uint32_t subkey_num = 0; uint32_t subnode_pos = 0; uint32_t j = 0; bool is_mid_node = false; int log_level = DF_UL_LOG_NONE; int err = 0; int err1 = 0; subtree_root = UNDEF_INDEX; //在checkpointing过程中，一旦检测到_ckp_state变化，则中止该checkpointing。 if (_bt_is_cancel_checkpointing()) { log_level = DF_UL_LOG_NOTICE; DF_WRITE_LOG_US(log_level, "loading checkpointing cancelled"); err = DF_BT_SET_NORMAL_ERR(ERRNO_BT_CKP_CANCELLED); } else if ((err = _load_subkeys( subkey_index_ary, df_len_of_ary(subkey_index_ary), subkey_num, is_mid_node, load_info)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_load_subkeys() returns 0x%x", err); } else if (is_mid_node) { for (subnode_pos = 0; subnode_pos <= subkey_num; ++subnode_pos) { if ((err = _load_subtree( subnode_index_ary[subnode_pos], load_info)) != 0) { log_level = (ERRNO_BT_CKP_CANCELLED == err) ? DF_UL_LOG_NOTICE : DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_load_subtree() returns 0x%x", err); //如果出现错误，则已经生成的obj对象需要回收 //如果不保存INDEX的话,那么需要释放...:)..... //???what does it means..??; if (load_info.get_store_t_type() != dfs_btree_load_info_t::STORE_T_INDEX) { //先+1引用计数，再-1引用计数，这导致对象回收 if ((err1 = vir_inc_obj_ary_ref_counter(subkey_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_inc_obj_ary_ref_counter() returns 0x%x", err1); } else if ((err1 = vir_dec_obj_ary_ref_counter(subkey_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_dec_obj_ary_ref_counter() returns 0x%x", err1); } } //已经生成的子树也需要回收 for (j = 0; j < subnode_pos; ++j) { //先+1引用计数，再-1引用计数，这导致对象回收 if ((err1 = _inc_node_ref_counter(subnode_index_ary[j], ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_node_ref_counter() returns 0x%x", err1); } else if ((err1 = _dec_node_ref_counter(subnode_index_ary[j], ref_counter)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_dec_node_ref_counter() returns 0x%x", err1); } } break; } } if (0 == err) { mid_node_t * pmid_node = NULL; if ((err = _acquire_mid_node(subtree_root, &pmid_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_mid_node(subtree_root...) returns 0x%x", err); } else if (UNDEF_INDEX == subtree_root || NULL == pmid_node) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == subtree_root || NULL == pmid_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pmid_node->put_pairs( subkey_index_ary, subnode_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pmid_node->put_pairs() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(subtree_root)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(subtree_root) returns 0x%x", err); } } load_info.dec_total_mid_node_num(); } else { //leaf node leaf_node_t * pleaf_node = NULL; if ((err = _acquire_leaf_node(subtree_root, &pleaf_node)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_acquire_leaf_node(subtree_root...) returns 0x%x", err); } else if (UNDEF_INDEX == subtree_root || NULL == pleaf_node) { //leaf_node: 保留unit 0 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "UNDEF_INDEX == subtree_root || NULL == pleaf_node"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LEAF_NODE_ACQUIRE); } else if ((err = pleaf_node->put_subkeys(subkey_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "pleaf_node->put_subkeys() returns 0x%x", err); } else if ((err = _inc_pointed_ref_counter(subtree_root)) != 0) { //由该新节点导致的引用计数增加 log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_inc_pointed_ref_counter(subtree_root) returns 0x%x", err); } load_info.dec_total_leaf_node_num(); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "subtree_root=0x%lx", subtree_root); DF_WRITE_LOG_US(log_level, "subkey_num=%d, subnode_pos=%d, is_mid_node=%d", subkey_num, subnode_pos, is_mid_node); BT_DF_WRITE_LOG_INT64S(log_level, "subkey_index_ary", subkey_index_ary, subkey_num); BT_DF_WRITE_LOG_INT64S(log_level, "subnode_index_ary", subnode_index_ary, subkey_num+1); } return err; }; //store contents of all subkeys of a node to file int dfs_btree_t::_store_subkeys( const uint64_t node_index, dfs_btree_store_info_t & store_info) const { uint64_t num = 0; uint64_t obj_index = UNDEF_INDEX; uint64_t pre_data_pos = 0; const node_base_t * pnode = NULL; uint32_t subkey_num = 0; uint32_t subkey_pos = 0; int log_level = DF_UL_LOG_NONE; int err = 0; if ((err = _get_node(node_index, &pnode)) != 0 || NULL == pnode) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "_get_node() returns 0x%x", err); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_NODE_NULL_POINTER); } else { subkey_num = pnode->get_subkey_num(); num = subkey_num<<1; store_info.add_total_key_num(subkey_num); if (pnode->is_mid_node()) { num |= dfs_btree_fhead_t::ATTR_MIDNODE_FLAG; store_info.inc_total_mid_node_num(); } else { store_info.inc_total_leaf_node_num(); } //num有什么用...... if ((err = store_info.encode_num(num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "store_info.encode_num() returns 0x%x", err); } else { for (subkey_pos = 0; subkey_pos < subkey_num; ++subkey_pos) { if ((obj_index = pnode->get_subkey_index(subkey_pos)) == UNDEF_INDEX) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "obj_index == UNDEF_INDEX"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_KEY_INDEX); break; } else if ((err = vir_obj_store_size(obj_index, num, store_info)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_obj_store_size() returns 0x%x", err); break; } else if ((err = store_info.encode_data_len(num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "store_info.encode_data_len() returns 0x%x", err); break; } else { pre_data_pos = store_info.get_data_pos(); if ((err = vir_store_obj(obj_index, store_info)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_store_obj() returns 0x%x", err); break; } else if ((pre_data_pos+num) != store_info.get_data_pos()) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "(pre_data_pos+num) != store_info.get_data_pos()"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_STORE_POS); break; } } } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "node_index=0x%lx, obj_index=0x%lx", node_index, obj_index); DF_WRITE_LOG_US(log_level, "pre_data_pos=%ld, store_info.get_data_pos()=%ld", pre_data_pos, store_info.get_data_pos()); DF_WRITE_LOG_US(log_level, "subkey_num=%d, subkey_pos=%d, num=%ld", subkey_num, subkey_pos, num); } return err; }; //store contents of all subkeys of a node to file int dfs_btree_t::_load_subkeys( uint64_t * subkey_index_ary, const uint32_t ary_len, uint32_t & subkey_num, bool & is_mid_node, dfs_btree_load_info_t & load_info) { uint64_t num = 0; uint64_t pre_data_pos = 0; uint64_t obj_index = UNDEF_INDEX; uint32_t subkey_pos = 0; int log_level = DF_UL_LOG_NONE; int err = 0; int err1 = 0; subkey_num = 0; is_mid_node = false; //first the length if ((err = load_info.decode_num(num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "load_info.decode_num() returns 0x%x", err); } else { is_mid_node = ((num & dfs_btree_fhead_t::ATTR_MIDNODE_FLAG) != 0); //subkey_num是0是可能的：空的树 if ((subkey_num = (uint32_t)(num>>1)) > ary_len) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "subkey_num > ary_len"); err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_SUBKEY_NUM); } load_info.sub_total_key_num(subkey_num); } if (0 == err) { for (subkey_pos = 0; subkey_pos < subkey_num; ++subkey_pos) { obj_index = UNDEF_INDEX; if ((err = load_info.decode_data_len(num)) != 0) { //length of T log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "load_info.decode_data_len() returns 0x%x", err); break; } else { pre_data_pos = load_info.get_data_pos(); if ((err = vir_load_obj(obj_index, load_info)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_load_obj() returns 0x%x", err); break; } else if ((pre_data_pos+num) != load_info.get_data_pos()) { err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LOAD_POS); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, ERRINFO_BT_LOAD_POS); break; } } if (load_info.get_store_t_type() == dfs_btree_load_info_t::STORE_T_INDEX) { if ((err = load_info.get_kept_key_index(obj_index, subkey_index_ary[subkey_pos])) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "load_info.get_kept_key_index() returns 0x%x", err); break; } } else { subkey_index_ary[subkey_pos] = obj_index; if (load_info.get_store_t_type() == dfs_btree_load_info_t::STORE_T_VALUE_KEEP_T_INDEX) { if ((err = load_info.keep_obj_index(subkey_index_ary[subkey_pos])) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "load_info.keep_obj_index() returns 0x%x", err); break; } } } } //如果出现错误，则已经生成的obj对象需要回收 if (0 != err && load_info.get_store_t_type() != dfs_btree_load_info_t::STORE_T_INDEX) { if (UNDEF_INDEX != obj_index) { subkey_index_ary[subkey_pos++] = obj_index; } //先+1引用计数，再-1引用计数，这导致对象回收 if ((err1 = vir_inc_obj_ary_ref_counter(subkey_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_inc_obj_ary_ref_counter() returns 0x%x", err1); } else if ((err1 = vir_dec_obj_ary_ref_counter(subkey_index_ary, subkey_num)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "vir_dec_obj_ary_ref_counter() returns 0x%x", err1); } } } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "obj_index=0x%lx", obj_index); DF_WRITE_LOG_US(log_level, "pre_data_pos=%ld, load_info.get_data_pos()=%ld, num=%ld", pre_data_pos, load_info.get_data_pos(), num); DF_WRITE_LOG_US(log_level, "subkey_num=%d, subkey_pos=%d, ary_len=%d, is_mid_node=%d", subkey_num, subkey_pos, ary_len, is_mid_node); BT_DF_WRITE_LOG_INT64S(log_level, "subkey_index_ary", subkey_index_ary, subkey_num); } return err; }; //填写文件头.. int dfs_btree_t::_store_fhead( dfs_btree_store_info_t & store_info, int64_t & file_head_offset, dfs_btree_fhead_t & btree_fhead) const { int log_level = DF_UL_LOG_NONE; int err = 0; file_head_offset = store_info.get_cur_file_offset(); memset(&btree_fhead, 0, sizeof(btree_fhead)); //填写好btree fhead... btree_fhead.size = sizeof(btree_fhead); btree_fhead.ver = dfs_btree_fhead_t::CORE_BT_VER ; btree_fhead.major_tag = store_info.get_major_tag(); btree_fhead.minor_tag = dfs_btree_fhead_t::CORE_BT_TAG; btree_fhead.store_t_type = store_info.get_store_t_type(); if ((err = store_info.store_buf(&btree_fhead, sizeof(btree_fhead))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "store_info.store_buf() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "file_head_offset=%ld", file_head_offset); } return err; }; int dfs_btree_t::_update_stored_fhead( dfs_btree_store_info_t & store_info, const int64_t file_head_offset, dfs_btree_fhead_t & btree_fhead) const { int log_level = DF_UL_LOG_NONE; int err = 0; btree_fhead.total_data_len = store_info.get_cur_file_offset() - file_head_offset; btree_fhead.total_leaf_node_num = store_info.get_total_leaf_node_num() ; btree_fhead.total_mid_node_num = store_info.get_total_mid_node_num() ; btree_fhead.total_key_num = store_info.get_total_key_num() ; if ((err = store_info.rewrite_data(&btree_fhead, sizeof(btree_fhead), file_head_offset)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "store_info.rewrite_data() returns 0x%x", err); } if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "file_head_offset=%ld", file_head_offset); } return err; }; int dfs_btree_t::_load_fhead( dfs_btree_load_info_t & load_info, int64_t & file_head_offset, dfs_btree_fhead_t & btree_fhead) const { uint32_t unread_len = 0; const uint32_t unread_head = sizeof(dfs_btree_fhead_t)-sizeof(dfs_btree_fhead_base_t); int log_level = DF_UL_LOG_NONE; int err = 0; file_head_offset = load_info.get_cur_file_offset(); memset(&btree_fhead, 0, sizeof(btree_fhead)); //此时最大长度不知道，暂时设置为基本头的长度 load_info.set_max_file_offset(file_head_offset+sizeof(dfs_btree_fhead_base_t)); //加载基本头信息 if ((err = load_info.load_buf( (void *)((dfs_btree_fhead_base_t *)&btree_fhead), sizeof(dfs_btree_fhead_base_t))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, "load_info.load_buf(dfs_btree_fhead_base_t) returns 0x%x", err); } else if (load_info.get_major_tag() != btree_fhead.major_tag) { err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LOAD_MAJOR_TAG); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, ERRINFO_BT_LOAD_MAJOR_TAG); } else if (dfs_btree_fhead_t::CORE_BT_TAG != btree_fhead.minor_tag) { err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LOAD_MINOR_TAG); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, ERRINFO_BT_LOAD_MINOR_TAG); } else if (dfs_btree_fhead_t::CORE_BT_VER < btree_fhead.ver) { err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LOAD_HEAD_VER); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, ERRINFO_BT_LOAD_HEAD_VER); } else if (btree_fhead.size < sizeof(dfs_btree_fhead_base_t)) { err = DF_BT_SET_INTERNAL_ERR(ERRNO_BT_LOAD_HEAD_SIZE); log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US(log_level, ERRINFO_BT_LOAD_HEAD_SIZE); } else { unread_len = btree_fhead.size-sizeof(dfs_btree_fhead_base_t); //设置准确的最大长度 load_info.set_max_file_offset(file_head_offset+btree_fhead.total_data_len); //加载扩展头信息：头信息尺寸可能不等于sizeof(btree_fhead) if ((err = load_info.load_buf( (void *)((dfs_btree_fhead_ext_t *)&btree_fhead), MIN(unread_len, unread_head))) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US( log_level, "load_info.load_buf(dfs_btree_fhead_ext_t) returns 0x%x", err); } else if (unread_len > unread_head) { if ((err = load_info.skip_data_len(unread_len-unread_head)) != 0) { log_level = DF_UL_LOG_FATAL; DF_WRITE_LOG_US( log_level, "load_info.load_buf(unread_len-unread_head) returns 0x%x", err); } } } load_info.set_store_t_type(btree_fhead.store_t_type); if (DF_UL_LOG_NONE != log_level) { DF_WRITE_LOG_US(log_level, "file_head_offset=%ld", file_head_offset); DF_WRITE_LOG_US(log_level, "load_info.get_major_tag()=0x%x, btree_fhead.major_tag=0x%x", load_info.get_major_tag(), btree_fhead.major_tag); DF_WRITE_LOG_US(log_level, "dfs_btree_fhead_t::CORE_BT_TAG=0x%x, btree_fhead.minor_tag=0x%x", dfs_btree_fhead_t::CORE_BT_TAG, btree_fhead.minor_tag); DF_WRITE_LOG_US(log_level, "dfs_btree_fhead_t::CORE_BT_VER=0x%x, btree_fhead.ver=0x%x", dfs_btree_fhead_t::CORE_BT_VER, btree_fhead.ver); DF_WRITE_LOG_US(log_level, "unread_len=0x%x, unread_head=0x%x, btree_fhead.size=0x%x", unread_len, unread_head, btree_fhead.size); } return err; }; #endif //__DFS_BTREE_INCLUDE_H_