trunk/modules/m_names.c

/*
 *  ircd-hybrid: an advanced Internet Relay Chat Daemon(ircd).
 *  m_names.c: Shows the users who are online.
 *
 *  Copyright (C) 2002 by the past and present ircd coders, and others.
 *
 *  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
 *
 *  $Id: m_names.c,v 1.62 2005/08/17 16:02:51 michael Exp $
 */

#include "stdinc.h"
#include "tools.h"
#include "handlers.h"
#include "channel.h"
#include "channel_mode.h"
#include "client.h"
#include "common.h"   /* bleah */
#include "hash.h"
#include "irc_string.h"
#include "sprintf_irc.h"
#include "ircd.h"
#include "list.h"
#include "numeric.h"
#include "send.h"
#include "s_serv.h"
#include "s_conf.h"
#include "msg.h"
#include "parse.h"
#include "modules.h"


static void names_all_visible_channels(struct Client *);
static void names_non_public_non_secret(struct Client *);

static void m_names(struct Client *, struct Client *, int, char *[]);
static void ms_names(struct Client *, struct Client *, int, char *[]);

struct Message names_msgtab = {
  "NAMES", 0, 0, 0, 0, MFLG_SLOW, 0,
  {m_unregistered, m_names, ms_names, m_ignore, m_names, m_ignore}
};

#ifndef STATIC_MODULES
void
_modinit(void)
{
  mod_add_cmd(&names_msgtab);
}

void
_moddeinit(void)
{
  mod_del_cmd(&names_msgtab);
}

const char *_version = "$Revision: 1.62 $";
#endif

/************************************************************************
 * m_names() - Added by Jto 27 Apr 1989
 ************************************************************************/

/*
** m_names
**      parv[0] = sender prefix
**      parv[1] = channel
*/
static void
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))
  {
    while (*para == ',')
      para++;

    if ((s = strchr(para, ',')) != NULL)
      *s = '\0';

    if (*para == '\0')
      return;

    if (!check_channel_name(para))
    { 
      sendto_one(source_p, form_str(ERR_BADCHANNAME),
                 me.name, source_p->name, para);
      return;
    }

    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, "*");
  }
}

/* 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;
  struct Channel *chptr;

  /* 
   * First, do all visible channels (public and the one user self is)
   */
  DLINK_FOREACH(ptr, global_channel_list.head)
  {
    chptr = ptr->data;

    /* Find users on same channel (defined by chptr) */
    channel_member_names(source_p, chptr, 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 = NO;
  int shown_already;
  dlink_node *gc2ptr, *lp;
  struct Client *c2ptr;
  struct Channel *ch3ptr = NULL;
  char buf[IRCD_BUFSIZE];
  char *t;

  mlen = ircsprintf(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) || IsInvisible(c2ptr))
      continue;

    shown_already = NO;

    /* 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 = YES;
        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 = YES;
  }

  if (reply_to_send)
    sendto_one(source_p, "%s", buf);
}

static void
ms_names(struct Client *client_p, struct Client *source_p,
         int parc, char *parv[])
{
  /* If its running as a hub, and linked with lazy links
   * then allow leaf to use normal client m_names()
   * other wise, ignore it.
   */
  if (ServerInfo.hub)
  {
    if (!IsCapable(client_p->from, CAP_LL))
      return;
  }

  if (IsClient(source_p))
    m_names(client_p, source_p, parc, parv);
}
Revision:	30
Committed:	Sun Oct 2 20:03:27 2005 UTC (18 years, 6 months ago) by adx
Content type:	text/x-csrc
Original Path:	*ircd-hybrid/modules/m_names.c*
File size:	5714 byte(s)
Log Message:	- imported sources - can be moved later according to the directory/branching scheme, but we need the svn up
#	User	Rev	Content
1	adx	30	/*
2			* ircd-hybrid: an advanced Internet Relay Chat Daemon(ircd).
3			* m_names.c: Shows the users who are online.
4			*
5			* Copyright (C) 2002 by the past and present ircd coders, and others.
6			*
7			* This program is free software; you can redistribute it and/or modify
8			* it under the terms of the GNU General Public License as published by
9			* the Free Software Foundation; either version 2 of the License, or
10			* (at your option) any later version.
11			*
12			* This program is distributed in the hope that it will be useful,
13			* but WITHOUT ANY WARRANTY; without even the implied warranty of
14			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15			* GNU General Public License for more details.
16			*
17			* You should have received a copy of the GNU General Public License
18			* along with this program; if not, write to the Free Software
19			* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
20			* USA
21			*
22			* $Id: m_names.c,v 1.62 2005/08/17 16:02:51 michael Exp $
23			*/
24
25			#include "stdinc.h"
26			#include "tools.h"
27			#include "handlers.h"
28			#include "channel.h"
29			#include "channel_mode.h"
30			#include "client.h"
31			#include "common.h" /* bleah */
32			#include "hash.h"
33			#include "irc_string.h"
34			#include "sprintf_irc.h"
35			#include "ircd.h"
36			#include "list.h"
37			#include "numeric.h"
38			#include "send.h"
39			#include "s_serv.h"
40			#include "s_conf.h"
41			#include "msg.h"
42			#include "parse.h"
43			#include "modules.h"
44
45
46			static void names_all_visible_channels(struct Client *);
47			static void names_non_public_non_secret(struct Client *);
48
49			static void m_names(struct Client , struct Client , int, char *[]);
50			static void ms_names(struct Client , struct Client , int, char *[]);
51
52			struct Message names_msgtab = {
53			"NAMES", 0, 0, 0, 0, MFLG_SLOW, 0,
54			{m_unregistered, m_names, ms_names, m_ignore, m_names, m_ignore}
55			};
56
57			#ifndef STATIC_MODULES
58			void
59			_modinit(void)
60			{
61			mod_add_cmd(&names_msgtab);
62			}
63
64			void
65			_moddeinit(void)
66			{
67			mod_del_cmd(&names_msgtab);
68			}
69
70			const char *_version = "$Revision: 1.62 $";
71			#endif
72
73			/************************************************************************
74			* m_names() - Added by Jto 27 Apr 1989
75			************************************************************************/
76
77			/*
78			** m_names
79			** parv[0] = sender prefix
80			** parv[1] = channel
81			*/
82			static void
83			m_names(struct Client client_p, struct Client source_p,
84			int parc, char *parv[])
85			{
86			struct Channel *chptr = NULL;
87			char *s;
88			char *para = parc > 1 ? parv[1] : NULL;
89
90			if (!EmptyString(para))
91			{
92			while (*para == ',')
93			para++;
94
95			if ((s = strchr(para, ',')) != NULL)
96			*s = '\0';
97
98			if (*para == '\0')
99			return;
100
101			if (!check_channel_name(para))
102			{
103			sendto_one(source_p, form_str(ERR_BADCHANNAME),
104			me.name, source_p->name, para);
105			return;
106			}
107
108			if ((chptr = hash_find_channel(para)) != NULL)
109			channel_member_names(source_p, chptr, 1);
110			else
111			sendto_one(source_p, form_str(RPL_ENDOFNAMES),
112			me.name, source_p->name, para);
113			}
114			else
115			{
116			names_all_visible_channels(source_p);
117			names_non_public_non_secret(source_p);
118			sendto_one(source_p, form_str(RPL_ENDOFNAMES),
119			me.name, source_p->name, "*");
120			}
121			}
122
123			/* names_all_visible_channels()
124			*
125			* inputs - pointer to client struct requesting names
126			* output - none
127			* side effects - lists all visible channels whee!
128			*/
129			static void
130			names_all_visible_channels(struct Client *source_p)
131			{
132			dlink_node *ptr;
133			struct Channel *chptr;
134
135			/*
136			* First, do all visible channels (public and the one user self is)
137			*/
138			DLINK_FOREACH(ptr, global_channel_list.head)
139			{
140			chptr = ptr->data;
141
142			/* Find users on same channel (defined by chptr) */
143			channel_member_names(source_p, chptr, 0);
144			}
145			}
146
147			/* names_non_public_non_secret()
148			*
149			* inputs - pointer to client struct requesting names
150			* output - none
151			* side effects - lists all non public non secret channels
152			*/
153			static void
154			names_non_public_non_secret(struct Client *source_p)
155			{
156			int mlen, tlen, cur_len;
157			int reply_to_send = NO;
158			int shown_already;
159			dlink_node gc2ptr, lp;
160			struct Client *c2ptr;
161			struct Channel *ch3ptr = NULL;
162			char buf[IRCD_BUFSIZE];
163			char *t;
164
165			mlen = ircsprintf(buf,form_str(RPL_NAMREPLY),
166			me.name, source_p->name, "", "");
167			cur_len = mlen;
168			t = buf + mlen;
169
170			/* Second, do all non-public, non-secret channels in one big sweep */
171			DLINK_FOREACH(gc2ptr, global_client_list.head)
172			{
173			c2ptr = gc2ptr->data;
174
175			if (!IsClient(c2ptr) \|\| IsInvisible(c2ptr))
176			continue;
177
178			shown_already = NO;
179
180			/* We already know the user is not +i. If they are on no common
181			* channels with source_p, they have not been shown yet. */
182			DLINK_FOREACH(lp, c2ptr->channel.head)
183			{
184			ch3ptr = ((struct Membership *) lp->data)->chptr;
185
186			if (IsMember(source_p, ch3ptr))
187			{
188			shown_already = YES;
189			break;
190			}
191			}
192
193			if (shown_already)
194			continue;
195
196			tlen = strlen(c2ptr->name);
197			if (cur_len + tlen + 1 > IRCD_BUFSIZE - 2)
198			{
199			sendto_one(source_p, "%s", buf);
200			cur_len = mlen;
201			t = buf + mlen;
202			}
203
204			strcpy(t, c2ptr->name);
205			t += tlen;
206
207			*t++ = ' ';
208			*t = 0;
209
210			cur_len += tlen + 1;
211
212			reply_to_send = YES;
213			}
214
215			if (reply_to_send)
216			sendto_one(source_p, "%s", buf);
217			}
218
219			static void
220			ms_names(struct Client client_p, struct Client source_p,
221			int parc, char *parv[])
222			{
223			/* If its running as a hub, and linked with lazy links
224			* then allow leaf to use normal client m_names()
225			* other wise, ignore it.
226			*/
227			if (ServerInfo.hub)
228			{
229			if (!IsCapable(client_p->from, CAP_LL))
230			return;
231			}
232
233			if (IsClient(source_p))
234			m_names(client_p, source_p, parc, parv);
235			}