trunk/src/conf_class.c

/*
 *  ircd-hybrid: an advanced Internet Relay Chat Daemon(ircd).
 *
 *  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
 */

/*! \file
 * \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 = { NULL, NULL, 0 };


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

struct ClassItem *
class_make(void)
{
  struct ClassItem *class = MyMalloc(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);
  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 *ptr = NULL;

  if ((ptr = list->head))
  {
    const struct MaskItem *conf = ptr->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 *ptr = NULL;

  if ((ptr = list->head))
  {
    const struct MaskItem *conf = ptr->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 *ptr = NULL;

  if ((ptr = list->head))
  {
    const struct MaskItem *conf = ptr->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 *ptr = NULL;

  if ((ptr = list->head))
  {
    const struct MaskItem *conf = ptr->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 *ptr = NULL;

  if ((ptr = list->head))
  {
    const struct MaskItem *conf = ptr->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 *ptr = NULL;

  DLINK_FOREACH(ptr, class_list.head)
  {
    struct ClassItem *class = ptr->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 *ptr = NULL;

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

void
class_delete_marked(void)
{
  dlink_node *ptr = NULL, *ptr_next = NULL;

  DLINK_FOREACH_SAFE(ptr, ptr_next, class_list.head)
  {
    struct ClassItem *class = ptr->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 *ptr = 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(ptr, class->list_ipv4.head)
    {
      cidr = ptr->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 = MyMalloc(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);
  }
#ifdef IPV6
  else if (class->cidr_bitlen_ipv6 > 0)
  {
    DLINK_FOREACH(ptr, class->list_ipv6.head)
    {
      cidr = ptr->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 = MyMalloc(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);
  }
#endif
  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 *ptr = NULL;
  dlink_node *next_ptr = NULL;
  struct CidrItem *cidr;

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

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

    DLINK_FOREACH_SAFE(ptr, next_ptr, aclass->list_ipv4.head)
    {
      cidr = ptr->data;

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

        if (cidr->number_on_this_cidr == 0)
        {
          dlinkDelete(ptr, &aclass->list_ipv4);
          MyFree(cidr);
          return;
        }
      }
    }
  }
#ifdef IPV6
  else if (aclass->cidr_bitlen_ipv6 > 0)
  {
    DLINK_FOREACH_SAFE(ptr, next_ptr, aclass->list_ipv6.head)
    {
      cidr = ptr->data;

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

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

void
rebuild_cidr_list(struct ClassItem *class)
{
  dlink_node *ptr;

  destroy_cidr_class(class);

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

    if (conf && (conf->type == CONF_CLIENT))
      if (conf->class == class)
        cidr_limit_reached(1, &client_p->localClient->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 *ptr = NULL, *next_ptr = NULL;

  DLINK_FOREACH_SAFE(ptr, next_ptr, list->head)
  {
    dlinkDelete(ptr, list);
    MyFree(ptr->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:	2213
Committed:	Wed Jun 5 22:25:49 2013 UTC (12 years, 2 months ago) by michael
Content type:	text/x-csrc
File size:	8647 byte(s)
Log Message:	- conf_class.c: white-space changes
#	User	Rev	Content
1	michael	1633	/*
2			* ircd-hybrid: an advanced Internet Relay Chat Daemon(ircd).
3			*
4			* Copyright (C) 2002 by the past and present ircd coders, and others.
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307
19			* USA
20			*/
21
22			/*! \file
23			* \brief Configuration managment for class{} blocks
24	michael	1635	* \version $Id$
25	michael	1633	*/
26
27			#include "stdinc.h"
28			#include "list.h"
29	michael	1658	#include "ircd.h"
30	michael	1633	#include "conf.h"
31	michael	1658	#include "hostmask.h"
32	michael	1633	#include "irc_string.h"
33			#include "memory.h"
34
35
36			struct ClassItem *class_default;
37
38			static dlink_list class_list = { NULL, NULL, 0 };
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 class = MyMalloc(sizeof(class));
51
52	michael	1650	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	michael	1633	dlinkAdd(class, &class->node, &class_list);
60
61			return class;
62			}
63
64			void
65			class_free(struct ClassItem *class)
66			{
67			assert(class);
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	michael	1650	(class_default = class_make())->name = xstrdup("default");
80	michael	1633	}
81
82	michael	1783	struct ClassItem *
83			get_class_ptr(const dlink_list *const list)
84			{
85			const dlink_node *ptr = NULL;
86
87	michael	2213	if ((ptr = list->head))
88			{
89	michael	1783	const struct MaskItem *conf = ptr->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	michael	1633	const char *
101			get_client_class(const dlink_list *const list)
102			{
103			const dlink_node *ptr = NULL;
104
105	michael	2213	if ((ptr = list->head))
106			{
107	michael	1633	const struct MaskItem *conf = ptr->data;
108
109			assert(conf->class);
110	michael	1654	assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
111	michael	1633
112			return conf->class->name;
113			}
114
115			return class_default->name;
116			}
117
118			unsigned int
119	michael	1644	get_client_ping(const dlink_list *const list)
120	michael	1633	{
121			const dlink_node *ptr = NULL;
122
123	michael	2213	if ((ptr = list->head))
124			{
125	michael	1633	const struct MaskItem *conf = ptr->data;
126
127	michael	1654	assert(conf->class);
128			assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
129	michael	1633
130	michael	1644	return conf->class->ping_freq;
131	michael	1633	}
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 *ptr = NULL;
140
141	michael	2213	if ((ptr = list->head))
142			{
143	michael	1633	const struct MaskItem *conf = ptr->data;
144
145			assert(conf->class);
146	michael	1654	assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
147	michael	1633
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 *ptr = NULL;
158
159	michael	2213	if ((ptr = list->head))
160			{
161	michael	1633	const struct MaskItem *conf = ptr->data;
162
163			assert(conf->class);
164	michael	1654	assert(conf->type & (CONF_OPER \| CONF_CLIENT \| CONF_SERVER));
165	michael	1633
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 *ptr = NULL;
181
182	michael	2213	DLINK_FOREACH(ptr, class_list.head)
183			{
184	michael	1633	struct ClassItem *class = ptr->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 *ptr = NULL;
201
202	michael	1650	DLINK_FOREACH_PREV(ptr, class_list.tail->prev)
203			((struct ClassItem *)ptr->data)->active = 0;
204	michael	1633	}
205
206			void
207			class_delete_marked(void)
208			{
209			dlink_node ptr = NULL, ptr_next = NULL;
210
211	michael	2213	DLINK_FOREACH_SAFE(ptr, ptr_next, class_list.head)
212			{
213	michael	1633	struct ClassItem *class = ptr->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	michael	2213	cidr_limit_reached(int over_rule, struct irc_ssaddr ip, struct ClassItem class)
235	michael	1633	{
236			dlink_node *ptr = NULL;
237			struct CidrItem *cidr = NULL;
238
239	michael	1644	if (class->number_per_cidr == 0)
240	michael	1633	return 0;
241
242			if (ip->ss.ss_family == AF_INET)
243			{
244	michael	1644	if (class->cidr_bitlen_ipv4 == 0)
245	michael	1633	return 0;
246
247			DLINK_FOREACH(ptr, class->list_ipv4.head)
248			{
249			cidr = ptr->data;
250	michael	2213
251	michael	1633	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	michael	2213
256	michael	1633	cidr->number_on_this_cidr++;
257			return 0;
258			}
259			}
260	michael	2213
261	michael	1633	cidr = MyMalloc(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			#ifdef IPV6
268			else if (class->cidr_bitlen_ipv6 > 0)
269			{
270			DLINK_FOREACH(ptr, class->list_ipv6.head)
271			{
272			cidr = ptr->data;
273	michael	2213
274	michael	1633	if (match_ipv6(ip, &cidr->mask, class->cidr_bitlen_ipv6))
275			{
276			if (!over_rule && (cidr->number_on_this_cidr >= class->number_per_cidr))
277			return -1;
278	michael	2213
279	michael	1633	cidr->number_on_this_cidr++;
280			return 0;
281			}
282			}
283	michael	2213
284	michael	1633	cidr = MyMalloc(sizeof(struct CidrItem));
285			cidr->number_on_this_cidr = 1;
286			cidr->mask = *ip;
287			mask_addr(&cidr->mask, class->cidr_bitlen_ipv6);
288			dlinkAdd(cidr, &cidr->node, &class->list_ipv6);
289			}
290			#endif
291			return 0;
292			}
293
294			/*
295			* remove_from_cidr_check
296			*
297			* inputs - pointer to the ip to be removed
298			* - pointer to the class
299			* output - NONE
300			* side effects -
301			*/
302			void
303			remove_from_cidr_check(struct irc_ssaddr ip, struct ClassItem aclass)
304			{
305			dlink_node *ptr = NULL;
306			dlink_node *next_ptr = NULL;
307			struct CidrItem *cidr;
308
309			if (aclass->number_per_cidr == 0)
310			return;
311
312			if (ip->ss.ss_family == AF_INET)
313			{
314	michael	1644	if (aclass->cidr_bitlen_ipv4 == 0)
315	michael	1633	return;
316
317			DLINK_FOREACH_SAFE(ptr, next_ptr, aclass->list_ipv4.head)
318			{
319			cidr = ptr->data;
320	michael	2213
321	michael	1633	if (match_ipv4(ip, &cidr->mask, aclass->cidr_bitlen_ipv4))
322			{
323	michael	2213	cidr->number_on_this_cidr--;
324
325			if (cidr->number_on_this_cidr == 0)
326			{
327			dlinkDelete(ptr, &aclass->list_ipv4);
328			MyFree(cidr);
329			return;
330			}
331	michael	1633	}
332			}
333			}
334			#ifdef IPV6
335			else if (aclass->cidr_bitlen_ipv6 > 0)
336			{
337			DLINK_FOREACH_SAFE(ptr, next_ptr, aclass->list_ipv6.head)
338			{
339			cidr = ptr->data;
340	michael	2213
341	michael	1633	if (match_ipv6(ip, &cidr->mask, aclass->cidr_bitlen_ipv6))
342			{
343	michael	2213	cidr->number_on_this_cidr--;
344
345			if (cidr->number_on_this_cidr == 0)
346			{
347			dlinkDelete(ptr, &aclass->list_ipv6);
348			MyFree(cidr);
349			return;
350			}
351	michael	1633	}
352			}
353			}
354			#endif
355			}
356
357	michael	1647	void
358			rebuild_cidr_list(struct ClassItem *class)
359	michael	1633	{
360			dlink_node *ptr;
361
362	michael	1647	destroy_cidr_class(class);
363	michael	1633
364			DLINK_FOREACH(ptr, local_client_list.head)
365			{
366	michael	1647	struct Client *client_p = ptr->data;
367			struct MaskItem *conf = client_p->localClient->confs.tail->data;
368	michael	1633
369	michael	1647	if (conf && (conf->type == CONF_CLIENT))
370			if (conf->class == class)
371			cidr_limit_reached(1, &client_p->localClient->ip, class);
372	michael	1633	}
373			}
374
375			/*
376			* destroy_cidr_list
377			*
378			* inputs - pointer to class dlink list of cidr blocks
379			* output - none
380			* side effects - completely destroys the class link list of cidr blocks
381			*/
382			static void
383			destroy_cidr_list(dlink_list *list)
384			{
385			dlink_node ptr = NULL, next_ptr = NULL;
386
387			DLINK_FOREACH_SAFE(ptr, next_ptr, list->head)
388			{
389			dlinkDelete(ptr, list);
390			MyFree(ptr->data);
391			}
392			}
393
394			/*
395			* destroy_cidr_class
396			*
397			* inputs - pointer to class
398			* output - none
399			* side effects - completely destroys the class link list of cidr blocks
400			*/
401			void
402			destroy_cidr_class(struct ClassItem *class)
403			{
404			destroy_cidr_list(&class->list_ipv4);
405			destroy_cidr_list(&class->list_ipv6);
406			}