2 * Object IDentifier Support
4 * (c) 2007, Luis E. Garcia Ontanon <luis.ontanon@gmail.com>
8 * Wireshark - Network traffic analyzer
9 * By Gerald Combs <gerald@wireshark.org>
10 * Copyright 1998 Gerald Combs
12 * This program is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU General Public License
14 * as published by the Free Software Foundation; either version 2
15 * of the License, or (at your option) any later version.
17 * This program is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
22 * You should have received a copy of the GNU General Public License
23 * along with this program; if not, write to the Free Software
24 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
41 #include "report_err.h"
42 #include "filesystem.h"
43 #include "dissectors/packet-ber.h"
49 #define D(level,args) do if (debuglevel >= level) { printf args; printf("\n"); fflush(stdout); } while(0)
53 static int debuglevel = 0;
55 static const oid_value_type_t integer_type = { FT_INT32, BASE_DEC, BER_CLASS_UNI, BER_UNI_TAG_INTEGER, 1, 4, OID_KEY_TYPE_INTEGER, 1};
56 static const oid_value_type_t bytes_type = { FT_BYTES, BASE_NONE, BER_CLASS_UNI, BER_UNI_TAG_OCTETSTRING, 0, -1, OID_KEY_TYPE_BYTES, 0};
57 static const oid_value_type_t oid_type = { FT_OID, BASE_NONE, BER_CLASS_UNI, BER_UNI_TAG_OID, 1, -1, OID_KEY_TYPE_OID, 0};
58 static const oid_value_type_t ipv4_type = { FT_IPv4, BASE_NONE, BER_CLASS_APP, 0, 4, 4, OID_KEY_TYPE_IPADDR, 4};
59 static const oid_value_type_t counter32_type = { FT_UINT32, BASE_DEC, BER_CLASS_APP, 1, 1, 4, OID_KEY_TYPE_INTEGER, 1};
60 static const oid_value_type_t unsigned32_type = { FT_UINT32, BASE_DEC, BER_CLASS_APP, 2, 1, 4, OID_KEY_TYPE_INTEGER, 1};
61 static const oid_value_type_t timeticks_type = { FT_UINT32, BASE_DEC, BER_CLASS_APP, 3, 1, 4, OID_KEY_TYPE_INTEGER, 1};
62 static const oid_value_type_t opaque_type = { FT_BYTES, BASE_NONE, BER_CLASS_APP, 4, 1, 4, OID_KEY_TYPE_BYTES, 0};
63 static const oid_value_type_t nsap_type = { FT_BYTES, BASE_NONE, BER_CLASS_APP, 5, 0, -1, OID_KEY_TYPE_NSAP, 0};
64 static const oid_value_type_t counter64_type = { FT_UINT64, BASE_DEC, BER_CLASS_APP, 6, 1, 8, OID_KEY_TYPE_INTEGER, 1};
65 static const oid_value_type_t ipv6_type = { FT_IPv6, BASE_NONE, BER_CLASS_UNI, BER_UNI_TAG_OCTETSTRING, 16, 16, OID_KEY_TYPE_BYTES, 16};
66 static const oid_value_type_t float_type = { FT_FLOAT, BASE_DEC, BER_CLASS_UNI, BER_UNI_TAG_OCTETSTRING, 4, 4, OID_KEY_TYPE_WRONG, 0};
67 static const oid_value_type_t double_type = { FT_DOUBLE, BASE_DEC, BER_CLASS_UNI, BER_UNI_TAG_OCTETSTRING, 8, 8, OID_KEY_TYPE_WRONG, 0};
68 static const oid_value_type_t ether_type = { FT_ETHER, BASE_NONE, BER_CLASS_UNI, BER_UNI_TAG_OCTETSTRING, 6, 6, OID_KEY_TYPE_BYTES, 6};
69 static const oid_value_type_t string_type = { FT_STRING, BASE_NONE, BER_CLASS_UNI, BER_UNI_TAG_OCTETSTRING, 0, -1, OID_KEY_TYPE_STRING, 0};
70 static const oid_value_type_t unknown_type = { FT_BYTES, BASE_NONE, BER_CLASS_ANY, BER_TAG_ANY, 0, -1, OID_KEY_TYPE_WRONG, 0};
72 static oid_info_t oid_root = { 0, NULL, OID_KIND_UNKNOWN, NULL, &unknown_type, -2, NULL, NULL, NULL};
74 static oid_info_t* add_oid(const char* name, oid_kind_t kind, const oid_value_type_t* type, oid_key_t* key, guint oid_len, guint32 *subids) {
76 oid_info_t* c = &oid_root;
78 if (!oid_root.children) {
79 char* debug_env = getenv("WIRESHARK_DEBUG_MIBS");
82 debuglevel = debug_env ? strtoul(debug_env,NULL,10) : 0;
84 oid_root.children = pe_tree_create(EMEM_TREE_TYPE_RED_BLACK,"oid_root");
87 * make sure we got strings at least in the three root-children oids
88 * that way oid_resolved() will always have a string to print
90 subid = 0; oid_add("itu-t",1,&subid);
91 subid = 1; oid_add("iso",1,&subid);
92 subid = 2; oid_add("joint-iso-itu-t",1,&subid);
98 oid_info_t* n = emem_tree_lookup32(c->children,subids[i]);
103 if (!g_str_equal(n->name,name)) {
104 D(2,("Renaming Oid from: %s -> %s, this means the same oid is registered more than once",n->name,name));
106 /* XXX - Don't free n->name here. It may be part of an hf_register_info
107 * struct that has been appended to the hfa GArray. */
110 n->name = g_strdup(name);
112 if (! n->value_type) {
113 n->value_type = type;
119 n = g_malloc(sizeof(oid_info_t));
120 n->subid = subids[i];
122 n->children = pe_tree_create(EMEM_TREE_TYPE_RED_BLACK,"oid_children");
128 emem_tree_insert32(c->children,n->subid,n);
131 n->name = g_strdup(name);
132 n->value_type = type;
137 n->value_type = NULL;
138 n->kind = OID_KIND_UNKNOWN;
144 g_assert_not_reached();
148 void oid_add(const char* name, guint oid_len, guint32 *subids) {
149 g_assert(subids && *subids <= 2);
151 D(3,("\tOid (from subids): %s %s ",name?name:"NULL", oid_subid2string(subids,oid_len)));
152 add_oid(name,OID_KIND_UNKNOWN,NULL,NULL,oid_len,subids);
154 D(1,("Failed to add Oid: %s (from subids)",name?name:"NULL"));
158 void oid_add_from_string(const char* name, const gchar *oid_str) {
160 guint oid_len = oid_string2subid(oid_str, &subids);
163 D(3,("\tOid (from string): %s %s ",name?name:"NULL", oid_subid2string(subids,oid_len)));
164 add_oid(name,OID_KIND_UNKNOWN,NULL,NULL,oid_len,subids);
166 D(1,("Failed to add Oid: %s %s ",name?name:"NULL", oid_str?oid_str:NULL));
170 extern void oid_add_from_encoded(const char* name, const guint8 *oid, gint oid_len) {
172 guint subids_len = oid_encoded2subid(oid, oid_len, &subids);
175 D(3,("\tOid (from encoded): %s %s ",name, oid_subid2string(subids,subids_len)));
176 add_oid(name,OID_KIND_UNKNOWN,NULL,NULL,subids_len,subids);
178 D(1,("Failed to add Oid: %s [%d]%s ",name?name:"NULL", oid_len,bytestring_to_str(oid, oid_len, ':')));
183 typedef struct smi_module_t {
187 static smi_module_t* smi_paths = NULL;
188 static guint num_smi_paths = 0;
189 static uat_t* smi_paths_uat = NULL;
191 static smi_module_t* smi_modules = NULL;
192 static guint num_smi_modules = 0;
193 static uat_t* smi_modules_uat = NULL;
195 static GString* smi_errors;
197 UAT_CSTRING_CB_DEF(smi_mod,name,smi_module_t)
199 static void smi_error_handler(char *path, int line, int severity, char *msg, char *tag) {
200 g_string_sprintfa(smi_errors,"%s:%d %d %s %s\n",
208 static void* smi_mod_copy_cb(void* dest, const void* orig, unsigned len _U_) {
209 const smi_module_t* m = orig;
210 smi_module_t* d = dest;
212 d->name = g_strdup(m->name);
217 static void smi_mod_free_cb(void* p) {
219 if (m->name) g_free(m->name);
223 static char* alnumerize(const char* name) {
224 char* s = g_strdup(name);
229 for (;(c = *r); r++) {
230 if (isalnum(c) || c == '_' || c == '-' || c == '.') {
232 } else if (c == ':' && r[1] == ':') {
242 const oid_value_type_t* get_typedata(SmiType* smiType) {
244 * There has to be a better way to know if a given
245 * OCTETSTRING type is actually human readable text,
246 * an address of some type or some moe specific FT_
247 * Until that is found, this is the mappping between
248 * SNMP Types and our FT_s
250 static const struct _type_mapping_t {
253 const oid_value_type_t* type;
255 {"IpAddress", SMI_BASETYPE_UNKNOWN, &ipv4_type},
256 {"InetAddressIPv4",SMI_BASETYPE_UNKNOWN,&ipv4_type},
257 {"InetAddressIPv6",SMI_BASETYPE_UNKNOWN,&ipv6_type},
258 {"NetworkAddress",SMI_BASETYPE_UNKNOWN,&ipv4_type},
259 {"MacAddress",SMI_BASETYPE_UNKNOWN,ðer_type},
260 {"TimeTicks",SMI_BASETYPE_UNKNOWN,&timeticks_type},
261 {"Ipv6Address",SMI_BASETYPE_UNKNOWN,&ipv6_type},
262 {"TimeStamp",SMI_BASETYPE_UNKNOWN,&integer_type},
263 {"DisplayString",SMI_BASETYPE_UNKNOWN,&string_type},
264 {"SnmpAdminString",SMI_BASETYPE_UNKNOWN,&string_type},
265 {"DateAndTime",SMI_BASETYPE_UNKNOWN,&string_type},
266 {"Counter",SMI_BASETYPE_UNKNOWN,&counter32_type},
267 {"Counter32",SMI_BASETYPE_UNKNOWN,&counter32_type},
268 {"Unsigned32",SMI_BASETYPE_UNKNOWN,&unsigned32_type},
269 {"Gauge",SMI_BASETYPE_UNKNOWN,&unsigned32_type},
270 {"Gauge32",SMI_BASETYPE_UNKNOWN,&unsigned32_type},
271 {"NsapAddress",SMI_BASETYPE_UNKNOWN,&nsap_type},
272 {"i32",SMI_BASETYPE_INTEGER32,&integer_type},
273 {"octets",SMI_BASETYPE_OCTETSTRING,&bytes_type},
274 {"oid",SMI_BASETYPE_OBJECTIDENTIFIER,&oid_type},
275 {"u32",SMI_BASETYPE_UNSIGNED32,&unsigned32_type},
276 {"u64",SMI_BASETYPE_UNSIGNED64,&counter64_type},
277 {"f32",SMI_BASETYPE_FLOAT32,&float_type},
278 {"f64",SMI_BASETYPE_FLOAT64,&double_type},
279 {"f128",SMI_BASETYPE_FLOAT128,&bytes_type},
280 {"enum",SMI_BASETYPE_ENUM,&integer_type},
281 {"bits",SMI_BASETYPE_BITS,&bytes_type},
282 {"unk",SMI_BASETYPE_UNKNOWN,&unknown_type},
285 const struct _type_mapping_t* t;
286 SmiType* sT = smiType;
288 if (!smiType) return NULL;
291 for (t = types; t->type ; t++ ) {
292 char* name = smiRenderType(sT, SMI_RENDER_NAME);
293 if (name && t->name && g_str_equal(name, t->name )) {
301 } while(( sT = smiGetParentType(sT) ));
303 for (t = types; t->type ; t++ ) {
304 if(smiType->basetype == t->base) {
309 return &unknown_type;
312 static guint get_non_implicit_size(SmiType* sT) {
314 guint size = 0xffffffff;
316 switch (sT->basetype) {
317 case SMI_BASETYPE_OCTETSTRING:
318 case SMI_BASETYPE_OBJECTIDENTIFIER:
324 for ( ; sT; sT = smiGetParentType(sT) ) {
325 for (sR = smiGetFirstRange(sT); sR ; sR = smiGetNextRange(sR)) {
326 if (size == 0xffffffff) {
327 if (sR->minValue.value.unsigned32 == sR->maxValue.value.unsigned32) {
328 size = sR->minValue.value.unsigned32;
333 if (sR->minValue.value.unsigned32 != size || sR->maxValue.value.unsigned32 != size) {
340 return size == 0xffffffff ? 0 : size;
344 static inline oid_kind_t smikind(SmiNode* sN, oid_key_t** key_p) {
347 switch(sN->nodekind) {
348 case SMI_NODEKIND_ROW: {
350 oid_key_t* kl = NULL;
351 const oid_value_type_t* typedata = NULL;
354 switch (sN->indexkind) {
355 case SMI_INDEX_INDEX:
357 case SMI_INDEX_AUGMENT:
358 case SMI_INDEX_REORDER:
359 case SMI_INDEX_SPARSE:
360 case SMI_INDEX_EXPAND:
361 sN = smiGetRelatedNode(sN);
363 case SMI_INDEX_UNKNOWN:
364 return OID_KIND_UNKNOWN;
367 implied = sN->implied;
369 for (sE = smiGetFirstElement(sN); sE; sE = smiGetNextElement(sE)) {
370 SmiNode* elNode = smiGetElementNode(sE) ;
371 SmiType* elType = smiGetNodeType(elNode);
373 guint non_implicit_size = 0;
377 non_implicit_size = get_non_implicit_size(elType);
380 typedata = get_typedata(elType);
382 k = g_malloc(sizeof(oid_key_t));
384 oid1 = smiRenderOID(sN->oidlen, sN->oid, SMI_RENDER_QUALIFIED);
385 oid2 = smiRenderOID(elNode->oidlen, elNode->oid, SMI_RENDER_NAME);
386 k->name = g_strdup_printf("%s.%s", oid1, oid2);
391 k->ft_type = typedata ? typedata->ft_type : FT_BYTES;
392 k->display = typedata ? typedata->display : BASE_NONE;
397 k->key_type = typedata->keytype;
398 k->num_subids = typedata->keysize;
401 switch (elType->basetype) {
402 case SMI_BASETYPE_BITS:
403 case SMI_BASETYPE_OCTETSTRING: {
404 k->key_type = OID_KEY_TYPE_BYTES;
405 k->num_subids = non_implicit_size;
408 case SMI_BASETYPE_ENUM:
409 case SMI_BASETYPE_OBJECTIDENTIFIER:
410 case SMI_BASETYPE_INTEGER32:
411 case SMI_BASETYPE_UNSIGNED32:
412 case SMI_BASETYPE_INTEGER64:
413 case SMI_BASETYPE_UNSIGNED64:
414 k->key_type = OID_KEY_TYPE_INTEGER;
418 k->key_type = OID_KEY_TYPE_WRONG;
423 k->key_type = OID_KEY_TYPE_WRONG;
429 if (!*key_p) *key_p = k;
430 if (kl) kl->next = k;
436 switch (kl->key_type) {
437 case OID_KEY_TYPE_BYTES: kl->key_type = OID_KEY_TYPE_IMPLIED_BYTES; break;
438 case OID_KEY_TYPE_STRING: kl->key_type = OID_KEY_TYPE_IMPLIED_STRING; break;
439 case OID_KEY_TYPE_OID: kl->key_type = OID_KEY_TYPE_IMPLIED_OID; break;
446 case SMI_NODEKIND_NODE: return OID_KIND_NODE;
447 case SMI_NODEKIND_SCALAR: return OID_KIND_SCALAR;
448 case SMI_NODEKIND_TABLE: return OID_KIND_TABLE;
449 case SMI_NODEKIND_COLUMN: return OID_KIND_COLUMN;
450 case SMI_NODEKIND_NOTIFICATION: return OID_KIND_NOTIFICATION;
451 case SMI_NODEKIND_GROUP: return OID_KIND_GROUP;
452 case SMI_NODEKIND_COMPLIANCE: return OID_KIND_COMPLIANCE;
453 case SMI_NODEKIND_CAPABILITIES: return OID_KIND_CAPABILITIES;
454 default: return OID_KIND_UNKNOWN;
458 #define IS_ENUMABLE(ft) ( (ft == FT_UINT8) || (ft == FT_UINT16) || (ft == FT_UINT24) || (ft == FT_UINT32) \
459 || (ft == FT_INT8) || (ft == FT_INT16) || (ft == FT_INT24) || (ft == FT_INT32) \
460 || (ft == FT_UINT64) || (ft == FT_INT64) )
462 void register_mibs(void) {
463 SmiModule *smiModule;
467 GArray* hfa = g_array_new(FALSE,TRUE,sizeof(hf_register_info));
468 GArray* etta = g_array_new(FALSE,TRUE,sizeof(gint*));
469 static uat_field_t smi_fields[] = {
470 UAT_FLD_CSTRING(smi_mod,name,"The module's name"),
473 static uat_field_t smi_paths_fields[] = {
474 UAT_FLD_CSTRING(smi_mod,name,"The directory name"),
477 char* smi_load_error = NULL;
480 smi_modules_uat = uat_new("SMI Modules",
481 sizeof(smi_module_t),
493 smi_paths_uat = uat_new("SMI Paths",
494 sizeof(smi_module_t),
509 uat_load(smi_modules_uat, &smi_load_error);
511 if (smi_load_error) {
512 report_failure("Error Loading SMI Modules Table: %s",smi_load_error);
516 uat_load(smi_paths_uat, &smi_load_error);
518 if (smi_load_error) {
519 report_failure("Error Loading SMI Paths Table: %s",smi_load_error);
523 path_str = oid_get_default_mib_path();
524 D(1,("SMI Path: '%s'",path_str));
526 smiSetPath(path_str);
530 smi_errors = g_string_new("");
531 smiSetErrorHandler(smi_error_handler);
533 for(i=0;i<num_smi_modules;i++) {
534 if (!smi_modules[i].name) continue;
537 if (smiIsLoaded(smi_modules[i].name)) {
540 char* mod_name = smiLoadModule(smi_modules[i].name);
542 D(2,("Loaded: '%s'[%d] as %s",smi_modules[i].name,i,mod_name ));
544 D(1,("Failed to load: '%s'[%d]",smi_modules[i].name,i));
548 if (smi_errors->len) {
549 report_failure("The following errors were found while loading the MIBS:\n%s\n\n"
550 "The Current Path is: %s\n" , smi_errors->str , path_str);
551 D(1,("Errors while loading:\n%s\n",smi_errors->str));
555 g_string_free(smi_errors,TRUE);
557 for (smiModule = smiGetFirstModule();
559 smiModule = smiGetNextModule(smiModule)) {
561 D(3,("\tModule: %s", smiModule->name));
563 for (smiNode = smiGetFirstNode(smiModule, SMI_NODEKIND_ANY);
565 smiNode = smiGetNextNode(smiNode, SMI_NODEKIND_ANY)) {
567 SmiType* smiType = smiGetNodeType(smiNode);
568 const oid_value_type_t* typedata = get_typedata(smiType);
570 oid_kind_t kind = smikind(smiNode,&key);
571 char *oid = smiRenderOID(smiNode->oidlen, smiNode->oid, SMI_RENDER_QUALIFIED);
572 oid_info_t* oid_data = add_oid(oid,
580 D(4,("\t\tNode: kind=%d oid=%s name=%s ",
581 oid_data->kind, oid_subid2string(smiNode->oid, smiNode->oidlen), oid_data->name ));
583 if ( typedata && oid_data->value_hfid == -2 ) {
584 SmiNamedNumber* smiEnum;
585 hf_register_info hf = { &(oid_data->value_hfid), {
587 alnumerize(oid_data->name),
592 smiRenderOID(smiNode->oidlen, smiNode->oid, SMI_RENDER_ALL),
595 oid_data->value_hfid = -1;
597 if ( IS_ENUMABLE(hf.hfinfo.type) && (smiEnum = smiGetFirstNamedNumber(smiType))) {
598 GArray* vals = g_array_new(TRUE,TRUE,sizeof(value_string));
600 for(;smiEnum; smiEnum = smiGetNextNamedNumber(smiEnum)) {
602 value_string val = {smiEnum->value.value.integer32,g_strdup(smiEnum->name)};
603 g_array_append_val(vals,val);
607 hf.hfinfo.strings = VALS(vals->data);
608 g_array_free(vals,FALSE);
610 #if 0 /* packet-snmp does not hanldle bits yet */
611 } else if (smiType->basetype == SMI_BASETYPE_BITS && ( smiEnum = smiGetFirstNamedNumber(smiType) )) {
613 oid_bits_info_t* bits = g_malloc(sizeof(oid_bits_info_t));
614 gint* ettp = &(bits->ett);
619 g_array_append_val(etta,ettp);
621 for(;smiEnum; smiEnum = smiGetNextNamedNumber(smiEnum), bits->num++);
623 bits->data = g_malloc(sizeof(struct _oid_bit_t)*bits->num);
625 for(smiEnum = smiGetFirstNamedNumber(smiType),n=0;
627 smiEnum = smiGetNextNamedNumber(smiEnum),n++) {
628 guint mask = 1 << (smiEnum->value.value.integer32 % 8);
629 char* base = alnumerize(oid_data->name);
630 char* ext = alnumerize(smiEnum->name);
631 hf_register_info hf2 = { &(bits->data[n].hfid), { NULL, NULL, FT_UINT8, BASE_HEX, NULL, mask, "", HFILL }};
633 bits->data[n].hfid = -1;
634 bits->data[n].offset = smiEnum->value.value.integer32 / 8;
636 hf2.hfinfo.name = g_strdup_printf("%s:%s",oid_data->name,smiEnum->name);
637 hf2.hfinfo.abbrev = g_strdup_printf("%s.%s",base,ext);
641 g_array_append_val(hfa,hf2);
643 #endif /* packet-snmp does not use this yet */
644 g_array_append_val(hfa,hf);
647 if ((key = oid_data->key)) {
648 for(; key; key = key->next) {
649 hf_register_info hf = { &(key->hfid), {
651 alnumerize(key->name),
659 D(5,("\t\t\tIndex: name=%s subids=%d key_type=%d",
660 key->name, key->num_subids, key->key_type ));
662 if (key->hfid == -2) {
663 g_array_append_val(hfa,hf);
666 g_free((void*)hf.hfinfo.abbrev);
673 proto_mibs = proto_register_protocol("MIBs", "MIBS", "mibs");
675 proto_register_field_array(proto_mibs, (hf_register_info*)hfa->data, hfa->len);
677 proto_register_subtree_array((gint**)etta->data, etta->len);
680 g_array_free(etta,TRUE);
681 g_array_free(hfa,FALSE);
686 void oids_init(void) {
690 D(1,("libsmi disabled oid resolution not enabled"));
694 const char* oid_subid2string(guint32* subids, guint len) {
695 char* s = ep_alloc0(((len)*11)+1);
699 return "*** Empty OID ***";
702 w += sprintf(w,"%u.",*subids++);
705 if (w!=s) *(w-1) = '\0'; else *(s) = '\0';
710 guint check_num_oid(const char* str) {
715 D(8,("check_num_oid: '%s'",str));
716 if (*r == '.' || *r == '\0') return 0;
719 D(9,("\tcheck_num_oid: '%c' %d",*r,n));
723 if (c == '.') return 0;
724 case '1' : case '2' : case '3' : case '4' : case '5' :
725 case '6' : case '7' : case '8' : case '9' : case '0' :
735 if (c == '.') return 0;
740 guint oid_string2subid(const char* str, guint32** subids_p) {
743 guint32* subids_overflow;
744 guint n = check_num_oid(str);
746 * we cannot handle sub-ids greater than 32bytes
747 * keep a pilot subid of 64 bytes to check the limit
751 D(6,("oid_string2subid: str='%s'",str));
758 *subids_p = subids = ep_alloc0(sizeof(guint32)*n);
759 subids_overflow = subids + n;
765 case '1' : case '2' : case '3' : case '4' : case '5' :
766 case '6' : case '7' : case '8' : case '9' : case '0' :
770 if( subids >= subids_overflow || subid > 0xffffffff) {
776 *(subids) += *r - '0';
788 guint oid_encoded2subid(const guint8 *oid_bytes, gint oid_len, guint32** subids_p) {
791 gboolean is_first = TRUE;
793 guint32* subid_overflow;
795 * we cannot handle sub-ids greater than 32bytes
796 * have the subid in 64 bytes to be able to check the limit
800 for (i=0; i<oid_len; i++) { if (! (oid_bytes[i] & 0x80 )) n++; }
802 *subids_p = subids = ep_alloc(sizeof(guint32)*n);
803 subid_overflow = subids+n;
805 for (i=0; i<oid_len; i++){
806 guint8 byte = oid_bytes[i];
809 subid |= byte & 0x7F;
818 if (subid >= 40) { subid0++; subid-=40; }
819 if (subid >= 40) { subid0++; subid-=40; }
826 if( subids >= subid_overflow || subid > 0xffffffff) {
831 *subids++ = (guint32)subid;
838 oid_info_t* oid_get(guint len, guint32* subids, guint* matched, guint* left) {
839 oid_info_t* curr_oid = &oid_root;
842 if(!(subids && *subids <= 2)) {
848 for( i=0; i < len; i++) {
849 oid_info_t* next_oid = emem_tree_lookup32(curr_oid->children,subids[i]);
863 oid_info_t* oid_get_from_encoded(const guint8 *bytes, gint byteslen, guint32** subids_p, guint* matched_p, guint* left_p) {
864 guint subids_len = oid_encoded2subid(bytes, byteslen, subids_p);
865 return oid_get(subids_len, *subids_p, matched_p, left_p);
868 oid_info_t* oid_get_from_string(const gchar *oid_str, guint32** subids_p, guint* matched, guint* left) {
869 guint subids_len = oid_string2subid(oid_str, subids_p);
870 return oid_get(subids_len, *subids_p, matched, left);
873 const gchar *oid_resolved_from_encoded(const guint8 *oid, gint oid_len) {
875 guint subid_oid_length = oid_encoded2subid(oid, oid_len, &subid_oid);
877 return oid_resolved(subid_oid_length, subid_oid);
881 guint oid_subid2encoded(guint subids_len, guint32* subids, guint8** bytes_p) {
888 if ( !subids || subids_len <= 0) {
893 subid = (subids[0] * 40) + subids[1];
897 if (subid <= 0x0000007F) {
899 } else if (subid <= 0x00003FFF ) {
901 } else if (subid <= 0x001FFFFF ) {
903 } else if (subid <= 0x0FFFFFFF ) {
910 } while ( i++ < subids_len );
912 *bytes_p = b = bytes = ep_alloc(bytelen);
914 subid = (subids[0] * 40) + subids[1];
920 if ((subid <= 0x0000007F )) len = 1;
921 else if ((subid <= 0x00003FFF )) len = 2;
922 else if ((subid <= 0x001FFFFF )) len = 3;
923 else if ((subid <= 0x0FFFFFFF )) len = 4;
927 default: *bytes_p=NULL; return 0;
928 case 5: *(b++) = ((subid & 0xF0000000) << 28) | 0x80;
929 case 4: *(b++) = ((subid & 0x0FE00000 ) >> 21) | 0x80;
930 case 3: *(b++) = ((subid & 0x001FC000 ) >> 14) | 0x80;
931 case 2: *(b++) = ((subid & 0x00003F10 ) >> 7) | 0x80;
932 case 1: *(b++) = subid & 0x0000007F ; break;
936 } while ( i++ < subids_len);
941 const gchar* oid_encoded2string(const guint8* encoded, guint len) {
943 guint subids_len = oid_encoded2subid(encoded, len, &subids);
946 return oid_subid2string(subids,subids_len);
954 guint oid_string2encoded(const char *oid_str, guint8 **bytes) {
959 if ( ( subids_len = oid_string2subid(oid_str, &subids) )
961 ( byteslen = oid_subid2encoded(subids_len, subids, bytes) ) ) {
967 char* oid2str(oid_info_t* oid, guint32* subids, guint len, guint left) {
971 return ep_strdup_printf("%s.%s",oid->name,oid_subid2string(subids+(len-left),left));
975 const gchar *oid_resolved_from_string(const gchar *oid_str) {
977 guint subid_oid_length = oid_string2subid(oid_str, &subid_oid);
979 return oid_resolved(subid_oid_length, subid_oid);
982 const gchar *oid_resolved(guint32 num_subids, guint32* subids) {
987 if(! (subids && *subids <= 2 ))
988 return "*** Malformed OID ***";
990 oid = oid_get(num_subids, subids, &matched, &left);
992 while (! oid->name ) {
993 if (!(oid = oid->parent)) {
994 return oid_subid2string(subids,num_subids);
1001 return ep_strdup_printf("%s.%s",
1002 oid->name ? oid->name : oid_subid2string(subids,matched),
1003 oid_subid2string(&(subids[matched]),left));
1005 return oid->name ? oid->name : oid_subid2string(subids,matched);
1009 extern void oid_both(guint oid_len, guint32 *subids, char** resolved_p, char** numeric_p) {
1010 *resolved_p = (void*)oid_resolved(oid_len,subids);
1011 *numeric_p = (void*)oid_subid2string(subids,oid_len);
1014 extern void oid_both_from_encoded(const guint8 *oid, gint oid_len, char** resolved_p, char** numeric_p) {
1016 guint subids_len = oid_encoded2subid(oid, oid_len, &subids);
1017 *resolved_p = (void*)oid_resolved(subids_len,subids);
1018 *numeric_p = (void*)oid_subid2string(subids,subids_len);
1021 extern void oid_both_from_string(const gchar *oid_str, char** resolved_p, char** numeric_p) {
1023 guint subids_len = oid_string2subid(oid_str, &subids);
1024 *resolved_p = (void*)oid_resolved(subids_len,subids);
1025 *numeric_p = (void*)oid_subid2string(subids,subids_len);
1029 * Fetch the default OID path.
1032 oid_get_default_mib_path(void) {
1039 path_str = g_string_new("");
1041 #define PATH_SEPARATOR ";"
1042 path = get_datafile_path("snmp\\mibs");
1043 g_string_sprintfa(path_str, "%s;", path);
1046 path = get_persconffile_path("snmp\\mibs", FALSE, FALSE);
1047 g_string_sprintfa(path_str, "%s", path);
1050 #define PATH_SEPARATOR ":"
1051 path = smiGetPath();
1052 g_string_sprintfa(path_str, "%s", path);
1056 for(i=0;i<num_smi_paths;i++) {
1057 if (!( smi_paths[i].name && *smi_paths[i].name))
1060 g_string_sprintfa(path_str,PATH_SEPARATOR "%s",smi_paths[i].name);
1063 path_ret = path_str->str;
1064 g_string_free(path_str, FALSE);
1066 #else /* HAVE_LIBSMI */
1067 return g_strdup("");
1072 char* oid_test_a2b(guint32 num_subids, guint32* subids) {
1077 const char* sub2str = oid_subid2string(subids, num_subids);
1078 guint sub2enc_len = oid_subid2encoded(num_subids, subids,&sub2enc);
1079 guint enc2sub_len = oid_encoded2subid(sub2enc, sub2enc_len, &enc2sub);
1080 const char* enc2str = oid_encoded2string(sub2enc, sub2enc_len);
1081 guint str2enc_len = oid_string2encoded(sub2str,&str2enc);
1082 guint str2sub_len = oid_string2subid(sub2str,&str2sub);
1084 return ep_strdup_printf(
1085 "oid_subid2string=%s \n"
1086 "oid_subid2encoded=[%d]%s \n"
1087 "oid_encoded2subid=%s \n "
1088 "oid_encoded2string=%s \n"
1089 "oid_string2encoded=[%d]%s \n"
1090 "oid_string2subid=%s \n "
1092 ,sub2enc_len,bytestring_to_str(sub2enc, sub2enc_len, ':')
1093 ,enc2sub ? oid_subid2string(enc2sub,enc2sub_len) : "-"
1095 ,str2enc_len,bytestring_to_str(str2enc, str2enc_len, ':')
1096 ,str2sub ? oid_subid2string(str2sub,str2sub_len) : "-"
1100 void add_oid_debug_subtree(oid_info_t* oid_info, proto_tree *tree) {
1101 static const char* oid_kinds[] = { "Unknown", "Node", "Scalar", "Table", "Row", "Column", "Notification", "Group", "Compliance", "Capabilities"};
1102 static const char* key_types[] = {"OID_KEY_TYPE_WRONG","OID_KEY_TYPE_INTEGER",
1103 "OID_KEY_TYPE_FIXED_STRING","OID_KEY_TYPE_FIXED_BYTES","OID_KEY_TYPE_STRING",
1104 "OID_KEY_TYPE_BYTES","OID_KEY_TYPE_NSAP","OID_KEY_TYPE_OID","OID_KEY_TYPE_IPADDR"};
1105 proto_item* pi = proto_tree_add_text(tree,NULL,0,0,
1106 "OidInfo: Name='%s' sub-id=%u kind=%s hfid=%d",
1107 oid_info->name ? oid_info->name : "",
1109 oid_info->kind <= OID_KIND_CAPABILITIES ? oid_kinds[oid_info->kind] : "BROKEN",
1110 oid_info->value_hfid);
1111 proto_tree* pt = proto_item_add_subtree(pi,0);
1114 for(key = oid_info->key; key; key = key->next) {
1115 proto_tree_add_text(pt,NULL,0,0,
1116 "Key: name='%s' num_subids=%d type=%s",
1118 key->key_type <= OID_KEY_TYPE_IPADDR ? key_types[key->key_type] : "BROKEN"
1122 if (oid_info->parent) {
1123 pi = proto_tree_add_text(pt,NULL,0,0,"Parent:");
1124 pt = proto_item_add_subtree(pi,0);
1125 add_oid_debug_subtree(oid_info->parent, pt);
1136 * indent-tabs-mode: tabs
1139 * ex: set shiftwidth=8 tabstop=8 noexpandtab
1140 * :indentSize=8:tabSize=8:noTabs=false: