]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * ircd-ratbox: A slightly useful ircd. | |
3 | * m_names.c: Shows the users who are online. | |
4 | * | |
5 | * Copyright (C) 1990 Jarkko Oikarinen and University of Oulu, Co Center | |
6 | * Copyright (C) 1996-2002 Hybrid Development Team | |
7 | * Copyright (C) 2002-2005 ircd-ratbox development team | |
8 | * | |
9 | * This program is free software; you can redistribute it and/or modify | |
10 | * it under the terms of the GNU General Public License as published by | |
11 | * the Free Software Foundation; either version 2 of the License, or | |
12 | * (at your option) any later version. | |
13 | * | |
14 | * This program is distributed in the hope that it will be useful, | |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
18 | * | |
19 | * You should have received a copy of the GNU General Public License | |
20 | * along with this program; if not, write to the Free Software | |
21 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 | |
22 | * USA | |
23 | * | |
24 | * $Id: m_names.c 254 2005-09-21 23:35:12Z nenolod $ | |
25 | */ | |
26 | ||
27 | #include "stdinc.h" | |
28 | #include "channel.h" | |
29 | #include "client.h" | |
30 | #include "common.h" | |
31 | #include "hash.h" | |
32 | #include "match.h" | |
33 | #include "ircd.h" | |
34 | #include "numeric.h" | |
35 | #include "send.h" | |
36 | #include "s_serv.h" | |
37 | #include "s_conf.h" | |
38 | #include "msg.h" | |
39 | #include "parse.h" | |
40 | #include "modules.h" | |
41 | ||
42 | static int m_names(struct Client *, struct Client *, int, const char **); | |
43 | ||
44 | struct Message names_msgtab = { | |
45 | "NAMES", 0, 0, 0, MFLG_SLOW, | |
46 | {mg_unreg, {m_names, 0}, mg_ignore, mg_ignore, mg_ignore, {m_names, 0}} | |
47 | }; | |
48 | ||
49 | mapi_clist_av1 names_clist[] = { &names_msgtab, NULL }; | |
50 | DECLARE_MODULE_AV1(names, NULL, NULL, names_clist, NULL, NULL, "$Revision: 254 $"); | |
51 | ||
52 | static void names_global(struct Client *source_p); | |
53 | ||
54 | /************************************************************************ | |
55 | * m_names() - Added by Jto 27 Apr 1989 | |
56 | ************************************************************************/ | |
57 | ||
58 | /* | |
59 | * m_names | |
60 | * parv[0] = sender prefix | |
61 | * parv[1] = channel | |
62 | */ | |
63 | static int | |
64 | m_names(struct Client *client_p, struct Client *source_p, int parc, const char *parv[]) | |
65 | { | |
66 | static time_t last_used = 0; | |
67 | struct Channel *chptr = NULL; | |
68 | char *s; | |
69 | ||
70 | if(parc > 1 && !EmptyString(parv[1])) | |
71 | { | |
72 | char *p = LOCAL_COPY(parv[1]); | |
73 | if((s = strchr(p, ','))) | |
74 | *s = '\0'; | |
75 | ||
76 | if(!check_channel_name(p)) | |
77 | { | |
78 | sendto_one_numeric(source_p, ERR_BADCHANNAME, | |
79 | form_str(ERR_BADCHANNAME), | |
80 | (unsigned char *) p); | |
81 | return 0; | |
82 | } | |
83 | ||
84 | if((chptr = find_channel(p)) != NULL) | |
85 | channel_member_names(chptr, source_p, 1); | |
86 | else | |
87 | sendto_one(source_p, form_str(RPL_ENDOFNAMES), | |
88 | me.name, source_p->name, p); | |
89 | } | |
90 | else | |
91 | { | |
92 | if(!IsOper(source_p)) | |
93 | { | |
94 | if((last_used + ConfigFileEntry.pace_wait) > rb_current_time()) | |
95 | { | |
96 | sendto_one(source_p, form_str(RPL_LOAD2HI), | |
97 | me.name, source_p->name, "NAMES"); | |
98 | sendto_one(source_p, form_str(RPL_ENDOFNAMES), | |
99 | me.name, source_p->name, "*"); | |
100 | return 0; | |
101 | } | |
102 | else | |
103 | last_used = rb_current_time(); | |
104 | } | |
105 | ||
106 | names_global(source_p); | |
107 | sendto_one(source_p, form_str(RPL_ENDOFNAMES), | |
108 | me.name, source_p->name, "*"); | |
109 | } | |
110 | ||
111 | return 0; | |
112 | } | |
113 | ||
114 | /* | |
115 | * names_global | |
116 | * | |
117 | * inputs - pointer to client struct requesting names | |
118 | * output - none | |
119 | * side effects - lists all non public non secret channels | |
120 | */ | |
121 | static void | |
122 | names_global(struct Client *source_p) | |
123 | { | |
124 | int mlen; | |
125 | int tlen; | |
126 | int cur_len; | |
127 | int dont_show = NO; | |
128 | rb_dlink_node *lp, *ptr; | |
129 | struct Client *target_p; | |
130 | struct Channel *chptr = NULL; | |
131 | struct membership *msptr; | |
132 | char buf[BUFSIZE]; | |
133 | char *t; | |
134 | ||
135 | /* first do all visible channels */ | |
136 | RB_DLINK_FOREACH(ptr, global_channel_list.head) | |
137 | { | |
138 | chptr = ptr->data; | |
139 | channel_member_names(chptr, source_p, 0); | |
140 | } | |
141 | cur_len = mlen = rb_sprintf(buf, form_str(RPL_NAMREPLY), | |
142 | me.name, source_p->name, "*", "*"); | |
143 | t = buf + mlen; | |
144 | ||
145 | /* Second, do all clients in one big sweep */ | |
146 | RB_DLINK_FOREACH(ptr, global_client_list.head) | |
147 | { | |
148 | target_p = ptr->data; | |
149 | dont_show = NO; | |
150 | ||
151 | if(!IsPerson(target_p) || IsInvisible(target_p)) | |
152 | continue; | |
153 | ||
154 | /* we want to show -i clients that are either: | |
155 | * a) not on any channels | |
156 | * b) only on +p channels | |
157 | * | |
158 | * both were missed out above. if the target is on a | |
159 | * common channel with source, its already been shown. | |
160 | */ | |
161 | RB_DLINK_FOREACH(lp, target_p->user->channel.head) | |
162 | { | |
163 | msptr = lp->data; | |
164 | chptr = msptr->chptr; | |
165 | ||
166 | if(PubChannel(chptr) || IsMember(source_p, chptr) || | |
167 | SecretChannel(chptr)) | |
168 | { | |
169 | dont_show = YES; | |
170 | break; | |
171 | } | |
172 | } | |
173 | ||
174 | if(dont_show) | |
175 | continue; | |
176 | ||
177 | if((cur_len + NICKLEN + 2) > (BUFSIZE - 3)) | |
178 | { | |
179 | sendto_one(source_p, "%s", buf); | |
180 | cur_len = mlen; | |
181 | t = buf + mlen; | |
182 | } | |
183 | ||
184 | tlen = rb_sprintf(t, "%s ", target_p->name); | |
185 | cur_len += tlen; | |
186 | t += tlen; | |
187 | } | |
188 | ||
189 | if(cur_len > mlen) | |
190 | sendto_one(source_p, "%s", buf); | |
191 | } |