src/server/BucketList.cxx

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2007 by www.databasecache.com                           *
 *   Contact: praba_tuty@databasecache.com                                 *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
  ***************************************************************************/
#include<Index.h>
#include<Allocator.h>
#include<Database.h>
#include<Debug.h>
DbRetVal BucketList::insert(Chunk *chunk, Database *db, void *key, void*tuple)
{
    DbRetVal rv = OK;
    HashIndexNode *newNode;// (HashIndexNode*) chunk->allocate(db, &rv);
    newNode= (HashIndexNode*) chunk->allocate(db, &rv);
    if (NULL == newNode)
    {
        printError(rv, "Unable to allocate HashIndex node");
        return rv;
    }
    printDebug(DM_HashIndex,"Hash Index node allocated:%x", newNode);
    newNode->ptrToKey_ = key;
    newNode->ptrToTuple_ = tuple;
    newNode->next_ = NULL;

    //If this is the first node, set it as head
    if (NULL == head)
    {
        printDebug(DM_HashIndex, "BucketList:insert head is null key:%x",key);
        head = newNode;
        return OK;
    }

    HashIndexNode *it = head;
    while (NULL != it->next_) it = it->next_;
    it->next_ = newNode;
    printDebug(DM_HashIndex, "BucketList:insert adding it to the end of list key:%x", key);
    return rv;
}
//Returns 2 if the head itself is removed.
DbRetVal BucketList::remove(Chunk *chunk, Database *db, void *keyPtr)
{
    if (NULL == head) return ErrNotFound;
    HashIndexNode *ite = head, *prev = head;
    while (ite != NULL)
    {
        if (ite->ptrToKey_ ==  keyPtr)
        {
            prev->next_ = ite->next_;
            chunk->free(db, ite);
            if ( ite == head) { head = NULL; return SplCase; }
            return OK;
        }
        prev = ite;
        ite = ite->next_;
    }
    printError(ErrNotFound, "Node not found in the bucket list");
    return ErrNotFound;
}

---