XrdCmsNash Class Reference

#include <XrdCmsNash.hh>

Collaboration diagram for XrdCmsNash:

Public Member Functions
	XrdCmsNash (int psize=17711, int size=28657)
	~XrdCmsNash ()
XrdCmsKeyItem *	Add (XrdCmsKey &Key)
XrdCmsKeyItem *	Find (XrdCmsKey &Key)
int	Recycle (XrdCmsKeyItem *rip)

Detailed Description

Definition at line 35 of file XrdCmsNash.hh.

Constructor & Destructor Documentation

XrdCmsNash()

XrdCmsNash::XrdCmsNash	(	int	psize = 17711,
		int	size = 28657 )

Definition at line 39 of file XrdCmsNash.cc.

{
     prevtablesize = psize;
     nashtablesize = csize;
     Threshold     = (csize * LoadMax) / 100;
     nashnum       = 0;
     nashtable     = (XrdCmsKeyItem **)
                     malloc( (size_t)(csize*sizeof(XrdCmsKeyItem *)) );
     memset((void *)nashtable, 0, (size_t)(csize*sizeof(XrdCmsKeyItem *)));
}

~XrdCmsNash()

XrdCmsNash::~XrdCmsNash ( )

inline

Definition at line 49 of file XrdCmsNash.hh.

{} // Never gets deleted

Member Function Documentation

Add()

XrdCmsKeyItem * XrdCmsNash::Add

(

XrdCmsKey &

Key

)

Definition at line 54 of file XrdCmsNash.cc.

{
   XrdCmsKeyItem *hip;
   unsigned int kent;
 
// Allocate the entry
//
   if (!(hip = XrdCmsKeyItem::Alloc(Key.TOD))) return (XrdCmsKeyItem *)0;
 
// Check if we should expand the table
//
   if (++nashnum > Threshold) Expand();
 
// Fill out the key data
//
   if (!Key.Hash) Key.setHash();
   hip->Key = Key;
 
// Add the entry to the table
//
   kent = Key.Hash % nashtablesize;
   hip->Next = nashtable[kent];
   nashtable[kent] = hip;
   return hip;
}

References XrdCmsKeyItem::Alloc(), XrdCmsKey::Hash, XrdCmsKeyItem::Key, XrdCmsKeyItem::Next, XrdCmsKey::setHash(), and XrdCmsKey::TOD.

Here is the call graph for this function:

Find()

XrdCmsKeyItem * XrdCmsNash::Find

(

XrdCmsKey &

Key

)

Definition at line 129 of file XrdCmsNash.cc.

{
  XrdCmsKeyItem *nip;
  unsigned int kent;
 
// Check if we already have a hash value and get one if not
//
   if (!Key.Hash) Key.setHash();
 
// Compute position of the hash table entry
//
   kent = Key.Hash%nashtablesize;
 
// Find the entry
//
   nip = nashtable[kent];
   while(nip && nip->Key != Key) nip = nip->Next;
   return nip;
}

References XrdCmsKey::Hash, XrdCmsKeyItem::Key, XrdCmsKeyItem::Next, and XrdCmsKey::setHash().

Here is the call graph for this function:

Recycle()

int XrdCmsNash::Recycle

(

XrdCmsKeyItem *

rip

)

Definition at line 156 of file XrdCmsNash.cc.

{
   XrdCmsKeyItem *nip, *pip = 0;
   unsigned int kent;
 
// Compute position of the hash table entry
//
   kent = rip->Loc.HashSave%nashtablesize;
 
// Find the entry
//
   nip = nashtable[kent];
   while(nip && nip != rip) {pip = nip; nip = nip->Next;}
 
// Remove and recycle if found
//
   if (nip)
      {if (pip) pip->Next = nip->Next;
          else nashtable[kent] = nip->Next;
          rip->Recycle();
          nashnum--;
      }
   return nip != 0;
}

References XrdCmsKeyItem::Loc, XrdCmsKeyItem::Next, and XrdCmsKeyItem::Recycle().

Here is the call graph for this function:

---

The documentation for this class was generated from the following files:

• XrdCmsNash.hh
• XrdCmsNash.cc