ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/svn/ircd-hybrid/trunk/src/parse.c
Revision: 3241
Committed: Sun Mar 30 16:45:31 2014 UTC (11 years, 4 months ago) by michael
Content type: text/x-csrc
File size: 21303 byte(s)
Log Message:
- Incorporate Adam's writev() patch

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 {
225 if (IsClient(from))
226 sendto_one_numeric(from, &me, ERR_UNKNOWNCOMMAND, ch);
227 }
228
229 ++ServerStats.is_unco;
230 return;
231 }
232
233 assert(msg_ptr->cmd);
234
235 paramcount = msg_ptr->args_max;
236 ii = bufend - ((s) ? s : ch);
237 msg_ptr->bytes += ii;
238 }
239
240 /*
241 * Must the following loop really be so devious? On surface it
242 * splits the message to parameters from blank spaces. But, if
243 * paramcount has been reached, the rest of the message goes into
244 * this last parameter (about same effect as ":" has...) --msa
245 */
246
247 /* Note initially true: s==NULL || *(s-1) == '\0' !! */
248
249 para[parc] = ch;
250
251 if (s)
252 {
253 if (paramcount > MAXPARA)
254 paramcount = MAXPARA;
255
256 while (1)
257 {
258 while (*s == ' ')
259 *s++ = '\0';
260
261 if (*s == '\0')
262 break;
263
264 if (*s == ':')
265 {
266 /* The rest is a single parameter */
267 para[++parc] = s + (!numeric); /* keep the colon if it's a numeric */
268 break;
269 }
270
271 para[++parc] = s;
272
273 if (parc >= paramcount)
274 break;
275
276 while (*s && *s != ' ')
277 ++s;
278 }
279 }
280
281 para[++parc] = NULL;
282
283 if (msg_ptr)
284 handle_command(msg_ptr, from, parc, para);
285 else
286 handle_numeric(numeric, from, parc, para);
287 }
288
289 /* handle_command()
290 *
291 * inputs - pointer to message block
292 * - pointer to client
293 * - pointer to client message is from
294 * - count of number of args
295 * - pointer to argv[] array
296 * output - -1 if error from server
297 * side effects -
298 */
299 static void
300 handle_command(struct Message *mptr, struct Client *source_p,
301 unsigned int i, char *hpara[])
302 {
303 if (IsServer(source_p->from))
304 mptr->rcount++;
305
306 mptr->count++;
307
308 /* check right amount of params is passed... --is */
309 if (i < mptr->args_min)
310 sendto_one_numeric(source_p, &me, ERR_NEEDMOREPARAMS, mptr->cmd);
311 else
312 {
313 AddFlag(source_p->from, FLAGS_CORK);
314 mptr->handlers[source_p->from->handler](source_p, i, hpara);
315
316 if (HasFlag(source_p->from, FLAGS_CORK))
317 {
318 DelFlag(source_p->from, FLAGS_CORK);
319 send_queued_write(source_p->from);
320 }
321 }
322 }
323
324 /* add_msg_element()
325 *
326 * inputs - pointer to MessageTree
327 * - pointer to Message to add for given command
328 * - pointer to current portion of command being added
329 * output - NONE
330 * side effects - recursively build the Message Tree ;-)
331 */
332 /*
333 * How this works.
334 *
335 * The code first checks to see if its reached the end of the command
336 * If so, that struct MessageTree has a msg pointer updated and the links
337 * count incremented, since a msg pointer is a reference.
338 * Then the code descends recursively, building the trie.
339 * If a pointer index inside the struct MessageTree is NULL a new
340 * child struct MessageTree has to be allocated.
341 * The links (reference count) is incremented as they are created
342 * in the parent.
343 */
344 static void
345 add_msg_element(struct MessageTree *mtree_p, struct Message *msg_p,
346 const char *cmd)
347 {
348 struct MessageTree *ntree_p;
349
350 if (*cmd == '\0')
351 {
352 mtree_p->msg = msg_p;
353 mtree_p->links++; /* Have msg pointer, so up ref count */
354 }
355 else
356 {
357 /*
358 * *cmd & (MAXPTRLEN-1)
359 * convert the char pointed to at *cmd from ASCII to an integer
360 * between 0 and MAXPTRLEN.
361 * Thus 'A' -> 0x1 'B' -> 0x2 'c' -> 0x3 etc.
362 */
363 if ((ntree_p = mtree_p->pointers[*cmd & (MAXPTRLEN - 1)]) == NULL)
364 {
365 ntree_p = MyMalloc(sizeof(struct MessageTree));
366 mtree_p->pointers[*cmd & (MAXPTRLEN - 1)] = ntree_p;
367
368 mtree_p->links++; /* Have new pointer, so up ref count */
369 }
370
371 add_msg_element(ntree_p, msg_p, cmd + 1);
372 }
373 }
374
375 /* del_msg_element()
376 *
377 * inputs - Pointer to MessageTree to delete from
378 * - pointer to command name to delete
379 * output - NONE
380 * side effects - recursively deletes a token from the Message Tree ;-)
381 */
382 /*
383 * How this works.
384 *
385 * Well, first off, the code recursively descends into the trie
386 * until it finds the terminating letter of the command being removed.
387 * Once it has done that, it marks the msg pointer as NULL then
388 * reduces the reference count on that allocated struct MessageTree
389 * since a command counts as a reference.
390 *
391 * Then it pops up the recurse stack. As it comes back up the recurse
392 * The code checks to see if the child now has no pointers or msg
393 * i.e. the links count has gone to zero. If its no longer used, the
394 * child struct MessageTree can be deleted. The parent reference
395 * to this child is then removed and the parents link count goes down.
396 * Thus, we continue to go back up removing all unused MessageTree(s)
397 */
398 static void
399 del_msg_element(struct MessageTree *mtree_p, const char *cmd)
400 {
401 struct MessageTree *ntree_p;
402
403 /*
404 * In case this is called for a nonexistent command
405 * check that there is a msg pointer here, else links-- goes -ve
406 * -db
407 */
408 if (*cmd == '\0' && mtree_p->msg)
409 {
410 mtree_p->msg = NULL;
411 mtree_p->links--;
412 }
413 else
414 {
415 if ((ntree_p = mtree_p->pointers[*cmd & (MAXPTRLEN - 1)]))
416 {
417 del_msg_element(ntree_p, cmd + 1);
418
419 if (ntree_p->links == 0)
420 {
421 mtree_p->pointers[*cmd & (MAXPTRLEN - 1)] = NULL;
422 mtree_p->links--;
423 MyFree(ntree_p);
424 }
425 }
426 }
427 }
428
429 /* msg_tree_parse()
430 *
431 * inputs - Pointer to command to find
432 * - Pointer to MessageTree root
433 * output - Find given command returning Message * if found NULL if not
434 * side effects - none
435 */
436 static struct Message *
437 msg_tree_parse(const char *cmd)
438 {
439 struct MessageTree *mtree = &msg_tree;
440 assert(cmd && *cmd);
441
442 while (IsAlpha(*cmd) && (mtree = mtree->pointers[*cmd & (MAXPTRLEN - 1)]))
443 if (*++cmd == '\0')
444 return mtree->msg;
445
446 return NULL;
447 }
448
449 /* mod_add_cmd()
450 *
451 * inputs - pointer to struct Message
452 * output - none
453 * side effects - load this one command name
454 * msg->count msg->bytes is modified in place, in
455 * modules address space. Might not want to do that...
456 */
457 void
458 mod_add_cmd(struct Message *msg)
459 {
460 assert(msg && msg->cmd);
461
462 /* command already added? */
463 if (msg_tree_parse(msg->cmd))
464 return;
465
466 add_msg_element(&msg_tree, msg, msg->cmd);
467 msg->count = msg->rcount = msg->bytes = 0;
468 }
469
470 /* mod_del_cmd()
471 *
472 * inputs - pointer to struct Message
473 * output - none
474 * side effects - unload this one command name
475 */
476 void
477 mod_del_cmd(struct Message *msg)
478 {
479 assert(msg && msg->cmd);
480
481 del_msg_element(&msg_tree, msg->cmd);
482 }
483
484 /* find_command()
485 *
486 * inputs - command name
487 * output - pointer to struct Message
488 * side effects - none
489 */
490 struct Message *
491 find_command(const char *cmd)
492 {
493 return msg_tree_parse(cmd);
494 }
495
496 static void
497 recurse_report_messages(struct Client *source_p, const struct MessageTree *mtree)
498 {
499 if (mtree->msg)
500 sendto_one_numeric(source_p, &me, RPL_STATSCOMMANDS,
501 mtree->msg->cmd,
502 mtree->msg->count, mtree->msg->bytes,
503 mtree->msg->rcount);
504
505 for (unsigned int i = 0; i < MAXPTRLEN; ++i)
506 if (mtree->pointers[i])
507 recurse_report_messages(source_p, mtree->pointers[i]);
508 }
509
510 /* report_messages()
511 *
512 * inputs - pointer to client to report to
513 * output - NONE
514 * side effects - client is shown list of commands
515 */
516 void
517 report_messages(struct Client *source_p)
518 {
519 const struct MessageTree *mtree = &msg_tree;
520
521 for (unsigned int i = 0; i < MAXPTRLEN; ++i)
522 if (mtree->pointers[i])
523 recurse_report_messages(source_p, mtree->pointers[i]);
524 }
525
526 /* cancel_clients()
527 *
528 * inputs -
529 * output -
530 * side effects -
531 */
532 static int
533 cancel_clients(struct Client *client_p, struct Client *source_p, char *cmd)
534 {
535 /*
536 * Kill all possible points that are causing confusion here,
537 * I'm not sure I've got this all right...
538 * - avalon
539 *
540 * Knowing avalon, probably not.
541 */
542
543 /*
544 * With TS, fake prefixes are a common thing, during the
545 * connect burst when there's a nick collision, and they
546 * must be ignored rather than killed because one of the
547 * two is surviving.. so we don't bother sending them to
548 * all ops everytime, as this could send 'private' stuff
549 * from lagged clients. we do send the ones that cause
550 * servers to be dropped though, as well as the ones from
551 * non-TS servers -orabidoo
552 */
553 /*
554 * Incorrect prefix for a server from some connection. If it is a
555 * client trying to be annoying, just QUIT them, if it is a server
556 * then the same deal.
557 */
558 if (IsServer(source_p) || IsMe(source_p))
559 {
560 sendto_realops_flags(UMODE_DEBUG, L_ADMIN, SEND_NOTICE,
561 "Message for %s[%s] from %s",
562 source_p->name, source_p->from->name,
563 get_client_name(client_p, SHOW_IP));
564 sendto_realops_flags(UMODE_DEBUG, L_OPER, SEND_NOTICE,
565 "Message for %s[%s] from %s",
566 source_p->name, source_p->from->name,
567 get_client_name(client_p, MASK_IP));
568 sendto_realops_flags(UMODE_DEBUG, L_ALL, SEND_NOTICE,
569 "Not dropping server %s (%s) for Fake Direction",
570 client_p->name, source_p->name);
571 return -1;
572 /* return exit_client(client_p, client_p, &me, "Fake Direction");*/
573 }
574
575 /*
576 * Ok, someone is trying to impose as a client and things are
577 * confused. If we got the wrong prefix from a server, send out a
578 * kill, else just exit the lame client.
579 */
580 /*
581 * If the fake prefix is coming from a TS server, discard it
582 * silently -orabidoo
583 *
584 * all servers must be TS these days --is
585 */
586 sendto_realops_flags(UMODE_DEBUG, L_ADMIN, SEND_NOTICE,
587 "Message for %s[%s@%s!%s] from %s (TS, ignored)",
588 source_p->name, source_p->username, source_p->host,
589 source_p->from->name, get_client_name(client_p, SHOW_IP));
590 sendto_realops_flags(UMODE_DEBUG, L_OPER, SEND_NOTICE,
591 "Message for %s[%s@%s!%s] from %s (TS, ignored)",
592 source_p->name, source_p->username, source_p->host,
593 source_p->from->name, get_client_name(client_p, MASK_IP));
594 return 0;
595 }
596
597 /* remove_unknown()
598 *
599 * inputs -
600 * output -
601 * side effects -
602 */
603 static void
604 remove_unknown(struct Client *client_p, char *lsender, char *lbuffer)
605 {
606 /*
607 * Do kill if it came from a server because it means there is a ghost
608 * user on the other server which needs to be removed. -avalon
609 * Tell opers about this. -Taner
610 */
611 /*
612 * '[0-9]something' is an ID (KILL/SQUIT depending on its length)
613 * 'nodots' is a nickname (KILL)
614 * 'no.dot.at.start' is a server (SQUIT)
615 */
616 if ((IsDigit(*lsender) && strlen(lsender) <= IRC_MAXSID) ||
617 strchr(lsender, '.'))
618 {
619 sendto_realops_flags(UMODE_DEBUG, L_ADMIN, SEND_NOTICE,
620 "Unknown prefix (%s) from %s, Squitting %s",
621 lbuffer, get_client_name(client_p, SHOW_IP), lsender);
622 sendto_realops_flags(UMODE_DEBUG, L_OPER, SEND_NOTICE,
623 "Unknown prefix (%s) from %s, Squitting %s",
624 lbuffer, client_p->name, lsender);
625 sendto_one(client_p, ":%s SQUIT %s :(Unknown prefix (%s) from %s)",
626 me.name, lsender, lbuffer, client_p->name);
627 }
628 else
629 sendto_one(client_p, ":%s KILL %s :%s (Unknown Client)",
630 me.name, lsender, me.name);
631 }
632
633 /*
634 *
635 * parc number of arguments ('sender' counted as one!)
636 * parv[0] pointer to 'sender' (may point to empty string) (not used)
637 * parv[1]..parv[parc-1]
638 * pointers to additional parameters, this is a NULL
639 * terminated list (parv[parc] == NULL).
640 *
641 * *WARNING*
642 * Numerics are mostly error reports. If there is something
643 * wrong with the message, just *DROP* it! Don't even think of
644 * sending back a neat error message -- big danger of creating
645 * a ping pong error message...
646 *
647 * Rewritten by Nemesi, Jan 1999, to support numeric nicks in parv[1]
648 *
649 * Called when we get a numeric message from a remote _server_ and we are
650 * supposed to forward it somewhere. Note that we always ignore numerics sent
651 * to 'me' and simply drop the message if we can't handle with this properly:
652 * the savvy approach is NEVER generate an error in response to an... error :)
653 */
654 static void
655 handle_numeric(char numeric[], struct Client *source_p, int parc, char *parv[])
656 {
657 struct Client *target_p = NULL;
658 struct Channel *chptr = NULL;
659
660 /*
661 * Avoid trash, we need it to come from a server and have a target
662 */
663 if (parc < 2 || !IsServer(source_p))
664 return;
665
666 /*
667 * Who should receive this message ? Will we do something with it ?
668 * Note that we use findUser functions, so the target can't be neither
669 * a server, nor a channel (?) nor a list of targets (?) .. u2.10
670 * should never generate numeric replies to non-users anyway
671 * Ahem... it can be a channel actually, csc bots use it :\ --Nem
672 */
673 if (IsChanPrefix(*parv[1]))
674 chptr = hash_find_channel(parv[1]);
675 else
676 target_p = find_person(source_p, parv[1]);
677
678 if (((!target_p) || (target_p->from == source_p->from)) && !chptr)
679 return;
680
681 /*
682 * Remap low number numerics, not that I understand WHY.. --Nemesi
683 */
684 /*
685 * Numerics below 100 talk about the current 'connection', you're not
686 * connected to a remote server so it doesn't make sense to send them
687 * remotely - but the information they contain may be useful, so we
688 * remap them up. Weird, but true. -- Isomer
689 */
690 if (numeric[0] == '0')
691 numeric[0] = '1';
692
693 if (target_p)
694 {
695 /* Fake it for server hiding, if its our client */
696 if (ConfigServerHide.hide_servers && MyClient(target_p) &&
697 !HasUMode(target_p, UMODE_OPER))
698 sendto_one(target_p, ":%s %s %s %s", me.name, numeric, target_p->name, parv[2]);
699 else
700 sendto_one(target_p, ":%s %s %s %s", ID_or_name(source_p, target_p),
701 numeric, ID_or_name(target_p, target_p), parv[2]);
702 }
703 else
704 sendto_channel_butone(source_p, source_p, chptr, 0, "%s %s %s",
705 numeric, chptr->chname, parv[2]);
706 }
707
708 /* m_not_oper()
709 * inputs -
710 * output -
711 * side effects - just returns a nastyogram to given user
712 */
713 int
714 m_not_oper(struct Client *source_p, int parc, char *parv[])
715 {
716 sendto_one_numeric(source_p, &me, ERR_NOPRIVILEGES);
717 return 0;
718 }
719
720 int
721 m_unregistered(struct Client *source_p, int parc, char *parv[])
722 {
723 sendto_one_numeric(source_p, &me, ERR_NOTREGISTERED);
724 return 0;
725 }
726
727 int
728 m_registered(struct Client *source_p, int parc, char *parv[])
729 {
730 sendto_one_numeric(source_p, &me, ERR_ALREADYREGISTRED);
731 return 0;
732 }
733
734 int
735 m_ignore(struct Client *source_p, int parc, char *parv[])
736 {
737 return 0;
738 }

Properties

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