#include <XrdXrootdTransPend.hh>

Collaboration diagram for XrdXrootdTransPend:

Classes
union	[union].Pend

Public Member Functions
	XrdXrootdTransPend (XrdLink lkP, XrdXrootdTransit brP, ClientRequest *rqP)
	~XrdXrootdTransPend ()
void	Queue ()

Static Public Member Functions
static void	Clear (XrdXrootdTransit *trP)
static XrdXrootdTransPend *	Remove (XrdLink *lP, short sid)

Public Attributes
XrdXrootdTransit *	bridge
XrdLink *	link
XrdXrootdTransPend *	next
union	Pend

Detailed Description

Definition at line 42 of file XrdXrootdTransPend.hh.

Class Documentation

◆ XrdXrootdTransPend::[union].Pend

union XrdXrootdTransPend::[union].Pend

Definition at line 48 of file XrdXrootdTransPend.hh.

Collaboration diagram for XrdXrootdTransPend::[union].Pend:

Class Members
ClientRequest	Request
short	theSid

Constructor & Destructor Documentation

◆ XrdXrootdTransPend()

XrdXrootdTransPend::XrdXrootdTransPend	(	XrdLink *	lkP,
		XrdXrootdTransit *	brP,
		ClientRequest *	rqP )

inline

Definition at line 58 of file XrdXrootdTransPend.hh.

61 : next(0), link(lkP), bridge(brP)

62 {memcpy(&Pend.Request, rqP, sizeof(Pend.Request));}

XrdXrootdTransPend::link

XrdLink * link

Definition XrdXrootdTransPend.hh:46

XrdXrootdTransPend::next

XrdXrootdTransPend * next

Definition XrdXrootdTransPend.hh:45

XrdXrootdTransPend::Pend

union XrdXrootdTransPend::@371012140333040222300212162025004307132302363251 Pend

XrdXrootdTransPend::bridge

XrdXrootdTransit * bridge

Definition XrdXrootdTransPend.hh:47

References bridge, link, next, and Pend.

Referenced by Clear(), and Remove().

Here is the caller graph for this function:

◆ ~XrdXrootdTransPend()

XrdXrootdTransPend::~XrdXrootdTransPend ( )

inline

Definition at line 64 of file XrdXrootdTransPend.hh.

64{}

Member Function Documentation

◆ Clear()

void XrdXrootdTransPend::Clear ( XrdXrootdTransit * trP )

static

Definition at line 48 of file XrdXrootdTransPend.cc.

{
   XrdXrootdTransPend *tpP, *tpN, *tpX;
 
// Lock this operations
//
   myMutex.Lock();
 
// Run through the queue deleting all elements owned by the transit object
//
   tpP = 0; tpN = rqstQ;
   while(tpN)
        {if (tpN->bridge == trP)
            {if (tpP) tpP->next = tpN->next;
                else  rqstQ     = tpN->next;
             tpX = tpN; tpN = tpN->next; delete tpX;
            } else {
             tpP = tpN; tpN = tpN->next;
           }
        }
 
// All done
//
   myMutex.UnLock();
}

References XrdXrootdTransPend(), bridge, and next.

Referenced by XrdXrootdTransit::Recycle().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ Queue()

void XrdXrootdTransPend::Queue ( )

Definition at line 78 of file XrdXrootdTransPend.cc.

{
// Now place it on out pending queue
//
   myMutex.Lock();
   next = rqstQ; rqstQ = this;
   myMutex.UnLock();
}

References next.

◆ Remove()

XrdXrootdTransPend * XrdXrootdTransPend::Remove	(	XrdLink *	lP,
		short	sid )

static

Definition at line 91 of file XrdXrootdTransPend.cc.

{
   XrdXrootdTransPend *tpP, *tpN;
 
// Lock this operations
//
   myMutex.Lock();
 
// Run through the queue and remove matching element
//
   tpP = 0; tpN = rqstQ;
   while(tpN)
        {if (tpN->link == lP && tpN->Pend.theSid == sid)
            {if (tpP) tpP->next = tpN->next;
                else  rqstQ     = tpN->next;
             break;
            } else {
             tpP = tpN; tpN = tpN->next;
           }
        }
 
// All done
//
   myMutex.UnLock();
   return tpN;
}