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
153
154
155
156
157
158
159
160
161
162
|
#include <u.h>
#include <libc.h>
#include <dtracy.h>
char *
dtstrdup(char *n)
{
char *m;
m = dtmalloc(strlen(n) + 1);
strcpy(m, n);
setmalloctag(m, getcallerpc(&n));
return m;
}
DTProbe *
dtpnew(char *name, DTProvider *prov, void *aux)
{
DTProbe *p, **pp;
p = dtmalloc(sizeof(DTProbe));
p->name = dtstrdup(name);
p->prov = prov;
p->aux = aux;
p->enablist.probnext = p->enablist.probprev = &p->enablist;
for(pp = &prov->probes; *pp != nil; pp = &(*pp)->provnext)
;
*pp = p;
return p;
}
/* does the pattern match at most one probe (or provider if provonly)? */
static int
patunique(char *pat, int provonly)
{
for(;; pat++)
switch(*pat){
case ':':
if(provonly){
case 0:
return 1;
}
break;
case '?':
case '*':
return 0;
}
}
static char *
partmatch(char *pat, char *str, int provonly)
{
for(;; pat++, str++){
if(*pat == '*')
return pat;
if(*pat != *str && (*pat != '?' || *str == ':') && (!provonly || *pat != ':' || *str != 0))
return nil;
if(*pat == 0 || *pat == ':' && provonly)
return (void*)-1;
}
}
/*
do a wildcard match with * and ?, but don't match : against a wildcard
if provonly, stop at the first :
replacing empty parts with * is done in user space
*/
int
dtnamematch(char *pat, char *str, int provonly)
{
char *patp, *strp, *p;
patp = partmatch(pat, str, provonly);
if(patp == nil) return 0;
if(patp == (void*)-1) return 1;
/* reached a * */
strp = str + (patp - pat);
patp++;
for(;;){
/* try the rest of the pattern against each position */
p = partmatch(patp, strp, provonly);
if(p == nil){
if(*strp == 0 || *strp == ':') return 0;
strp++;
continue;
}
if(p == (void*)-1)
return 1;
/* reached another * */
strp += p - patp;
patp = p + 1;
}
}
int
dtpmatch(char *name, DTProbe ***ret)
{
DTProbe **l;
int nl;
DTProvider **provp, *prov;
DTProbe **pp, *p;
int unique, uniqueprov;
l = nil;
nl = 0;
unique = patunique(name, 0);
uniqueprov = patunique(name, 1);
for(provp = dtproviders; prov = *provp, prov != nil; provp++){
if(!dtnamematch(name, prov->name, 1))
continue;
if(!prov->provided){
prov->provided = 1;
prov->provide(prov);
}
for(pp = &prov->probes; p = *pp, p != nil; pp = &p->provnext){
if(dtnamematch(name, p->name, 0)){
if(ret != nil){
l = dtrealloc(l, (nl + 1) * sizeof(DTProbe *));
l[nl] = p;
}
nl++;
if(unique) goto out;
}
}
if(uniqueprov) goto out;
}
out:
if(ret != nil)
*ret = l;
return nl;
}
int
dtplist(DTProbe ***ret)
{
DTProbe **l;
int nl;
DTProvider **provp, *prov;
DTProbe **pp, *p;
l = nil;
nl = 0;
for(provp = dtproviders; prov = *provp, prov != nil; provp++){
if(!prov->provided){
prov->provided = 1;
prov->provide(prov);
}
for(pp = &prov->probes; p = *pp, p != nil; pp = &p->provnext){
if(ret != nil){
l = dtrealloc(l, (nl + 1) * sizeof(DTProbe *));
l[nl] = p;
}
nl++;
}
}
if(ret != nil)
*ret = l;
else
dtfree(l);
return nl;
}
|
