1 |
/* |
2 |
* ircd-hybrid: an advanced Internet Relay Chat Daemon(ircd). |
3 |
* parse.c: The message parser. |
4 |
* |
5 |
* Copyright (C) 2002 by the past and present ircd coders, and others. |
6 |
* |
7 |
* This program is free software; you can redistribute it and/or modify |
8 |
* it under the terms of the GNU General Public License as published by |
9 |
* the Free Software Foundation; either version 2 of the License, or |
10 |
* (at your option) any later version. |
11 |
* |
12 |
* This program is distributed in the hope that it will be useful, |
13 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 |
* GNU General Public License for more details. |
16 |
* |
17 |
* You should have received a copy of the GNU General Public License |
18 |
* along with this program; if not, write to the Free Software |
19 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 |
20 |
* USA |
21 |
* |
22 |
* $Id$ |
23 |
*/ |
24 |
|
25 |
#include "stdinc.h" |
26 |
#include "client.h" |
27 |
#include "parse.h" |
28 |
#include "channel.h" |
29 |
#include "hash.h" |
30 |
#include "irc_string.h" |
31 |
#include "ircd.h" |
32 |
#include "numeric.h" |
33 |
#include "log.h" |
34 |
#include "send.h" |
35 |
#include "conf.h" |
36 |
#include "memory.h" |
37 |
#include "s_user.h" |
38 |
#include "s_serv.h" |
39 |
|
40 |
/* |
41 |
* (based on orabidoo's parser code) |
42 |
* |
43 |
* This has always just been a trie. Look at volume III of Knuth ACP |
44 |
* |
45 |
* |
46 |
* ok, you start out with an array of pointers, each one corresponds |
47 |
* to a letter at the current position in the command being examined. |
48 |
* |
49 |
* so roughly you have this for matching 'trie' or 'tie' |
50 |
* |
51 |
* 't' points -> [MessageTree *] 'r' -> [MessageTree *] -> 'i' |
52 |
* -> [MessageTree *] -> [MessageTree *] -> 'e' and matches |
53 |
* |
54 |
* 'i' -> [MessageTree *] -> 'e' and matches |
55 |
* |
56 |
* BUGS (Limitations!) |
57 |
* |
58 |
* I designed this trie to parse ircd commands. Hence it currently |
59 |
* casefolds. This is trivial to fix by increasing MAXPTRLEN. |
60 |
* This trie also "folds" '{' etc. down. This means, the input to this |
61 |
* trie must be alpha tokens only. This again, is a limitation that |
62 |
* can be overcome by increasing MAXPTRLEN to include upper/lower case |
63 |
* at the expense of more memory. At the extreme end, you could make |
64 |
* MAXPTRLEN 128. |
65 |
* |
66 |
* This is also not a patricia trie. On short ircd tokens, this is |
67 |
* not likely going to matter. |
68 |
* |
69 |
* Diane Bruce (Dianora), June 6 2003 |
70 |
*/ |
71 |
|
72 |
#define MAXPTRLEN 32 |
73 |
/* Must be a power of 2, and |
74 |
* larger than 26 [a-z]|[A-Z] |
75 |
* its used to allocate the set |
76 |
* of pointers at each node of the tree |
77 |
* There are MAXPTRLEN pointers at each node. |
78 |
* Obviously, there have to be more pointers |
79 |
* Than ASCII letters. 32 is a nice number |
80 |
* since there is then no need to shift |
81 |
* 'A'/'a' to base 0 index, at the expense |
82 |
* of a few never used pointers. For a small |
83 |
* parser like this, this is a good compromise |
84 |
* and does make it somewhat faster. |
85 |
* |
86 |
* - Dianora |
87 |
*/ |
88 |
|
89 |
struct MessageTree |
90 |
{ |
91 |
int links; /* Count of all pointers (including msg) at this node |
92 |
* used as reference count for deletion of _this_ node. |
93 |
*/ |
94 |
struct Message *msg; |
95 |
struct MessageTree *pointers[MAXPTRLEN]; |
96 |
}; |
97 |
|
98 |
static struct MessageTree msg_tree; |
99 |
|
100 |
/* |
101 |
* NOTE: parse() should not be called recursively by other functions! |
102 |
*/ |
103 |
static char *sender; |
104 |
static char *para[MAXPARA + 2]; /* <prefix> + <params> + NULL */ |
105 |
|
106 |
static int cancel_clients(struct Client *, struct Client *, char *); |
107 |
static void remove_unknown(struct Client *, char *, char *); |
108 |
static void handle_numeric(char[], struct Client *, struct Client *, int, char *[]); |
109 |
static void handle_command(struct Message *, struct Client *, struct Client *, unsigned int, char *[]); |
110 |
|
111 |
|
112 |
/* |
113 |
* parse a buffer. |
114 |
* |
115 |
* NOTE: parse() should not be called recusively by any other functions! |
116 |
*/ |
117 |
void |
118 |
parse(struct Client *client_p, char *pbuffer, char *bufend) |
119 |
{ |
120 |
struct Client *from = client_p; |
121 |
struct Message *msg_ptr = NULL; |
122 |
char *ch = NULL; |
123 |
char *s = NULL; |
124 |
char *numeric = NULL; |
125 |
unsigned int parc = 0; |
126 |
unsigned int paramcount; |
127 |
|
128 |
if (IsDefunct(client_p)) |
129 |
return; |
130 |
|
131 |
assert(client_p->localClient->fd.flags.open); |
132 |
assert((bufend - pbuffer) < 512); |
133 |
|
134 |
for (ch = pbuffer; *ch == ' '; ++ch) /* skip spaces */ |
135 |
/* null statement */ ; |
136 |
|
137 |
if (*ch == ':') |
138 |
{ |
139 |
/* |
140 |
* Copy the prefix to 'sender' assuming it terminates |
141 |
* with SPACE (or NULL, which is an error, though). |
142 |
*/ |
143 |
sender = ++ch; |
144 |
|
145 |
if ((s = strchr(ch, ' ')) != NULL) |
146 |
{ |
147 |
*s = '\0'; |
148 |
ch = ++s; |
149 |
} |
150 |
|
151 |
if (*sender && IsServer(client_p)) |
152 |
{ |
153 |
if ((from = find_person(client_p, sender)) == NULL) |
154 |
from = hash_find_server(sender); |
155 |
|
156 |
/* |
157 |
* Hmm! If the client corresponding to the prefix is not found--what is |
158 |
* the correct action??? Now, I will ignore the message (old IRC just |
159 |
* let it through as if the prefix just wasn't there...) --msa |
160 |
*/ |
161 |
if (from == NULL) |
162 |
{ |
163 |
++ServerStats.is_unpf; |
164 |
remove_unknown(client_p, sender, pbuffer); |
165 |
return; |
166 |
} |
167 |
|
168 |
if (from->from != client_p) |
169 |
{ |
170 |
++ServerStats.is_wrdi; |
171 |
cancel_clients(client_p, from, pbuffer); |
172 |
return; |
173 |
} |
174 |
} |
175 |
|
176 |
while (*ch == ' ') |
177 |
++ch; |
178 |
} |
179 |
|
180 |
if (*ch == '\0') |
181 |
{ |
182 |
++ServerStats.is_empt; |
183 |
return; |
184 |
} |
185 |
|
186 |
/* |
187 |
* Extract the command code from the packet. Point s to the end |
188 |
* of the command code and calculate the length using pointer |
189 |
* arithmetic. Note: only need length for numerics and *all* |
190 |
* numerics must have parameters and thus a space after the command |
191 |
* code. -avalon |
192 |
*/ |
193 |
|
194 |
/* EOB is 3 chars long but is not a numeric */ |
195 |
if (*(ch + 3) == ' ' && /* ok, lets see if its a possible numeric.. */ |
196 |
IsDigit(*ch) && IsDigit(*(ch + 1)) && IsDigit(*(ch + 2))) |
197 |
{ |
198 |
numeric = ch; |
199 |
paramcount = 2; /* destination, and the rest of it */ |
200 |
++ServerStats.is_num; |
201 |
s = ch + 3; /* I know this is ' ' from above if */ |
202 |
*s++ = '\0'; /* blow away the ' ', and point s to next part */ |
203 |
} |
204 |
else |
205 |
{ |
206 |
unsigned int ii = 0; |
207 |
|
208 |
if ((s = strchr(ch, ' ')) != NULL) |
209 |
*s++ = '\0'; |
210 |
|
211 |
if ((msg_ptr = find_command(ch)) == NULL) |
212 |
{ |
213 |
/* |
214 |
* Note: Give error message *only* to recognized |
215 |
* persons. It's a nightmare situation to have |
216 |
* two programs sending "Unknown command"'s or |
217 |
* equivalent to each other at full blast.... |
218 |
* If it has got to person state, it at least |
219 |
* seems to be well behaving. Perhaps this message |
220 |
* should never be generated, though... --msa |
221 |
* Hm, when is the buffer empty -- if a command |
222 |
* code has been found ?? -Armin |
223 |
*/ |
224 |
if (*pbuffer != '\0') |
225 |
{ |
226 |
if (IsClient(from)) |
227 |
sendto_one(from, form_str(ERR_UNKNOWNCOMMAND), |
228 |
me.name, from->name, ch); |
229 |
} |
230 |
|
231 |
++ServerStats.is_unco; |
232 |
return; |
233 |
} |
234 |
|
235 |
assert(msg_ptr->cmd != NULL); |
236 |
|
237 |
paramcount = msg_ptr->args_max; |
238 |
ii = bufend - ((s) ? s : ch); |
239 |
msg_ptr->bytes += ii; |
240 |
} |
241 |
|
242 |
/* |
243 |
* Must the following loop really be so devious? On surface it |
244 |
* splits the message to parameters from blank spaces. But, if |
245 |
* paramcount has been reached, the rest of the message goes into |
246 |
* this last parameter (about same effect as ":" has...) --msa |
247 |
*/ |
248 |
|
249 |
/* Note initially true: s==NULL || *(s-1) == '\0' !! */ |
250 |
|
251 |
para[parc] = from->name; |
252 |
|
253 |
if (s) |
254 |
{ |
255 |
if (paramcount > MAXPARA) |
256 |
paramcount = MAXPARA; |
257 |
|
258 |
while (1) |
259 |
{ |
260 |
while (*s == ' ') |
261 |
*s++ = '\0'; |
262 |
|
263 |
if (*s == '\0') |
264 |
break; |
265 |
|
266 |
if (*s == ':') |
267 |
{ |
268 |
/* The rest is a single parameter */ |
269 |
para[++parc] = s + (!numeric); /* keep the colon if it's a numeric */ |
270 |
break; |
271 |
} |
272 |
|
273 |
para[++parc] = s; |
274 |
|
275 |
if (parc >= paramcount) |
276 |
break; |
277 |
|
278 |
while (*s && *s != ' ') |
279 |
++s; |
280 |
} |
281 |
} |
282 |
|
283 |
para[++parc] = NULL; |
284 |
|
285 |
if (msg_ptr != NULL) |
286 |
handle_command(msg_ptr, client_p, from, parc, para); |
287 |
else |
288 |
handle_numeric(numeric, client_p, from, parc, para); |
289 |
} |
290 |
|
291 |
/* handle_command() |
292 |
* |
293 |
* inputs - pointer to message block |
294 |
* - pointer to client |
295 |
* - pointer to client message is from |
296 |
* - count of number of args |
297 |
* - pointer to argv[] array |
298 |
* output - -1 if error from server |
299 |
* side effects - |
300 |
*/ |
301 |
static void |
302 |
handle_command(struct Message *mptr, struct Client *client_p, |
303 |
struct Client *from, unsigned int i, char *hpara[]) |
304 |
{ |
305 |
MessageHandler handler = 0; |
306 |
|
307 |
if (IsServer(client_p)) |
308 |
mptr->rcount++; |
309 |
|
310 |
mptr->count++; |
311 |
|
312 |
handler = mptr->handlers[client_p->handler]; |
313 |
|
314 |
/* check right amount of params is passed... --is */ |
315 |
if (i < mptr->args_min) |
316 |
{ |
317 |
if (!IsServer(client_p)) |
318 |
{ |
319 |
sendto_one(client_p, form_str(ERR_NEEDMOREPARAMS), me.name, |
320 |
EmptyString(hpara[0]) ? "*" : hpara[0], mptr->cmd); |
321 |
} |
322 |
else |
323 |
{ |
324 |
sendto_realops_flags(UMODE_ALL, L_ALL, SEND_NOTICE, |
325 |
"Dropping server %s due to (invalid) command '%s' " |
326 |
"with only %d arguments (expecting %d).", |
327 |
client_p->name, mptr->cmd, i, mptr->args_min); |
328 |
ilog(LOG_TYPE_IRCD, "Insufficient parameters (%d) for command '%s' from %s.", |
329 |
i, mptr->cmd, client_p->name); |
330 |
exit_client(client_p, client_p, |
331 |
"Not enough arguments to server command."); |
332 |
} |
333 |
} |
334 |
else |
335 |
(*handler)(client_p, from, i, hpara); |
336 |
} |
337 |
|
338 |
/* add_msg_element() |
339 |
* |
340 |
* inputs - pointer to MessageTree |
341 |
* - pointer to Message to add for given command |
342 |
* - pointer to current portion of command being added |
343 |
* output - NONE |
344 |
* side effects - recursively build the Message Tree ;-) |
345 |
*/ |
346 |
/* |
347 |
* How this works. |
348 |
* |
349 |
* The code first checks to see if its reached the end of the command |
350 |
* If so, that struct MessageTree has a msg pointer updated and the links |
351 |
* count incremented, since a msg pointer is a reference. |
352 |
* Then the code descends recursively, building the trie. |
353 |
* If a pointer index inside the struct MessageTree is NULL a new |
354 |
* child struct MessageTree has to be allocated. |
355 |
* The links (reference count) is incremented as they are created |
356 |
* in the parent. |
357 |
*/ |
358 |
static void |
359 |
add_msg_element(struct MessageTree *mtree_p, struct Message *msg_p, |
360 |
const char *cmd) |
361 |
{ |
362 |
struct MessageTree *ntree_p; |
363 |
|
364 |
if (*cmd == '\0') |
365 |
{ |
366 |
mtree_p->msg = msg_p; |
367 |
mtree_p->links++; /* Have msg pointer, so up ref count */ |
368 |
} |
369 |
else |
370 |
{ |
371 |
/* |
372 |
* *cmd & (MAXPTRLEN-1) |
373 |
* convert the char pointed to at *cmd from ASCII to an integer |
374 |
* between 0 and MAXPTRLEN. |
375 |
* Thus 'A' -> 0x1 'B' -> 0x2 'c' -> 0x3 etc. |
376 |
*/ |
377 |
if ((ntree_p = mtree_p->pointers[*cmd & (MAXPTRLEN - 1)]) == NULL) |
378 |
{ |
379 |
ntree_p = MyMalloc(sizeof(struct MessageTree)); |
380 |
mtree_p->pointers[*cmd & (MAXPTRLEN - 1)] = ntree_p; |
381 |
|
382 |
mtree_p->links++; /* Have new pointer, so up ref count */ |
383 |
} |
384 |
|
385 |
add_msg_element(ntree_p, msg_p, cmd + 1); |
386 |
} |
387 |
} |
388 |
|
389 |
/* del_msg_element() |
390 |
* |
391 |
* inputs - Pointer to MessageTree to delete from |
392 |
* - pointer to command name to delete |
393 |
* output - NONE |
394 |
* side effects - recursively deletes a token from the Message Tree ;-) |
395 |
*/ |
396 |
/* |
397 |
* How this works. |
398 |
* |
399 |
* Well, first off, the code recursively descends into the trie |
400 |
* until it finds the terminating letter of the command being removed. |
401 |
* Once it has done that, it marks the msg pointer as NULL then |
402 |
* reduces the reference count on that allocated struct MessageTree |
403 |
* since a command counts as a reference. |
404 |
* |
405 |
* Then it pops up the recurse stack. As it comes back up the recurse |
406 |
* The code checks to see if the child now has no pointers or msg |
407 |
* i.e. the links count has gone to zero. If its no longer used, the |
408 |
* child struct MessageTree can be deleted. The parent reference |
409 |
* to this child is then removed and the parents link count goes down. |
410 |
* Thus, we continue to go back up removing all unused MessageTree(s) |
411 |
*/ |
412 |
static void |
413 |
del_msg_element(struct MessageTree *mtree_p, const char *cmd) |
414 |
{ |
415 |
struct MessageTree *ntree_p; |
416 |
|
417 |
/* |
418 |
* In case this is called for a nonexistent command |
419 |
* check that there is a msg pointer here, else links-- goes -ve |
420 |
* -db |
421 |
*/ |
422 |
if ((*cmd == '\0') && (mtree_p->msg != NULL)) |
423 |
{ |
424 |
mtree_p->msg = NULL; |
425 |
mtree_p->links--; |
426 |
} |
427 |
else |
428 |
{ |
429 |
if ((ntree_p = mtree_p->pointers[*cmd & (MAXPTRLEN - 1)]) != NULL) |
430 |
{ |
431 |
del_msg_element(ntree_p, cmd + 1); |
432 |
|
433 |
if (ntree_p->links == 0) |
434 |
{ |
435 |
mtree_p->pointers[*cmd & (MAXPTRLEN - 1)] = NULL; |
436 |
mtree_p->links--; |
437 |
MyFree(ntree_p); |
438 |
} |
439 |
} |
440 |
} |
441 |
} |
442 |
|
443 |
/* msg_tree_parse() |
444 |
* |
445 |
* inputs - Pointer to command to find |
446 |
* - Pointer to MessageTree root |
447 |
* output - Find given command returning Message * if found NULL if not |
448 |
* side effects - none |
449 |
*/ |
450 |
static struct Message * |
451 |
msg_tree_parse(const char *cmd) |
452 |
{ |
453 |
struct MessageTree *mtree = &msg_tree; |
454 |
assert(cmd && *cmd); |
455 |
|
456 |
while (IsAlpha(*cmd) && (mtree = mtree->pointers[*cmd & (MAXPTRLEN - 1)])) |
457 |
if (*++cmd == '\0') |
458 |
return mtree->msg; |
459 |
|
460 |
return NULL; |
461 |
} |
462 |
|
463 |
/* mod_add_cmd() |
464 |
* |
465 |
* inputs - pointer to struct Message |
466 |
* output - none |
467 |
* side effects - load this one command name |
468 |
* msg->count msg->bytes is modified in place, in |
469 |
* modules address space. Might not want to do that... |
470 |
*/ |
471 |
void |
472 |
mod_add_cmd(struct Message *msg) |
473 |
{ |
474 |
assert(msg && msg->cmd); |
475 |
|
476 |
/* command already added? */ |
477 |
if (msg_tree_parse(msg->cmd)) |
478 |
return; |
479 |
|
480 |
add_msg_element(&msg_tree, msg, msg->cmd); |
481 |
msg->count = msg->rcount = msg->bytes = 0; |
482 |
} |
483 |
|
484 |
/* mod_del_cmd() |
485 |
* |
486 |
* inputs - pointer to struct Message |
487 |
* output - none |
488 |
* side effects - unload this one command name |
489 |
*/ |
490 |
void |
491 |
mod_del_cmd(struct Message *msg) |
492 |
{ |
493 |
assert(msg && msg->cmd); |
494 |
|
495 |
del_msg_element(&msg_tree, msg->cmd); |
496 |
} |
497 |
|
498 |
/* find_command() |
499 |
* |
500 |
* inputs - command name |
501 |
* output - pointer to struct Message |
502 |
* side effects - none |
503 |
*/ |
504 |
struct Message * |
505 |
find_command(const char *cmd) |
506 |
{ |
507 |
return msg_tree_parse(cmd); |
508 |
} |
509 |
|
510 |
static void |
511 |
recurse_report_messages(struct Client *source_p, const struct MessageTree *mtree) |
512 |
{ |
513 |
unsigned int i; |
514 |
|
515 |
if (mtree->msg != NULL) |
516 |
sendto_one(source_p, form_str(RPL_STATSCOMMANDS), |
517 |
me.name, source_p->name, mtree->msg->cmd, |
518 |
mtree->msg->count, mtree->msg->bytes, |
519 |
mtree->msg->rcount); |
520 |
|
521 |
for (i = 0; i < MAXPTRLEN; ++i) |
522 |
if (mtree->pointers[i] != NULL) |
523 |
recurse_report_messages(source_p, mtree->pointers[i]); |
524 |
} |
525 |
|
526 |
/* report_messages() |
527 |
* |
528 |
* inputs - pointer to client to report to |
529 |
* output - NONE |
530 |
* side effects - client is shown list of commands |
531 |
*/ |
532 |
void |
533 |
report_messages(struct Client *source_p) |
534 |
{ |
535 |
const struct MessageTree *mtree = &msg_tree; |
536 |
unsigned int i; |
537 |
|
538 |
for (i = 0; i < MAXPTRLEN; ++i) |
539 |
if (mtree->pointers[i] != NULL) |
540 |
recurse_report_messages(source_p, mtree->pointers[i]); |
541 |
} |
542 |
|
543 |
/* cancel_clients() |
544 |
* |
545 |
* inputs - |
546 |
* output - |
547 |
* side effects - |
548 |
*/ |
549 |
static int |
550 |
cancel_clients(struct Client *client_p, struct Client *source_p, char *cmd) |
551 |
{ |
552 |
/* |
553 |
* Kill all possible points that are causing confusion here, |
554 |
* I'm not sure I've got this all right... |
555 |
* - avalon |
556 |
* |
557 |
* Knowing avalon, probably not. |
558 |
*/ |
559 |
|
560 |
/* |
561 |
* With TS, fake prefixes are a common thing, during the |
562 |
* connect burst when there's a nick collision, and they |
563 |
* must be ignored rather than killed because one of the |
564 |
* two is surviving.. so we don't bother sending them to |
565 |
* all ops everytime, as this could send 'private' stuff |
566 |
* from lagged clients. we do send the ones that cause |
567 |
* servers to be dropped though, as well as the ones from |
568 |
* non-TS servers -orabidoo |
569 |
*/ |
570 |
/* |
571 |
* Incorrect prefix for a server from some connection. If it is a |
572 |
* client trying to be annoying, just QUIT them, if it is a server |
573 |
* then the same deal. |
574 |
*/ |
575 |
if (IsServer(source_p) || IsMe(source_p)) |
576 |
{ |
577 |
sendto_realops_flags(UMODE_DEBUG, L_ADMIN, SEND_NOTICE, |
578 |
"Message for %s[%s] from %s", |
579 |
source_p->name, source_p->from->name, |
580 |
get_client_name(client_p, SHOW_IP)); |
581 |
sendto_realops_flags(UMODE_DEBUG, L_OPER, SEND_NOTICE, |
582 |
"Message for %s[%s] from %s", |
583 |
source_p->name, source_p->from->name, |
584 |
get_client_name(client_p, MASK_IP)); |
585 |
sendto_realops_flags(UMODE_DEBUG, L_ALL, SEND_NOTICE, |
586 |
"Not dropping server %s (%s) for Fake Direction", |
587 |
client_p->name, source_p->name); |
588 |
return -1; |
589 |
/* return exit_client(client_p, client_p, &me, "Fake Direction");*/ |
590 |
} |
591 |
|
592 |
/* |
593 |
* Ok, someone is trying to impose as a client and things are |
594 |
* confused. If we got the wrong prefix from a server, send out a |
595 |
* kill, else just exit the lame client. |
596 |
*/ |
597 |
/* |
598 |
* If the fake prefix is coming from a TS server, discard it |
599 |
* silently -orabidoo |
600 |
* |
601 |
* all servers must be TS these days --is |
602 |
*/ |
603 |
sendto_realops_flags(UMODE_DEBUG, L_ADMIN, SEND_NOTICE, |
604 |
"Message for %s[%s@%s!%s] from %s (TS, ignored)", |
605 |
source_p->name, source_p->username, source_p->host, |
606 |
source_p->from->name, get_client_name(client_p, SHOW_IP)); |
607 |
sendto_realops_flags(UMODE_DEBUG, L_OPER, SEND_NOTICE, |
608 |
"Message for %s[%s@%s!%s] from %s (TS, ignored)", |
609 |
source_p->name, source_p->username, source_p->host, |
610 |
source_p->from->name, get_client_name(client_p, MASK_IP)); |
611 |
|
612 |
return 0; |
613 |
} |
614 |
|
615 |
/* remove_unknown() |
616 |
* |
617 |
* inputs - |
618 |
* output - |
619 |
* side effects - |
620 |
*/ |
621 |
static void |
622 |
remove_unknown(struct Client *client_p, char *lsender, char *lbuffer) |
623 |
{ |
624 |
/* |
625 |
* Do kill if it came from a server because it means there is a ghost |
626 |
* user on the other server which needs to be removed. -avalon |
627 |
* Tell opers about this. -Taner |
628 |
*/ |
629 |
/* |
630 |
* '[0-9]something' is an ID (KILL/SQUIT depending on its length) |
631 |
* 'nodots' is a nickname (KILL) |
632 |
* 'no.dot.at.start' is a server (SQUIT) |
633 |
*/ |
634 |
if ((IsDigit(*lsender) && strlen(lsender) <= IRC_MAXSID) || |
635 |
strchr(lsender, '.') != NULL) |
636 |
{ |
637 |
sendto_realops_flags(UMODE_DEBUG, L_ADMIN, SEND_NOTICE, |
638 |
"Unknown prefix (%s) from %s, Squitting %s", |
639 |
lbuffer, get_client_name(client_p, SHOW_IP), lsender); |
640 |
sendto_realops_flags(UMODE_DEBUG, L_OPER, SEND_NOTICE, |
641 |
"Unknown prefix (%s) from %s, Squitting %s", |
642 |
lbuffer, client_p->name, lsender); |
643 |
sendto_one(client_p, ":%s SQUIT %s :(Unknown prefix (%s) from %s)", |
644 |
me.name, lsender, lbuffer, client_p->name); |
645 |
} |
646 |
else |
647 |
sendto_one(client_p, ":%s KILL %s :%s (Unknown Client)", |
648 |
me.name, lsender, me.name); |
649 |
} |
650 |
|
651 |
/* |
652 |
* |
653 |
* parc number of arguments ('sender' counted as one!) |
654 |
* parv[0] pointer to 'sender' (may point to empty string) (not used) |
655 |
* parv[1]..parv[parc-1] |
656 |
* pointers to additional parameters, this is a NULL |
657 |
* terminated list (parv[parc] == NULL). |
658 |
* |
659 |
* *WARNING* |
660 |
* Numerics are mostly error reports. If there is something |
661 |
* wrong with the message, just *DROP* it! Don't even think of |
662 |
* sending back a neat error message -- big danger of creating |
663 |
* a ping pong error message... |
664 |
* |
665 |
* Rewritten by Nemesi, Jan 1999, to support numeric nicks in parv[1] |
666 |
* |
667 |
* Called when we get a numeric message from a remote _server_ and we are |
668 |
* supposed to forward it somewhere. Note that we always ignore numerics sent |
669 |
* to 'me' and simply drop the message if we can't handle with this properly: |
670 |
* the savvy approach is NEVER generate an error in response to an... error :) |
671 |
*/ |
672 |
static void |
673 |
handle_numeric(char numeric[], struct Client *client_p, struct Client *source_p, |
674 |
int parc, char *parv[]) |
675 |
{ |
676 |
struct Client *target_p = NULL; |
677 |
struct Channel *chptr = NULL; |
678 |
|
679 |
/* |
680 |
* Avoid trash, we need it to come from a server and have a target |
681 |
*/ |
682 |
if (parc < 2 || !IsServer(source_p)) |
683 |
return; |
684 |
|
685 |
/* |
686 |
* Who should receive this message ? Will we do something with it ? |
687 |
* Note that we use findUser functions, so the target can't be neither |
688 |
* a server, nor a channel (?) nor a list of targets (?) .. u2.10 |
689 |
* should never generate numeric replies to non-users anyway |
690 |
* Ahem... it can be a channel actually, csc bots use it :\ --Nem |
691 |
*/ |
692 |
if (IsChanPrefix(*parv[1])) |
693 |
chptr = hash_find_channel(parv[1]); |
694 |
else |
695 |
target_p = find_person(client_p, parv[1]); |
696 |
|
697 |
if (((!target_p) || (target_p->from == client_p)) && !chptr) |
698 |
return; |
699 |
|
700 |
/* |
701 |
* Remap low number numerics, not that I understand WHY.. --Nemesi |
702 |
*/ |
703 |
/* |
704 |
* Numerics below 100 talk about the current 'connection', you're not |
705 |
* connected to a remote server so it doesn't make sense to send them |
706 |
* remotely - but the information they contain may be useful, so we |
707 |
* remap them up. Weird, but true. -- Isomer |
708 |
*/ |
709 |
if (numeric[0] == '0') |
710 |
numeric[0] = '1'; |
711 |
|
712 |
if (target_p) |
713 |
{ |
714 |
/* Fake it for server hiding, if its our client */ |
715 |
if (ConfigServerHide.hide_servers && MyClient(target_p) && |
716 |
!HasUMode(target_p, UMODE_OPER)) |
717 |
sendto_one(target_p, ":%s %s %s %s", me.name, numeric, target_p->name, parv[2]); |
718 |
else |
719 |
sendto_one(target_p, ":%s %s %s %s", ID_or_name(source_p, target_p->from), |
720 |
numeric, ID_or_name(target_p, target_p->from), parv[2]); |
721 |
} |
722 |
else |
723 |
sendto_channel_local(ALL_MEMBERS, 0, chptr, ":%s %s %s %s", |
724 |
source_p->name, numeric, chptr->chname, parv[2]); |
725 |
} |
726 |
|
727 |
/* m_not_oper() |
728 |
* inputs - |
729 |
* output - |
730 |
* side effects - just returns a nastyogram to given user |
731 |
*/ |
732 |
void |
733 |
m_not_oper(struct Client *client_p, struct Client *source_p, |
734 |
int parc, char *parv[]) |
735 |
{ |
736 |
sendto_one(source_p, form_str(ERR_NOPRIVILEGES), |
737 |
me.name, source_p->name); |
738 |
} |
739 |
|
740 |
void |
741 |
m_unregistered(struct Client *client_p, struct Client *source_p, |
742 |
int parc, char *parv[]) |
743 |
{ |
744 |
sendto_one(source_p, form_str(ERR_NOTREGISTERED), me.name, |
745 |
source_p->name[0] ? source_p->name : "*"); |
746 |
} |
747 |
|
748 |
void |
749 |
m_registered(struct Client *client_p, struct Client *source_p, |
750 |
int parc, char *parv[]) |
751 |
{ |
752 |
sendto_one(source_p, form_str(ERR_ALREADYREGISTRED), |
753 |
me.name, source_p->name); |
754 |
} |
755 |
|
756 |
void |
757 |
m_ignore(struct Client *client_p, struct Client *source_p, |
758 |
int parc, char *parv[]) |
759 |
{ |
760 |
return; |
761 |
} |