]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * ircd-ratbox: A slightly useful ircd. | |
3 | * channel.c: Controls channels. | |
4 | * | |
5 | * Copyright (C) 1990 Jarkko Oikarinen and University of Oulu, Co Center | |
6 | * Copyright (C) 1996-2002 Hybrid Development Team | |
7 | * Copyright (C) 2002-2005 ircd-ratbox development team | |
8 | * | |
9 | * This program is free software; you can redistribute it and/or modify | |
10 | * it under the terms of the GNU General Public License as published by | |
11 | * the Free Software Foundation; either version 2 of the License, or | |
12 | * (at your option) any later version. | |
13 | * | |
14 | * This program is distributed in the hope that it will be useful, | |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
18 | * | |
19 | * You should have received a copy of the GNU General Public License | |
20 | * along with this program; if not, write to the Free Software | |
21 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 | |
22 | * USA | |
23 | * | |
24 | * $Id: channel.c 3580 2007-11-07 23:45:14Z jilles $ | |
25 | */ | |
26 | ||
27 | #include "stdinc.h" | |
28 | #include "channel.h" | |
29 | #include "chmode.h" | |
30 | #include "client.h" | |
31 | #include "common.h" | |
32 | #include "hash.h" | |
33 | #include "hook.h" | |
34 | #include "match.h" | |
35 | #include "ircd.h" | |
36 | #include "numeric.h" | |
37 | #include "s_serv.h" /* captab */ | |
38 | #include "s_user.h" | |
39 | #include "send.h" | |
40 | #include "whowas.h" | |
41 | #include "s_conf.h" /* ConfigFileEntry, ConfigChannel */ | |
42 | #include "s_newconf.h" | |
43 | #include "logger.h" | |
44 | ||
45 | struct config_channel_entry ConfigChannel; | |
46 | rb_dlink_list global_channel_list; | |
47 | static rb_bh *channel_heap; | |
48 | static rb_bh *ban_heap; | |
49 | static rb_bh *topic_heap; | |
50 | static rb_bh *member_heap; | |
51 | ||
52 | static int channel_capabs[] = { CAP_EX, CAP_IE, | |
53 | CAP_SERVICE, | |
54 | CAP_TS6 | |
55 | }; | |
56 | ||
57 | #define NCHCAPS (sizeof(channel_capabs)/sizeof(int)) | |
58 | #define NCHCAP_COMBOS (1 << NCHCAPS) | |
59 | ||
60 | static struct ChCapCombo chcap_combos[NCHCAP_COMBOS]; | |
61 | ||
62 | static void free_topic(struct Channel *chptr); | |
63 | ||
64 | static int h_can_join; | |
65 | ||
66 | /* init_channels() | |
67 | * | |
68 | * input - | |
69 | * output - | |
70 | * side effects - initialises the various blockheaps | |
71 | */ | |
72 | void | |
73 | init_channels(void) | |
74 | { | |
75 | channel_heap = rb_bh_create(sizeof(struct Channel), CHANNEL_HEAP_SIZE, "channel_heap"); | |
76 | ban_heap = rb_bh_create(sizeof(struct Ban), BAN_HEAP_SIZE, "ban_heap"); | |
77 | topic_heap = rb_bh_create(TOPICLEN + 1 + USERHOST_REPLYLEN, TOPIC_HEAP_SIZE, "topic_heap"); | |
78 | member_heap = rb_bh_create(sizeof(struct membership), MEMBER_HEAP_SIZE, "member_heap"); | |
79 | ||
80 | h_can_join = register_hook("can_join"); | |
81 | } | |
82 | ||
83 | /* | |
84 | * allocate_channel - Allocates a channel | |
85 | */ | |
86 | struct Channel * | |
87 | allocate_channel(const char *chname) | |
88 | { | |
89 | struct Channel *chptr; | |
90 | chptr = rb_bh_alloc(channel_heap); | |
91 | chptr->chname = rb_strdup(chname); | |
92 | return (chptr); | |
93 | } | |
94 | ||
95 | void | |
96 | free_channel(struct Channel *chptr) | |
97 | { | |
98 | rb_free(chptr->chname); | |
99 | rb_bh_free(channel_heap, chptr); | |
100 | } | |
101 | ||
102 | struct Ban * | |
103 | allocate_ban(const char *banstr, const char *who) | |
104 | { | |
105 | struct Ban *bptr; | |
106 | bptr = rb_bh_alloc(ban_heap); | |
107 | bptr->banstr = rb_strdup(banstr); | |
108 | bptr->who = rb_strdup(who); | |
109 | ||
110 | return (bptr); | |
111 | } | |
112 | ||
113 | void | |
114 | free_ban(struct Ban *bptr) | |
115 | { | |
116 | rb_free(bptr->banstr); | |
117 | rb_free(bptr->who); | |
118 | rb_bh_free(ban_heap, bptr); | |
119 | } | |
120 | ||
121 | ||
122 | /* find_channel_membership() | |
123 | * | |
124 | * input - channel to find them in, client to find | |
125 | * output - membership of client in channel, else NULL | |
126 | * side effects - | |
127 | */ | |
128 | struct membership * | |
129 | find_channel_membership(struct Channel *chptr, struct Client *client_p) | |
130 | { | |
131 | struct membership *msptr; | |
132 | rb_dlink_node *ptr; | |
133 | ||
134 | if(!IsClient(client_p)) | |
135 | return NULL; | |
136 | ||
137 | /* Pick the most efficient list to use to be nice to things like | |
138 | * CHANSERV which could be in a large number of channels | |
139 | */ | |
140 | if(rb_dlink_list_length(&chptr->members) < rb_dlink_list_length(&client_p->user->channel)) | |
141 | { | |
142 | RB_DLINK_FOREACH(ptr, chptr->members.head) | |
143 | { | |
144 | msptr = ptr->data; | |
145 | ||
146 | if(msptr->client_p == client_p) | |
147 | return msptr; | |
148 | } | |
149 | } | |
150 | else | |
151 | { | |
152 | RB_DLINK_FOREACH(ptr, client_p->user->channel.head) | |
153 | { | |
154 | msptr = ptr->data; | |
155 | ||
156 | if(msptr->chptr == chptr) | |
157 | return msptr; | |
158 | } | |
159 | } | |
160 | ||
161 | return NULL; | |
162 | } | |
163 | ||
164 | /* find_channel_status() | |
165 | * | |
166 | * input - membership to get status for, whether we can combine flags | |
167 | * output - flags of user on channel | |
168 | * side effects - | |
169 | */ | |
170 | const char * | |
171 | find_channel_status(struct membership *msptr, int combine) | |
172 | { | |
173 | static char buffer[3]; | |
174 | char *p; | |
175 | ||
176 | p = buffer; | |
177 | ||
178 | if(is_chanop(msptr)) | |
179 | { | |
180 | if(!combine) | |
181 | return "@"; | |
182 | *p++ = '@'; | |
183 | } | |
184 | ||
185 | if(is_voiced(msptr)) | |
186 | *p++ = '+'; | |
187 | ||
188 | *p = '\0'; | |
189 | return buffer; | |
190 | } | |
191 | ||
192 | /* add_user_to_channel() | |
193 | * | |
194 | * input - channel to add client to, client to add, channel flags | |
195 | * output - | |
196 | * side effects - user is added to channel | |
197 | */ | |
198 | void | |
199 | add_user_to_channel(struct Channel *chptr, struct Client *client_p, int flags) | |
200 | { | |
201 | struct membership *msptr; | |
202 | ||
203 | s_assert(client_p->user != NULL); | |
204 | if(client_p->user == NULL) | |
205 | return; | |
206 | ||
207 | msptr = rb_bh_alloc(member_heap); | |
208 | ||
209 | msptr->chptr = chptr; | |
210 | msptr->client_p = client_p; | |
211 | msptr->flags = flags; | |
212 | ||
213 | rb_dlinkAdd(msptr, &msptr->usernode, &client_p->user->channel); | |
214 | rb_dlinkAdd(msptr, &msptr->channode, &chptr->members); | |
215 | ||
216 | if(MyClient(client_p)) | |
217 | rb_dlinkAdd(msptr, &msptr->locchannode, &chptr->locmembers); | |
218 | } | |
219 | ||
220 | /* remove_user_from_channel() | |
221 | * | |
222 | * input - membership pointer to remove from channel | |
223 | * output - | |
224 | * side effects - membership (thus user) is removed from channel | |
225 | */ | |
226 | void | |
227 | remove_user_from_channel(struct membership *msptr) | |
228 | { | |
229 | struct Client *client_p; | |
230 | struct Channel *chptr; | |
231 | s_assert(msptr != NULL); | |
232 | if(msptr == NULL) | |
233 | return; | |
234 | ||
235 | client_p = msptr->client_p; | |
236 | chptr = msptr->chptr; | |
237 | ||
238 | rb_dlinkDelete(&msptr->usernode, &client_p->user->channel); | |
239 | rb_dlinkDelete(&msptr->channode, &chptr->members); | |
240 | ||
241 | if(client_p->servptr == &me) | |
242 | rb_dlinkDelete(&msptr->locchannode, &chptr->locmembers); | |
243 | ||
244 | if(!(chptr->mode.mode & MODE_PERMANENT) && rb_dlink_list_length(&chptr->members) <= 0) | |
245 | destroy_channel(chptr); | |
246 | ||
247 | rb_bh_free(member_heap, msptr); | |
248 | ||
249 | return; | |
250 | } | |
251 | ||
252 | /* remove_user_from_channels() | |
253 | * | |
254 | * input - user to remove from all channels | |
255 | * output - | |
256 | * side effects - user is removed from all channels | |
257 | */ | |
258 | void | |
259 | remove_user_from_channels(struct Client *client_p) | |
260 | { | |
261 | struct Channel *chptr; | |
262 | struct membership *msptr; | |
263 | rb_dlink_node *ptr; | |
264 | rb_dlink_node *next_ptr; | |
265 | ||
266 | if(client_p == NULL) | |
267 | return; | |
268 | ||
269 | RB_DLINK_FOREACH_SAFE(ptr, next_ptr, client_p->user->channel.head) | |
270 | { | |
271 | msptr = ptr->data; | |
272 | chptr = msptr->chptr; | |
273 | ||
274 | rb_dlinkDelete(&msptr->channode, &chptr->members); | |
275 | ||
276 | if(client_p->servptr == &me) | |
277 | rb_dlinkDelete(&msptr->locchannode, &chptr->locmembers); | |
278 | ||
279 | if(!(chptr->mode.mode & MODE_PERMANENT) && rb_dlink_list_length(&chptr->members) <= 0) | |
280 | destroy_channel(chptr); | |
281 | ||
282 | rb_bh_free(member_heap, msptr); | |
283 | } | |
284 | ||
285 | client_p->user->channel.head = client_p->user->channel.tail = NULL; | |
286 | client_p->user->channel.length = 0; | |
287 | } | |
288 | ||
289 | /* invalidate_bancache_user() | |
290 | * | |
291 | * input - user to invalidate ban cache for | |
292 | * output - | |
293 | * side effects - ban cache is invalidated for all memberships of that user | |
294 | * to be used after a nick change | |
295 | */ | |
296 | void | |
297 | invalidate_bancache_user(struct Client *client_p) | |
298 | { | |
299 | struct membership *msptr; | |
300 | rb_dlink_node *ptr; | |
301 | ||
302 | if(client_p == NULL) | |
303 | return; | |
304 | ||
305 | RB_DLINK_FOREACH(ptr, client_p->user->channel.head) | |
306 | { | |
307 | msptr = ptr->data; | |
308 | msptr->bants = 0; | |
309 | msptr->flags &= ~CHFL_BANNED; | |
310 | } | |
311 | } | |
312 | ||
313 | /* check_channel_name() | |
314 | * | |
315 | * input - channel name | |
316 | * output - 1 if valid channel name, else 0 | |
317 | * side effects - | |
318 | */ | |
319 | int | |
320 | check_channel_name(const char *name) | |
321 | { | |
322 | s_assert(name != NULL); | |
323 | if(name == NULL) | |
324 | return 0; | |
325 | ||
326 | for (; *name; ++name) | |
327 | { | |
328 | if(!IsChanChar(*name)) | |
329 | return 0; | |
330 | } | |
331 | ||
332 | return 1; | |
333 | } | |
334 | ||
335 | /* free_channel_list() | |
336 | * | |
337 | * input - rb_dlink list to free | |
338 | * output - | |
339 | * side effects - list of b/e/I modes is cleared | |
340 | */ | |
341 | void | |
342 | free_channel_list(rb_dlink_list * list) | |
343 | { | |
344 | rb_dlink_node *ptr; | |
345 | rb_dlink_node *next_ptr; | |
346 | struct Ban *actualBan; | |
347 | ||
348 | RB_DLINK_FOREACH_SAFE(ptr, next_ptr, list->head) | |
349 | { | |
350 | actualBan = ptr->data; | |
351 | free_ban(actualBan); | |
352 | } | |
353 | ||
354 | list->head = list->tail = NULL; | |
355 | list->length = 0; | |
356 | } | |
357 | ||
358 | /* destroy_channel() | |
359 | * | |
360 | * input - channel to destroy | |
361 | * output - | |
362 | * side effects - channel is obliterated | |
363 | */ | |
364 | void | |
365 | destroy_channel(struct Channel *chptr) | |
366 | { | |
367 | rb_dlink_node *ptr, *next_ptr; | |
368 | ||
369 | RB_DLINK_FOREACH_SAFE(ptr, next_ptr, chptr->invites.head) | |
370 | { | |
371 | del_invite(chptr, ptr->data); | |
372 | } | |
373 | ||
374 | /* free all bans/exceptions/denies */ | |
375 | free_channel_list(&chptr->banlist); | |
376 | free_channel_list(&chptr->exceptlist); | |
377 | free_channel_list(&chptr->invexlist); | |
378 | free_channel_list(&chptr->quietlist); | |
379 | ||
380 | /* Free the topic */ | |
381 | free_topic(chptr); | |
382 | ||
383 | rb_dlinkDelete(&chptr->node, &global_channel_list); | |
384 | del_from_channel_hash(chptr->chname, chptr); | |
385 | free_channel(chptr); | |
386 | } | |
387 | ||
388 | /* channel_pub_or_secret() | |
389 | * | |
390 | * input - channel | |
391 | * output - "=" if public, "@" if secret, else "*" | |
392 | * side effects - | |
393 | */ | |
394 | static const char * | |
395 | channel_pub_or_secret(struct Channel *chptr) | |
396 | { | |
397 | if(PubChannel(chptr)) | |
398 | return ("="); | |
399 | else if(SecretChannel(chptr)) | |
400 | return ("@"); | |
401 | return ("*"); | |
402 | } | |
403 | ||
404 | /* channel_member_names() | |
405 | * | |
406 | * input - channel to list, client to list to, show endofnames | |
407 | * output - | |
408 | * side effects - client is given list of users on channel | |
409 | */ | |
410 | void | |
411 | channel_member_names(struct Channel *chptr, struct Client *client_p, int show_eon) | |
412 | { | |
413 | struct membership *msptr; | |
414 | struct Client *target_p; | |
415 | rb_dlink_node *ptr; | |
416 | char lbuf[BUFSIZE]; | |
417 | char *t; | |
418 | int mlen; | |
419 | int tlen; | |
420 | int cur_len; | |
421 | int is_member; | |
422 | int stack = IsCapable(client_p, CLICAP_MULTI_PREFIX); | |
423 | ||
424 | if(ShowChannel(client_p, chptr)) | |
425 | { | |
426 | is_member = IsMember(client_p, chptr); | |
427 | ||
428 | cur_len = mlen = rb_sprintf(lbuf, form_str(RPL_NAMREPLY), | |
429 | me.name, client_p->name, | |
430 | channel_pub_or_secret(chptr), chptr->chname); | |
431 | ||
432 | t = lbuf + cur_len; | |
433 | ||
434 | RB_DLINK_FOREACH(ptr, chptr->members.head) | |
435 | { | |
436 | msptr = ptr->data; | |
437 | target_p = msptr->client_p; | |
438 | ||
439 | if(IsInvisible(target_p) && !is_member) | |
440 | continue; | |
441 | ||
442 | /* space, possible "@+" prefix */ | |
443 | if(cur_len + strlen(target_p->name) + 3 >= BUFSIZE - 3) | |
444 | { | |
445 | *(t - 1) = '\0'; | |
446 | sendto_one(client_p, "%s", lbuf); | |
447 | cur_len = mlen; | |
448 | t = lbuf + mlen; | |
449 | } | |
450 | ||
451 | tlen = rb_sprintf(t, "%s%s ", find_channel_status(msptr, stack), | |
452 | target_p->name); | |
453 | ||
454 | cur_len += tlen; | |
455 | t += tlen; | |
456 | } | |
457 | ||
458 | /* The old behaviour here was to always output our buffer, | |
459 | * even if there are no clients we can show. This happens | |
460 | * when a client does "NAMES" with no parameters, and all | |
461 | * the clients on a -sp channel are +i. I dont see a good | |
462 | * reason for keeping that behaviour, as it just wastes | |
463 | * bandwidth. --anfl | |
464 | */ | |
465 | if(cur_len != mlen) | |
466 | { | |
467 | *(t - 1) = '\0'; | |
468 | sendto_one(client_p, "%s", lbuf); | |
469 | } | |
470 | } | |
471 | ||
472 | if(show_eon) | |
473 | sendto_one(client_p, form_str(RPL_ENDOFNAMES), | |
474 | me.name, client_p->name, chptr->chname); | |
475 | } | |
476 | ||
477 | /* del_invite() | |
478 | * | |
479 | * input - channel to remove invite from, client to remove | |
480 | * output - | |
481 | * side effects - user is removed from invite list, if exists | |
482 | */ | |
483 | void | |
484 | del_invite(struct Channel *chptr, struct Client *who) | |
485 | { | |
486 | rb_dlinkFindDestroy(who, &chptr->invites); | |
487 | rb_dlinkFindDestroy(chptr, &who->user->invited); | |
488 | } | |
489 | ||
490 | /* is_banned() | |
491 | * | |
492 | * input - channel to check bans for, user to check bans against | |
493 | * optional prebuilt buffers | |
494 | * output - 1 if banned, else 0 | |
495 | * side effects - | |
496 | */ | |
497 | int | |
498 | is_banned(struct Channel *chptr, struct Client *who, struct membership *msptr, | |
499 | const char *s, const char *s2) | |
500 | { | |
501 | char src_host[NICKLEN + USERLEN + HOSTLEN + 6]; | |
502 | char src_iphost[NICKLEN + USERLEN + HOSTLEN + 6]; | |
503 | char src_althost[NICKLEN + USERLEN + HOSTLEN + 6]; | |
504 | char *s3 = NULL; | |
505 | rb_dlink_node *ptr; | |
506 | struct Ban *actualBan = NULL; | |
507 | struct Ban *actualExcept = NULL; | |
508 | ||
509 | if(!MyClient(who)) | |
510 | return 0; | |
511 | ||
512 | /* if the buffers havent been built, do it here */ | |
513 | if(s == NULL) | |
514 | { | |
515 | rb_sprintf(src_host, "%s!%s@%s", who->name, who->username, who->host); | |
516 | rb_sprintf(src_iphost, "%s!%s@%s", who->name, who->username, who->sockhost); | |
517 | ||
518 | s = src_host; | |
519 | s2 = src_iphost; | |
520 | } | |
521 | if(who->localClient->mangledhost != NULL) | |
522 | { | |
523 | /* if host mangling mode enabled, also check their real host */ | |
524 | if(!strcmp(who->host, who->localClient->mangledhost)) | |
525 | { | |
526 | rb_sprintf(src_althost, "%s!%s@%s", who->name, who->username, who->orighost); | |
527 | s3 = src_althost; | |
528 | } | |
529 | /* if host mangling mode not enabled and no other spoof, | |
530 | * also check the mangled form of their host */ | |
531 | else if (!IsDynSpoof(who)) | |
532 | { | |
533 | rb_sprintf(src_althost, "%s!%s@%s", who->name, who->username, who->localClient->mangledhost); | |
534 | s3 = src_althost; | |
535 | } | |
536 | } | |
537 | ||
538 | RB_DLINK_FOREACH(ptr, chptr->banlist.head) | |
539 | { | |
540 | actualBan = ptr->data; | |
541 | if(match(actualBan->banstr, s) || | |
542 | match(actualBan->banstr, s2) || | |
543 | match_cidr(actualBan->banstr, s2) || | |
544 | match_extban(actualBan->banstr, who, chptr, CHFL_BAN) || | |
545 | (s3 != NULL && match(actualBan->banstr, s3))) | |
546 | break; | |
547 | else | |
548 | actualBan = NULL; | |
549 | } | |
550 | ||
551 | if((actualBan != NULL) && ConfigChannel.use_except) | |
552 | { | |
553 | RB_DLINK_FOREACH(ptr, chptr->exceptlist.head) | |
554 | { | |
555 | actualExcept = ptr->data; | |
556 | ||
557 | /* theyre exempted.. */ | |
558 | if(match(actualExcept->banstr, s) || | |
559 | match(actualExcept->banstr, s2) || | |
560 | match_cidr(actualExcept->banstr, s2) || | |
561 | match_extban(actualExcept->banstr, who, chptr, CHFL_EXCEPTION) || | |
562 | (s3 != NULL && match(actualExcept->banstr, s3))) | |
563 | { | |
564 | /* cache the fact theyre not banned */ | |
565 | if(msptr != NULL) | |
566 | { | |
567 | msptr->bants = chptr->bants; | |
568 | msptr->flags &= ~CHFL_BANNED; | |
569 | } | |
570 | ||
571 | return CHFL_EXCEPTION; | |
572 | } | |
573 | } | |
574 | } | |
575 | ||
576 | /* cache the banned/not banned status */ | |
577 | if(msptr != NULL) | |
578 | { | |
579 | msptr->bants = chptr->bants; | |
580 | ||
581 | if(actualBan != NULL) | |
582 | { | |
583 | msptr->flags |= CHFL_BANNED; | |
584 | return CHFL_BAN; | |
585 | } | |
586 | else | |
587 | { | |
588 | msptr->flags &= ~CHFL_BANNED; | |
589 | return 0; | |
590 | } | |
591 | } | |
592 | ||
593 | return ((actualBan ? CHFL_BAN : 0)); | |
594 | } | |
595 | ||
596 | /* is_quieted() | |
597 | * | |
598 | * input - channel to check bans for, user to check bans against | |
599 | * optional prebuilt buffers | |
600 | * output - 1 if banned, else 0 | |
601 | * side effects - | |
602 | */ | |
603 | int | |
604 | is_quieted(struct Channel *chptr, struct Client *who, struct membership *msptr, | |
605 | const char *s, const char *s2) | |
606 | { | |
607 | char src_host[NICKLEN + USERLEN + HOSTLEN + 6]; | |
608 | char src_iphost[NICKLEN + USERLEN + HOSTLEN + 6]; | |
609 | char src_althost[NICKLEN + USERLEN + HOSTLEN + 6]; | |
610 | char *s3 = NULL; | |
611 | rb_dlink_node *ptr; | |
612 | struct Ban *actualBan = NULL; | |
613 | struct Ban *actualExcept = NULL; | |
614 | ||
615 | if(!MyClient(who)) | |
616 | return 0; | |
617 | ||
618 | /* if the buffers havent been built, do it here */ | |
619 | if(s == NULL) | |
620 | { | |
621 | rb_sprintf(src_host, "%s!%s@%s", who->name, who->username, who->host); | |
622 | rb_sprintf(src_iphost, "%s!%s@%s", who->name, who->username, who->sockhost); | |
623 | ||
624 | s = src_host; | |
625 | s2 = src_iphost; | |
626 | } | |
627 | if(who->localClient->mangledhost != NULL) | |
628 | { | |
629 | /* if host mangling mode enabled, also check their real host */ | |
630 | if(!strcmp(who->host, who->localClient->mangledhost)) | |
631 | { | |
632 | rb_sprintf(src_althost, "%s!%s@%s", who->name, who->username, who->orighost); | |
633 | s3 = src_althost; | |
634 | } | |
635 | /* if host mangling mode not enabled and no other spoof, | |
636 | * also check the mangled form of their host */ | |
637 | else if (!IsDynSpoof(who)) | |
638 | { | |
639 | rb_sprintf(src_althost, "%s!%s@%s", who->name, who->username, who->localClient->mangledhost); | |
640 | s3 = src_althost; | |
641 | } | |
642 | } | |
643 | ||
644 | RB_DLINK_FOREACH(ptr, chptr->quietlist.head) | |
645 | { | |
646 | actualBan = ptr->data; | |
647 | if(match(actualBan->banstr, s) || | |
648 | match(actualBan->banstr, s2) || | |
649 | match_cidr(actualBan->banstr, s2) || | |
650 | match_extban(actualBan->banstr, who, chptr, CHFL_QUIET) || | |
651 | (s3 != NULL && match(actualBan->banstr, s3))) | |
652 | break; | |
653 | else | |
654 | actualBan = NULL; | |
655 | } | |
656 | ||
657 | if((actualBan != NULL) && ConfigChannel.use_except) | |
658 | { | |
659 | RB_DLINK_FOREACH(ptr, chptr->exceptlist.head) | |
660 | { | |
661 | actualExcept = ptr->data; | |
662 | ||
663 | /* theyre exempted.. */ | |
664 | if(match(actualExcept->banstr, s) || | |
665 | match(actualExcept->banstr, s2) || | |
666 | match_cidr(actualExcept->banstr, s2) || | |
667 | match_extban(actualExcept->banstr, who, chptr, CHFL_EXCEPTION) || | |
668 | (s3 != NULL && match(actualExcept->banstr, s3))) | |
669 | { | |
670 | /* cache the fact theyre not banned */ | |
671 | if(msptr != NULL) | |
672 | { | |
673 | msptr->bants = chptr->bants; | |
674 | msptr->flags &= ~CHFL_BANNED; | |
675 | } | |
676 | ||
677 | return CHFL_EXCEPTION; | |
678 | } | |
679 | } | |
680 | } | |
681 | ||
682 | /* cache the banned/not banned status */ | |
683 | if(msptr != NULL) | |
684 | { | |
685 | msptr->bants = chptr->bants; | |
686 | ||
687 | if(actualBan != NULL) | |
688 | { | |
689 | msptr->flags |= CHFL_BANNED; | |
690 | return CHFL_BAN; | |
691 | } | |
692 | else | |
693 | { | |
694 | msptr->flags &= ~CHFL_BANNED; | |
695 | return 0; | |
696 | } | |
697 | } | |
698 | ||
699 | return ((actualBan ? CHFL_BAN : 0)); | |
700 | } | |
701 | ||
702 | /* can_join() | |
703 | * | |
704 | * input - client to check, channel to check for, key | |
705 | * output - reason for not being able to join, else 0 | |
706 | * side effects - | |
707 | */ | |
708 | int | |
709 | can_join(struct Client *source_p, struct Channel *chptr, char *key) | |
710 | { | |
711 | rb_dlink_node *invite = NULL; | |
712 | rb_dlink_node *ptr; | |
713 | struct Ban *invex = NULL; | |
714 | char src_host[NICKLEN + USERLEN + HOSTLEN + 6]; | |
715 | char src_iphost[NICKLEN + USERLEN + HOSTLEN + 6]; | |
716 | char src_althost[NICKLEN + USERLEN + HOSTLEN + 6]; | |
717 | int use_althost = 0; | |
718 | int i = 0; | |
719 | hook_data_channel moduledata; | |
720 | ||
721 | s_assert(source_p->localClient != NULL); | |
722 | ||
723 | rb_sprintf(src_host, "%s!%s@%s", source_p->name, source_p->username, source_p->host); | |
724 | rb_sprintf(src_iphost, "%s!%s@%s", source_p->name, source_p->username, source_p->sockhost); | |
725 | if(source_p->localClient->mangledhost != NULL) | |
726 | { | |
727 | /* if host mangling mode enabled, also check their real host */ | |
728 | if(!strcmp(source_p->host, source_p->localClient->mangledhost)) | |
729 | { | |
730 | rb_sprintf(src_althost, "%s!%s@%s", source_p->name, source_p->username, source_p->orighost); | |
731 | use_althost = 1; | |
732 | } | |
733 | /* if host mangling mode not enabled and no other spoof, | |
734 | * also check the mangled form of their host */ | |
735 | else if (!IsDynSpoof(source_p)) | |
736 | { | |
737 | rb_sprintf(src_althost, "%s!%s@%s", source_p->name, source_p->username, source_p->localClient->mangledhost); | |
738 | use_althost = 1; | |
739 | } | |
740 | } | |
741 | ||
742 | if((is_banned(chptr, source_p, NULL, src_host, src_iphost)) == CHFL_BAN) | |
743 | return (ERR_BANNEDFROMCHAN); | |
744 | ||
745 | if(chptr->mode.mode & MODE_INVITEONLY) | |
746 | { | |
747 | RB_DLINK_FOREACH(invite, source_p->user->invited.head) | |
748 | { | |
749 | if(invite->data == chptr) | |
750 | break; | |
751 | } | |
752 | if(invite == NULL) | |
753 | { | |
754 | if(!ConfigChannel.use_invex) | |
755 | return (ERR_INVITEONLYCHAN); | |
756 | RB_DLINK_FOREACH(ptr, chptr->invexlist.head) | |
757 | { | |
758 | invex = ptr->data; | |
759 | if(match(invex->banstr, src_host) | |
760 | || match(invex->banstr, src_iphost) | |
761 | || match_cidr(invex->banstr, src_iphost) | |
762 | || match_extban(invex->banstr, source_p, chptr, CHFL_INVEX) | |
763 | || (use_althost && match(invex->banstr, src_althost))) | |
764 | break; | |
765 | } | |
766 | if(ptr == NULL) | |
767 | return (ERR_INVITEONLYCHAN); | |
768 | } | |
769 | } | |
770 | ||
771 | if(*chptr->mode.key && (EmptyString(key) || irccmp(chptr->mode.key, key))) | |
772 | return (ERR_BADCHANNELKEY); | |
773 | ||
774 | if(chptr->mode.limit && | |
775 | rb_dlink_list_length(&chptr->members) >= (unsigned long) chptr->mode.limit) | |
776 | i = ERR_CHANNELISFULL; | |
777 | if(chptr->mode.mode & MODE_REGONLY && EmptyString(source_p->user->suser)) | |
778 | i = ERR_NEEDREGGEDNICK; | |
779 | /* join throttling stuff --nenolod */ | |
780 | else if(chptr->mode.join_num > 0 && chptr->mode.join_time > 0) | |
781 | { | |
782 | if ((rb_current_time() - chptr->join_delta <= | |
783 | chptr->mode.join_time) && (chptr->join_count >= | |
784 | chptr->mode.join_num)) | |
785 | i = ERR_THROTTLE; | |
786 | } | |
787 | ||
788 | /* allow /invite to override +l/+r/+j also -- jilles */ | |
789 | if (i != 0 && invite == NULL) | |
790 | { | |
791 | RB_DLINK_FOREACH(invite, source_p->user->invited.head) | |
792 | { | |
793 | if(invite->data == chptr) | |
794 | break; | |
795 | } | |
796 | if (invite == NULL) | |
797 | return i; | |
798 | } | |
799 | ||
800 | moduledata.client = source_p; | |
801 | moduledata.chptr = chptr; | |
802 | moduledata.approved = 0; | |
803 | ||
804 | call_hook(h_can_join, &moduledata); | |
805 | ||
806 | return moduledata.approved; | |
807 | } | |
808 | ||
809 | /* can_send() | |
810 | * | |
811 | * input - user to check in channel, membership pointer | |
812 | * output - whether can explicitly send or not, else CAN_SEND_NONOP | |
813 | * side effects - | |
814 | */ | |
815 | int | |
816 | can_send(struct Channel *chptr, struct Client *source_p, struct membership *msptr) | |
817 | { | |
818 | if(IsServer(source_p) || IsService(source_p)) | |
819 | return CAN_SEND_OPV; | |
820 | ||
821 | if(MyClient(source_p) && hash_find_resv(chptr->chname) && | |
822 | !IsOper(source_p) && !IsExemptResv(source_p)) | |
823 | return CAN_SEND_NO; | |
824 | ||
825 | if(msptr == NULL) | |
826 | { | |
827 | msptr = find_channel_membership(chptr, source_p); | |
828 | ||
829 | if(msptr == NULL) | |
830 | { | |
831 | /* if its +m or +n and theyre not in the channel, | |
832 | * they cant send. we dont check bans here because | |
833 | * theres no possibility of caching them --fl | |
834 | */ | |
835 | if(chptr->mode.mode & MODE_NOPRIVMSGS || chptr->mode.mode & MODE_MODERATED) | |
836 | return CAN_SEND_NO; | |
837 | else | |
838 | return CAN_SEND_NONOP; | |
839 | } | |
840 | } | |
841 | ||
842 | if(is_chanop_voiced(msptr)) | |
843 | return CAN_SEND_OPV; | |
844 | ||
845 | if(chptr->mode.mode & MODE_MODERATED) | |
846 | return CAN_SEND_NO; | |
847 | ||
848 | if(MyClient(source_p)) | |
849 | { | |
850 | /* cached can_send */ | |
851 | if(msptr->bants == chptr->bants) | |
852 | { | |
853 | if(can_send_banned(msptr)) | |
854 | return CAN_SEND_NO; | |
855 | } | |
856 | else if(is_banned(chptr, source_p, msptr, NULL, NULL) == CHFL_BAN | |
857 | || is_quieted(chptr, source_p, msptr, NULL, NULL) == CHFL_BAN) | |
858 | return CAN_SEND_NO; | |
859 | } | |
860 | ||
861 | return CAN_SEND_NONOP; | |
862 | } | |
863 | ||
864 | /* find_bannickchange_channel() | |
865 | * Input: client to check | |
866 | * Output: channel preventing nick change | |
867 | */ | |
868 | struct Channel * | |
869 | find_bannickchange_channel(struct Client *client_p) | |
870 | { | |
871 | struct Channel *chptr; | |
872 | struct membership *msptr; | |
873 | rb_dlink_node *ptr; | |
874 | char src_host[NICKLEN + USERLEN + HOSTLEN + 6]; | |
875 | char src_iphost[NICKLEN + USERLEN + HOSTLEN + 6]; | |
876 | ||
877 | if (!MyClient(client_p)) | |
878 | return NULL; | |
879 | ||
880 | rb_sprintf(src_host, "%s!%s@%s", client_p->name, client_p->username, client_p->host); | |
881 | rb_sprintf(src_iphost, "%s!%s@%s", client_p->name, client_p->username, client_p->sockhost); | |
882 | ||
883 | RB_DLINK_FOREACH(ptr, client_p->user->channel.head) | |
884 | { | |
885 | msptr = ptr->data; | |
886 | chptr = msptr->chptr; | |
887 | if (is_chanop_voiced(msptr)) | |
888 | continue; | |
889 | /* cached can_send */ | |
890 | if (msptr->bants == chptr->bants) | |
891 | { | |
892 | if (can_send_banned(msptr)) | |
893 | return chptr; | |
894 | } | |
895 | else if (is_banned(chptr, client_p, msptr, src_host, src_iphost) == CHFL_BAN | |
896 | || is_quieted(chptr, client_p, msptr, src_host, src_iphost) == CHFL_BAN) | |
897 | return chptr; | |
898 | } | |
899 | return NULL; | |
900 | } | |
901 | ||
902 | /* void check_spambot_warning(struct Client *source_p) | |
903 | * Input: Client to check, channel name or NULL if this is a part. | |
904 | * Output: none | |
905 | * Side-effects: Updates the client's oper_warn_count_down, warns the | |
906 | * IRC operators if necessary, and updates join_leave_countdown as | |
907 | * needed. | |
908 | */ | |
909 | void | |
910 | check_spambot_warning(struct Client *source_p, const char *name) | |
911 | { | |
912 | int t_delta; | |
913 | int decrement_count; | |
914 | if((GlobalSetOptions.spam_num && | |
915 | (source_p->localClient->join_leave_count >= GlobalSetOptions.spam_num))) | |
916 | { | |
917 | if(source_p->localClient->oper_warn_count_down > 0) | |
918 | source_p->localClient->oper_warn_count_down--; | |
919 | else | |
920 | source_p->localClient->oper_warn_count_down = 0; | |
921 | if(source_p->localClient->oper_warn_count_down == 0 && | |
922 | name != NULL) | |
923 | { | |
924 | /* Its already known as a possible spambot */ | |
925 | sendto_realops_snomask(SNO_BOTS, L_NETWIDE, | |
926 | "User %s (%s@%s) trying to join %s is a possible spambot", | |
927 | source_p->name, | |
928 | source_p->username, source_p->orighost, name); | |
929 | source_p->localClient->oper_warn_count_down = OPER_SPAM_COUNTDOWN; | |
930 | } | |
931 | } | |
932 | else | |
933 | { | |
934 | if((t_delta = | |
935 | (rb_current_time() - source_p->localClient->last_leave_time)) > | |
936 | JOIN_LEAVE_COUNT_EXPIRE_TIME) | |
937 | { | |
938 | decrement_count = (t_delta / JOIN_LEAVE_COUNT_EXPIRE_TIME); | |
939 | if(decrement_count > source_p->localClient->join_leave_count) | |
940 | source_p->localClient->join_leave_count = 0; | |
941 | else | |
942 | source_p->localClient->join_leave_count -= decrement_count; | |
943 | } | |
944 | else | |
945 | { | |
946 | if((rb_current_time() - | |
947 | (source_p->localClient->last_join_time)) < GlobalSetOptions.spam_time) | |
948 | { | |
949 | /* oh, its a possible spambot */ | |
950 | source_p->localClient->join_leave_count++; | |
951 | } | |
952 | } | |
953 | if(name != NULL) | |
954 | source_p->localClient->last_join_time = rb_current_time(); | |
955 | else | |
956 | source_p->localClient->last_leave_time = rb_current_time(); | |
957 | } | |
958 | } | |
959 | ||
960 | /* check_splitmode() | |
961 | * | |
962 | * input - | |
963 | * output - | |
964 | * side effects - compares usercount and servercount against their split | |
965 | * values and adjusts splitmode accordingly | |
966 | */ | |
967 | void | |
968 | check_splitmode(void *unused) | |
969 | { | |
970 | if(splitchecking && (ConfigChannel.no_join_on_split || ConfigChannel.no_create_on_split)) | |
971 | { | |
972 | /* not split, we're being asked to check now because someone | |
973 | * has left | |
974 | */ | |
975 | if(!splitmode) | |
976 | { | |
977 | if(eob_count < split_servers || Count.total < split_users) | |
978 | { | |
979 | splitmode = 1; | |
980 | sendto_realops_snomask(SNO_GENERAL, L_ALL, | |
981 | "Network split, activating splitmode"); | |
982 | check_splitmode_ev = rb_event_addish("check_splitmode", check_splitmode, NULL, 2); | |
983 | } | |
984 | } | |
985 | /* in splitmode, check whether its finished */ | |
986 | else if(eob_count >= split_servers && Count.total >= split_users) | |
987 | { | |
988 | splitmode = 0; | |
989 | ||
990 | sendto_realops_snomask(SNO_GENERAL, L_ALL, | |
991 | "Network rejoined, deactivating splitmode"); | |
992 | ||
993 | rb_event_delete(check_splitmode_ev); | |
994 | check_splitmode_ev = NULL; | |
995 | } | |
996 | } | |
997 | } | |
998 | ||
999 | ||
1000 | /* allocate_topic() | |
1001 | * | |
1002 | * input - channel to allocate topic for | |
1003 | * output - 1 on success, else 0 | |
1004 | * side effects - channel gets a topic allocated | |
1005 | */ | |
1006 | static void | |
1007 | allocate_topic(struct Channel *chptr) | |
1008 | { | |
1009 | void *ptr; | |
1010 | ||
1011 | if(chptr == NULL) | |
1012 | return; | |
1013 | ||
1014 | ptr = rb_bh_alloc(topic_heap); | |
1015 | ||
1016 | /* Basically we allocate one large block for the topic and | |
1017 | * the topic info. We then split it up into two and shove it | |
1018 | * in the chptr | |
1019 | */ | |
1020 | chptr->topic = ptr; | |
1021 | chptr->topic_info = (char *) ptr + TOPICLEN + 1; | |
1022 | *chptr->topic = '\0'; | |
1023 | *chptr->topic_info = '\0'; | |
1024 | } | |
1025 | ||
1026 | /* free_topic() | |
1027 | * | |
1028 | * input - channel which has topic to free | |
1029 | * output - | |
1030 | * side effects - channels topic is free'd | |
1031 | */ | |
1032 | static void | |
1033 | free_topic(struct Channel *chptr) | |
1034 | { | |
1035 | void *ptr; | |
1036 | ||
1037 | if(chptr == NULL || chptr->topic == NULL) | |
1038 | return; | |
1039 | ||
1040 | /* This is safe for now - If you change allocate_topic you | |
1041 | * MUST change this as well | |
1042 | */ | |
1043 | ptr = chptr->topic; | |
1044 | rb_bh_free(topic_heap, ptr); | |
1045 | chptr->topic = NULL; | |
1046 | chptr->topic_info = NULL; | |
1047 | } | |
1048 | ||
1049 | /* set_channel_topic() | |
1050 | * | |
1051 | * input - channel, topic to set, topic info and topic ts | |
1052 | * output - | |
1053 | * side effects - channels topic, topic info and TS are set. | |
1054 | */ | |
1055 | void | |
1056 | set_channel_topic(struct Channel *chptr, const char *topic, const char *topic_info, time_t topicts) | |
1057 | { | |
1058 | if(strlen(topic) > 0) | |
1059 | { | |
1060 | if(chptr->topic == NULL) | |
1061 | allocate_topic(chptr); | |
1062 | rb_strlcpy(chptr->topic, topic, TOPICLEN + 1); | |
1063 | rb_strlcpy(chptr->topic_info, topic_info, USERHOST_REPLYLEN); | |
1064 | chptr->topic_time = topicts; | |
1065 | } | |
1066 | else | |
1067 | { | |
1068 | if(chptr->topic != NULL) | |
1069 | free_topic(chptr); | |
1070 | chptr->topic_time = 0; | |
1071 | } | |
1072 | } | |
1073 | ||
1074 | /* channel_modes() | |
1075 | * | |
1076 | * inputs - pointer to channel | |
1077 | * - pointer to client | |
1078 | * output - string with simple modes | |
1079 | * side effects - result from previous calls overwritten | |
1080 | * | |
1081 | * Stolen from ShadowIRCd 4 --nenolod | |
1082 | */ | |
1083 | const char * | |
1084 | channel_modes(struct Channel *chptr, struct Client *client_p) | |
1085 | { | |
1086 | int i; | |
1087 | char buf1[BUFSIZE]; | |
1088 | char buf2[BUFSIZE]; | |
1089 | static char final[BUFSIZE]; | |
1090 | char *mbuf = buf1; | |
1091 | char *pbuf = buf2; | |
1092 | ||
1093 | *mbuf++ = '+'; | |
1094 | *pbuf = '\0'; | |
1095 | ||
1096 | for (i = 0; i < 256; i++) | |
1097 | if(chptr->mode.mode & chmode_flags[i]) | |
1098 | *mbuf++ = i; | |
1099 | ||
1100 | if(chptr->mode.limit) | |
1101 | { | |
1102 | *mbuf++ = 'l'; | |
1103 | ||
1104 | if(!IsClient(client_p) || IsMember(client_p, chptr)) | |
1105 | pbuf += rb_sprintf(pbuf, " %d", chptr->mode.limit); | |
1106 | } | |
1107 | ||
1108 | if(*chptr->mode.key) | |
1109 | { | |
1110 | *mbuf++ = 'k'; | |
1111 | ||
1112 | if(pbuf > buf2 || !IsClient(client_p) || IsMember(client_p, chptr)) | |
1113 | pbuf += rb_sprintf(pbuf, " %s", chptr->mode.key); | |
1114 | } | |
1115 | ||
1116 | if(chptr->mode.join_num) | |
1117 | { | |
1118 | *mbuf++ = 'j'; | |
1119 | ||
1120 | if(pbuf > buf2 || !IsClient(client_p) || IsMember(client_p, chptr)) | |
1121 | pbuf += rb_sprintf(pbuf, " %d:%d", chptr->mode.join_num, | |
1122 | chptr->mode.join_time); | |
1123 | } | |
1124 | ||
1125 | if(*chptr->mode.forward && (ConfigChannel.use_forward || !IsClient(client_p))) | |
1126 | { | |
1127 | *mbuf++ = 'f'; | |
1128 | ||
1129 | if(pbuf > buf2 || !IsClient(client_p) || IsMember(client_p, chptr)) | |
1130 | pbuf += rb_sprintf(pbuf, " %s", chptr->mode.forward); | |
1131 | } | |
1132 | ||
1133 | *mbuf = '\0'; | |
1134 | ||
1135 | rb_strlcpy(final, buf1, sizeof final); | |
1136 | rb_strlcat(final, buf2, sizeof final); | |
1137 | return final; | |
1138 | } | |
1139 | ||
1140 | /* Now lets do some stuff to keep track of what combinations of | |
1141 | * servers exist... | |
1142 | * Note that the number of combinations doubles each time you add | |
1143 | * something to this list. Each one is only quick if no servers use that | |
1144 | * combination, but if the numbers get too high here MODE will get too | |
1145 | * slow. I suggest if you get more than 7 here, you consider getting rid | |
1146 | * of some and merging or something. If it wasn't for irc+cs we would | |
1147 | * probably not even need to bother about most of these, but unfortunately | |
1148 | * we do. -A1kmm | |
1149 | */ | |
1150 | ||
1151 | /* void init_chcap_usage_counts(void) | |
1152 | * | |
1153 | * Inputs - none | |
1154 | * Output - none | |
1155 | * Side-effects - Initialises the usage counts to zero. Fills in the | |
1156 | * chcap_yes and chcap_no combination tables. | |
1157 | */ | |
1158 | void | |
1159 | init_chcap_usage_counts(void) | |
1160 | { | |
1161 | unsigned long m, c, y, n; | |
1162 | ||
1163 | memset(chcap_combos, 0, sizeof(chcap_combos)); | |
1164 | ||
1165 | /* For every possible combination */ | |
1166 | for (m = 0; m < NCHCAP_COMBOS; m++) | |
1167 | { | |
1168 | /* Check each capab */ | |
1169 | for (c = y = n = 0; c < NCHCAPS; c++) | |
1170 | { | |
1171 | if((m & (1 << c)) == 0) | |
1172 | n |= channel_capabs[c]; | |
1173 | else | |
1174 | y |= channel_capabs[c]; | |
1175 | } | |
1176 | chcap_combos[m].cap_yes = y; | |
1177 | chcap_combos[m].cap_no = n; | |
1178 | } | |
1179 | } | |
1180 | ||
1181 | /* void set_chcap_usage_counts(struct Client *serv_p) | |
1182 | * Input: serv_p; The client whose capabs to register. | |
1183 | * Output: none | |
1184 | * Side-effects: Increments the usage counts for the correct capab | |
1185 | * combination. | |
1186 | */ | |
1187 | void | |
1188 | set_chcap_usage_counts(struct Client *serv_p) | |
1189 | { | |
1190 | int n; | |
1191 | ||
1192 | for (n = 0; n < NCHCAP_COMBOS; n++) | |
1193 | { | |
1194 | if(IsCapable(serv_p, chcap_combos[n].cap_yes) && | |
1195 | NotCapable(serv_p, chcap_combos[n].cap_no)) | |
1196 | { | |
1197 | chcap_combos[n].count++; | |
1198 | return; | |
1199 | } | |
1200 | } | |
1201 | ||
1202 | /* This should be impossible -A1kmm. */ | |
1203 | s_assert(0); | |
1204 | } | |
1205 | ||
1206 | /* void set_chcap_usage_counts(struct Client *serv_p) | |
1207 | * | |
1208 | * Inputs - serv_p; The client whose capabs to register. | |
1209 | * Output - none | |
1210 | * Side-effects - Decrements the usage counts for the correct capab | |
1211 | * combination. | |
1212 | */ | |
1213 | void | |
1214 | unset_chcap_usage_counts(struct Client *serv_p) | |
1215 | { | |
1216 | int n; | |
1217 | ||
1218 | for (n = 0; n < NCHCAP_COMBOS; n++) | |
1219 | { | |
1220 | if(IsCapable(serv_p, chcap_combos[n].cap_yes) && | |
1221 | NotCapable(serv_p, chcap_combos[n].cap_no)) | |
1222 | { | |
1223 | /* Hopefully capabs can't change dynamically or anything... */ | |
1224 | s_assert(chcap_combos[n].count > 0); | |
1225 | ||
1226 | if(chcap_combos[n].count > 0) | |
1227 | chcap_combos[n].count--; | |
1228 | return; | |
1229 | } | |
1230 | } | |
1231 | ||
1232 | /* This should be impossible -A1kmm. */ | |
1233 | s_assert(0); | |
1234 | } | |
1235 | ||
1236 | /* void send_cap_mode_changes(struct Client *client_p, | |
1237 | * struct Client *source_p, | |
1238 | * struct Channel *chptr, int cap, int nocap) | |
1239 | * Input: The client sending(client_p), the source client(source_p), | |
1240 | * the channel to send mode changes for(chptr) | |
1241 | * Output: None. | |
1242 | * Side-effects: Sends the appropriate mode changes to capable servers. | |
1243 | * | |
1244 | * Reverted back to my original design, except that we now keep a count | |
1245 | * of the number of servers which each combination as an optimisation, so | |
1246 | * the capabs combinations which are not needed are not worked out. -A1kmm | |
1247 | */ | |
1248 | void | |
1249 | send_cap_mode_changes(struct Client *client_p, struct Client *source_p, | |
1250 | struct Channel *chptr, struct ChModeChange mode_changes[], int mode_count) | |
1251 | { | |
1252 | static char modebuf[BUFSIZE]; | |
1253 | static char parabuf[BUFSIZE]; | |
1254 | int i, mbl, pbl, nc, mc, preflen, len; | |
1255 | char *pbuf; | |
1256 | const char *arg; | |
1257 | int dir; | |
1258 | int j; | |
1259 | int cap; | |
1260 | int nocap; | |
1261 | int arglen; | |
1262 | ||
1263 | /* Now send to servers... */ | |
1264 | for (j = 0; j < NCHCAP_COMBOS; j++) | |
1265 | { | |
1266 | if(chcap_combos[j].count == 0) | |
1267 | continue; | |
1268 | ||
1269 | mc = 0; | |
1270 | nc = 0; | |
1271 | pbl = 0; | |
1272 | parabuf[0] = 0; | |
1273 | pbuf = parabuf; | |
1274 | dir = MODE_QUERY; | |
1275 | ||
1276 | cap = chcap_combos[j].cap_yes; | |
1277 | nocap = chcap_combos[j].cap_no; | |
1278 | ||
1279 | mbl = preflen = rb_sprintf(modebuf, ":%s TMODE %ld %s ", | |
1280 | use_id(source_p), (long) chptr->channelts, | |
1281 | chptr->chname); | |
1282 | ||
1283 | /* loop the list of - modes we have */ | |
1284 | for (i = 0; i < mode_count; i++) | |
1285 | { | |
1286 | /* if they dont support the cap we need, or they do support a cap they | |
1287 | * cant have, then dont add it to the modebuf.. that way they wont see | |
1288 | * the mode | |
1289 | */ | |
1290 | if((mode_changes[i].letter == 0) || | |
1291 | ((cap & mode_changes[i].caps) != mode_changes[i].caps) | |
1292 | || ((nocap & mode_changes[i].nocaps) != mode_changes[i].nocaps)) | |
1293 | continue; | |
1294 | ||
1295 | if(!EmptyString(mode_changes[i].id)) | |
1296 | arg = mode_changes[i].id; | |
1297 | else | |
1298 | arg = mode_changes[i].arg; | |
1299 | ||
1300 | if(arg) | |
1301 | { | |
1302 | arglen = strlen(arg); | |
1303 | ||
1304 | /* dont even think about it! --fl */ | |
1305 | if(arglen > MODEBUFLEN - 5) | |
1306 | continue; | |
1307 | } | |
1308 | ||
1309 | /* if we're creeping past the buf size, we need to send it and make | |
1310 | * another line for the other modes | |
1311 | * XXX - this could give away server topology with uids being | |
1312 | * different lengths, but not much we can do, except possibly break | |
1313 | * them as if they were the longest of the nick or uid at all times, | |
1314 | * which even then won't work as we don't always know the uid -A1kmm. | |
1315 | */ | |
1316 | if(arg && ((mc == MAXMODEPARAMSSERV) || | |
1317 | ((mbl + pbl + arglen + 4) > (BUFSIZE - 3)))) | |
1318 | { | |
1319 | if(nc != 0) | |
1320 | sendto_server(client_p, chptr, cap, nocap, | |
1321 | "%s %s", modebuf, parabuf); | |
1322 | nc = 0; | |
1323 | mc = 0; | |
1324 | ||
1325 | mbl = preflen; | |
1326 | pbl = 0; | |
1327 | pbuf = parabuf; | |
1328 | parabuf[0] = 0; | |
1329 | dir = MODE_QUERY; | |
1330 | } | |
1331 | ||
1332 | if(dir != mode_changes[i].dir) | |
1333 | { | |
1334 | modebuf[mbl++] = (mode_changes[i].dir == MODE_ADD) ? '+' : '-'; | |
1335 | dir = mode_changes[i].dir; | |
1336 | } | |
1337 | ||
1338 | modebuf[mbl++] = mode_changes[i].letter; | |
1339 | modebuf[mbl] = 0; | |
1340 | nc++; | |
1341 | ||
1342 | if(arg != NULL) | |
1343 | { | |
1344 | len = rb_sprintf(pbuf, "%s ", arg); | |
1345 | pbuf += len; | |
1346 | pbl += len; | |
1347 | mc++; | |
1348 | } | |
1349 | } | |
1350 | ||
1351 | if(pbl && parabuf[pbl - 1] == ' ') | |
1352 | parabuf[pbl - 1] = 0; | |
1353 | ||
1354 | if(nc != 0) | |
1355 | sendto_server(client_p, chptr, cap, nocap, "%s %s", modebuf, parabuf); | |
1356 | } | |
1357 | } |