trunk/src/conf_shared.c

/*
 *  ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
 *
 *  Copyright (c) 1997-2018 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
 *  USA
 */

/*! \file conf_shared.c
 * \brief Implements shared {} block configuration management.
 * \version $Id$
 */

#include "stdinc.h"
#include "list.h"
#include "irc_string.h"
#include "memory.h"
#include "conf_shared.h"


static dlink_list shared_list;


const dlink_list *
shared_get_list(void)
{
  return &shared_list;
}

void
shared_clear(void)
{
  while (shared_list.head)
  {
    struct SharedItem *shared = shared_list.head->data;

    dlinkDelete(&shared->node, &shared_list);
    xfree(shared->server);
    xfree(shared->user);
    xfree(shared->host);
    xfree(shared);
  }
}

struct SharedItem *
shared_make(void)
{
  struct SharedItem *shared = xcalloc(sizeof(*shared));
  dlinkAdd(shared, &shared->node, &shared_list);

  return shared;
}

const struct SharedItem *
shared_find(unsigned int type, const char *server,
            const char *user, const char *host)
{
  dlink_node *node;

  DLINK_FOREACH(node, shared_list.head)
  {
    const struct SharedItem *shared = node->data;

    if (shared->type & type)
      if (!match(shared->server, server))
        if (!match(shared->user, user) &&
            !match(shared->host, host))
          return shared;
  }

  return NULL;
}
Revision:	8279
Committed:	Tue Feb 20 19:30:13 2018 UTC (8 years, 5 months ago) by michael
Content type:	text/x-csrc
File size:	2070 byte(s)
Log Message:	- Update copyright years
#	User	Rev	Content
1	michael	7209	/*
2			* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
3			*
4	michael	8279	* Copyright (c) 1997-2018 ircd-hybrid development team
5	michael	7209	*
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
19			* USA
20			*/
21
22			/*! \file conf_shared.c
23			* \brief Implements shared {} block configuration management.
24	michael	7221	* \version $Id$
25	michael	7209	*/
26
27			#include "stdinc.h"
28			#include "list.h"
29			#include "irc_string.h"
30			#include "memory.h"
31			#include "conf_shared.h"
32
33
34			static dlink_list shared_list;
35
36
37			const dlink_list *
38			shared_get_list(void)
39			{
40			return &shared_list;
41			}
42
43			void
44			shared_clear(void)
45			{
46			while (shared_list.head)
47			{
48			struct SharedItem *shared = shared_list.head->data;
49
50			dlinkDelete(&shared->node, &shared_list);
51			xfree(shared->server);
52			xfree(shared->user);
53			xfree(shared->host);
54			xfree(shared);
55			}
56			}
57
58			struct SharedItem *
59			shared_make(void)
60			{
61			struct SharedItem shared = xcalloc(sizeof(shared));
62			dlinkAdd(shared, &shared->node, &shared_list);
63
64			return shared;
65			}
66
67			const struct SharedItem *
68			shared_find(unsigned int type, const char *server,
69			const char user, const char host)
70			{
71			dlink_node *node;
72
73			DLINK_FOREACH(node, shared_list.head)
74			{
75			const struct SharedItem *shared = node->data;
76
77			if (shared->type & type)
78			if (!match(shared->server, server))
79			if (!match(shared->user, user) &&
80			!match(shared->host, host))
81			return shared;
82			}
83
84			return NULL;
85			}