108 int Exists(
char *
Path,
int fnPos,
int UpAT=0);
117 void Init(
int Opts,
int DMlife,
int DPLife);
121inline int Limit() {
return theQ.rLimit;}
123 void Limit(
int rLim,
int qMax);
135 {
if (xdfs) dfsMaxTries =
145inline int Trim() {
return preSel;}
152 dmLife(0), dpLife(0), lclStat(0), preSel(1),
153 dfsSys(0), Server(0), Fixed(0), Punt(0) {}
158struct dMoP {
int Present;};
161 int FStat(
char *
Path,
int fnPos,
int upat=0);
162 int hasDir(
char *
Path,
int fnPos);
163 void Queue(XrdCmsRRData &Arg, XrdCmsPInfo &Who,
165 void Xeq(XrdCmsBaseFR *rP);
168 XrdOucHash<dMoP> fsDirMP;
169 void (*cBack)(XrdCmsBaseFR *, int);
173 XrdSysSemaphore pqAvail;
174 XrdSysSemaphore rqAvail;
175 XrdCmsBaseFR *pqFirst;
176 XrdCmsBaseFR *pqLast;
177 XrdCmsBaseFR *rqFirst;
178 XrdCmsBaseFR *rqLast;
185 RequestQ() : pqAvail(0), rqAvail(0),
186 pqFirst(0), pqLast(0), rqFirst(0), rqLast(0),
187 rLimit(0), qHWM(0), qMax(1), qNum(0),
188 rLeft(0), rAgain(0) {}