trunk/src/conf_class.c

/*
 *  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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
 *  USA
 */

/*! \file conf_class.c
 * \brief Configuration managment for class{} blocks
 * \version $Id$
 */

#include "stdinc.h"
#include "list.h"
#include "ircd.h"
#include "conf.h"
#include "hostmask.h"
#include "irc_string.h"
#include "memory.h"


struct ClassItem *class_default;

static dlink_list class_list;


const dlink_list *
class_get_list(void)
{
  return &class_list;
}

struct ClassItem *
class_make(void)
{
  struct ClassItem *const class = MyCalloc(sizeof(*class));

  class->active    = 1;
  class->con_freq  = DEFAULT_CONNECTFREQUENCY;
  class->ping_freq = DEFAULT_PINGFREQUENCY;
  class->max_total = MAXIMUM_LINKS_DEFAULT;
  class->max_sendq = DEFAULT_SENDQ;
  class->max_recvq = DEFAULT_RECVQ;

  dlinkAdd(class, &class->node, &class_list);

  return class;
}

void
class_free(struct ClassItem *class)
{
  assert(class != class_default);
  assert(class->active    == 0);
  assert(class->ref_count == 0);

  dlinkDelete(&class->node, &class_list);
  MyFree(class->name);
  MyFree(class);
}

void
class_init(void)
{
  (class_default = class_make())->name = xstrdup("default");
}

struct ClassItem *
get_class_ptr(const dlink_list *const list)
{
  const dlink_node *node = NULL;

  if ((node = list->head))
  {
    const struct MaskItem *const conf = node->data;

    assert(conf->class);
    assert(conf->type & (CONF_OPER | CONF_CLIENT | CONF_SERVER));

    return conf->class;
  }

  return class_default;
}

const char *
get_client_class(const dlink_list *const list)
{
  const dlink_node *node = NULL;

  if ((node = list->head))
  {
    const struct MaskItem *const conf = node->data;

    assert(conf->class);
    assert(conf->type & (CONF_OPER | CONF_CLIENT | CONF_SERVER));

    return conf->class->name;
  }

  return class_default->name;
}

unsigned int
get_client_ping(const dlink_list *const list)
{
  const dlink_node *node = NULL;

  if ((node = list->head))
  {
    const struct MaskItem *const conf = node->data;

    assert(conf->class);
    assert(conf->type & (CONF_OPER | CONF_CLIENT | CONF_SERVER));

    return conf->class->ping_freq;
  }

  return class_default->ping_freq;
}

unsigned int
get_sendq(const dlink_list *const list)
{
  const dlink_node *node = NULL;

  if ((node = list->head))
  {
    const struct MaskItem *const conf = node->data;

    assert(conf->class);
    assert(conf->type & (CONF_OPER | CONF_CLIENT | CONF_SERVER));

    return conf->class->max_sendq;
  }

  return class_default->max_sendq;
}

unsigned int
get_recvq(const dlink_list *const list)
{
  const dlink_node *node = NULL;

  if ((node = list->head))
  {
    const struct MaskItem *const conf = node->data;

    assert(conf->class);
    assert(conf->type & (CONF_OPER | CONF_CLIENT | CONF_SERVER));

    return conf->class->max_recvq;
  }

  return class_default->max_recvq;
}

/*
 * inputs       - Integer (Number of class)
 * output       - Pointer to ClassItem struct. Non-NULL expected
 * side effects - NONE
 */
struct ClassItem *
class_find(const char *name, int active)
{
  dlink_node *node = NULL;

  DLINK_FOREACH(node, class_list.head)
  {
    struct ClassItem *class = node->data;

    if (!irccmp(class->name, name))
      return active && !class->active ? NULL : class;
  }

  return NULL;
}

/*
 * We don't delete the class table, rather mark all entries for deletion.
 * The table is cleaned up by delete_marked_classes. - avalon
 */
void
class_mark_for_deletion(void)
{
  dlink_node *node = NULL;

  DLINK_FOREACH_PREV(node, class_list.tail->prev)
    ((struct ClassItem *)node->data)->active = 0;
}

void
class_delete_marked(void)
{
  dlink_node *node = NULL, *node_next = NULL;

  DLINK_FOREACH_SAFE(node, node_next, class_list.head)
  {
    struct ClassItem *class = node->data;

    if (!class->active && !class->ref_count)
    {
      destroy_cidr_class(class);
      class_free(class);
    }
  }
}

/*
 * cidr_limit_reached
 *
 * inputs       - int flag allowing over_rule of limits
 *              - pointer to the ip to be added
 *              - pointer to the class
 * output       - non zero if limit reached
 *                0 if limit not reached
 * side effects -
 */
int
cidr_limit_reached(int over_rule, struct irc_ssaddr *ip, struct ClassItem *class)
{
  dlink_node *node = NULL;
  struct CidrItem *cidr = NULL;

  if (class->number_per_cidr == 0)
    return 0;

  if (ip->ss.ss_family == AF_INET)
  {
    if (class->cidr_bitlen_ipv4 == 0)
      return 0;

    DLINK_FOREACH(node, class->list_ipv4.head)
    {
      cidr = node->data;

      if (match_ipv4(ip, &cidr->mask, class->cidr_bitlen_ipv4))
      {
        if (!over_rule && (cidr->number_on_this_cidr >= class->number_per_cidr))
          return -1;

        cidr->number_on_this_cidr++;
        return 0;
      }
    }

    cidr = MyCalloc(sizeof(struct CidrItem));
    cidr->number_on_this_cidr = 1;
    cidr->mask = *ip;
    mask_addr(&cidr->mask, class->cidr_bitlen_ipv4);
    dlinkAdd(cidr, &cidr->node, &class->list_ipv4);
  }
  else if (class->cidr_bitlen_ipv6 > 0)
  {
    DLINK_FOREACH(node, class->list_ipv6.head)
    {
      cidr = node->data;

      if (match_ipv6(ip, &cidr->mask, class->cidr_bitlen_ipv6))
      {
        if (!over_rule && (cidr->number_on_this_cidr >= class->number_per_cidr))
          return -1;

        cidr->number_on_this_cidr++;
        return 0;
      }
    }

    cidr = MyCalloc(sizeof(struct CidrItem));
    cidr->number_on_this_cidr = 1;
    cidr->mask = *ip;
    mask_addr(&cidr->mask, class->cidr_bitlen_ipv6);
    dlinkAdd(cidr, &cidr->node, &class->list_ipv6);
  }

  return 0;
}

/*
 * remove_from_cidr_check
 *
 * inputs       - pointer to the ip to be removed
 *              - pointer to the class
 * output       - NONE
 * side effects -
 */
void
remove_from_cidr_check(struct irc_ssaddr *ip, struct ClassItem *aclass)
{
  dlink_node *node = NULL, *node_next = NULL;

  if (aclass->number_per_cidr == 0)
    return;

  if (ip->ss.ss_family == AF_INET)
  {
    if (aclass->cidr_bitlen_ipv4 == 0)
      return;

    DLINK_FOREACH_SAFE(node, node_next, aclass->list_ipv4.head)
    {
      struct CidrItem *cidr = node->data;

      if (match_ipv4(ip, &cidr->mask, aclass->cidr_bitlen_ipv4))
      {
        cidr->number_on_this_cidr--;

        if (cidr->number_on_this_cidr == 0)
        {
          dlinkDelete(node, &aclass->list_ipv4);
          MyFree(cidr);
          return;
        }
      }
    }
  }
  else if (aclass->cidr_bitlen_ipv6 > 0)
  {
    DLINK_FOREACH_SAFE(node, node_next, aclass->list_ipv6.head)
    {
      struct CidrItem *cidr = node->data;

      if (match_ipv6(ip, &cidr->mask, aclass->cidr_bitlen_ipv6))
      {
        cidr->number_on_this_cidr--;

        if (cidr->number_on_this_cidr == 0)
        {
          dlinkDelete(node, &aclass->list_ipv6);
          MyFree(cidr);
          return;
        }
      }
    }
  }
}

void
rebuild_cidr_list(struct ClassItem *class)
{
  dlink_node *node = NULL;

  destroy_cidr_class(class);

  DLINK_FOREACH(node, local_client_list.head)
  {
    struct Client *client_p = node->data;
    struct MaskItem *conf = client_p->connection->confs.tail->data;

    if (conf && (conf->type == CONF_CLIENT))
      if (conf->class == class)
        cidr_limit_reached(1, &client_p->connection->ip, class);
  }
}

/*
 * destroy_cidr_list
 *
 * inputs       - pointer to class dlink list of cidr blocks
 * output       - none
 * side effects - completely destroys the class link list of cidr blocks
 */
static void
destroy_cidr_list(dlink_list *list)
{
  dlink_node *node = NULL, *node_next = NULL;

  DLINK_FOREACH_SAFE(node, node_next, list->head)
  {
    dlinkDelete(node, list);
    MyFree(node->data);
  }
}

/*
 * destroy_cidr_class
 *
 * inputs       - pointer to class
 * output       - none
 * side effects - completely destroys the class link list of cidr blocks
 */
void
destroy_cidr_class(struct ClassItem *class)
{
  destroy_cidr_list(&class->list_ipv4);
  destroy_cidr_list(&class->list_ipv6);
}
Revision:	4833
Committed:	Sun Nov 2 11:45:04 2014 UTC (10 years, 9 months ago) by michael
Content type:	text/x-csrc
File size:	8709 byte(s)
Log Message:	- Constification
#	Content
1	/*
2	* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
3	*
4	* Copyright (c) 1997-2014 ircd-hybrid development team
5	*
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_class.c
23	* \brief Configuration managment for class{} blocks
24	* \version $Id$
25	*/
26
27	#include "stdinc.h"
28	#include "list.h"
29	#include "ircd.h"
30	#include "conf.h"
31	#include "hostmask.h"
32	#include "irc_string.h"
33	#include "memory.h"
34
35
36	struct ClassItem *class_default;
37
38	static dlink_list class_list;
39
40
41	const dlink_list *
42	class_get_list(void)
43	{
44	return &class_list;
45	}
46
47	struct ClassItem *
48	class_make(void)
49	{
50	struct ClassItem const class = MyCalloc(sizeof(class));
51
52	class->active = 1;
53	class->con_freq = DEFAULT_CONNECTFREQUENCY;
54	class->ping_freq = DEFAULT_PINGFREQUENCY;
55	class->max_total = MAXIMUM_LINKS_DEFAULT;
56	class->max_sendq = DEFAULT_SENDQ;
57	class->max_recvq = DEFAULT_RECVQ;
58
59	dlinkAdd(class, &class->node, &class_list);
60
61	return class;
62	}
63
64	void
65	class_free(struct ClassItem *class)
66	{
67	assert(class != class_default);
68	assert(class->active == 0);
69	assert(class->ref_count == 0);
70
71	dlinkDelete(&class->node, &class_list);
72	MyFree(class->name);
73	MyFree(class);
74	}
75
76	void
77	class_init(void)
78	{
79	(class_default = class_make())->name = xstrdup("default");
80	}
81
82	struct ClassItem *
83	get_class_ptr(const dlink_list *const list)
84	{
85	const dlink_node *node = NULL;
86
87	if ((node = list->head))
88	{
89	const struct MaskItem *const conf = node->data;
90
91	assert(conf->class);
92	assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
93
94	return conf->class;
95	}
96
97	return class_default;
98	}
99
100	const char *
101	get_client_class(const dlink_list *const list)
102	{
103	const dlink_node *node = NULL;
104
105	if ((node = list->head))
106	{
107	const struct MaskItem *const conf = node->data;
108
109	assert(conf->class);
110	assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
111
112	return conf->class->name;
113	}
114
115	return class_default->name;
116	}
117
118	unsigned int
119	get_client_ping(const dlink_list *const list)
120	{
121	const dlink_node *node = NULL;
122
123	if ((node = list->head))
124	{
125	const struct MaskItem *const conf = node->data;
126
127	assert(conf->class);
128	assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
129
130	return conf->class->ping_freq;
131	}
132
133	return class_default->ping_freq;
134	}
135
136	unsigned int
137	get_sendq(const dlink_list *const list)
138	{
139	const dlink_node *node = NULL;
140
141	if ((node = list->head))
142	{
143	const struct MaskItem *const conf = node->data;
144
145	assert(conf->class);
146	assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
147
148	return conf->class->max_sendq;
149	}
150
151	return class_default->max_sendq;
152	}
153
154	unsigned int
155	get_recvq(const dlink_list *const list)
156	{
157	const dlink_node *node = NULL;
158
159	if ((node = list->head))
160	{
161	const struct MaskItem *const conf = node->data;
162
163	assert(conf->class);
164	assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
165
166	return conf->class->max_recvq;
167	}
168
169	return class_default->max_recvq;
170	}
171
172	/*
173	* inputs - Integer (Number of class)
174	* output - Pointer to ClassItem struct. Non-NULL expected
175	* side effects - NONE
176	*/
177	struct ClassItem *
178	class_find(const char *name, int active)
179	{
180	dlink_node *node = NULL;
181
182	DLINK_FOREACH(node, class_list.head)
183	{
184	struct ClassItem *class = node->data;
185
186	if (!irccmp(class->name, name))
187	return active && !class->active ? NULL : class;
188	}
189
190	return NULL;
191	}
192
193	/*
194	* We don't delete the class table, rather mark all entries for deletion.
195	* The table is cleaned up by delete_marked_classes. - avalon
196	*/
197	void
198	class_mark_for_deletion(void)
199	{
200	dlink_node *node = NULL;
201
202	DLINK_FOREACH_PREV(node, class_list.tail->prev)
203	((struct ClassItem *)node->data)->active = 0;
204	}
205
206	void
207	class_delete_marked(void)
208	{
209	dlink_node node = NULL, node_next = NULL;
210
211	DLINK_FOREACH_SAFE(node, node_next, class_list.head)
212	{
213	struct ClassItem *class = node->data;
214
215	if (!class->active && !class->ref_count)
216	{
217	destroy_cidr_class(class);
218	class_free(class);
219	}
220	}
221	}
222
223	/*
224	* cidr_limit_reached
225	*
226	* inputs - int flag allowing over_rule of limits
227	* - pointer to the ip to be added
228	* - pointer to the class
229	* output - non zero if limit reached
230	* 0 if limit not reached
231	* side effects -
232	*/
233	int
234	cidr_limit_reached(int over_rule, struct irc_ssaddr ip, struct ClassItem class)
235	{
236	dlink_node *node = NULL;
237	struct CidrItem *cidr = NULL;
238
239	if (class->number_per_cidr == 0)
240	return 0;
241
242	if (ip->ss.ss_family == AF_INET)
243	{
244	if (class->cidr_bitlen_ipv4 == 0)
245	return 0;
246
247	DLINK_FOREACH(node, class->list_ipv4.head)
248	{
249	cidr = node->data;
250
251	if (match_ipv4(ip, &cidr->mask, class->cidr_bitlen_ipv4))
252	{
253	if (!over_rule && (cidr->number_on_this_cidr >= class->number_per_cidr))
254	return -1;
255
256	cidr->number_on_this_cidr++;
257	return 0;
258	}
259	}
260
261	cidr = MyCalloc(sizeof(struct CidrItem));
262	cidr->number_on_this_cidr = 1;
263	cidr->mask = *ip;
264	mask_addr(&cidr->mask, class->cidr_bitlen_ipv4);
265	dlinkAdd(cidr, &cidr->node, &class->list_ipv4);
266	}
267	else if (class->cidr_bitlen_ipv6 > 0)
268	{
269	DLINK_FOREACH(node, class->list_ipv6.head)
270	{
271	cidr = node->data;
272
273	if (match_ipv6(ip, &cidr->mask, class->cidr_bitlen_ipv6))
274	{
275	if (!over_rule && (cidr->number_on_this_cidr >= class->number_per_cidr))
276	return -1;
277
278	cidr->number_on_this_cidr++;
279	return 0;
280	}
281	}
282
283	cidr = MyCalloc(sizeof(struct CidrItem));
284	cidr->number_on_this_cidr = 1;
285	cidr->mask = *ip;
286	mask_addr(&cidr->mask, class->cidr_bitlen_ipv6);
287	dlinkAdd(cidr, &cidr->node, &class->list_ipv6);
288	}
289
290	return 0;
291	}
292
293	/*
294	* remove_from_cidr_check
295	*
296	* inputs - pointer to the ip to be removed
297	* - pointer to the class
298	* output - NONE
299	* side effects -
300	*/
301	void
302	remove_from_cidr_check(struct irc_ssaddr ip, struct ClassItem aclass)
303	{
304	dlink_node node = NULL, node_next = NULL;
305
306	if (aclass->number_per_cidr == 0)
307	return;
308
309	if (ip->ss.ss_family == AF_INET)
310	{
311	if (aclass->cidr_bitlen_ipv4 == 0)
312	return;
313
314	DLINK_FOREACH_SAFE(node, node_next, aclass->list_ipv4.head)
315	{
316	struct CidrItem *cidr = node->data;
317
318	if (match_ipv4(ip, &cidr->mask, aclass->cidr_bitlen_ipv4))
319	{
320	cidr->number_on_this_cidr--;
321
322	if (cidr->number_on_this_cidr == 0)
323	{
324	dlinkDelete(node, &aclass->list_ipv4);
325	MyFree(cidr);
326	return;
327	}
328	}
329	}
330	}
331	else if (aclass->cidr_bitlen_ipv6 > 0)
332	{
333	DLINK_FOREACH_SAFE(node, node_next, aclass->list_ipv6.head)
334	{
335	struct CidrItem *cidr = node->data;
336
337	if (match_ipv6(ip, &cidr->mask, aclass->cidr_bitlen_ipv6))
338	{
339	cidr->number_on_this_cidr--;
340
341	if (cidr->number_on_this_cidr == 0)
342	{
343	dlinkDelete(node, &aclass->list_ipv6);
344	MyFree(cidr);
345	return;
346	}
347	}
348	}
349	}
350	}
351
352	void
353	rebuild_cidr_list(struct ClassItem *class)
354	{
355	dlink_node *node = NULL;
356
357	destroy_cidr_class(class);
358
359	DLINK_FOREACH(node, local_client_list.head)
360	{
361	struct Client *client_p = node->data;
362	struct MaskItem *conf = client_p->connection->confs.tail->data;
363
364	if (conf && (conf->type == CONF_CLIENT))
365	if (conf->class == class)
366	cidr_limit_reached(1, &client_p->connection->ip, class);
367	}
368	}
369
370	/*
371	* destroy_cidr_list
372	*
373	* inputs - pointer to class dlink list of cidr blocks
374	* output - none
375	* side effects - completely destroys the class link list of cidr blocks
376	*/
377	static void
378	destroy_cidr_list(dlink_list *list)
379	{
380	dlink_node node = NULL, node_next = NULL;
381
382	DLINK_FOREACH_SAFE(node, node_next, list->head)
383	{
384	dlinkDelete(node, list);
385	MyFree(node->data);
386	}
387	}
388
389	/*
390	* destroy_cidr_class
391	*
392	* inputs - pointer to class
393	* output - none
394	* side effects - completely destroys the class link list of cidr blocks
395	*/
396	void
397	destroy_cidr_class(struct ClassItem *class)
398	{
399	destroy_cidr_list(&class->list_ipv4);
400	destroy_cidr_list(&class->list_ipv6);
401	}