00001 #ifndef __XRDSSIPACER_HH__ 00002 #define __XRDSSIPACER_HH__ 00003 /******************************************************************************/ 00004 /* */ 00005 /* X r d S s i P a c e r . h h */ 00006 /* */ 00007 /* (c) 2016 by the Board of Trustees of the Leland Stanford, Jr., University */ 00008 /* Produced by Andrew Hanushevsky for Stanford University under contract */ 00009 /* DE-AC02-76-SFO0515 with the Department of Energy */ 00010 /* */ 00011 /* This file is part of the XRootD software suite. */ 00012 /* */ 00013 /* XRootD is free software: you can redistribute it and/or modify it under */ 00014 /* the terms of the GNU Lesser General Public License as published by the */ 00015 /* Free Software Foundation, either version 3 of the License, or (at your */ 00016 /* option) any later version. */ 00017 /* */ 00018 /* XRootD is distributed in the hope that it will be useful, but WITHOUT */ 00019 /* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or */ 00020 /* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public */ 00021 /* License for more details. */ 00022 /* */ 00023 /* You should have received a copy of the GNU Lesser General Public License */ 00024 /* along with XRootD in a file called COPYING.LESSER (LGPL license) and file */ 00025 /* COPYING (GPL license). If not, see <http://www.gnu.org/licenses/>. */ 00026 /* */ 00027 /* The copyright holder's institutional names and contributor's names may not */ 00028 /* be used to endorse or promote products derived from this software without */ 00029 /* specific prior written permission of the institution or contributor. */ 00030 /******************************************************************************/ 00031 00032 #include "Xrd/XrdJob.hh" 00033 #include "XrdSsi/XrdSsiAtomics.hh" 00034 #include "XrdSsi/XrdSsiRequest.hh" 00035 00036 class XrdSsiPacer : public XrdJob 00037 { 00038 public: 00039 00040 void DoIt() {Redrive();} 00041 00042 void Hold(const char *reqID=0); 00043 00044 void Q_Insert(XrdSsiPacer *Node) 00045 {Node->next = next; // Chain in the item; 00046 next->prev = Node; 00047 next = Node; 00048 Node->prev = this; 00049 theQ->qCnt++; 00050 } 00051 00052 void Q_Remove() 00053 {prev->next = next; // Unchain the item 00054 next->prev = prev; 00055 next = this; 00056 prev = this; 00057 theQ->qCnt--; 00058 } 00059 00060 void Q_PushBack(XrdSsiPacer *Node) {prev->Q_Insert(Node);} 00061 00062 virtual void Redrive() {} // Meant to be overridden 00063 00064 virtual 00065 const char *RequestID() {return 0;} // Meant to be overridden 00066 00067 void Reset(); 00068 00069 static void Run(XrdSsiRequest::RDR_Info &rInfo, 00070 XrdSsiRequest::RDR_How rhow, const char *reqid=0); 00071 00072 bool Singleton() {return next == this;} 00073 00074 XrdSsiPacer() : prev(this), next(this), theQ(this), 00075 qCnt(0), aCnt(0) {} 00076 virtual ~XrdSsiPacer() {Reset();} 00077 00078 private: 00079 00080 static XrdSsiMutex pMutex; 00081 static XrdSsiPacer glbQ; 00082 XrdSsiPacer *prev; 00083 XrdSsiPacer *next; 00084 XrdSsiPacer *theQ; 00085 int qCnt; 00086 int aCnt; 00087 }; 00088 #endif