]>
Commit | Line | Data |
---|---|---|
1 | /* modules/m_cap.c | |
2 | * | |
3 | * Copyright (C) 2005 Lee Hardy <lee@leeh.co.uk> | |
4 | * Copyright (C) 2005 ircd-ratbox development team | |
5 | * Copyright (C) 2016 William Pitcock <nenolod@dereferenced.org> | |
6 | * | |
7 | * Redistribution and use in source and binary forms, with or without | |
8 | * modification, are permitted provided that the following conditions are | |
9 | * met: | |
10 | * | |
11 | * 1.Redistributions of source code must retain the above copyright notice, | |
12 | * this list of conditions and the following disclaimer. | |
13 | * 2.Redistributions in binary form must reproduce the above copyright | |
14 | * notice, this list of conditions and the following disclaimer in the | |
15 | * documentation and/or other materials provided with the distribution. | |
16 | * 3.The name of the author may not be used to endorse or promote products | |
17 | * derived from this software without specific prior written permission. | |
18 | * | |
19 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | |
20 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | |
21 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | |
22 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, | |
23 | * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | |
24 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR | |
25 | * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
26 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | |
27 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING | |
28 | * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
29 | * POSSIBILITY OF SUCH DAMAGE. | |
30 | */ | |
31 | ||
32 | #include "stdinc.h" | |
33 | #include "class.h" | |
34 | #include "client.h" | |
35 | #include "match.h" | |
36 | #include "ircd.h" | |
37 | #include "numeric.h" | |
38 | #include "msg.h" | |
39 | #include "parse.h" | |
40 | #include "modules.h" | |
41 | #include "s_serv.h" | |
42 | #include "s_user.h" | |
43 | #include "send.h" | |
44 | #include "s_conf.h" | |
45 | #include "hash.h" | |
46 | ||
47 | static const char cap_desc[] = "Provides the commands used for client capability negotiation"; | |
48 | ||
49 | typedef int (*bqcmp)(const void *, const void *); | |
50 | ||
51 | static void m_cap(struct MsgBuf *, struct Client *, struct Client *, int, const char **); | |
52 | ||
53 | struct Message cap_msgtab = { | |
54 | "CAP", 0, 0, 0, 0, | |
55 | {{m_cap, 2}, {m_cap, 2}, mg_ignore, mg_ignore, mg_ignore, {m_cap, 2}} | |
56 | }; | |
57 | ||
58 | mapi_clist_av1 cap_clist[] = { &cap_msgtab, NULL }; | |
59 | ||
60 | DECLARE_MODULE_AV2(cap, NULL, NULL, cap_clist, NULL, NULL, NULL, NULL, cap_desc); | |
61 | ||
62 | #define IsCapableEntry(c, e) IsCapable(c, 1 << (e)->value) | |
63 | #define HasCapabilityFlag(c, f) (c->ownerdata != NULL && (((struct ClientCapability *)c->ownerdata)->flags & (f)) == f) | |
64 | ||
65 | static inline int | |
66 | clicap_visible(struct Client *client_p, const struct CapabilityEntry *cap) | |
67 | { | |
68 | struct ClientCapability *clicap; | |
69 | ||
70 | /* orphaned caps shouldn't be visible */ | |
71 | if (cap->flags & CAP_ORPHANED) | |
72 | return 0; | |
73 | ||
74 | if (cap->ownerdata == NULL) | |
75 | return 1; | |
76 | ||
77 | clicap = cap->ownerdata; | |
78 | if (clicap->visible == NULL) | |
79 | return 1; | |
80 | ||
81 | return clicap->visible(client_p); | |
82 | } | |
83 | ||
84 | /* clicap_find() | |
85 | * Used iteratively over a buffer, extracts individual cap tokens. | |
86 | * | |
87 | * Inputs: buffer to start iterating over (NULL to iterate over existing buf) | |
88 | * int pointer to whether the cap token is negated | |
89 | * int pointer to whether we finish with success | |
90 | * Ouputs: Cap entry if found, NULL otherwise. | |
91 | */ | |
92 | static struct CapabilityEntry * | |
93 | clicap_find(const char *data, int *negate, int *finished) | |
94 | { | |
95 | static char buf[BUFSIZE]; | |
96 | static char *p; | |
97 | struct CapabilityEntry *cap; | |
98 | char *s; | |
99 | ||
100 | *negate = 0; | |
101 | ||
102 | if(data) | |
103 | { | |
104 | rb_strlcpy(buf, data, sizeof(buf)); | |
105 | p = buf; | |
106 | } | |
107 | ||
108 | if(*finished) | |
109 | return NULL; | |
110 | ||
111 | /* skip any whitespace */ | |
112 | while(*p && IsSpace(*p)) | |
113 | p++; | |
114 | ||
115 | if(EmptyString(p)) | |
116 | { | |
117 | *finished = 1; | |
118 | return NULL; | |
119 | } | |
120 | ||
121 | if(*p == '-') | |
122 | { | |
123 | *negate = 1; | |
124 | p++; | |
125 | ||
126 | /* someone sent a '-' without a parameter.. */ | |
127 | if(*p == '\0') | |
128 | return NULL; | |
129 | } | |
130 | ||
131 | if((s = strchr(p, ' '))) | |
132 | *s++ = '\0'; | |
133 | ||
134 | if((cap = capability_find(cli_capindex, p)) != NULL) | |
135 | { | |
136 | if(s) | |
137 | p = s; | |
138 | else | |
139 | *finished = 1; | |
140 | } | |
141 | ||
142 | return cap; | |
143 | } | |
144 | ||
145 | /* clicap_generate() | |
146 | * Generates a list of capabilities. | |
147 | * | |
148 | * Inputs: client to send to, subcmd to send, | |
149 | * flags to match against: 0 to do none, -1 if client has no flags | |
150 | * Outputs: None | |
151 | */ | |
152 | static void | |
153 | clicap_generate(struct Client *source_p, const char *subcmd, int flags) | |
154 | { | |
155 | static char buf_prefix[DATALEN + 1]; | |
156 | static char buf_list[DATALEN + 1]; | |
157 | const char *str_cont = " * :"; | |
158 | const char *str_final = " :"; | |
159 | int len_prefix; | |
160 | int max_list; | |
161 | struct CapabilityEntry *entry; | |
162 | rb_dictionary_iter iter; | |
163 | ||
164 | buf_prefix[0] = '\0'; | |
165 | len_prefix = rb_snprintf_try_append(buf_prefix, sizeof(buf_prefix), | |
166 | ":%s CAP %s %s", | |
167 | me.name, | |
168 | EmptyString(source_p->name) ? "*" : source_p->name, | |
169 | subcmd); | |
170 | ||
171 | /* shortcut, nothing to do */ | |
172 | if (flags == -1 || len_prefix < 0) { | |
173 | sendto_one(source_p, "%s%s", buf_prefix, str_final); | |
174 | return; | |
175 | } | |
176 | ||
177 | buf_list[0] = '\0'; | |
178 | max_list = sizeof(buf_prefix) - len_prefix - strlen(str_cont); | |
179 | ||
180 | RB_DICTIONARY_FOREACH(entry, &iter, cli_capindex->cap_dict) { | |
181 | struct ClientCapability *clicap = entry->ownerdata; | |
182 | const char *data = NULL; | |
183 | ||
184 | if (flags && !IsCapableEntry(source_p, entry)) | |
185 | continue; | |
186 | ||
187 | if (!clicap_visible(source_p, entry)) | |
188 | continue; | |
189 | ||
190 | if (!flags && (source_p->flags & FLAGS_CLICAP_DATA) && clicap != NULL && clicap->data != NULL) | |
191 | data = clicap->data(source_p); | |
192 | ||
193 | for (int attempts = 0; attempts < 2; attempts++) { | |
194 | if (rb_snprintf_try_append(buf_list, max_list, "%s%s%s%s", | |
195 | buf_list[0] == '\0' ? "" : " ", /* space between caps */ | |
196 | entry->cap, | |
197 | data != NULL ? "=" : "", /* '=' between cap and data */ | |
198 | data != NULL ? data : "") < 0 | |
199 | && buf_list[0] != '\0') { | |
200 | ||
201 | if (!(source_p->flags & FLAGS_CLICAP_DATA)) { | |
202 | /* the client doesn't support multiple lines */ | |
203 | break; | |
204 | } | |
205 | ||
206 | /* doesn't fit in the buffer, output what we have */ | |
207 | sendto_one(source_p, "%s%s%s", buf_prefix, str_cont, buf_list); | |
208 | ||
209 | /* reset the buffer and go around the loop one more time */ | |
210 | buf_list[0] = '\0'; | |
211 | } else { | |
212 | break; | |
213 | } | |
214 | } | |
215 | } | |
216 | ||
217 | sendto_one(source_p, "%s%s%s", buf_prefix, str_final, buf_list); | |
218 | } | |
219 | ||
220 | static void | |
221 | cap_ack(struct Client *source_p, const char *arg) | |
222 | { | |
223 | struct CapabilityEntry *cap; | |
224 | int capadd = 0, capdel = 0; | |
225 | int finished = 0, negate; | |
226 | ||
227 | if(EmptyString(arg)) | |
228 | return; | |
229 | ||
230 | for(cap = clicap_find(arg, &negate, &finished); cap; | |
231 | cap = clicap_find(NULL, &negate, &finished)) | |
232 | { | |
233 | /* sent an ACK for something they havent REQd */ | |
234 | if(!IsCapableEntry(source_p, cap)) | |
235 | continue; | |
236 | ||
237 | if(negate) | |
238 | { | |
239 | /* dont let them ack something sticky off */ | |
240 | if(HasCapabilityFlag(cap, CLICAP_FLAGS_STICKY)) | |
241 | continue; | |
242 | ||
243 | capdel |= (1 << cap->value); | |
244 | } | |
245 | else | |
246 | capadd |= (1 << cap->value); | |
247 | } | |
248 | ||
249 | source_p->localClient->caps |= capadd; | |
250 | source_p->localClient->caps &= ~capdel; | |
251 | } | |
252 | ||
253 | static void | |
254 | cap_end(struct Client *source_p, const char *arg) | |
255 | { | |
256 | if(IsRegistered(source_p)) | |
257 | return; | |
258 | ||
259 | source_p->flags &= ~FLAGS_CLICAP; | |
260 | ||
261 | if(source_p->name[0] && source_p->flags & FLAGS_SENTUSER) | |
262 | { | |
263 | register_local_user(source_p, source_p); | |
264 | } | |
265 | } | |
266 | ||
267 | static void | |
268 | cap_list(struct Client *source_p, const char *arg) | |
269 | { | |
270 | /* list of what theyre currently using */ | |
271 | clicap_generate(source_p, "LIST", | |
272 | source_p->localClient->caps ? source_p->localClient->caps : -1); | |
273 | } | |
274 | ||
275 | static void | |
276 | cap_ls(struct Client *source_p, const char *arg) | |
277 | { | |
278 | int caps_version = 301; | |
279 | ||
280 | if(!IsRegistered(source_p)) | |
281 | source_p->flags |= FLAGS_CLICAP; | |
282 | ||
283 | if (!EmptyString(arg)) { | |
284 | caps_version = atoi(arg); | |
285 | } | |
286 | ||
287 | if (caps_version >= 302) { | |
288 | source_p->flags |= FLAGS_CLICAP_DATA; | |
289 | source_p->localClient->caps |= CLICAP_CAP_NOTIFY; | |
290 | } | |
291 | ||
292 | /* list of what we support */ | |
293 | clicap_generate(source_p, "LS", 0); | |
294 | } | |
295 | ||
296 | static void | |
297 | cap_req(struct Client *source_p, const char *arg) | |
298 | { | |
299 | static char buf_prefix[DATALEN + 1]; | |
300 | static char buf_list[2][DATALEN + 1]; | |
301 | const char *str_cont = " * :"; | |
302 | const char *str_final = " :"; | |
303 | int len_prefix; | |
304 | int max_list; | |
305 | struct CapabilityEntry *cap; | |
306 | int i = 0; | |
307 | int capadd = 0, capdel = 0; | |
308 | int finished = 0, negate; | |
309 | ||
310 | if(!IsRegistered(source_p)) | |
311 | source_p->flags |= FLAGS_CLICAP; | |
312 | ||
313 | if(EmptyString(arg)) | |
314 | return; | |
315 | ||
316 | buf_prefix[0] = '\0'; | |
317 | len_prefix = rb_snprintf_try_append(buf_prefix, sizeof(buf_prefix), | |
318 | ":%s CAP %s ACK", | |
319 | me.name, | |
320 | EmptyString(source_p->name) ? "*" : source_p->name); | |
321 | ||
322 | buf_list[0][0] = '\0'; | |
323 | buf_list[1][0] = '\0'; | |
324 | max_list = sizeof(buf_prefix) - len_prefix - strlen(str_cont); | |
325 | ||
326 | for(cap = clicap_find(arg, &negate, &finished); cap; | |
327 | cap = clicap_find(NULL, &negate, &finished)) | |
328 | { | |
329 | const char *type; | |
330 | ||
331 | if(negate) | |
332 | { | |
333 | if(HasCapabilityFlag(cap, CLICAP_FLAGS_STICKY)) | |
334 | { | |
335 | finished = 0; | |
336 | break; | |
337 | } | |
338 | ||
339 | type = "-"; | |
340 | capdel |= (1 << cap->value); | |
341 | } | |
342 | else | |
343 | { | |
344 | if (!clicap_visible(source_p, cap)) | |
345 | { | |
346 | finished = 0; | |
347 | break; | |
348 | } | |
349 | ||
350 | type = ""; | |
351 | capadd |= (1 << cap->value); | |
352 | } | |
353 | ||
354 | /* XXX this probably should exclude REQACK'd caps from capadd/capdel, but keep old behaviour for now */ | |
355 | if(HasCapabilityFlag(cap, CLICAP_FLAGS_REQACK)) | |
356 | { | |
357 | type = "~"; | |
358 | } | |
359 | ||
360 | for (int attempts = 0; attempts < 2; attempts++) { | |
361 | if (rb_snprintf_try_append(buf_list[i], max_list, "%s%s%s", | |
362 | buf_list[i][0] == '\0' ? "" : " ", /* space between caps */ | |
363 | type, | |
364 | cap->cap) < 0 | |
365 | && buf_list[i][0] != '\0') { | |
366 | ||
367 | if (!(source_p->flags & FLAGS_CLICAP_DATA)) { | |
368 | /* the client doesn't support multiple lines */ | |
369 | break; | |
370 | } | |
371 | ||
372 | /* doesn't fit in the buffer, move to the next one */ | |
373 | if (i < 2) { | |
374 | i++; | |
375 | } else { | |
376 | /* uh-oh */ | |
377 | break; | |
378 | } | |
379 | ||
380 | /* reset the buffer and go around the loop one more time */ | |
381 | buf_list[i][0] = '\0'; | |
382 | } else { | |
383 | break; | |
384 | } | |
385 | } | |
386 | } | |
387 | ||
388 | if(!finished) | |
389 | { | |
390 | sendto_one(source_p, ":%s CAP %s NAK :%s", | |
391 | me.name, EmptyString(source_p->name) ? "*" : source_p->name, arg); | |
392 | return; | |
393 | } | |
394 | ||
395 | if (i) { | |
396 | sendto_one(source_p, "%s%s%s", buf_prefix, str_cont, buf_list[0]); | |
397 | sendto_one(source_p, "%s%s%s", buf_prefix, str_final, buf_list[1]); | |
398 | } else { | |
399 | sendto_one(source_p, "%s%s%s", buf_prefix, str_final, buf_list[0]); | |
400 | } | |
401 | ||
402 | source_p->localClient->caps |= capadd; | |
403 | source_p->localClient->caps &= ~capdel; | |
404 | } | |
405 | ||
406 | static struct clicap_cmd | |
407 | { | |
408 | const char *cmd; | |
409 | void (*func)(struct Client *source_p, const char *arg); | |
410 | } clicap_cmdlist[] = { | |
411 | /* This list *MUST* be in alphabetical order */ | |
412 | { "ACK", cap_ack }, | |
413 | { "END", cap_end }, | |
414 | { "LIST", cap_list }, | |
415 | { "LS", cap_ls }, | |
416 | { "REQ", cap_req }, | |
417 | }; | |
418 | ||
419 | static int | |
420 | clicap_cmd_search(const char *command, struct clicap_cmd *entry) | |
421 | { | |
422 | return irccmp(command, entry->cmd); | |
423 | } | |
424 | ||
425 | static void | |
426 | m_cap(struct MsgBuf *msgbuf_p, struct Client *client_p, struct Client *source_p, int parc, const char *parv[]) | |
427 | { | |
428 | struct clicap_cmd *cmd; | |
429 | ||
430 | if(!(cmd = bsearch(parv[1], clicap_cmdlist, | |
431 | sizeof(clicap_cmdlist) / sizeof(struct clicap_cmd), | |
432 | sizeof(struct clicap_cmd), (bqcmp) clicap_cmd_search))) | |
433 | { | |
434 | sendto_one(source_p, form_str(ERR_INVALIDCAPCMD), | |
435 | me.name, EmptyString(source_p->name) ? "*" : source_p->name, | |
436 | parv[1]); | |
437 | return; | |
438 | } | |
439 | ||
440 | (cmd->func)(source_p, parv[2]); | |
441 | } |