1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
|
/*
* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
*
* Copyright (c) 1997-2014 ircd-hybrid development team
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA
*/
/*! \file m_names.c
* \brief Includes required functions for processing the NAMES command.
* \version $Id$
*/
#include "stdinc.h"
#include "list.h"
#include "channel.h"
#include "channel_mode.h"
#include "client.h"
#include "hash.h"
#include "irc_string.h"
#include "ircd.h"
#include "numeric.h"
#include "send.h"
#include "s_serv.h"
#include "parse.h"
#include "modules.h"
/* names_all_visible_channels()
*
* inputs - pointer to client struct requesting names
* output - none
* side effects - lists all visible channels whee!
*/
static void
names_all_visible_channels(struct Client *source_p)
{
dlink_node *ptr = NULL;
/*
* First, do all visible channels (public and the one user self is)
*/
DLINK_FOREACH(ptr, global_channel_list.head)
/* Find users on same channel (defined by chptr) */
channel_member_names(source_p, ptr->data, 0);
}
/* names_non_public_non_secret()
*
* inputs - pointer to client struct requesting names
* output - none
* side effects - lists all non public non secret channels
*/
static void
names_non_public_non_secret(struct Client *source_p)
{
int mlen, tlen, cur_len;
int reply_to_send = 0;
int shown_already;
dlink_node *gc2ptr, *lp;
struct Client *c2ptr;
struct Channel *ch3ptr = NULL;
char buf[IRCD_BUFSIZE];
char *t;
mlen = snprintf(buf, sizeof(buf), form_str(RPL_NAMREPLY),
me.name, source_p->name, "*", "*");
cur_len = mlen;
t = buf + mlen;
/* Second, do all non-public, non-secret channels in one big sweep */
DLINK_FOREACH(gc2ptr, global_client_list.head)
{
c2ptr = gc2ptr->data;
if (!IsClient(c2ptr) || HasUMode(c2ptr, UMODE_INVISIBLE))
continue;
shown_already = 0;
/* We already know the user is not +i. If they are on no common
* channels with source_p, they have not been shown yet. */
DLINK_FOREACH(lp, c2ptr->channel.head)
{
ch3ptr = ((struct Membership *)lp->data)->chptr;
if (IsMember(source_p, ch3ptr))
{
shown_already = 1;
break;
}
}
if (shown_already)
continue;
tlen = strlen(c2ptr->name);
if (cur_len + tlen + 1 > IRCD_BUFSIZE - 2)
{
sendto_one(source_p, "%s", buf);
cur_len = mlen;
t = buf + mlen;
}
strcpy(t, c2ptr->name);
t += tlen;
*t++ = ' ';
*t = 0;
cur_len += tlen + 1;
reply_to_send = 1;
}
if (reply_to_send)
sendto_one(source_p, "%s", buf);
}
/*
** m_names
** parv[0] = sender prefix
** parv[1] = channel
*/
static int
m_names(struct Client *client_p, struct Client *source_p,
int parc, char *parv[])
{
struct Channel *chptr = NULL;
char *s;
char *para = parc > 1 ? parv[1] : NULL;
if (!EmptyString(para))
{
if ((s = strchr(para, ',')) != NULL)
*s = '\0';
if (*para == '\0')
return 0;
if ((chptr = hash_find_channel(para)) != NULL)
channel_member_names(source_p, chptr, 1);
else
sendto_one(source_p, form_str(RPL_ENDOFNAMES),
me.name, source_p->name, para);
}
else
{
names_all_visible_channels(source_p);
names_non_public_non_secret(source_p);
sendto_one(source_p, form_str(RPL_ENDOFNAMES),
me.name, source_p->name, "*");
}
return 0;
}
static struct Message names_msgtab =
{
"NAMES", 0, 0, 0, MAXPARA, MFLG_SLOW, 0,
{ m_unregistered, m_names, m_ignore, m_ignore, m_names, m_ignore }
};
static void
module_init(void)
{
mod_add_cmd(&names_msgtab);
}
static void
module_exit(void)
{
mod_del_cmd(&names_msgtab);
}
struct module module_entry =
{
.node = { NULL, NULL, NULL },
.name = NULL,
.version = "$Revision$",
.handle = NULL,
.modinit = module_init,
.modexit = module_exit,
.flags = 0
};
|
