tagged 1.1

[z.facultad/75.52/treemulator.git] / src / btree.cpp

diff --git a/src/btree.cpp b/src/btree.cpp
index 81af642041af8670b6d9105e016af3cae521eee5..cce07595dbae924ffd7fdd431c014c031e350758 100644 (file)
--- a/src/btree.cpp
+++ b/src/btree.cpp
@@ -3,8 +3,6 @@
 
 BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt, bool create_new_file)
 {
 
 BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt, bool create_new_file)
 {

-       key_type = kt;
-       tree_type = tt;

        uchar *node;
        BTreeNodeHeader nh;
 
        uchar *node;
        BTreeNodeHeader nh;
 


@@ -19,6 +17,11 @@ BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt,
        
        /* Inicializo el header */
        header.block_size = block_size;
        
        /* Inicializo el header */
        header.block_size = block_size;

+       header.tree_type = tt;
+       header.key_type = kt;
+       header.block_data_counter = 0;
+       strcpy (header.magic, "DILUMA");
+       header.magic[6] = '\0';

        WriteFileHeader ();
 
        /* Creo el primer bloque vacio */
        WriteFileHeader ();
 
        /* Creo el primer bloque vacio */


@@ -33,9 +36,76 @@ BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt,
        delete [] node;
 }
 
        delete [] node;
 }
 

+BTree::BTree (const std::string &name)
+{
+       /* Leo los bloques recuperables */
+       std::string del = filename + ".del";
+
+       fp = fopen (del.c_str (), "wb");
+       if (fp != NULL) {
+               uint i;
+
+               while (fread (&i, 1, sizeof (uint), fp)) {
+                       deleted_nodes.push_back (i);
+               }
+
+               fclose (fp);
+       }
+
+       del = filename + ".blockdel";
+
+       fp = fopen (del.c_str (), "wb");
+       if (fp != NULL) {
+               uint i;
+
+               while (fread (&i, 1, sizeof (uint), fp)) {
+                       deleted_block_data.push_back (i);
+               }
+
+               fclose (fp);
+       }
+
+       fp = fopen (name.c_str(), "rb+");
+       if (!fp) {
+               /* TODO : mandar una exception ? */
+               return;
+       }
+       filename = name;
+       ReadFileHeader ();
+}
+

 BTree::~BTree ()
 {
        fclose (fp);
 BTree::~BTree ()
 {
        fclose (fp);

+
+       std::string del = filename + ".del";
+
+       fp = fopen (del.c_str (), "wb");
+       std::list<uint>::iterator it = deleted_nodes.begin ();
+
+       while (it != deleted_nodes.end ()) {
+               uint i = *it;
+               fwrite (&i, 1, sizeof (uint), fp);
+               it++;
+       }
+
+       del = filename + ".del";
+
+       fp = fopen (del.c_str (), "wb");
+       it = deleted_block_data.begin ();
+
+       while (it != deleted_block_data.end ()) {
+               uint i = *it;
+               fwrite (&i, 1, sizeof (uint), fp);
+               it++;
+       }
+       fclose (fp);
+}
+
+void BTree::ReadFileHeader ()
+{
+       fseek (fp, 0L, SEEK_SET);
+       fread (&header, 1, sizeof (BTreeFileHeader), fp);

 }
 
 void BTree::WriteFileHeader ()
 }
 
 void BTree::WriteFileHeader ()


@@ -54,14 +124,19 @@ void BTree::WriteBlock (uchar *block, uint num)
 void BTree::AddKey (const Clave &k)
 {
        uint left, right;
 void BTree::AddKey (const Clave &k)
 {
        uint left, right;

-       Clave *kout;
+       Clave *kout, *in;
+
+       in = k.Clone ();
+       in->SetBlockData ( GetNextBlockData () );

 
        try {
 
        try {

-               kout = AddKeyR (k.Clone (), 0, left, right);
+               kout = AddKeyR (in->Clone (), 0, left, right);

        } catch (Exception *e) {
                throw e;
        }
 
        } catch (Exception *e) {
                throw e;
        }
 

+       delete in;
+

        if (kout) {
                unsigned short level;
                /* Debo dejar la raiz en el nodo 0, por lo que paso el nodo
        if (kout) {
                unsigned short level;
                /* Debo dejar la raiz en el nodo 0, por lo que paso el nodo


@@ -143,7 +218,7 @@ Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint
 
                while (it != node_keys.end ()) {
                        datait = (*it);
 
                while (it != node_keys.end ()) {
                        datait = (*it);

-                       if (tree_type == TYPE_IDENTIFICACION) {
+                       if (header.tree_type == TYPE_IDENTIFICACION) {

                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();
                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();


@@ -184,7 +259,7 @@ Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint
                while (it != node_keys.end ()) {
                        BTreeData *datait;
                        datait = (*it);
                while (it != node_keys.end ()) {
                        BTreeData *datait;
                        datait = (*it);

-                       if (tree_type == TYPE_IDENTIFICACION) {
+                       if (header.tree_type == TYPE_IDENTIFICACION) {

                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();
                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();


@@ -284,7 +359,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
        posterior = it;
 
        while (it != node_keys.end ()) {
        posterior = it;
 
        while (it != node_keys.end ()) {

-               if (tree_type == TYPE_IDENTIFICACION) {
+               if (header.tree_type == TYPE_IDENTIFICACION) {

                        /* Verifico que la clave no existea ya en el arbol */
                        if ((*data) == (*(*it))) {
                                throw new AddException ();
                        /* Verifico que la clave no existea ya en el arbol */
                        if ((*data) == (*(*it))) {
                                throw new AddException ();


@@ -320,7 +395,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
 
                while (it != node_keys.end ()) {
                        datait = (*it);
 
                while (it != node_keys.end ()) {
                        datait = (*it);

-                       if (tree_type == TYPE_IDENTIFICACION) {
+                       if (header.tree_type == TYPE_IDENTIFICACION) {

                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();
                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();


@@ -362,7 +437,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
                while (it != node_keys.end ()) {
                        BTreeData *datait;
                        datait = (*it);
                while (it != node_keys.end ()) {
                        BTreeData *datait;
                        datait = (*it);

-                       if (tree_type == TYPE_IDENTIFICACION) {
+                       if (header.tree_type == TYPE_IDENTIFICACION) {

                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();
                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();


@@ -533,6 +608,7 @@ void BTree::DelKeyFromLeaf (Clave *k, uint node_num, uint padre)
                if ((*data) == (*(*it))) {
                        BTreeData *aborrar = (*it);
                        node_keys.erase (it);
                if ((*data) == (*(*it))) {
                        BTreeData *aborrar = (*it);
                        node_keys.erase (it);

+                       deleted_block_data.push_back (aborrar->GetKey ()->GetBlockData ());

                        delete aborrar;
                        break;
                }
                        delete aborrar;
                        break;
                }


@@ -1037,9 +1113,9 @@ std::list<BTreeData *> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_heade
        for (uint i=0; i<count; i++) {
                BTreeData *data;
                if (node_header.level == 0) {
        for (uint i=0; i<count; i++) {
                BTreeData *data;
                if (node_header.level == 0) {

-                       data = new BTreeLeafData (node, key_type);
+                       data = new BTreeLeafData (node, header.key_type);

                } else {
                } else {

-                       data = new BTreeData (node, key_type);
+                       data = new BTreeData (node, header.key_type);

                }
                node += data->Size ();
                keys.push_back (data);
                }
                node += data->Size ();
                keys.push_back (data);


@@ -1052,7 +1128,7 @@ std::list<BTreeData *> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_heade
 void BTree::AbrevKey (std::list<BTreeData *> &lst)
 {
        /* Claves Fijas No se abrevian */
 void BTree::AbrevKey (std::list<BTreeData *> &lst)
 {
        /* Claves Fijas No se abrevian */

-       if (key_type == KEY_FIXED) return;
+       if (header.key_type == KEY_FIXED) return;

 
        BTreeData *primera = NULL;
        std::list<BTreeData *>::iterator it = lst.begin ();
 
        BTreeData *primera = NULL;
        std::list<BTreeData *>::iterator it = lst.begin ();


@@ -1067,7 +1143,7 @@ void BTree::AbrevKey (std::list<BTreeData *> &lst)
 void BTree::DeAbrevKey (std::list<BTreeData *> &lst)
 {
        /* Claves Fijas No se abrevian */
 void BTree::DeAbrevKey (std::list<BTreeData *> &lst)
 {
        /* Claves Fijas No se abrevian */

-       if (key_type == KEY_FIXED) return;
+       if (header.key_type == KEY_FIXED) return;

 
        BTreeData *primera = NULL;
        std::list<BTreeData *>::iterator it = lst.begin ();
 
        BTreeData *primera = NULL;
        std::list<BTreeData *>::iterator it = lst.begin ();


@@ -1138,9 +1214,9 @@ uchar *BTree::NewBlock (uint &num)
        BTreeNodeHeader nh;
 
        std::list<uint>::iterator it;
        BTreeNodeHeader nh;
 
        std::list<uint>::iterator it;

-       it = deleted_nodes.begin ();

 
 

-       if (it != deleted_nodes.end ()) {
+       if (deleted_nodes.size ()) {
+               it = deleted_nodes.begin ();

                num = *it;
                deleted_nodes.erase (it);
        } else {
                num = *it;
                deleted_nodes.erase (it);
        } else {


@@ -1247,5 +1323,20 @@ void BTree::DeleteKeys (std::list<BTreeData *> &keys)
 
 int BTree::type () const
 {
 
 int BTree::type () const
 {

-       return key_type;
+       return header.key_type;

 }
 }

+
+uint BTree::GetNextBlockData ()
+{
+       uint n;
+       if (deleted_block_data.size ()) {
+               std::list<uint>::iterator it = deleted_block_data.begin ();
+               n = *it;
+               deleted_block_data.erase (it);
+       } else {
+               n = header.block_data_counter++;
+       }
+
+       return n;
+}
+