ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/svn/ircd-hybrid/trunk/src/parse.c
Revision: 3347
Committed: Sun Apr 20 14:03:06 2014 UTC (11 years, 4 months ago) by michael
Content type: text/x-csrc
File size: 21085 byte(s)
Log Message:
- Moved files:
  s_user.c -> user.c
  s_misc.c -> misc.c
  s_serv.c -> server.c

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

Properties

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