ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/svn/ircd-hybrid/trunk/src/parse.c
Revision: 7379
Committed: Tue Mar 1 17:35:03 2016 UTC (9 years, 5 months ago) by michael
Content type: text/x-csrc
File size: 18779 byte(s)
Log Message:
- parse.c:parse(): change length to size_t type

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 7006 * Copyright (c) 1997-2016 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 michael 4565 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
19 adx 30 * 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 michael 6161 #include "id.h"
33 adx 30 #include "irc_string.h"
34     #include "ircd.h"
35     #include "numeric.h"
36 michael 1309 #include "log.h"
37 adx 30 #include "send.h"
38 michael 1309 #include "conf.h"
39 adx 30 #include "memory.h"
40 michael 3347 #include "user.h"
41     #include "server.h"
42 adx 30
43 michael 2916
44 adx 30 /*
45     * (based on orabidoo's parser code)
46     *
47     * This has always just been a trie. Look at volume III of Knuth ACP
48     *
49     *
50     * ok, you start out with an array of pointers, each one corresponds
51     * to a letter at the current position in the command being examined.
52     *
53     * so roughly you have this for matching 'trie' or 'tie'
54     *
55     * 't' points -> [MessageTree *] 'r' -> [MessageTree *] -> 'i'
56     * -> [MessageTree *] -> [MessageTree *] -> 'e' and matches
57     *
58 michael 2916 * 'i' -> [MessageTree *] -> 'e' and matches
59 adx 30 *
60     * BUGS (Limitations!)
61 michael 2345 *
62 adx 30 * I designed this trie to parse ircd commands. Hence it currently
63     * casefolds. This is trivial to fix by increasing MAXPTRLEN.
64     * This trie also "folds" '{' etc. down. This means, the input to this
65     * trie must be alpha tokens only. This again, is a limitation that
66     * can be overcome by increasing MAXPTRLEN to include upper/lower case
67     * at the expense of more memory. At the extreme end, you could make
68     * MAXPTRLEN 128.
69     *
70     * This is also not a patricia trie. On short ircd tokens, this is
71 michael 2345 * not likely going to matter.
72 adx 30 *
73     * Diane Bruce (Dianora), June 6 2003
74     */
75    
76 michael 4231 /*
77     * Must be a power of 2, and larger than 26 [a-z]|[A-Z]. It's used to allocate
78     * the set of pointers at each node of the tree.
79     * There are MAXPTRLEN pointers at each node. Obviously, there have to be more
80     * pointers than ASCII letters. 32 is a nice number since there is then no need
81     * to shift 'A'/'a' to base 0 index, at the expense of a few never used
82     * pointers.
83     * For a small parser like this, this is a good compromise and does
84     * make it somewhat faster. - Dianora
85     */
86 michael 6350 enum { MAXPTRLEN = 32 };
87 adx 30
88 michael 4231
89     static struct MessageTree
90 adx 30 {
91 michael 2345 int links; /* Count of all pointers (including msg) at this node
92 michael 2182 * used as reference count for deletion of _this_ node.
93     */
94 adx 30 struct Message *msg;
95     struct MessageTree *pointers[MAXPTRLEN];
96 michael 4231 } msg_tree;
97 adx 30
98    
99 michael 4231 /* remove_unknown()
100     *
101     * inputs -
102     * output -
103     * side effects -
104     */
105     static void
106 michael 4552 parse_remove_unknown(struct Client *client_p, const char *lsender, char *lbuffer)
107 michael 4231 {
108     /*
109     * Do kill if it came from a server because it means there is a ghost
110     * user on the other server which needs to be removed. -avalon
111     * Tell opers about this. -Taner
112     */
113     /*
114     * '[0-9]something' is an ID (KILL/SQUIT depending on its length)
115     * 'nodots' is a nickname (KILL)
116     * 'no.dot.at.start' is a server (SQUIT)
117     */
118     if ((IsDigit(*lsender) && strlen(lsender) <= IRC_MAXSID) || strchr(lsender, '.'))
119     {
120     sendto_realops_flags(UMODE_DEBUG, L_ADMIN, SEND_NOTICE,
121     "Unknown prefix (%s) from %s, Squitting %s",
122     lbuffer, get_client_name(client_p, SHOW_IP), lsender);
123     sendto_realops_flags(UMODE_DEBUG, L_OPER, SEND_NOTICE,
124     "Unknown prefix (%s) from %s, Squitting %s",
125 michael 6437 lbuffer, get_client_name(client_p, MASK_IP), lsender);
126 michael 4231 sendto_one(client_p, ":%s SQUIT %s :(Unknown prefix (%s) from %s)",
127     me.id, lsender, lbuffer, client_p->name);
128     }
129     else
130     sendto_one(client_p, ":%s KILL %s :%s (Unknown Client)",
131     me.id, lsender, me.name);
132     }
133 adx 30
134     /*
135 michael 4231 *
136     * parc number of arguments ('sender' counted as one!)
137     * parv[0] pointer to 'sender' (may point to empty string) (not used)
138     * parv[1]..parv[parc-1]
139     * pointers to additional parameters, this is a NULL
140     * terminated list (parv[parc] == NULL).
141     *
142     * *WARNING*
143     * Numerics are mostly error reports. If there is something
144     * wrong with the message, just *DROP* it! Don't even think of
145     * sending back a neat error message -- big danger of creating
146     * a ping pong error message...
147     *
148     * Rewritten by Nemesi, Jan 1999, to support numeric nicks in parv[1]
149     *
150     * Called when we get a numeric message from a remote _server_ and we are
151     * supposed to forward it somewhere. Note that we always ignore numerics sent
152     * to 'me' and simply drop the message if we can't handle with this properly:
153     * the savvy approach is NEVER generate an error in response to an... error :)
154     */
155     static void
156     parse_handle_numeric(unsigned int numeric, struct Client *source_p, int parc, char *parv[])
157     {
158     struct Client *target_p = NULL;
159     struct Channel *chptr = NULL;
160    
161     /*
162     * Avoid trash, we need it to come from a server and have a target
163     */
164     if (parc < 2 || !IsServer(source_p))
165     return;
166    
167     /*
168     * Who should receive this message ? Will we do something with it ?
169     * Note that we use findUser functions, so the target can't be neither
170     * a server, nor a channel (?) nor a list of targets (?) .. u2.10
171     * should never generate numeric replies to non-users anyway
172     * Ahem... it can be a channel actually, csc bots use it :\ --Nem
173     */
174     if (IsChanPrefix(*parv[1]))
175     chptr = hash_find_channel(parv[1]);
176     else
177     target_p = find_person(source_p, parv[1]);
178    
179 michael 4959 if ((!target_p || target_p->from == source_p->from) && !chptr)
180 michael 4231 return;
181    
182     /*
183     * Remap low number numerics, not that I understand WHY.. --Nemesi
184     */
185     /*
186     * Numerics below 100 talk about the current 'connection', you're not
187     * connected to a remote server so it doesn't make sense to send them
188     * remotely - but the information they contain may be useful, so we
189     * remap them up. Weird, but true. -- Isomer
190     */
191     if (numeric < 100)
192     numeric += 100;
193    
194     if (target_p)
195     {
196     /* Fake it for server hiding, if it's our client */
197     if ((ConfigServerHide.hide_servers || IsHidden(source_p)) && MyConnect(target_p) &&
198     !HasUMode(target_p, UMODE_OPER))
199 michael 5583 sendto_one_numeric(target_p, &me, numeric | SND_EXPLICIT, "%s", parv[2]);
200 michael 4231 else
201 michael 5583 sendto_one_numeric(target_p, source_p, numeric | SND_EXPLICIT, "%s", parv[2]);
202 michael 4231 }
203     else
204     sendto_channel_butone(source_p, source_p, chptr, 0, "%u %s %s",
205 michael 4618 numeric, chptr->name, parv[2]);
206 michael 4231 }
207    
208     /* handle_command()
209     *
210     * inputs - pointer to message block
211     * - pointer to client
212     * - pointer to client message is from
213     * - count of number of args
214     * - pointer to argv[] array
215     * output - -1 if error from server
216     * side effects -
217     */
218     static void
219 michael 4937 parse_handle_command(struct Message *message, struct Client *source_p,
220 michael 4231 unsigned int i, char *para[])
221     {
222     if (IsServer(source_p->from))
223 michael 4937 ++message->rcount;
224 michael 4231
225 michael 4937 ++message->count;
226 michael 4231
227     /* Check right amount of parameters is passed... --is */
228 michael 4937 if (i < message->args_min)
229     sendto_one_numeric(source_p, &me, ERR_NEEDMOREPARAMS, message->cmd);
230 michael 4231 else
231 michael 4937 message->handlers[source_p->from->handler](source_p, i, para);
232 michael 4231 }
233    
234     /*
235 adx 30 * parse a buffer.
236     *
237     * NOTE: parse() should not be called recusively by any other functions!
238     */
239     void
240     parse(struct Client *client_p, char *pbuffer, char *bufend)
241     {
242     struct Client *from = client_p;
243 michael 4937 struct Message *message = NULL;
244 michael 3638 char *para[MAXPARA + 2]; /* <command> + <parameters> + NULL */
245 michael 1246 char *ch = NULL;
246     char *s = NULL;
247 michael 3573 unsigned int numeric = 0;
248 michael 1178 unsigned int parc = 0;
249     unsigned int paramcount;
250 adx 30
251     if (IsDefunct(client_p))
252     return;
253    
254 michael 4588 assert(client_p->connection->fd.flags.open);
255 michael 2786 assert((bufend - pbuffer) < IRCD_BUFSIZE);
256 adx 30
257 michael 3628 for (ch = pbuffer; *ch == ' '; ++ch) /* Skip spaces */
258     ;
259 adx 30
260     if (*ch == ':')
261     {
262 michael 1178 /*
263     * Copy the prefix to 'sender' assuming it terminates
264 adx 30 * with SPACE (or NULL, which is an error, though).
265     */
266 michael 4833 const char *const sender = ++ch;
267 adx 30
268 michael 3235 if ((s = strchr(ch, ' ')))
269 adx 30 {
270     *s = '\0';
271 michael 1178 ch = ++s;
272 adx 30 }
273    
274     if (*sender && IsServer(client_p))
275     {
276 michael 4554 if ((from = hash_find_id(sender)) == NULL)
277     from = hash_find_client(sender);
278 adx 30
279 michael 2345 /*
280     * Hmm! If the client corresponding to the prefix is not found--what is
281     * the correct action??? Now, I will ignore the message (old IRC just
282     * let it through as if the prefix just wasn't there...) --msa
283 adx 30 */
284     if (from == NULL)
285     {
286 michael 896 ++ServerStats.is_unpf;
287 michael 4231 parse_remove_unknown(client_p, sender, pbuffer);
288 adx 30 return;
289     }
290    
291     if (from->from != client_p)
292     {
293 michael 896 ++ServerStats.is_wrdi;
294 michael 4926 sendto_realops_flags(UMODE_DEBUG, L_ADMIN, SEND_NOTICE,
295     "Fake direction: dropped message from %s[%s] via %s",
296     from->name, from->from->name,
297     get_client_name(client_p, SHOW_IP));
298     sendto_realops_flags(UMODE_DEBUG, L_OPER, SEND_NOTICE,
299 michael 4928 "Fake direction: dropped message from %s[%s] via %s",
300 michael 4926 from->name, from->from->name,
301     get_client_name(client_p, MASK_IP));
302 adx 30 return;
303     }
304     }
305    
306     while (*ch == ' ')
307 michael 1178 ++ch;
308 adx 30 }
309    
310     if (*ch == '\0')
311     {
312 michael 896 ++ServerStats.is_empt;
313 adx 30 return;
314     }
315    
316 michael 2345 /*
317     * Extract the command code from the packet. Point s to the end
318 adx 30 * of the command code and calculate the length using pointer
319 michael 2345 * arithmetic. Note: only need length for numerics and *all*
320 adx 30 * numerics must have parameters and thus a space after the command
321     * code. -avalon
322     */
323    
324 michael 3628 /* EOB is 3 characters long but is not a numeric */
325 michael 4298 if (*(ch + 3) == ' ' && /* Ok, let's see if it's a possible numeric */
326 adx 30 IsDigit(*ch) && IsDigit(*(ch + 1)) && IsDigit(*(ch + 2)))
327     {
328 michael 3573 numeric = (*ch - '0') * 100 + (*(ch + 1) - '0') * 10 + (*(ch + 2) - '0');
329 michael 3628 paramcount = 2; /* Destination, and the rest of it */
330 michael 896 ++ServerStats.is_num;
331 michael 3628 s = ch + 3; /* I know this is ' ' from above if */
332     *s++ = '\0'; /* Blow away the ' ', and point s to next part */
333 adx 30 }
334     else
335 michael 2345 {
336 michael 3235 if ((s = strchr(ch, ' ')))
337 adx 30 *s++ = '\0';
338    
339 michael 4937 if ((message = find_command(ch)) == NULL)
340 adx 30 {
341 michael 2916 /*
342 michael 2345 * Note: Give error message *only* to recognized
343 adx 30 * persons. It's a nightmare situation to have
344     * two programs sending "Unknown command"'s or
345     * equivalent to each other at full blast....
346     * If it has got to person state, it at least
347     * seems to be well behaving. Perhaps this message
348     * should never be generated, though... --msa
349     * Hm, when is the buffer empty -- if a command
350     * code has been found ?? -Armin
351     */
352 michael 3335 if (*pbuffer)
353 adx 30 if (IsClient(from))
354 michael 3109 sendto_one_numeric(from, &me, ERR_UNKNOWNCOMMAND, ch);
355 adx 30
356 michael 896 ++ServerStats.is_unco;
357 adx 30 return;
358     }
359    
360 michael 4937 assert(message->cmd);
361 adx 30
362 michael 4937 paramcount = message->args_max;
363 michael 7379
364     size_t length = bufend - ((s) ? s : ch);
365 michael 4937 message->bytes += length;
366 adx 30 }
367    
368 michael 1178 /*
369     * Must the following loop really be so devious? On surface it
370     * splits the message to parameters from blank spaces. But, if
371     * paramcount has been reached, the rest of the message goes into
372     * this last parameter (about same effect as ":" has...) --msa
373     */
374    
375 michael 3250 /* Note initially true: s == NULL || *(s - 1) == '\0' !! */
376 michael 1178
377 michael 3096 para[parc] = ch;
378 michael 1178
379 michael 4937 if (message && (message->flags & MFLG_EXTRA))
380 michael 4545 {
381     /*
382     * XXX: This will have to go away after the command handler rewrite
383     */
384 michael 4937 para[++parc] = message->extra;
385 michael 4545 }
386    
387 michael 1178 if (s)
388 adx 30 {
389 michael 1178 if (paramcount > MAXPARA)
390     paramcount = MAXPARA;
391    
392     while (1)
393     {
394     while (*s == ' ')
395     *s++ = '\0';
396    
397     if (*s == '\0')
398     break;
399    
400     if (*s == ':')
401     {
402 michael 4747 /* The rest is single parameter--can include blanks also. */
403 michael 3250 para[++parc] = s + (!numeric); /* Keep the colon if it's a numeric */
404 michael 1178 break;
405     }
406    
407     para[++parc] = s;
408    
409     if (parc >= paramcount)
410     break;
411    
412     while (*s && *s != ' ')
413     ++s;
414     }
415 adx 30 }
416    
417 michael 1178 para[++parc] = NULL;
418    
419 michael 4937 if (message)
420     parse_handle_command(message, from, parc, para);
421 adx 30 else
422 michael 4231 parse_handle_numeric(numeric, from, parc, para);
423 adx 30 }
424    
425     /* add_msg_element()
426     *
427     * inputs - pointer to MessageTree
428     * - pointer to Message to add for given command
429     * - pointer to current portion of command being added
430     * output - NONE
431     * side effects - recursively build the Message Tree ;-)
432     */
433     /*
434     * How this works.
435     *
436     * The code first checks to see if its reached the end of the command
437     * If so, that struct MessageTree has a msg pointer updated and the links
438     * count incremented, since a msg pointer is a reference.
439     * Then the code descends recursively, building the trie.
440     * If a pointer index inside the struct MessageTree is NULL a new
441     * child struct MessageTree has to be allocated.
442     * The links (reference count) is incremented as they are created
443     * in the parent.
444     */
445     static void
446 michael 1570 add_msg_element(struct MessageTree *mtree_p, struct Message *msg_p,
447     const char *cmd)
448 adx 30 {
449 michael 3624 struct MessageTree *ntree_p = NULL;
450 adx 30
451     if (*cmd == '\0')
452     {
453     mtree_p->msg = msg_p;
454 michael 1570 mtree_p->links++; /* Have msg pointer, so up ref count */
455 adx 30 }
456     else
457     {
458 michael 2345 /*
459     * *cmd & (MAXPTRLEN-1)
460 adx 30 * convert the char pointed to at *cmd from ASCII to an integer
461     * between 0 and MAXPTRLEN.
462     * Thus 'A' -> 0x1 'B' -> 0x2 'c' -> 0x3 etc.
463     */
464 michael 1013 if ((ntree_p = mtree_p->pointers[*cmd & (MAXPTRLEN - 1)]) == NULL)
465 adx 30 {
466 michael 7032 ntree_p = xcalloc(sizeof(struct MessageTree));
467 michael 1013 mtree_p->pointers[*cmd & (MAXPTRLEN - 1)] = ntree_p;
468 adx 30
469 michael 1570 mtree_p->links++; /* Have new pointer, so up ref count */
470 adx 30 }
471 michael 896
472 michael 1013 add_msg_element(ntree_p, msg_p, cmd + 1);
473 adx 30 }
474     }
475    
476     /* del_msg_element()
477     *
478     * inputs - Pointer to MessageTree to delete from
479     * - pointer to command name to delete
480     * output - NONE
481     * side effects - recursively deletes a token from the Message Tree ;-)
482     */
483     /*
484     * How this works.
485     *
486     * Well, first off, the code recursively descends into the trie
487     * until it finds the terminating letter of the command being removed.
488     * Once it has done that, it marks the msg pointer as NULL then
489     * reduces the reference count on that allocated struct MessageTree
490     * since a command counts as a reference.
491     *
492     * Then it pops up the recurse stack. As it comes back up the recurse
493     * The code checks to see if the child now has no pointers or msg
494 michael 4298 * i.e. the links count has gone to zero. If it's no longer used, the
495 adx 30 * child struct MessageTree can be deleted. The parent reference
496     * to this child is then removed and the parents link count goes down.
497     * Thus, we continue to go back up removing all unused MessageTree(s)
498     */
499     static void
500     del_msg_element(struct MessageTree *mtree_p, const char *cmd)
501     {
502 michael 3624 struct MessageTree *ntree_p = NULL;
503 adx 30
504 michael 1246 /*
505     * In case this is called for a nonexistent command
506 adx 30 * check that there is a msg pointer here, else links-- goes -ve
507     * -db
508     */
509 michael 3235 if (*cmd == '\0' && mtree_p->msg)
510 adx 30 {
511     mtree_p->msg = NULL;
512     mtree_p->links--;
513     }
514     else
515     {
516 michael 3235 if ((ntree_p = mtree_p->pointers[*cmd & (MAXPTRLEN - 1)]))
517 adx 30 {
518 michael 1013 del_msg_element(ntree_p, cmd + 1);
519 michael 896
520 adx 30 if (ntree_p->links == 0)
521     {
522 michael 1570 mtree_p->pointers[*cmd & (MAXPTRLEN - 1)] = NULL;
523     mtree_p->links--;
524 michael 7032 xfree(ntree_p);
525 adx 30 }
526     }
527     }
528     }
529    
530     /* msg_tree_parse()
531     *
532     * inputs - Pointer to command to find
533     * - Pointer to MessageTree root
534     * output - Find given command returning Message * if found NULL if not
535     * side effects - none
536     */
537     static struct Message *
538 michael 1427 msg_tree_parse(const char *cmd)
539 adx 30 {
540 michael 1427 struct MessageTree *mtree = &msg_tree;
541 michael 3250
542 michael 5777 assert(!EmptyString(cmd));
543 adx 30
544 michael 522 while (IsAlpha(*cmd) && (mtree = mtree->pointers[*cmd & (MAXPTRLEN - 1)]))
545     if (*++cmd == '\0')
546     return mtree->msg;
547 adx 30
548 michael 522 return NULL;
549 adx 30 }
550    
551     /* mod_add_cmd()
552     *
553     * inputs - pointer to struct Message
554     * output - none
555     * side effects - load this one command name
556     */
557     void
558     mod_add_cmd(struct Message *msg)
559     {
560 michael 6879 assert(msg);
561     assert(msg->cmd);
562 adx 30
563 michael 3250 /* Command already added? */
564 michael 1427 if (msg_tree_parse(msg->cmd))
565 adx 30 return;
566    
567     add_msg_element(&msg_tree, msg, msg->cmd);
568     }
569    
570     /* mod_del_cmd()
571     *
572     * inputs - pointer to struct Message
573     * output - none
574     * side effects - unload this one command name
575     */
576     void
577     mod_del_cmd(struct Message *msg)
578     {
579 michael 6879 assert(msg);
580     assert(msg->cmd);
581 adx 30
582 michael 3614 if (!msg_tree_parse(msg->cmd))
583     return;
584    
585 adx 30 del_msg_element(&msg_tree, msg->cmd);
586     }
587    
588     /* find_command()
589     *
590     * inputs - command name
591     * output - pointer to struct Message
592     * side effects - none
593     */
594     struct Message *
595     find_command(const char *cmd)
596     {
597 michael 1427 return msg_tree_parse(cmd);
598 adx 30 }
599    
600 michael 1246 static void
601     recurse_report_messages(struct Client *source_p, const struct MessageTree *mtree)
602     {
603 michael 3235 if (mtree->msg)
604 michael 3109 sendto_one_numeric(source_p, &me, RPL_STATSCOMMANDS,
605     mtree->msg->cmd,
606     mtree->msg->count, mtree->msg->bytes,
607     mtree->msg->rcount);
608 michael 1246
609 michael 3235 for (unsigned int i = 0; i < MAXPTRLEN; ++i)
610     if (mtree->pointers[i])
611 michael 1246 recurse_report_messages(source_p, mtree->pointers[i]);
612     }
613    
614 adx 30 /* report_messages()
615     *
616     * inputs - pointer to client to report to
617     * output - NONE
618     * side effects - client is shown list of commands
619     */
620     void
621     report_messages(struct Client *source_p)
622     {
623 michael 4833 const struct MessageTree *const mtree = &msg_tree;
624 adx 30
625 michael 3235 for (unsigned int i = 0; i < MAXPTRLEN; ++i)
626     if (mtree->pointers[i])
627 adx 30 recurse_report_messages(source_p, mtree->pointers[i]);
628     }
629    
630     /* m_not_oper()
631 michael 2345 * inputs -
632 adx 30 * output -
633     * side effects - just returns a nastyogram to given user
634     */
635 michael 2820 int
636 michael 3156 m_not_oper(struct Client *source_p, int parc, char *parv[])
637 adx 30 {
638 michael 3109 sendto_one_numeric(source_p, &me, ERR_NOPRIVILEGES);
639 michael 2820 return 0;
640 adx 30 }
641    
642 michael 2820 int
643 michael 3156 m_unregistered(struct Client *source_p, int parc, char *parv[])
644 adx 30 {
645 michael 3109 sendto_one_numeric(source_p, &me, ERR_NOTREGISTERED);
646 michael 2820 return 0;
647 adx 30 }
648    
649 michael 2820 int
650 michael 3156 m_registered(struct Client *source_p, int parc, char *parv[])
651 adx 30 {
652 michael 3109 sendto_one_numeric(source_p, &me, ERR_ALREADYREGISTRED);
653 michael 2820 return 0;
654 adx 30 }
655    
656 michael 2820 int
657 michael 3156 m_ignore(struct Client *source_p, int parc, char *parv[])
658 adx 30 {
659 michael 2820 return 0;
660 adx 30 }

Properties

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