blob: 0ef048e2c186367e2826893487a10e53e5b25ae8 [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
32int
hassof390d2c2004-09-10 20:48:21 +000033flags_get_index (struct flags *flags)
jardineb5d44e2003-12-23 08:09:43 +000034{
35 struct listnode *node;
36 int index;
37
hassof390d2c2004-09-10 20:48:21 +000038 if (flags->free_idcs == NULL || flags->free_idcs->count == 0)
39 {
40 flags->maxindex++;
41 index = flags->maxindex;
42 }
43 else
44 {
45 node = listhead (flags->free_idcs);
46 index = (int) getdata (node);
47 listnode_delete (flags->free_idcs, (void *) index);
48 }
49
jardineb5d44e2003-12-23 08:09:43 +000050 return index;
51}
52
hassof390d2c2004-09-10 20:48:21 +000053void
54flags_free_index (struct flags *flags, int index)
jardineb5d44e2003-12-23 08:09:43 +000055{
hassof390d2c2004-09-10 20:48:21 +000056 if (flags->free_idcs == NULL)
57 {
58 flags->free_idcs = list_new ();
59 }
60
61 listnode_add (flags->free_idcs, (void *) index);
62
jardineb5d44e2003-12-23 08:09:43 +000063 return;
64}
65
hassof390d2c2004-09-10 20:48:21 +000066int
67flags_any_set (u_int32_t * flags)
jardineb5d44e2003-12-23 08:09:43 +000068{
hassof390d2c2004-09-10 20:48:21 +000069 u_int32_t zero[ISIS_MAX_CIRCUITS];
70 memset (zero, 0x00, ISIS_MAX_CIRCUITS * 4);
jardineb5d44e2003-12-23 08:09:43 +000071
hassof390d2c2004-09-10 20:48:21 +000072 return bcmp (flags, zero, ISIS_MAX_CIRCUITS * 4);
jardineb5d44e2003-12-23 08:09:43 +000073}