XrdCmsPList_Anchor Class Reference

#include <XrdCmsPList.hh>

Collaboration diagram for XrdCmsPList_Anchor:

Public Member Functions
	XrdCmsPList_Anchor ()
	~XrdCmsPList_Anchor ()
int	Add (const char *pname, XrdCmsPInfo *pinfo)
void	Empty (XrdCmsPList *newlist=0)
int	Find (const char *pname, XrdCmsPInfo &masks)
XrdCmsPList *	First ()
SMask_t	Insert (const char *pname, XrdCmsPInfo *pinfo)
void	Lock ()
int	NotEmpty ()
void	Remove (SMask_t mask)
const char *	Type (const char *pname)
void	UnLock ()
XrdCmsPList *	Zorch (XrdCmsPList *newlist=0)

Detailed Description

Definition at line 95 of file XrdCmsPList.hh.

Constructor & Destructor Documentation

XrdCmsPList_Anchor()

XrdCmsPList_Anchor::XrdCmsPList_Anchor ( )

inline

Definition at line 132 of file XrdCmsPList.hh.

{next = 0;}

~XrdCmsPList_Anchor()

XrdCmsPList_Anchor::~XrdCmsPList_Anchor ( )

inline

Definition at line 134 of file XrdCmsPList.hh.

{Empty();}

References Empty().

Here is the call graph for this function:

Member Function Documentation

Add()

int XrdCmsPList_Anchor::Add	(	const char *	pname,
		XrdCmsPInfo *	pinfo
	)

Definition at line 41 of file XrdCmsPList.cc.

{
   int plen = strlen(pname);
   XrdCmsPList *p, *pp;
 
// Set up the search
//
   Lock();
   p = next;
   pp = 0;
 
// Find the proper insertion point. Paths are sorted in decreasin length order.
//
   while(p && p->pathlen >= plen)
        {if (p->pathlen == plen && !strcmp(p->pathname,pname))
            {UnLock(); return 0;}
         pp = p; 
          p = p->next;
        }
 
// Insert a new element
//
   p = new XrdCmsPList(pname, pinfo);
   if (pp) { p->next = pp->next; pp->next = p;}
      else { p->next =     next;     next = p;}
 
// All done
//
   UnLock();
   return 1;
}

References Lock(), and UnLock().

Here is the call graph for this function:

Empty()

void XrdCmsPList_Anchor::Empty ( XrdCmsPList *  newlist = 0 )

inline

Definition at line 104 of file XrdCmsPList.hh.

                    {Lock();
                     XrdCmsPList *p = next;
                     while(p) {next = p->next; delete p; p = next;}
                     next = newlist;
                     UnLock();
                    }

References Lock(), and UnLock().

Referenced by ~XrdCmsPList_Anchor().

Here is the call graph for this function:

Here is the caller graph for this function:

Find()

int XrdCmsPList_Anchor::Find	(	const char *	pname,
		XrdCmsPInfo &	masks
	)

Definition at line 77 of file XrdCmsPList.cc.

{
   int plen = strlen(pname);
 
// Lock the anchor and setup for search
//
   Lock();
   XrdCmsPList *p = next;
 
// Find matching entry
//
   while(p) if (p->pathlen <= plen && !strncmp(p->pathname, pname, p->pathlen)) 
               {pinfo = p->pathmask; break;}
               else p = p->next;
 
// All done
//
   UnLock();
   return p != 0;
}

References Lock(), and UnLock().

Referenced by XrdCmsNode::do_Have(), XrdCmsNode::do_StateFWD(), XrdCmsNode::do_StatFS(), XrdCmsCluster::Locate(), and XrdCmsCluster::Select().

Here is the call graph for this function:

Here is the caller graph for this function:

First()

XrdCmsPList* XrdCmsPList_Anchor::First ( )

inline

Definition at line 114 of file XrdCmsPList.hh.

{return next;}

Insert()

SMask_t XrdCmsPList_Anchor::Insert	(	const char *	pname,
		XrdCmsPInfo *	pinfo
	)

Definition at line 102 of file XrdCmsPList.cc.

{
   int rc, plen = strlen(pname);
   XrdCmsPList *p, *pp;
   SMask_t newmask;
 
// Set up the search
//
   Lock();
   p = next;
   pp = 0;
 
// Find the proper insertion point. Paths are sorted in decreasin length
// order. We must merge in the incoming mask with all subset paths.
//
   rc = 1;
   while(p && p->pathlen >= plen)
        {if (p->pathlen == plen && !(rc = strcmp(p->pathname,pname))) break;
            else if (!strncmp(p->pathname,pname,plen)
                 &&  !(p->pathmask.rovec & pinfo->rovec))
                    {p->pathmask.And(~(pinfo->rovec)); p->pathmask.Or(pinfo);}
         pp = p; 
          p = p->next;
        }
 
// Either merge the path masks or insert a new path. For a new path, add to
// it masks of all superset paths that may follow it in the chain of paths.
//
   if (!rc) {p->pathmask.And(~(pinfo->rovec)); p->pathmask.Or(pinfo);}
      else { p = new XrdCmsPList(pname, pinfo);
             if (pp)
                { p->next = pp->next;
                 pp->next = p;
                } else {
                  p->next = next;
                     next = p;
                }
             pp = p->next;
             while(pp) {if (pp->pathlen < plen
                        &&  !strncmp(pp->pathname,pname,pp->pathlen))
                           p->pathmask.Or(&(pp->pathmask));
                        pp = pp->next;
                       }
           }
 
// All done
//
   newmask = p->pathmask.rovec | p->pathmask.rwvec;
   UnLock();
   return newmask;
}

References XrdCmsPInfo::And(), Lock(), XrdCmsPInfo::Or(), XrdCmsPInfo::rovec, XrdCmsPInfo::rwvec, and UnLock().

Here is the call graph for this function:

Lock()

void XrdCmsPList_Anchor::Lock ( )

inline

Definition at line 99 of file XrdCmsPList.hh.

{mutex.Lock();}

References XrdSysMutex::Lock().

Referenced by Add(), Empty(), Find(), Insert(), Remove(), Type(), and Zorch().

Here is the call graph for this function:

Here is the caller graph for this function:

NotEmpty()

int XrdCmsPList_Anchor::NotEmpty ( )

inline

Definition at line 118 of file XrdCmsPList.hh.

{return next != 0;}

Remove()

void XrdCmsPList_Anchor::Remove

(

SMask_t

mask

)

Definition at line 158 of file XrdCmsPList.cc.

{
    SMask_t zmask(~mask);
    XrdCmsPList *pp = next, *prevp = 0;
 
// Lock the list
//
   Lock();
 
// Remove bit from mask. If mask is zero, remove the entry
//
   while(pp)
        {if (!pp->pathmask.And(zmask))
            {if (prevp) {prevp->next = pp->next; delete pp; pp = prevp->next;}
                else    {       next = pp->next; delete pp; pp = next;}
            }
            else {prevp = pp; pp = pp->next;}
        }
 
// All done
//
   UnLock();
}

References XrdCmsPInfo::And(), Lock(), and UnLock().

Here is the call graph for this function:

Type()

const char * XrdCmsPList_Anchor::Type

(

const char *

pname

)

Definition at line 186 of file XrdCmsPList.cc.

{
   int isrw = 0, plen = strlen(pname);
 
// Lock the anchor and setup for search
//
   Lock();
   XrdCmsPList *p = next;
 
// Find matching entry
//
   while(p) if (p->pathlen <= plen && !strncmp(p->pathname, pname, p->pathlen)) 
               {isrw = (p->pathmask.rwvec != 0); break;}
               else p = p->next;
 
// All done
//
   UnLock();
   if (p) return (isrw ? "w" : "r");
   return "?";
}

References Lock(), XrdCmsPInfo::rwvec, and UnLock().

Here is the call graph for this function:

UnLock()

void XrdCmsPList_Anchor::UnLock ( )

inline

Definition at line 100 of file XrdCmsPList.hh.

{mutex.UnLock();}

References XrdSysMutex::UnLock().

Referenced by Add(), Empty(), Find(), Insert(), Remove(), Type(), and Zorch().

Here is the call graph for this function:

Here is the caller graph for this function:

Zorch()

XrdCmsPList* XrdCmsPList_Anchor::Zorch ( XrdCmsPList *  newlist = 0 )

inline

Definition at line 124 of file XrdCmsPList.hh.

                   {Lock();
                    XrdCmsPList *p = next;
                    next = newlist;
                    UnLock();
                    return p;
                   }

References Lock(), and UnLock().

Here is the call graph for this function:

---

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

• XrdCmsPList.hh
• XrdCmsPList.cc