1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
/*
* Copyright (c) 2015-16 David Lamparter, for NetDEF, Inc.
*
* This file is part of Quagga
*
* Quagga 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, or (at your option) any
* later version.
*
* Quagga 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 Quagga; see the file COPYING. If not, write to the Free
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*/
#include <zebra.h>
#include "thread.h"
#include "memory.h"
#include "hash.h"
#include "log.h"
#include "qobj.h"
static struct hash *nodes = NULL;
static unsigned int qobj_key (void *data)
{
struct qobj_node *node = data;
return (unsigned int)node->nid;
}
static int qobj_cmp (const void *a, const void *b)
{
const struct qobj_node *na = a, *nb = b;
return na->nid == nb->nid;
}
void qobj_reg(struct qobj_node *node, struct qobj_nodetype *type)
{
node->type = type;
do
{
node->nid = (uint64_t)random();
node->nid ^= (uint64_t)random() << 32;
}
while (!node->nid || hash_get (nodes, node, hash_alloc_intern) != node);
}
void qobj_unreg(struct qobj_node *node)
{
hash_release (nodes, node);
}
struct qobj_node *qobj_get(uint64_t id)
{
struct qobj_node dummy = { .nid = id };
return hash_lookup (nodes, &dummy);
}
void *qobj_get_typed(uint64_t id, struct qobj_nodetype *type)
{
struct qobj_node *node = qobj_get(id);
if (!node || node->type != type)
return NULL;
return (char *)node - node->type->node_member_offset;
}
void qobj_init (void)
{
if (!nodes)
nodes = hash_create (qobj_key, qobj_cmp);
}
void qobj_finish (void)
{
hash_clean (nodes, NULL);
hash_free (nodes);
nodes = NULL;
}
|
