blob: ec0eaa4f82015b0e37446f9ccbf4d57a8bde2a24 [file] [log] [blame]
jardineb5d44e2003-12-23 08:09:43 +00001/*
2 * IS-IS Rout(e)ing protocol - isis_flags.c
3 * Routines for manipulation of SSN and SRM flags
4 *
5 * Copyright (C) 2001,2002 Sampo Saaristo
6 * Tampere University of Technology
7 * Institute of Communications Engineering
8 *
9 * This program is free software; you can redistribute it and/or modify it
10 * under the terms of the GNU General Public Licenseas published by the Free
11 * Software Foundation; either version 2 of the License, or (at your option)
12 * any later version.
13 *
14 * This program is distributed in the hope that it will be useful,but WITHOUT
15 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
17 * more details.
18 *
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write to the Free Software Foundation, Inc.,
21 * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
22 */
23
jardineb5d44e2003-12-23 08:09:43 +000024#include <zebra.h>
25#include "log.h"
26#include "linklist.h"
27
28#include "isisd/isis_constants.h"
29#include "isisd/isis_common.h"
30#include "isisd/isis_flags.h"
31
Paul Jakmac7350c42008-01-29 19:29:44 +000032void
33flags_initialize (struct flags *flags)
34{
35 flags->maxindex = 0;
36 flags->free_idcs = NULL;
37}
38
Josh Bailey3f045a02012-03-24 08:35:20 -070039long int
hassof390d2c2004-09-10 20:48:21 +000040flags_get_index (struct flags *flags)
jardineb5d44e2003-12-23 08:09:43 +000041{
42 struct listnode *node;
Josh Bailey3f045a02012-03-24 08:35:20 -070043 long int index;
jardineb5d44e2003-12-23 08:09:43 +000044
hassof390d2c2004-09-10 20:48:21 +000045 if (flags->free_idcs == NULL || flags->free_idcs->count == 0)
46 {
Paul Jakmac7350c42008-01-29 19:29:44 +000047 index = flags->maxindex++;
hassof390d2c2004-09-10 20:48:21 +000048 }
49 else
50 {
51 node = listhead (flags->free_idcs);
Josh Bailey3f045a02012-03-24 08:35:20 -070052 index = (long int) listgetdata (node);
hassof390d2c2004-09-10 20:48:21 +000053 listnode_delete (flags->free_idcs, (void *) index);
Paul Jakmac7350c42008-01-29 19:29:44 +000054 index--;
hassof390d2c2004-09-10 20:48:21 +000055 }
56
jardineb5d44e2003-12-23 08:09:43 +000057 return index;
58}
59
hassof390d2c2004-09-10 20:48:21 +000060void
Josh Bailey3f045a02012-03-24 08:35:20 -070061flags_free_index (struct flags *flags, long int index)
jardineb5d44e2003-12-23 08:09:43 +000062{
Paul Jakmac7350c42008-01-29 19:29:44 +000063 if (index + 1 == flags->maxindex)
64 {
65 flags->maxindex--;
66 return;
67 }
68
hassof390d2c2004-09-10 20:48:21 +000069 if (flags->free_idcs == NULL)
70 {
71 flags->free_idcs = list_new ();
72 }
73
Paul Jakmac7350c42008-01-29 19:29:44 +000074 listnode_add (flags->free_idcs, (void *) (index + 1));
hassof390d2c2004-09-10 20:48:21 +000075
jardineb5d44e2003-12-23 08:09:43 +000076 return;
77}
78
hassof390d2c2004-09-10 20:48:21 +000079int
80flags_any_set (u_int32_t * flags)
jardineb5d44e2003-12-23 08:09:43 +000081{
hassof390d2c2004-09-10 20:48:21 +000082 u_int32_t zero[ISIS_MAX_CIRCUITS];
83 memset (zero, 0x00, ISIS_MAX_CIRCUITS * 4);
jardineb5d44e2003-12-23 08:09:43 +000084
hassof390d2c2004-09-10 20:48:21 +000085 return bcmp (flags, zero, ISIS_MAX_CIRCUITS * 4);
jardineb5d44e2003-12-23 08:09:43 +000086}