ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/svn/ircd-hybrid/trunk/src/parse.c
Revision: 3250
Committed: Sun Mar 30 20:47:30 2014 UTC (11 years, 5 months ago) by michael
Content type: text/x-csrc
File size: 21286 byte(s)
Log Message:
- Fixed inconsistent style in several places

File Contents

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

Properties

Name Value
svn:eol-style native
svn:keywords Id Revision