-
Notifications
You must be signed in to change notification settings - Fork 149
/
XrdOucPList.hh
152 lines (129 loc) · 6.27 KB
/
XrdOucPList.hh
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#ifndef __OUC_PLIST__
#define __OUC_PLIST__
/******************************************************************************/
/* */
/* X r d O u c P L i s t . h h */
/* */
/* (c) 2003 by the Board of Trustees of the Leland Stanford, Jr., University */
/* All Rights Reserved */
/* Produced by Andrew Hanushevsky for Stanford University under contract */
/* DE-AC02-76-SFO0515 with the Department of Energy */
/* */
/* This file is part of the XRootD software suite. */
/* */
/* XRootD is free software: you can redistribute it and/or modify it under */
/* the terms of the GNU Lesser General Public License as published by the */
/* Free Software Foundation, either version 3 of the License, or (at your */
/* option) any later version. */
/* */
/* XRootD is distributed in the hope that it will be useful, but WITHOUT */
/* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or */
/* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public */
/* License for more details. */
/* */
/* You should have received a copy of the GNU Lesser General Public License */
/* along with XRootD in a file called COPYING.LESSER (LGPL license) and file */
/* COPYING (GPL license). If not, see <http://www.gnu.org/licenses/>. */
/* */
/* The copyright holder's institutional names and contributor's names may not */
/* be used to endorse or promote products derived from this software without */
/* specific prior written permission of the institution or contributor. */
/******************************************************************************/
#include <stdio.h>
#include <strings.h>
#include <stdlib.h>
class XrdOucPList
{
public:
inline int Attr() {return attrs;}
inline unsigned long long Flag() {return flags;}
inline const char *Name() {return name;}
inline XrdOucPList *Next() {return next;}
inline char *Path() {return path;}
inline int Plen() {return pathlen;}
inline int PathOK(const char *pd, const int pl)
{return pl >= pathlen && !strncmp(pd, path, pathlen);}
inline void Set(int aval) {attrs = aval;}
inline void Set(unsigned long long fval) {flags = fval;}
inline void Set(const char *pd, const char *pn)
{if (path) free(path);
pathlen = strlen(pd);
int n = strlen(pn) + 1 + pathlen + 1;
path = (char *)malloc(n);
n = snprintf(path, n, "%s", pd);
name = path+pathlen+1;
strcpy(name, pn); // This is safe
}
XrdOucPList(const char *pd="", unsigned long long fv=0)
: flags(fv), next(0), path(strdup(pd)),
pathlen(strlen(pd)), attrs(0) {}
XrdOucPList(const char *pd, const char *pn)
: next(0), path(0), attrs(0)
{Set(pd, pn);}
~XrdOucPList()
{if (path) free(path);}
friend class XrdOucPListAnchor;
private:
union{
unsigned long long flags;
char *name;
};
XrdOucPList *next;
char *path;
int pathlen;
int attrs;
};
class XrdOucPListAnchor : public XrdOucPList
{
public:
inline XrdOucPList *About(const char *pathname)
{int plen = strlen(pathname);
XrdOucPList *p = next;
while(p) {if (p->PathOK(pathname, plen)) break;
p=p->next;
}
return p;
}
inline void Default(unsigned long long x) {dflts = x;}
inline
unsigned long long Default() {return dflts;}
inline void Defstar(unsigned long long x) {dstrs = x;}
inline void Empty(XrdOucPList *newlist=0)
{XrdOucPList *p = next;
while(p) {next = p->next; delete p; p = next;}
next = newlist;
}
inline unsigned long long Find(const char *pathname)
{int plen = strlen(pathname);
XrdOucPList *p = next;
while(p) {if (p->PathOK(pathname, plen)) break;
p=p->next;
}
if (p) return p->flags;
return (*pathname == '/' ? dflts : dstrs);
}
inline XrdOucPList *Match(const char *pathname)
{int plen = strlen(pathname);
XrdOucPList *p = next;
while(p) {if (p->pathlen == plen
&& !strcmp(p->path, pathname)) break;
p=p->next;
}
return p;
}
inline XrdOucPList *First() {return next;}
inline void Insert(XrdOucPList *newitem)
{XrdOucPList *pp = 0, *cp = next;
while(cp && newitem->pathlen < cp->pathlen) {pp=cp;cp=cp->next;}
if (pp) {newitem->next = pp->next; pp->next = newitem;}
else {newitem->next = next; next = newitem;}
}
inline int NotEmpty() {return next != 0;}
XrdOucPListAnchor(unsigned long long dfx=0)
: dflts(dfx), dstrs(dfx) {}
~XrdOucPListAnchor() {}
private:
unsigned long long dflts;
unsigned long long dstrs;
};
#endif