ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/svn/ircd-hybrid/trunk/src/parse.c
Revision: 3638
Committed: Fri May 23 19:54:30 2014 UTC (12 years, 4 months ago) by michael
Content type: text/x-csrc
File size: 21118 byte(s)
Log Message:
- parse.c: moved *para[] to parse()

File Contents

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

Properties

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