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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
/*
* 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 this program; see the file COPYING; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <zebra.h>
#include "thread.h"
#include "memory.h"
#include "hash.h"
#include "log.h"
#include "qobj.h"
#include "jhash.h"
static uint32_t qobj_hash(const struct qobj_node *node)
{
return (uint32_t)node->nid;
}
static int qobj_cmp(const struct qobj_node *na, const struct qobj_node *nb)
{
if (na->nid < nb->nid)
return -1;
if (na->nid > nb->nid)
return 1;
return 0;
}
DECLARE_HASH(qobj_nodes, struct qobj_node, nodehash,
qobj_cmp, qobj_hash)
static pthread_rwlock_t nodes_lock;
static struct qobj_nodes_head nodes = { };
void qobj_reg(struct qobj_node *node, struct qobj_nodetype *type)
{
node->type = type;
pthread_rwlock_wrlock(&nodes_lock);
do {
node->nid = (uint64_t)random();
node->nid ^= (uint64_t)random() << 32;
} while (!node->nid || qobj_nodes_find(&nodes, node));
qobj_nodes_add(&nodes, node);
pthread_rwlock_unlock(&nodes_lock);
}
void qobj_unreg(struct qobj_node *node)
{
pthread_rwlock_wrlock(&nodes_lock);
qobj_nodes_del(&nodes, node);
pthread_rwlock_unlock(&nodes_lock);
}
struct qobj_node *qobj_get(uint64_t id)
{
struct qobj_node dummy = {.nid = id}, *rv;
pthread_rwlock_rdlock(&nodes_lock);
rv = qobj_nodes_find(&nodes, &dummy);
pthread_rwlock_unlock(&nodes_lock);
return rv;
}
void *qobj_get_typed(uint64_t id, struct qobj_nodetype *type)
{
struct qobj_node dummy = {.nid = id};
struct qobj_node *node;
void *rv;
pthread_rwlock_rdlock(&nodes_lock);
node = qobj_nodes_find(&nodes, &dummy);
/* note: we explicitly hold the lock until after we have checked the
* type.
* if the caller holds a lock that for example prevents the deletion of
* route-maps, we can still race against a delete of something that
* isn't
* a route-map. */
if (!node || node->type != type)
rv = NULL;
else
rv = (char *)node - node->type->node_member_offset;
pthread_rwlock_unlock(&nodes_lock);
return rv;
}
void qobj_init(void)
{
pthread_rwlock_init(&nodes_lock, NULL);
qobj_nodes_init(&nodes);
}
void qobj_finish(void)
{
struct qobj_node *node;
while ((node = qobj_nodes_pop(&nodes)))
qobj_nodes_del(&nodes, node);
pthread_rwlock_destroy(&nodes_lock);
}
|
