-
Notifications
You must be signed in to change notification settings - Fork 0
/
mib.c
146 lines (109 loc) · 3.65 KB
/
mib.c
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
/*
* mib.c
* Copyright (c) 2020 Sergei Kosivchenko <archichief@gmail.com>
*
* smart-snmp 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 3 of the License, or
* (at your option) any later version.
*
* smart-snmp 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, see <http://www.gnu.org/licenses/>.
*/
#include <stdbool.h>
#include <memory.h>
#include <stdio.h>
#include "mib.h"
#include "utilities.h"
typedef struct mib_tree_node mib_tree_node_t;
struct mib_tree_node {
int32_t subid;
size_t childs_cnt;
mib_tree_node_t **childs;
mib_entry_t entry;
};
static mib_tree_node_t mib = {
.subid = 1,
};
static int comparator(const void *a, const void *b) {
return (*((const mib_tree_node_t **)a))->subid - (*((const mib_tree_node_t **)b))->subid;
}
int mib_add_entry(const oid_t *oid, object_type_t type, mib_getter_t getter,
mib_setter_t setter) {
mib_tree_node_t *node = &mib, *subnode, key, *key_ptr;
size_t i;
bool found = true;
key_ptr = &key;
for (i = 1; i < oid->subids_cnt; i++) {
key.subid = oid->subids[i];
if (NULL == (subnode = bsearch(&key_ptr, node->childs, node->childs_cnt, sizeof(*node->childs), comparator))) {
found = false;
break;
}
node = *(mib_tree_node_t **)subnode;
}
if (!found) {
for (; i < oid->subids_cnt; i++) {
subnode = malloc(sizeof(*subnode));
node->childs = realloc(node->childs, (node->childs_cnt + 1) * sizeof(*node->childs));
node->childs[node->childs_cnt++] = subnode;
subnode->subid = oid->subids[i];
qsort(node->childs, node->childs_cnt, sizeof(*node->childs), comparator);
node = subnode;
}
node->entry.type = type;
node->entry.get = getter;
node->entry.set = setter;
memmove(&node->entry.oid, oid, sizeof(node->entry.oid));
}
return found;
}
const mib_entry_t *mib_find(const oid_t *oid) {
mib_tree_node_t *node = &mib, *subnode, key, *key_ptr;
size_t i;
key_ptr = &key;
for (i = 1; i < oid->subids_cnt; i++) {
key.subid = oid->subids[i];
if (NULL == (subnode = bsearch(&key_ptr, node->childs, node->childs_cnt, sizeof(*node->childs), comparator))) {
return NULL;
}
node = *(mib_tree_node_t **)subnode;
}
return node->childs_cnt ? NULL : &node->entry;
}
const mib_entry_t *mib_findnext(const oid_t *oid) {
mib_tree_node_t *node = &mib, *subnode, key, *key_ptr;
size_t i;
key_ptr = &key;
for (i = 1; i < oid->subids_cnt; i++) {
key.subid = oid->subids[i];
if (NULL == (subnode = bsearch(&key_ptr, node->childs, node->childs_cnt, sizeof(void *), comparator))) {
break;
}
node = *(mib_tree_node_t **)subnode;
}
while (node->childs_cnt) {
node = *node->childs;
}
return &node->entry;
}
static void free_mib_node(mib_tree_node_t *node) {
size_t i;
for (i = 0; i < node->childs_cnt; i++) {
free_mib_node(node->childs[i]);
free(node->childs);
}
free(node);
}
void mib_free() {
size_t i;
for (i = 0; i < mib.childs_cnt; i++) {
free_mib_node(mib.childs[i]);
}
free(mib.childs);
}