Coverage Report

Created: 2025-11-11 06:54

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/net-snmp/snmplib/parse.c
Line
Count
Source
1
/*
2
 * parse.c
3
 *
4
 */
5
/* Portions of this file are subject to the following copyrights.  See
6
 * the Net-SNMP's COPYING file for more details and other copyrights
7
 * that may apply:
8
 */
9
/******************************************************************
10
        Copyright 1989, 1991, 1992 by Carnegie Mellon University
11
12
                      All Rights Reserved
13
14
Permission to use, copy, modify, and distribute this software and its
15
documentation for any purpose and without fee is hereby granted,
16
provided that the above copyright notice appear in all copies and that
17
both that copyright notice and this permission notice appear in
18
supporting documentation, and that the name of CMU not be
19
used in advertising or publicity pertaining to distribution of the
20
software without specific, written prior permission.
21
22
CMU DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
23
ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
24
CMU BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
25
ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
26
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
27
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
28
SOFTWARE.
29
******************************************************************/
30
/*
31
 * Copyright © 2003 Sun Microsystems, Inc. All rights reserved.
32
 * Use is subject to license terms specified in the COPYING file
33
 * distributed with the Net-SNMP package.
34
 */
35
#include <net-snmp/net-snmp-config.h>
36
#include <net-snmp/net-snmp-features.h>
37
38
#ifndef NETSNMP_DISABLE_MIB_LOADING
39
40
#ifdef HAVE_LIMITS_H
41
#include <limits.h>
42
#endif
43
#include <stdio.h>
44
#ifdef HAVE_STDLIB_H
45
#include <stdlib.h>
46
#endif
47
#ifdef HAVE_STRING_H
48
#include <string.h>
49
#else
50
#include <strings.h>
51
#endif
52
#include <ctype.h>
53
#include <sys/types.h>
54
#ifdef HAVE_SYS_STAT_H
55
#include <sys/stat.h>
56
#endif
57
58
#ifdef HAVE_DIRENT_H
59
#include <dirent.h>
60
#endif
61
#ifdef TIME_WITH_SYS_TIME
62
# include <sys/time.h>
63
# include <time.h>
64
#else
65
# ifdef HAVE_SYS_TIME_H
66
#  include <sys/time.h>
67
# else
68
#  include <time.h>
69
# endif
70
#endif
71
#ifdef HAVE_NETINET_IN_H
72
#include <netinet/in.h>
73
#endif
74
#if defined(HAVE_REGEX_H) && defined(HAVE_REGCOMP)
75
#include <regex.h>
76
#endif
77
#ifdef HAVE_UNISTD_H
78
#include <unistd.h>
79
#endif
80
81
#include <errno.h>
82
83
#include <net-snmp/types.h>
84
#include <net-snmp/output_api.h>
85
#include <net-snmp/config_api.h>
86
#include <net-snmp/utilities.h>
87
88
#include <net-snmp/library/parse.h>
89
#include <net-snmp/library/mib.h>
90
#include <net-snmp/library/snmp_api.h>
91
#include <net-snmp/library/tools.h>
92
93
netsnmp_feature_child_of(find_module, mib_api);
94
netsnmp_feature_child_of(get_tc_description, mib_api);
95
96
/*
97
 * A linked list of nodes.
98
 */
99
struct node {
100
    struct node    *next;
101
    char           *label;  /* This node's (unique) textual name */
102
    u_long          subid;  /* This node's integer subidentifier */
103
    int             modid;  /* The module containing this node */
104
    char           *parent; /* The parent's textual name */
105
    int             tc_index; /* index into tclist (-1 if NA) */
106
    int             type;   /* The type of object this represents */
107
    int             access;
108
    int             status;
109
    struct enum_list *enums; /* (optional) list of enumerated integers */
110
    struct range_list *ranges;
111
    struct index_list *indexes;
112
    char           *augments;
113
    struct varbind_list *varbinds;
114
    char           *hint;
115
    char           *units;
116
    char           *description; /* description (a quoted string) */
117
    char           *reference; /* references (a quoted string) */
118
    char           *defaultValue;
119
    char           *filename;
120
    int             lineno;
121
};
122
123
/*
124
 * This is one element of an object identifier with either an integer
125
 * subidentifier, or a textual string label, or both.
126
 * The subid is -1 if not present, and label is NULL if not present.
127
 */
128
struct subid_s {
129
    int             subid;
130
    int             modid;
131
    char           *label;
132
};
133
134
1
#define TC_INCR 100
135
struct tc {                     /* textual conventions */
136
    int             type;
137
    int             modid;
138
    char           *descriptor;
139
    char           *hint;
140
    struct enum_list *enums;
141
    struct range_list *ranges;
142
    char           *description;
143
    int             lineno;
144
} *tclist;
145
int tc_alloc;
146
147
static int      mibLine;
148
static const char *File = "(none)";
149
static int      anonymous;
150
151
struct objgroup {
152
    char           *name;
153
    int             line;
154
    struct objgroup *next;
155
}              *objgroups = NULL, *objects = NULL, *notifs = NULL;
156
157
22.5k
#define SYNTAX_MASK     0x80
158
/*
159
 * types of tokens
160
 * Tokens with the SYNTAX_MASK bit set are syntax tokens 
161
 */
162
4.84k
#define CONTINUE    -1
163
1.27M
#define ENDOFFILE   0
164
1.24M
#define LABEL       1
165
#define SUBTREE     2
166
0
#define SYNTAX      3
167
1
#define OBJID       (4 | SYNTAX_MASK)
168
1
#define OCTETSTR    (5 | SYNTAX_MASK)
169
1.31k
#define INTEGER     (6 | SYNTAX_MASK)
170
1.31k
#define NETADDR     (7 | SYNTAX_MASK)
171
1.31k
#define IPADDR      (8 | SYNTAX_MASK)
172
1.31k
#define COUNTER     (9 | SYNTAX_MASK)
173
1.31k
#define GAUGE       (10 | SYNTAX_MASK)
174
1.31k
#define TIMETICKS   (11 | SYNTAX_MASK)
175
1.31k
#define KW_OPAQUE   (12 | SYNTAX_MASK)
176
1
#define NUL         (13 | SYNTAX_MASK)
177
1.53k
#define SEQUENCE    14
178
0
#define OF          15          /* SEQUENCE OF */
179
0
#define OBJTYPE     16
180
0
#define ACCESS      17
181
0
#define READONLY    18
182
0
#define READWRITE   19
183
0
#define WRITEONLY   20
184
#ifdef NOACCESS
185
#undef NOACCESS                 /* agent 'NOACCESS' token */
186
#endif
187
0
#define NOACCESS    21
188
0
#define STATUS      22
189
0
#define MANDATORY   23
190
0
#define KW_OPTIONAL    24
191
0
#define OBSOLETE    25
192
/*
193
 * #define RECOMMENDED 26 
194
 */
195
#define PUNCT       27
196
54.4k
#define EQUALS      28
197
11.2k
#define NUMBER      29
198
7.68k
#define LEFTBRACKET 30
199
2.25M
#define RIGHTBRACKET 31
200
6.27k
#define LEFTPAREN   32
201
4.68k
#define RIGHTPAREN  33
202
1.57k
#define COMMA       34
203
0
#define DESCRIPTION 35
204
2.01k
#define QUOTESTRING 36
205
0
#define INDEX       37
206
0
#define DEFVAL      38
207
0
#define DEPRECATED  39
208
0
#define SIZE        40
209
1
#define BITSTRING   (41 | SYNTAX_MASK)
210
1.31k
#define NSAPADDRESS (42 | SYNTAX_MASK)
211
1.31k
#define COUNTER64   (43 | SYNTAX_MASK)
212
1
#define OBJGROUP    44
213
1
#define NOTIFTYPE   45
214
0
#define AUGMENTS    46
215
1
#define COMPLIANCE  47
216
0
#define READCREATE  48
217
0
#define UNITS       49
218
0
#define REFERENCE   50
219
0
#define NUM_ENTRIES 51
220
1
#define MODULEIDENTITY 52
221
0
#define LASTUPDATED 53
222
0
#define ORGANIZATION 54
223
0
#define CONTACTINFO 55
224
1.31k
#define UINTEGER32 (56 | SYNTAX_MASK)
225
0
#define CURRENT     57
226
35
#define DEFINITIONS 58
227
0
#define END         59
228
1.38k
#define SEMI        60
229
1
#define TRAPTYPE    61
230
0
#define ENTERPRISE  62
231
/*
232
 * #define DISPLAYSTR (63 | SYNTAX_MASK) 
233
 */
234
111k
#define BEGIN       64
235
0
#define IMPORTS     65
236
0
#define EXPORTS     66
237
0
#define ACCNOTIFY   67
238
1.35k
#define BAR         68
239
55
#define RANGE       69
240
133
#define CONVENTION  70
241
0
#define DISPLAYHINT 71
242
0
#define FROM        72
243
1
#define AGENTCAP    73
244
569
#define MACRO       74
245
0
#define IMPLIED     75
246
0
#define SUPPORTS    76
247
0
#define INCLUDES    77
248
0
#define VARIATION   78
249
0
#define REVISION    79
250
0
#define NOTIMPL     80
251
0
#define OBJECTS     81
252
0
#define NOTIFICATIONS 82
253
0
#define MODULE      83
254
0
#define MINACCESS   84
255
0
#define PRODREL     85
256
0
#define WRSYNTAX    86
257
0
#define CREATEREQ   87
258
1
#define NOTIFGROUP  88
259
0
#define MANDATORYGROUPS 89
260
0
#define GROUP     90
261
156
#define OBJECT      91
262
5
#define IDENTIFIER  92
263
769
#define CHOICE      93
264
1.91k
#define LEFTSQBRACK 95
265
8.51k
#define RIGHTSQBRACK  96
266
244
#define IMPLICIT    97
267
1.31k
#define APPSYNTAX (98 | SYNTAX_MASK)
268
1.31k
#define OBJSYNTAX (99 | SYNTAX_MASK)
269
1.31k
#define SIMPLESYNTAX  (100 | SYNTAX_MASK)
270
1.31k
#define OBJNAME   (101 | SYNTAX_MASK)
271
1.31k
#define NOTIFNAME (102 | SYNTAX_MASK)
272
0
#define VARIABLES 103
273
1.31k
#define UNSIGNED32  (104 | SYNTAX_MASK)
274
1.31k
#define INTEGER32 (105 | SYNTAX_MASK)
275
1
#define OBJIDENTITY 106
276
/*
277
 * Beware of reaching SYNTAX_MASK (0x80) 
278
 */
279
280
struct tok {
281
    const char     *name;       /* token name */
282
    int             len;        /* length not counting nul */
283
    int             token;      /* value */
284
    int             hash;       /* hash of name */
285
    struct tok     *next;       /* pointer to next in hash table */
286
};
287
288
289
static struct tok tokens[] = {
290
    {"obsolete", sizeof("obsolete") - 1, OBSOLETE}
291
    ,
292
    {"Opaque", sizeof("Opaque") - 1, KW_OPAQUE}
293
    ,
294
    {"optional", sizeof("optional") - 1, KW_OPTIONAL}
295
    ,
296
    {"LAST-UPDATED", sizeof("LAST-UPDATED") - 1, LASTUPDATED}
297
    ,
298
    {"ORGANIZATION", sizeof("ORGANIZATION") - 1, ORGANIZATION}
299
    ,
300
    {"CONTACT-INFO", sizeof("CONTACT-INFO") - 1, CONTACTINFO}
301
    ,
302
    {"MODULE-IDENTITY", sizeof("MODULE-IDENTITY") - 1, MODULEIDENTITY}
303
    ,
304
    {"MODULE-COMPLIANCE", sizeof("MODULE-COMPLIANCE") - 1, COMPLIANCE}
305
    ,
306
    {"DEFINITIONS", sizeof("DEFINITIONS") - 1, DEFINITIONS}
307
    ,
308
    {"END", sizeof("END") - 1, END}
309
    ,
310
    {"AUGMENTS", sizeof("AUGMENTS") - 1, AUGMENTS}
311
    ,
312
    {"not-accessible", sizeof("not-accessible") - 1, NOACCESS}
313
    ,
314
    {"write-only", sizeof("write-only") - 1, WRITEONLY}
315
    ,
316
    {"NsapAddress", sizeof("NsapAddress") - 1, NSAPADDRESS}
317
    ,
318
    {"UNITS", sizeof("Units") - 1, UNITS}
319
    ,
320
    {"REFERENCE", sizeof("REFERENCE") - 1, REFERENCE}
321
    ,
322
    {"NUM-ENTRIES", sizeof("NUM-ENTRIES") - 1, NUM_ENTRIES}
323
    ,
324
    {"BITSTRING", sizeof("BITSTRING") - 1, BITSTRING}
325
    ,
326
    {"BIT", sizeof("BIT") - 1, CONTINUE}
327
    ,
328
    {"BITS", sizeof("BITS") - 1, BITSTRING}
329
    ,
330
    {"Counter64", sizeof("Counter64") - 1, COUNTER64}
331
    ,
332
    {"TimeTicks", sizeof("TimeTicks") - 1, TIMETICKS}
333
    ,
334
    {"NOTIFICATION-TYPE", sizeof("NOTIFICATION-TYPE") - 1, NOTIFTYPE}
335
    ,
336
    {"OBJECT-GROUP", sizeof("OBJECT-GROUP") - 1, OBJGROUP}
337
    ,
338
    {"OBJECT-IDENTITY", sizeof("OBJECT-IDENTITY") - 1, OBJIDENTITY}
339
    ,
340
    {"IDENTIFIER", sizeof("IDENTIFIER") - 1, IDENTIFIER}
341
    ,
342
    {"OBJECT", sizeof("OBJECT") - 1, OBJECT}
343
    ,
344
    {"NetworkAddress", sizeof("NetworkAddress") - 1, NETADDR}
345
    ,
346
    {"Gauge", sizeof("Gauge") - 1, GAUGE}
347
    ,
348
    {"Gauge32", sizeof("Gauge32") - 1, GAUGE}
349
    ,
350
    {"Unsigned32", sizeof("Unsigned32") - 1, UNSIGNED32}
351
    ,
352
    {"read-write", sizeof("read-write") - 1, READWRITE}
353
    ,
354
    {"read-create", sizeof("read-create") - 1, READCREATE}
355
    ,
356
    {"OCTETSTRING", sizeof("OCTETSTRING") - 1, OCTETSTR}
357
    ,
358
    {"OCTET", sizeof("OCTET") - 1, CONTINUE}
359
    ,
360
    {"OF", sizeof("OF") - 1, OF}
361
    ,
362
    {"SEQUENCE", sizeof("SEQUENCE") - 1, SEQUENCE}
363
    ,
364
    {"NULL", sizeof("NULL") - 1, NUL}
365
    ,
366
    {"IpAddress", sizeof("IpAddress") - 1, IPADDR}
367
    ,
368
    {"UInteger32", sizeof("UInteger32") - 1, UINTEGER32}
369
    ,
370
    {"INTEGER", sizeof("INTEGER") - 1, INTEGER}
371
    ,
372
    {"Integer32", sizeof("Integer32") - 1, INTEGER32}
373
    ,
374
    {"Counter", sizeof("Counter") - 1, COUNTER}
375
    ,
376
    {"Counter32", sizeof("Counter32") - 1, COUNTER}
377
    ,
378
    {"read-only", sizeof("read-only") - 1, READONLY}
379
    ,
380
    {"DESCRIPTION", sizeof("DESCRIPTION") - 1, DESCRIPTION}
381
    ,
382
    {"INDEX", sizeof("INDEX") - 1, INDEX}
383
    ,
384
    {"DEFVAL", sizeof("DEFVAL") - 1, DEFVAL}
385
    ,
386
    {"deprecated", sizeof("deprecated") - 1, DEPRECATED}
387
    ,
388
    {"SIZE", sizeof("SIZE") - 1, SIZE}
389
    ,
390
    {"MAX-ACCESS", sizeof("MAX-ACCESS") - 1, ACCESS}
391
    ,
392
    {"ACCESS", sizeof("ACCESS") - 1, ACCESS}
393
    ,
394
    {"mandatory", sizeof("mandatory") - 1, MANDATORY}
395
    ,
396
    {"current", sizeof("current") - 1, CURRENT}
397
    ,
398
    {"STATUS", sizeof("STATUS") - 1, STATUS}
399
    ,
400
    {"SYNTAX", sizeof("SYNTAX") - 1, SYNTAX}
401
    ,
402
    {"OBJECT-TYPE", sizeof("OBJECT-TYPE") - 1, OBJTYPE}
403
    ,
404
    {"TRAP-TYPE", sizeof("TRAP-TYPE") - 1, TRAPTYPE}
405
    ,
406
    {"ENTERPRISE", sizeof("ENTERPRISE") - 1, ENTERPRISE}
407
    ,
408
    {"BEGIN", sizeof("BEGIN") - 1, BEGIN}
409
    ,
410
    {"IMPORTS", sizeof("IMPORTS") - 1, IMPORTS}
411
    ,
412
    {"EXPORTS", sizeof("EXPORTS") - 1, EXPORTS}
413
    ,
414
    {"accessible-for-notify", sizeof("accessible-for-notify") - 1,
415
     ACCNOTIFY}
416
    ,
417
    {"TEXTUAL-CONVENTION", sizeof("TEXTUAL-CONVENTION") - 1, CONVENTION}
418
    ,
419
    {"NOTIFICATION-GROUP", sizeof("NOTIFICATION-GROUP") - 1, NOTIFGROUP}
420
    ,
421
    {"DISPLAY-HINT", sizeof("DISPLAY-HINT") - 1, DISPLAYHINT}
422
    ,
423
    {"FROM", sizeof("FROM") - 1, FROM}
424
    ,
425
    {"AGENT-CAPABILITIES", sizeof("AGENT-CAPABILITIES") - 1, AGENTCAP}
426
    ,
427
    {"MACRO", sizeof("MACRO") - 1, MACRO}
428
    ,
429
    {"IMPLIED", sizeof("IMPLIED") - 1, IMPLIED}
430
    ,
431
    {"SUPPORTS", sizeof("SUPPORTS") - 1, SUPPORTS}
432
    ,
433
    {"INCLUDES", sizeof("INCLUDES") - 1, INCLUDES}
434
    ,
435
    {"VARIATION", sizeof("VARIATION") - 1, VARIATION}
436
    ,
437
    {"REVISION", sizeof("REVISION") - 1, REVISION}
438
    ,
439
    {"not-implemented", sizeof("not-implemented") - 1, NOTIMPL}
440
    ,
441
    {"OBJECTS", sizeof("OBJECTS") - 1, OBJECTS}
442
    ,
443
    {"NOTIFICATIONS", sizeof("NOTIFICATIONS") - 1, NOTIFICATIONS}
444
    ,
445
    {"MODULE", sizeof("MODULE") - 1, MODULE}
446
    ,
447
    {"MIN-ACCESS", sizeof("MIN-ACCESS") - 1, MINACCESS}
448
    ,
449
    {"PRODUCT-RELEASE", sizeof("PRODUCT-RELEASE") - 1, PRODREL}
450
    ,
451
    {"WRITE-SYNTAX", sizeof("WRITE-SYNTAX") - 1, WRSYNTAX}
452
    ,
453
    {"CREATION-REQUIRES", sizeof("CREATION-REQUIRES") - 1, CREATEREQ}
454
    ,
455
    {"MANDATORY-GROUPS", sizeof("MANDATORY-GROUPS") - 1, MANDATORYGROUPS}
456
    ,
457
    {"GROUP", sizeof("GROUP") - 1, GROUP}
458
    ,
459
    {"CHOICE", sizeof("CHOICE") - 1, CHOICE}
460
    ,
461
    {"IMPLICIT", sizeof("IMPLICIT") - 1, IMPLICIT}
462
    ,
463
    {"ObjectSyntax", sizeof("ObjectSyntax") - 1, OBJSYNTAX}
464
    ,
465
    {"SimpleSyntax", sizeof("SimpleSyntax") - 1, SIMPLESYNTAX}
466
    ,
467
    {"ApplicationSyntax", sizeof("ApplicationSyntax") - 1, APPSYNTAX}
468
    ,
469
    {"ObjectName", sizeof("ObjectName") - 1, OBJNAME}
470
    ,
471
    {"NotificationName", sizeof("NotificationName") - 1, NOTIFNAME}
472
    ,
473
    {"VARIABLES", sizeof("VARIABLES") - 1, VARIABLES}
474
    ,
475
    {NULL}
476
};
477
478
static struct module_compatability *module_map_head;
479
static struct module_compatability module_map[] = {
480
    {"RFC1065-SMI", "RFC1155-SMI", NULL, 0},
481
    {"RFC1066-MIB", "RFC1156-MIB", NULL, 0},
482
    /*
483
     * 'mib' -> 'mib-2' 
484
     */
485
    {"RFC1156-MIB", "RFC1158-MIB", NULL, 0},
486
    /*
487
     * 'snmpEnableAuthTraps' -> 'snmpEnableAuthenTraps' 
488
     */
489
    {"RFC1158-MIB", "RFC1213-MIB", NULL, 0},
490
    /*
491
     * 'nullOID' -> 'zeroDotZero' 
492
     */
493
    {"RFC1155-SMI", "SNMPv2-SMI", NULL, 0},
494
    {"RFC1213-MIB", "SNMPv2-SMI", "mib-2", 0},
495
    {"RFC1213-MIB", "SNMPv2-MIB", "sys", 3},
496
    {"RFC1213-MIB", "IF-MIB", "if", 2},
497
    {"RFC1213-MIB", "IP-MIB", "ip", 2},
498
    {"RFC1213-MIB", "IP-MIB", "icmp", 4},
499
    {"RFC1213-MIB", "TCP-MIB", "tcp", 3},
500
    {"RFC1213-MIB", "UDP-MIB", "udp", 3},
501
    {"RFC1213-MIB", "SNMPv2-SMI", "transmission", 0},
502
    {"RFC1213-MIB", "SNMPv2-MIB", "snmp", 4},
503
    {"RFC1231-MIB", "TOKENRING-MIB", NULL, 0},
504
    {"RFC1271-MIB", "RMON-MIB", NULL, 0},
505
    {"RFC1286-MIB", "SOURCE-ROUTING-MIB", "dot1dSr", 7},
506
    {"RFC1286-MIB", "BRIDGE-MIB", NULL, 0},
507
    {"RFC1315-MIB", "FRAME-RELAY-DTE-MIB", NULL, 0},
508
    {"RFC1316-MIB", "CHARACTER-MIB", NULL, 0},
509
    {"RFC1406-MIB", "DS1-MIB", NULL, 0},
510
    {"RFC-1213", "RFC1213-MIB", NULL, 0},
511
};
512
513
1.17k
#define MODULE_NOT_FOUND  0
514
645
#define MODULE_LOADED_OK  1
515
524
#define MODULE_ALREADY_LOADED 2
516
/*
517
 * #define MODULE_LOAD_FAILED   3       
518
 */
519
0
#define MODULE_LOAD_FAILED  MODULE_NOT_FOUND
520
2.57k
#define MODULE_SYNTAX_ERROR     4
521
522
int gMibError = 0,gLoop = 0;
523
static char *gpMibErrorString;
524
char gMibNames[STRINGMAX];
525
526
73.0k
#define HASHSIZE        32
527
73.0k
#define BUCKET(x)       (x & (HASHSIZE-1))
528
529
3
#define NHASHSIZE    128
530
3
#define NBUCKET(x)   (x & (NHASHSIZE-1))
531
532
static struct tok *buckets[HASHSIZE];
533
534
static struct node *nbuckets[NHASHSIZE];
535
static struct tree *tbuckets[NHASHSIZE];
536
static struct module *module_head = NULL;
537
538
static struct node *orphan_nodes = NULL;
539
NETSNMP_IMPORT struct tree *tree_head;
540
struct tree        *tree_head = NULL;
541
542
0
#define NUMBER_OF_ROOT_NODES  3
543
static struct module_import root_imports[NUMBER_OF_ROOT_NODES];
544
545
static int      current_module = 0;
546
static int      max_module = 0;
547
static int      first_err_module = 1;
548
static char    *last_err_module = NULL; /* no repeats on "Cannot find module..." */
549
550
static void     tree_from_node(struct tree *tp, struct node *np);
551
static void     do_subtree(struct tree *, struct node **);
552
static void     do_linkup(struct module *, struct node *);
553
static void     dump_module_list(void);
554
static int      get_token(FILE *, char *, int);
555
static int      parseQuoteString(FILE *, char *, int);
556
static int      tossObjectIdentifier(FILE *);
557
static int      name_hash(const char *);
558
static void     init_node_hash(struct node *);
559
static void     print_error(const char *, const char *, int);
560
static void     free_tree(struct tree *);
561
static void     free_partial_tree(struct tree *, int);
562
static void     free_node(struct node *);
563
static void     build_translation_table(void);
564
static void     init_tree_roots(void);
565
static void     merge_anon_children(struct tree *, struct tree *);
566
static void     unlink_tbucket(struct tree *);
567
static void     unlink_tree(struct tree *);
568
static struct node *parse_objectid(FILE *, char *);
569
static int      get_tc(const char *, int, int *, struct enum_list **,
570
                       struct range_list **, char **);
571
static int      get_tc_index(const char *, int);
572
static struct enum_list *parse_enumlist(FILE *, struct enum_list **);
573
static struct range_list *parse_ranges(FILE * fp, struct range_list **);
574
static struct node *parse_asntype(FILE *, char *, int *, char *);
575
static struct node *parse_objecttype(FILE *, char *);
576
static struct node *parse_objectgroup(FILE *, char *, int,
577
                                      struct objgroup **);
578
static struct node *parse_notificationDefinition(FILE *, char *);
579
static struct node *parse_trapDefinition(FILE *, char *);
580
static struct node *parse_compliance(FILE *, char *);
581
static struct node *parse_capabilities(FILE *, char *);
582
static struct node *parse_moduleIdentity(FILE *, char *);
583
static struct node *parse_macro(FILE *, char *);
584
static void     parse_imports(FILE *);
585
static struct node *parse(FILE *);
586
587
static int     read_module_internal(const char *);
588
static int     read_module_replacements(const char *);
589
static int     read_import_replacements(const char *,
590
                                         struct module_import *);
591
592
static struct node *merge_parse_objectid(struct node *, FILE *, char *);
593
static struct index_list *getIndexes(FILE * fp, struct index_list **);
594
static struct varbind_list *getVarbinds(FILE * fp, struct varbind_list **);
595
static void     free_indexes(struct index_list **);
596
static void     free_varbinds(struct varbind_list **);
597
static void     free_ranges(struct range_list **);
598
static void     free_enums(struct enum_list **);
599
static struct range_list *copy_ranges(struct range_list *);
600
static struct enum_list *copy_enums(struct enum_list *);
601
602
static u_int    compute_match(const char *search_base, const char *key);
603
604
void
605
snmp_mib_toggle_options_usage(const char *lead, FILE * outf)
606
0
{
607
0
    fprintf(outf, "%su:  %sallow the use of underlines in MIB symbols\n",
608
0
            lead, ((netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID,
609
0
             NETSNMP_DS_LIB_MIB_PARSE_LABEL)) ?
610
0
       "dis" : ""));
611
0
    fprintf(outf, "%sc:  %sallow the use of \"--\" to terminate comments\n",
612
0
            lead, ((netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID,
613
0
             NETSNMP_DS_LIB_MIB_COMMENT_TERM)) ?
614
0
       "" : "dis"));
615
616
0
    fprintf(outf, "%sd:  %ssave the DESCRIPTIONs of the MIB objects\n",
617
0
            lead, ((netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
618
0
             NETSNMP_DS_LIB_SAVE_MIB_DESCRS)) ?
619
0
       "do not " : ""));
620
621
0
    fprintf(outf, "%se:  disable errors when MIB symbols conflict\n", lead);
622
623
0
    fprintf(outf, "%sw:  enable warnings when MIB symbols conflict\n", lead);
624
625
0
    fprintf(outf, "%sW:  enable detailed warnings when MIB symbols conflict\n",
626
0
            lead);
627
628
0
    fprintf(outf, "%sR:  replace MIB symbols from latest module\n", lead);
629
0
}
630
631
char           *
632
snmp_mib_toggle_options(char *options)
633
48
{
634
48
    if (options) {
635
1.85k
        while (*options) {
636
1.83k
            switch (*options) {
637
376
            case 'u':
638
376
                netsnmp_ds_set_boolean(NETSNMP_DS_LIBRARY_ID, NETSNMP_DS_LIB_MIB_PARSE_LABEL,
639
376
                               !netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID,
640
376
                                               NETSNMP_DS_LIB_MIB_PARSE_LABEL));
641
376
                break;
642
643
333
            case 'c':
644
333
                netsnmp_ds_toggle_boolean(NETSNMP_DS_LIBRARY_ID,
645
333
            NETSNMP_DS_LIB_MIB_COMMENT_TERM);
646
333
                break;
647
648
247
            case 'e':
649
247
                netsnmp_ds_toggle_boolean(NETSNMP_DS_LIBRARY_ID,
650
247
            NETSNMP_DS_LIB_MIB_ERRORS);
651
247
                break;
652
653
90
            case 'w':
654
90
                netsnmp_ds_set_int(NETSNMP_DS_LIBRARY_ID,
655
90
           NETSNMP_DS_LIB_MIB_WARNINGS, 1);
656
90
                break;
657
658
332
            case 'W':
659
332
                netsnmp_ds_set_int(NETSNMP_DS_LIBRARY_ID,
660
332
           NETSNMP_DS_LIB_MIB_WARNINGS, 2);
661
332
                break;
662
663
277
            case 'd':
664
277
                netsnmp_ds_toggle_boolean(NETSNMP_DS_LIBRARY_ID, 
665
277
            NETSNMP_DS_LIB_SAVE_MIB_DESCRS);
666
277
                break;
667
668
154
            case 'R':
669
154
                netsnmp_ds_toggle_boolean(NETSNMP_DS_LIBRARY_ID, 
670
154
            NETSNMP_DS_LIB_MIB_REPLACE);
671
154
                break;
672
673
26
            default:
674
                /*
675
                 * return at the unknown option 
676
                 */
677
26
                return options;
678
1.83k
            }
679
1.80k
            options++;
680
1.80k
        }
681
48
    }
682
22
    return NULL;
683
48
}
684
685
static int
686
name_hash(const char *name)
687
95
{
688
95
    int             hash = 0;
689
95
    const char     *cp;
690
691
95
    if (!name)
692
0
        return 0;
693
1.00k
    for (cp = name; *cp; cp++)
694
907
        hash += tolower((unsigned char)(*cp));
695
95
    return (hash);
696
95
}
697
698
void
699
netsnmp_init_mib_internals(void)
700
1.13k
{
701
1.13k
    register struct tok *tp;
702
1.13k
    register int    b, i;
703
1.13k
    int             max_modc;
704
705
1.13k
    if (tree_head)
706
1.13k
        return;
707
708
    /*
709
     * Set up hash list of pre-defined tokens
710
     */
711
1
    memset(buckets, 0, sizeof(buckets));
712
93
    for (tp = tokens; tp->name; tp++) {
713
92
        tp->hash = name_hash(tp->name);
714
92
        b = BUCKET(tp->hash);
715
92
        if (buckets[b])
716
60
            tp->next = buckets[b];      /* BUG ??? */
717
92
        buckets[b] = tp;
718
92
    }
719
720
    /*
721
     * Initialise other internal structures
722
     */
723
724
1
    max_modc = sizeof(module_map) / sizeof(module_map[0]) - 1;
725
22
    for (i = 0; i < max_modc; ++i)
726
21
        module_map[i].next = &(module_map[i + 1]);
727
1
    module_map[max_modc].next = NULL;
728
1
    module_map_head = module_map;
729
730
1
    memset(nbuckets, 0, sizeof(nbuckets));
731
1
    memset(tbuckets, 0, sizeof(tbuckets));
732
1
    tc_alloc = TC_INCR;
733
1
    tclist = calloc(tc_alloc, sizeof(struct tc));
734
1
    build_translation_table();
735
1
    init_tree_roots();          /* Set up initial roots */
736
    /*
737
     * Relies on 'add_mibdir' having set up the modules 
738
     */
739
1
}
740
741
#ifndef NETSNMP_NO_LEGACY_DEFINITIONS
742
void
743
init_mib_internals(void)
744
0
{
745
0
    netsnmp_init_mib_internals();
746
0
}
747
#endif
748
749
static void
750
init_node_hash(struct node *nodes)
751
0
{
752
0
    struct node    *np, *nextp;
753
0
    int             hash;
754
755
0
    memset(nbuckets, 0, sizeof(nbuckets));
756
0
    for (np = nodes; np;) {
757
0
        nextp = np->next;
758
0
        hash = NBUCKET(name_hash(np->parent));
759
0
        np->next = nbuckets[hash];
760
0
        nbuckets[hash] = np;
761
0
        np = nextp;
762
0
    }
763
0
}
764
765
static int      erroneousMibs = 0;
766
767
netsnmp_feature_child_of(parse_get_error_count, netsnmp_unused);
768
#ifndef NETSNMP_FEATURE_REMOVE_PARSE_GET_ERROR_COUNT
769
int
770
get_mib_parse_error_count(void)
771
0
{
772
0
    return erroneousMibs;
773
0
}
774
#endif /* NETSNMP_FEATURE_REMOVE_PARSE_GET_ERROR_COUNT */
775
776
777
static void
778
print_error(const char *str, const char *token, int type)
779
1.79k
{
780
1.79k
    erroneousMibs++;
781
1.79k
    if (!netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID,
782
1.79k
                                NETSNMP_DS_LIB_MIB_ERRORS))
783
280
  return;
784
1.51k
    DEBUGMSGTL(("parse-mibs", "\n"));
785
1.51k
    if (type == ENDOFFILE)
786
219
        snmp_log(LOG_ERR, "%s (EOF): At line %d in %s\n", str, mibLine,
787
219
                 File);
788
1.29k
    else if (token && *token)
789
1.20k
        snmp_log(LOG_ERR, "%s (%s): At line %d in %s\n", str, token,
790
1.20k
                 mibLine, File);
791
91
    else
792
91
        snmp_log(LOG_ERR, "%s: At line %d in %s\n", str, mibLine, File);
793
1.51k
}
794
795
static void
796
print_module_not_found(const char *cp)
797
47
{
798
47
    if (first_err_module) {
799
1
        snmp_log(LOG_ERR, "MIB search path: %s\n",
800
1
                           netsnmp_get_mib_directory());
801
1
        first_err_module = 0;
802
1
    }
803
47
    if (!last_err_module || strcmp(cp, last_err_module))
804
47
        print_error("Cannot find module", cp, CONTINUE);
805
47
    if (last_err_module)
806
46
        free(last_err_module);
807
47
    last_err_module = strdup(cp);
808
47
}
809
810
static struct node *
811
alloc_node(int modid)
812
653
{
813
653
    struct node    *np;
814
815
653
    np = calloc(1, sizeof(struct node));
816
653
    if (!np)
817
0
        return NULL;
818
819
653
    np->tc_index = -1;
820
653
    np->modid = modid;
821
653
    np->filename = strdup(File);
822
653
    np->lineno = mibLine;
823
824
653
    return np;
825
653
}
826
827
static void
828
unlink_tbucket(struct tree *tp)
829
0
{
830
0
    int             hash = NBUCKET(name_hash(tp->label));
831
0
    struct tree    *otp = NULL, *ntp = tbuckets[hash];
832
833
0
    while (ntp && ntp != tp) {
834
0
        otp = ntp;
835
0
        ntp = ntp->next;
836
0
    }
837
0
    if (!ntp)
838
0
        snmp_log(LOG_EMERG, "Can't find %s in tbuckets\n", tp->label);
839
0
    else if (otp)
840
0
        otp->next = ntp->next;
841
0
    else
842
0
        tbuckets[hash] = tp->next;
843
0
}
844
845
static void
846
unlink_tree(struct tree *tp)
847
0
{
848
0
    struct tree    *otp = NULL, *ntp = tp->parent;
849
850
0
    if (!ntp) {                 /* this tree has no parent */
851
0
        DEBUGMSGTL(("unlink_tree", "Tree node %s has no parent\n",
852
0
                    tp->label));
853
0
    } else {
854
0
        ntp = ntp->child_list;
855
856
0
        while (ntp && ntp != tp) {
857
0
            otp = ntp;
858
0
            ntp = ntp->next_peer;
859
0
        }
860
0
        if (!ntp)
861
0
            snmp_log(LOG_EMERG, "Can't find %s in %s's children\n",
862
0
                     tp->label, tp->parent->label);
863
0
        else if (otp)
864
0
            otp->next_peer = ntp->next_peer;
865
0
        else
866
0
            tp->parent->child_list = tp->next_peer;
867
0
    }
868
869
0
    if (tree_head == tp)
870
0
        tree_head = tp->next_peer;
871
0
}
872
873
static void
874
free_partial_tree(struct tree *tp, int keep_label)
875
0
{
876
0
    if (!tp)
877
0
        return;
878
879
    /*
880
     * remove the data from this tree node 
881
     */
882
0
    free_enums(&tp->enums);
883
0
    free_ranges(&tp->ranges);
884
0
    free_indexes(&tp->indexes);
885
0
    free_varbinds(&tp->varbinds);
886
0
    if (!keep_label)
887
0
        SNMP_FREE(tp->label);
888
0
    SNMP_FREE(tp->hint);
889
0
    SNMP_FREE(tp->units);
890
0
    SNMP_FREE(tp->description);
891
0
    SNMP_FREE(tp->reference);
892
0
    SNMP_FREE(tp->augments);
893
0
    SNMP_FREE(tp->defaultValue);
894
0
}
895
896
/*
897
 * free a tree node. Note: the node must already have been unlinked
898
 * from the tree when calling this routine
899
 */
900
static void
901
free_tree(struct tree *Tree)
902
0
{
903
0
    if (!Tree)
904
0
        return;
905
906
0
    unlink_tbucket(Tree);
907
0
    free_partial_tree(Tree, FALSE);
908
0
    if (Tree->module_list != &Tree->modid)
909
0
        free(Tree->module_list);
910
0
    free(Tree);
911
0
}
912
913
static void
914
free_node(struct node *np)
915
654
{
916
654
    if (!np)
917
1
        return;
918
919
653
    free_enums(&np->enums);
920
653
    free_ranges(&np->ranges);
921
653
    free_indexes(&np->indexes);
922
653
    free_varbinds(&np->varbinds);
923
653
    free(np->label);
924
653
    free(np->hint);
925
653
    free(np->units);
926
653
    free(np->description);
927
653
    free(np->reference);
928
653
    free(np->defaultValue);
929
653
    free(np->parent);
930
653
    free(np->augments);
931
653
    free(np->filename);
932
653
    free(np);
933
653
}
934
935
static void
936
print_range_value(FILE * fp, int type, struct range_list * rp)
937
0
{
938
0
    switch (type) {
939
0
    case TYPE_INTEGER:
940
0
    case TYPE_INTEGER32:
941
0
        if (rp->low == rp->high)
942
0
            fprintf(fp, "%d", rp->low);
943
0
        else
944
0
            fprintf(fp, "%d..%d", rp->low, rp->high);
945
0
        break;
946
0
    case TYPE_UNSIGNED32:
947
0
    case TYPE_OCTETSTR:
948
0
    case TYPE_GAUGE:
949
0
    case TYPE_UINTEGER:
950
0
        if (rp->low == rp->high)
951
0
            fprintf(fp, "%u", (unsigned)rp->low);
952
0
        else
953
0
            fprintf(fp, "%u..%u", (unsigned)rp->low, (unsigned)rp->high);
954
0
        break;
955
0
    default:
956
        /* No other range types allowed */
957
0
        break;
958
0
    }
959
0
}
960
961
#ifdef TEST
962
static void
963
print_nodes(FILE * fp, struct node *root)
964
{
965
    struct enum_list *ep;
966
    struct index_list *ip;
967
    struct varbind_list *vp;
968
    struct node    *np;
969
970
    for (np = root; np; np = np->next) {
971
        fprintf(fp, "%s ::= { %s %ld } (%d)\n", np->label, np->parent,
972
                np->subid, np->type);
973
        if (np->tc_index >= 0)
974
            fprintf(fp, "  TC = %s\n", tclist[np->tc_index].descriptor);
975
        if (np->enums) {
976
            fprintf(fp, "  Enums: \n");
977
            for (ep = np->enums; ep; ep = ep->next) {
978
                fprintf(fp, "    %s(%d)\n", ep->label, ep->value);
979
            }
980
        }
981
        if (np->ranges) {
982
            struct range_list *rp;
983
            fprintf(fp, "  Ranges: ");
984
            for (rp = np->ranges; rp; rp = rp->next) {
985
                fprintf(fp, "\n    ");
986
                print_range_value(fp, np->type, rp);
987
            }
988
            fprintf(fp, "\n");
989
        }
990
        if (np->indexes) {
991
            fprintf(fp, "  Indexes: \n");
992
            for (ip = np->indexes; ip; ip = ip->next) {
993
                fprintf(fp, "    %s\n", ip->ilabel);
994
            }
995
        }
996
        if (np->augments)
997
            fprintf(fp, "  Augments: %s\n", np->augments);
998
        if (np->varbinds) {
999
            fprintf(fp, "  Varbinds: \n");
1000
            for (vp = np->varbinds; vp; vp = vp->next) {
1001
                fprintf(fp, "    %s\n", vp->vblabel);
1002
            }
1003
        }
1004
        if (np->hint)
1005
            fprintf(fp, "  Hint: %s\n", np->hint);
1006
        if (np->units)
1007
            fprintf(fp, "  Units: %s\n", np->units);
1008
        if (np->defaultValue)
1009
            fprintf(fp, "  DefaultValue: %s\n", np->defaultValue);
1010
    }
1011
}
1012
#endif
1013
1014
void
1015
print_subtree(FILE * f, struct tree *tree, int count)
1016
0
{
1017
0
    struct tree    *tp;
1018
0
    int             i;
1019
0
    char            modbuf[256];
1020
1021
0
    for (i = 0; i < count; i++)
1022
0
        fprintf(f, "  ");
1023
0
    fprintf(f, "Children of %s(%ld):\n", tree->label, tree->subid);
1024
0
    count++;
1025
0
    for (tp = tree->child_list; tp; tp = tp->next_peer) {
1026
0
        for (i = 0; i < count; i++)
1027
0
            fprintf(f, "  ");
1028
0
        fprintf(f, "%s:%s(%ld) type=%d",
1029
0
                module_name(tp->module_list[0], modbuf),
1030
0
                tp->label, tp->subid, tp->type);
1031
0
        if (tp->tc_index != -1)
1032
0
            fprintf(f, " tc=%d", tp->tc_index);
1033
0
        if (tp->hint)
1034
0
            fprintf(f, " hint=%s", tp->hint);
1035
0
        if (tp->units)
1036
0
            fprintf(f, " units=%s", tp->units);
1037
0
        if (tp->number_modules > 1) {
1038
0
            fprintf(f, " modules:");
1039
0
            for (i = 1; i < tp->number_modules; i++)
1040
0
                fprintf(f, " %s", module_name(tp->module_list[i], modbuf));
1041
0
        }
1042
0
        fprintf(f, "\n");
1043
0
    }
1044
0
    for (tp = tree->child_list; tp; tp = tp->next_peer) {
1045
0
        if (tp->child_list)
1046
0
            print_subtree(f, tp, count);
1047
0
    }
1048
0
}
1049
1050
void
1051
print_ascii_dump_tree(FILE * f, struct tree *tree, int count)
1052
0
{
1053
0
    struct tree    *tp;
1054
1055
0
    count++;
1056
0
    for (tp = tree->child_list; tp; tp = tp->next_peer) {
1057
0
        fprintf(f, "%s OBJECT IDENTIFIER ::= { %s %ld }\n", tp->label,
1058
0
                tree->label, tp->subid);
1059
0
    }
1060
0
    for (tp = tree->child_list; tp; tp = tp->next_peer) {
1061
0
        if (tp->child_list)
1062
0
            print_ascii_dump_tree(f, tp, count);
1063
0
    }
1064
0
}
1065
1066
static int      translation_table[256];
1067
1068
static void
1069
build_translation_table(void)
1070
1
{
1071
1
    int             count;
1072
1073
257
    for (count = 0; count < 256; count++) {
1074
256
        switch (count) {
1075
1
        case OBJID:
1076
1
            translation_table[count] = TYPE_OBJID;
1077
1
            break;
1078
1
        case OCTETSTR:
1079
1
            translation_table[count] = TYPE_OCTETSTR;
1080
1
            break;
1081
1
        case INTEGER:
1082
1
            translation_table[count] = TYPE_INTEGER;
1083
1
            break;
1084
1
        case NETADDR:
1085
1
            translation_table[count] = TYPE_NETADDR;
1086
1
            break;
1087
1
        case IPADDR:
1088
1
            translation_table[count] = TYPE_IPADDR;
1089
1
            break;
1090
1
        case COUNTER:
1091
1
            translation_table[count] = TYPE_COUNTER;
1092
1
            break;
1093
1
        case GAUGE:
1094
1
            translation_table[count] = TYPE_GAUGE;
1095
1
            break;
1096
1
        case TIMETICKS:
1097
1
            translation_table[count] = TYPE_TIMETICKS;
1098
1
            break;
1099
1
        case KW_OPAQUE:
1100
1
            translation_table[count] = TYPE_OPAQUE;
1101
1
            break;
1102
1
        case NUL:
1103
1
            translation_table[count] = TYPE_NULL;
1104
1
            break;
1105
1
        case COUNTER64:
1106
1
            translation_table[count] = TYPE_COUNTER64;
1107
1
            break;
1108
1
        case BITSTRING:
1109
1
            translation_table[count] = TYPE_BITSTRING;
1110
1
            break;
1111
1
        case NSAPADDRESS:
1112
1
            translation_table[count] = TYPE_NSAPADDRESS;
1113
1
            break;
1114
1
        case INTEGER32:
1115
1
            translation_table[count] = TYPE_INTEGER32;
1116
1
            break;
1117
1
        case UINTEGER32:
1118
1
            translation_table[count] = TYPE_UINTEGER;
1119
1
            break;
1120
1
        case UNSIGNED32:
1121
1
            translation_table[count] = TYPE_UNSIGNED32;
1122
1
            break;
1123
1
        case TRAPTYPE:
1124
1
            translation_table[count] = TYPE_TRAPTYPE;
1125
1
            break;
1126
1
        case NOTIFTYPE:
1127
1
            translation_table[count] = TYPE_NOTIFTYPE;
1128
1
            break;
1129
1
        case NOTIFGROUP:
1130
1
            translation_table[count] = TYPE_NOTIFGROUP;
1131
1
            break;
1132
1
        case OBJGROUP:
1133
1
            translation_table[count] = TYPE_OBJGROUP;
1134
1
            break;
1135
1
        case MODULEIDENTITY:
1136
1
            translation_table[count] = TYPE_MODID;
1137
1
            break;
1138
1
        case OBJIDENTITY:
1139
1
            translation_table[count] = TYPE_OBJIDENTITY;
1140
1
            break;
1141
1
        case AGENTCAP:
1142
1
            translation_table[count] = TYPE_AGENTCAP;
1143
1
            break;
1144
1
        case COMPLIANCE:
1145
1
            translation_table[count] = TYPE_MODCOMP;
1146
1
            break;
1147
232
        default:
1148
232
            translation_table[count] = TYPE_OTHER;
1149
232
            break;
1150
256
        }
1151
256
    }
1152
1
}
1153
1154
static void
1155
init_tree_roots(void)
1156
1
{
1157
1
    struct tree    *tp, *lasttp;
1158
1
    int             base_modid;
1159
1
    int             hash;
1160
1161
1
    base_modid = which_module("SNMPv2-SMI");
1162
1
    if (base_modid == -1)
1163
1
        base_modid = which_module("RFC1155-SMI");
1164
1
    if (base_modid == -1)
1165
1
        base_modid = which_module("RFC1213-MIB");
1166
1167
    /*
1168
     * build root node 
1169
     */
1170
1
    tp = calloc(1, sizeof(struct tree));
1171
1
    if (tp == NULL)
1172
0
        return;
1173
1
    tp->label = strdup("joint-iso-ccitt");
1174
1
    tp->modid = base_modid;
1175
1
    tp->number_modules = 1;
1176
1
    tp->module_list = &(tp->modid);
1177
1
    tp->subid = 2;
1178
1
    tp->tc_index = -1;
1179
1
    set_function(tp);           /* from mib.c */
1180
1
    hash = NBUCKET(name_hash(tp->label));
1181
1
    tp->next = tbuckets[hash];
1182
1
    tbuckets[hash] = tp;
1183
1
    lasttp = tp;
1184
1
    root_imports[0].label = strdup(tp->label);
1185
1
    root_imports[0].modid = base_modid;
1186
1187
    /*
1188
     * build root node 
1189
     */
1190
1
    tp = calloc(1, sizeof(struct tree));
1191
1
    if (tp == NULL)
1192
0
        return;
1193
1
    tp->next_peer = lasttp;
1194
1
    tp->label = strdup("ccitt");
1195
1
    tp->modid = base_modid;
1196
1
    tp->number_modules = 1;
1197
1
    tp->module_list = &(tp->modid);
1198
1
    tp->subid = 0;
1199
1
    tp->tc_index = -1;
1200
1
    set_function(tp);           /* from mib.c */
1201
1
    hash = NBUCKET(name_hash(tp->label));
1202
1
    tp->next = tbuckets[hash];
1203
1
    tbuckets[hash] = tp;
1204
1
    lasttp = tp;
1205
1
    root_imports[1].label = strdup(tp->label);
1206
1
    root_imports[1].modid = base_modid;
1207
1208
    /*
1209
     * build root node 
1210
     */
1211
1
    tp = calloc(1, sizeof(struct tree));
1212
1
    if (tp == NULL)
1213
0
        return;
1214
1
    tp->next_peer = lasttp;
1215
1
    tp->label = strdup("iso");
1216
1
    tp->modid = base_modid;
1217
1
    tp->number_modules = 1;
1218
1
    tp->module_list = &(tp->modid);
1219
1
    tp->subid = 1;
1220
1
    tp->tc_index = -1;
1221
1
    set_function(tp);           /* from mib.c */
1222
1
    hash = NBUCKET(name_hash(tp->label));
1223
1
    tp->next = tbuckets[hash];
1224
1
    tbuckets[hash] = tp;
1225
1
    lasttp = tp;
1226
1
    root_imports[2].label = strdup(tp->label);
1227
1
    root_imports[2].modid = base_modid;
1228
1229
1
    tree_head = tp;
1230
1
}
1231
1232
#ifdef STRICT_MIB_PARSEING
1233
#define label_compare strcasecmp
1234
#else
1235
209k
#define label_compare strcmp
1236
#endif
1237
1238
1239
struct tree    *
1240
find_tree_node(const char *name, int modid)
1241
0
{
1242
0
    struct tree    *tp, *headtp;
1243
0
    int             count, *int_p;
1244
1245
0
    if (!name || !*name)
1246
0
        return (NULL);
1247
1248
0
    headtp = tbuckets[NBUCKET(name_hash(name))];
1249
0
    for (tp = headtp; tp; tp = tp->next) {
1250
0
        if (tp->label && !label_compare(tp->label, name)) {
1251
1252
0
            if (modid == -1)    /* Any module */
1253
0
                return (tp);
1254
1255
0
            for (int_p = tp->module_list, count = 0;
1256
0
                 count < tp->number_modules; ++count, ++int_p)
1257
0
                if (*int_p == modid)
1258
0
                    return (tp);
1259
0
        }
1260
0
    }
1261
1262
0
    return (NULL);
1263
0
}
1264
1265
/*
1266
 * computes a value which represents how close name1 is to name2.
1267
 * * high scores mean a worse match.
1268
 * * (yes, the algorithm sucks!)
1269
 */
1270
0
#define MAX_BAD 0xffffff
1271
1272
static          u_int
1273
compute_match(const char *search_base, const char *key)
1274
0
{
1275
0
#if defined(HAVE_REGEX_H) && defined(HAVE_REGCOMP)
1276
0
    int             rc;
1277
0
    regex_t         parsetree;
1278
0
    regmatch_t      pmatch;
1279
0
    rc = regcomp(&parsetree, key, REG_ICASE | REG_EXTENDED);
1280
0
    if (rc == 0)
1281
0
        rc = regexec(&parsetree, search_base, 1, &pmatch, 0);
1282
0
    regfree(&parsetree);
1283
0
    if (rc == 0) {
1284
        /*
1285
         * found 
1286
         */
1287
0
        return pmatch.rm_so;
1288
0
    }
1289
#else                           /* use our own wildcard matcher */
1290
    /*
1291
     * first find the longest matching substring (ick) 
1292
     */
1293
    char           *first = NULL, *result = NULL, *entry;
1294
    const char     *position;
1295
    char           *newkey = strdup(key);
1296
    char           *st;
1297
1298
1299
    entry = strtok_r(newkey, "*", &st);
1300
    position = search_base;
1301
    while (entry) {
1302
        result = strcasestr(position, entry);
1303
1304
        if (result == NULL) {
1305
            free(newkey);
1306
            return MAX_BAD;
1307
        }
1308
1309
        if (first == NULL)
1310
            first = result;
1311
1312
        position = result + strlen(entry);
1313
        entry = strtok_r(NULL, "*", &st);
1314
    }
1315
    free(newkey);
1316
    if (result)
1317
        return (first - search_base);
1318
#endif
1319
1320
    /*
1321
     * not found 
1322
     */
1323
0
    return MAX_BAD;
1324
0
}
1325
1326
/*
1327
 * Find the tree node that best matches the pattern string.
1328
 * Use the "reported" flag such that only one match
1329
 * is attempted for every node.
1330
 *
1331
 * Warning! This function may recurse.
1332
 *
1333
 * Caller _must_ invoke clear_tree_flags before first call
1334
 * to this function.  This function may be called multiple times
1335
 * to ensure that the entire tree is traversed.
1336
 */
1337
1338
struct tree    *
1339
find_best_tree_node(const char *pattrn, struct tree *tree_top,
1340
                    u_int * match)
1341
0
{
1342
0
    struct tree    *tp, *best_so_far = NULL, *retptr;
1343
0
    u_int           old_match = MAX_BAD, new_match = MAX_BAD;
1344
1345
0
    if (!pattrn || !*pattrn)
1346
0
        return (NULL);
1347
1348
0
    if (!tree_top)
1349
0
        tree_top = get_tree_head();
1350
1351
0
    for (tp = tree_top; tp; tp = tp->next_peer) {
1352
0
        if (!tp->reported && tp->label)
1353
0
            new_match = compute_match(tp->label, pattrn);
1354
0
        tp->reported = 1;
1355
1356
0
        if (new_match < old_match) {
1357
0
            best_so_far = tp;
1358
0
            old_match = new_match;
1359
0
        }
1360
0
        if (new_match == 0)
1361
0
            break;              /* this is the best result we can get */
1362
0
        if (tp->child_list) {
1363
0
            retptr =
1364
0
                find_best_tree_node(pattrn, tp->child_list, &new_match);
1365
0
            if (new_match < old_match) {
1366
0
                best_so_far = retptr;
1367
0
                old_match = new_match;
1368
0
            }
1369
0
            if (new_match == 0)
1370
0
                break;          /* this is the best result we can get */
1371
0
        }
1372
0
    }
1373
0
    if (match)
1374
0
        *match = old_match;
1375
0
    return (best_so_far);
1376
0
}
1377
1378
1379
static void
1380
merge_anon_children(struct tree *tp1, struct tree *tp2)
1381
                /*
1382
                 * NB: tp1 is the 'anonymous' node 
1383
                 */
1384
0
{
1385
0
    struct tree    *child1, *child2, *previous;
1386
1387
0
    for (child1 = tp1->child_list; child1;) {
1388
1389
0
        for (child2 = tp2->child_list, previous = NULL;
1390
0
             child2; previous = child2, child2 = child2->next_peer) {
1391
1392
0
            if (child1->subid == child2->subid) {
1393
                /*
1394
                 * Found 'matching' children,
1395
                 *  so merge them
1396
                 */
1397
0
                if (!strncmp(child1->label, ANON, ANON_LEN)) {
1398
0
                    merge_anon_children(child1, child2);
1399
1400
0
                    child1->child_list = NULL;
1401
0
                    previous = child1;  /* Finished with 'child1' */
1402
0
                    child1 = child1->next_peer;
1403
0
                    free_tree(previous);
1404
0
                    goto next;
1405
0
                }
1406
1407
0
                else if (!strncmp(child2->label, ANON, ANON_LEN)) {
1408
0
                    merge_anon_children(child2, child1);
1409
1410
0
                    if (previous)
1411
0
                        previous->next_peer = child2->next_peer;
1412
0
                    else
1413
0
                        tp2->child_list = child2->next_peer;
1414
0
                    free_tree(child2);
1415
1416
0
                    previous = child1;  /* Move 'child1' to 'tp2' */
1417
0
                    child1 = child1->next_peer;
1418
0
                    previous->next_peer = tp2->child_list;
1419
0
                    tp2->child_list = previous;
1420
0
                    for (previous = tp2->child_list;
1421
0
                         previous; previous = previous->next_peer)
1422
0
                        previous->parent = tp2;
1423
0
                    goto next;
1424
0
                } else if (!label_compare(child1->label, child2->label)) {
1425
0
                    if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
1426
0
             NETSNMP_DS_LIB_MIB_WARNINGS)) {
1427
0
                        snmp_log(LOG_WARNING,
1428
0
                                 "Warning: %s.%ld is both %s and %s (%s)\n",
1429
0
                                 tp2->label, child1->subid, child1->label,
1430
0
                                 child2->label, File);
1431
0
        }
1432
0
                    continue;
1433
0
                } else {
1434
                    /*
1435
                     * Two copies of the same node.
1436
                     * 'child2' adopts the children of 'child1'
1437
                     */
1438
1439
0
                    if (child2->child_list) {
1440
0
                        for (previous = child2->child_list; previous->next_peer; previous = previous->next_peer);       /* Find the end of the list */
1441
0
                        previous->next_peer = child1->child_list;
1442
0
                    } else
1443
0
                        child2->child_list = child1->child_list;
1444
0
                    for (previous = child1->child_list;
1445
0
                         previous; previous = previous->next_peer)
1446
0
                        previous->parent = child2;
1447
0
                    child1->child_list = NULL;
1448
1449
0
                    previous = child1;  /* Finished with 'child1' */
1450
0
                    child1 = child1->next_peer;
1451
0
                    free_tree(previous);
1452
0
                    goto next;
1453
0
                }
1454
0
            }
1455
0
        }
1456
        /*
1457
         * If no match, move 'child1' to 'tp2' child_list
1458
         */
1459
0
        if (child1) {
1460
0
            previous = child1;
1461
0
            child1 = child1->next_peer;
1462
0
            previous->parent = tp2;
1463
0
            previous->next_peer = tp2->child_list;
1464
0
            tp2->child_list = previous;
1465
0
        }
1466
0
      next:;
1467
0
    }
1468
0
}
1469
1470
1471
/*
1472
 * Find all the children of root in the list of nodes.  Link them into the
1473
 * tree and out of the nodes list.
1474
 */
1475
static void
1476
do_subtree(struct tree *root, struct node **nodes)
1477
0
{
1478
0
    struct tree    *tp, *anon_tp = NULL;
1479
0
    struct tree    *xroot = root;
1480
0
    struct node    *np, **headp;
1481
0
    struct node    *oldnp = NULL, *child_list = NULL, *childp = NULL;
1482
0
    int             hash;
1483
0
    int            *int_p;
1484
1485
0
    while (xroot->next_peer && xroot->next_peer->subid == root->subid) {
1486
#if 0
1487
        printf("xroot: %s.%s => %s\n", xroot->parent->label, xroot->label,
1488
               xroot->next_peer->label);
1489
#endif
1490
0
        xroot = xroot->next_peer;
1491
0
    }
1492
1493
0
    tp = root;
1494
0
    headp = &nbuckets[NBUCKET(name_hash(tp->label))];
1495
    /*
1496
     * Search each of the nodes for one whose parent is root, and
1497
     * move each into a separate list.
1498
     */
1499
0
    for (np = *headp; np; np = np->next) {
1500
0
        if (!label_compare(tp->label, np->parent)) {
1501
            /*
1502
             * take this node out of the node list 
1503
             */
1504
0
            if (oldnp == NULL) {
1505
0
                *headp = np->next;      /* fix root of node list */
1506
0
            } else {
1507
0
                oldnp->next = np->next; /* link around this node */
1508
0
            }
1509
0
            if (child_list)
1510
0
                childp->next = np;
1511
0
            else
1512
0
                child_list = np;
1513
0
            childp = np;
1514
0
        } else {
1515
0
            oldnp = np;
1516
0
        }
1517
1518
0
    }
1519
0
    if (childp)
1520
0
        childp->next = NULL;
1521
    /*
1522
     * Take each element in the child list and place it into the tree.
1523
     */
1524
0
    for (np = child_list; np; np = np->next) {
1525
0
        struct tree    *otp = NULL;
1526
0
        struct tree    *xxroot = xroot;
1527
0
        anon_tp = NULL;
1528
0
        tp = xroot->child_list;
1529
1530
0
        if (np->subid == -1) {
1531
            /*
1532
             * name ::= { parent } 
1533
             */
1534
0
            np->subid = xroot->subid;
1535
0
            tp = xroot;
1536
0
            xxroot = xroot->parent;
1537
0
        }
1538
1539
0
        while (tp) {
1540
0
            if (tp->subid == np->subid)
1541
0
                break;
1542
0
            else {
1543
0
                otp = tp;
1544
0
                tp = tp->next_peer;
1545
0
            }
1546
0
        }
1547
0
        if (tp) {
1548
0
            if (!label_compare(tp->label, np->label)) {
1549
                /*
1550
                 * Update list of modules 
1551
                 */
1552
0
                int_p = malloc((tp->number_modules + 1) * sizeof(int));
1553
0
                if (int_p == NULL)
1554
0
                    return;
1555
0
                memcpy(int_p, tp->module_list,
1556
0
                       tp->number_modules * sizeof(int));
1557
0
                int_p[tp->number_modules] = np->modid;
1558
0
                if (tp->module_list != &tp->modid)
1559
0
                    free(tp->module_list);
1560
0
                ++tp->number_modules;
1561
0
                tp->module_list = int_p;
1562
1563
0
                if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
1564
0
             NETSNMP_DS_LIB_MIB_REPLACE)) {
1565
                    /*
1566
                     * Replace from node 
1567
                     */
1568
0
                    tree_from_node(tp, np);
1569
0
                }
1570
                /*
1571
                 * Handle children 
1572
                 */
1573
0
                do_subtree(tp, nodes);
1574
0
                continue;
1575
0
            }
1576
0
            if (!strncmp(np->label, ANON, ANON_LEN) ||
1577
0
                !strncmp(tp->label, ANON, ANON_LEN)) {
1578
0
                anon_tp = tp;   /* Need to merge these two trees later */
1579
0
            } else if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
1580
0
            NETSNMP_DS_LIB_MIB_WARNINGS)) {
1581
0
                snmp_log(LOG_WARNING,
1582
0
                         "Warning: %s.%ld is both %s and %s (%s)\n",
1583
0
                         root->label, np->subid, tp->label, np->label,
1584
0
                         File);
1585
0
      }
1586
0
        }
1587
1588
0
        tp = calloc(1, sizeof(struct tree));
1589
0
        if (tp == NULL)
1590
0
            return;
1591
0
        tp->parent = xxroot;
1592
0
        tp->modid = np->modid;
1593
0
        tp->number_modules = 1;
1594
0
        tp->module_list = &(tp->modid);
1595
0
        tree_from_node(tp, np);
1596
0
        if (!otp && !xxroot) {
1597
0
          free(tp);
1598
0
          return;
1599
0
        }
1600
0
        tp->next_peer = otp ? otp->next_peer : xxroot->child_list;
1601
0
        if (otp)
1602
0
            otp->next_peer = tp;
1603
0
        else
1604
0
            xxroot->child_list = tp;
1605
0
        hash = NBUCKET(name_hash(tp->label));
1606
0
        tp->next = tbuckets[hash];
1607
0
        tbuckets[hash] = tp;
1608
0
        do_subtree(tp, nodes);
1609
1610
0
        if (anon_tp) {
1611
0
            if (!strncmp(tp->label, ANON, ANON_LEN)) {
1612
                /*
1613
                 * The new node is anonymous,
1614
                 *  so merge it with the existing one.
1615
                 */
1616
0
                merge_anon_children(tp, anon_tp);
1617
1618
                /*
1619
                 * unlink and destroy tp 
1620
                 */
1621
0
                unlink_tree(tp);
1622
0
                free_tree(tp);
1623
0
            } else if (!strncmp(anon_tp->label, ANON, ANON_LEN)) {
1624
0
                struct tree    *ntp;
1625
                /*
1626
                 * The old node was anonymous,
1627
                 *  so merge it with the existing one,
1628
                 *  and fill in the full information.
1629
                 */
1630
0
                merge_anon_children(anon_tp, tp);
1631
1632
                /*
1633
                 * unlink anon_tp from the hash 
1634
                 */
1635
0
                unlink_tbucket(anon_tp);
1636
1637
                /*
1638
                 * get rid of old contents of anon_tp 
1639
                 */
1640
0
                free_partial_tree(anon_tp, FALSE);
1641
1642
                /*
1643
                 * put in the current information 
1644
                 */
1645
0
                anon_tp->label = tp->label;
1646
0
                anon_tp->child_list = tp->child_list;
1647
0
                anon_tp->modid = tp->modid;
1648
0
                anon_tp->tc_index = tp->tc_index;
1649
0
                anon_tp->type = tp->type;
1650
0
                anon_tp->enums = tp->enums;
1651
0
                anon_tp->indexes = tp->indexes;
1652
0
                anon_tp->augments = tp->augments;
1653
0
                anon_tp->varbinds = tp->varbinds;
1654
0
                anon_tp->ranges = tp->ranges;
1655
0
                anon_tp->hint = tp->hint;
1656
0
                anon_tp->units = tp->units;
1657
0
                anon_tp->description = tp->description;
1658
0
                anon_tp->reference = tp->reference;
1659
0
                anon_tp->defaultValue = tp->defaultValue;
1660
0
                anon_tp->parent = tp->parent;
1661
1662
0
                set_function(anon_tp);
1663
1664
                /*
1665
                 * update parent pointer in moved children 
1666
                 */
1667
0
                ntp = anon_tp->child_list;
1668
0
                while (ntp) {
1669
0
                    ntp->parent = anon_tp;
1670
0
                    ntp = ntp->next_peer;
1671
0
                }
1672
1673
                /*
1674
                 * hash in anon_tp in its new place 
1675
                 */
1676
0
                hash = NBUCKET(name_hash(anon_tp->label));
1677
0
                anon_tp->next = tbuckets[hash];
1678
0
                tbuckets[hash] = anon_tp;
1679
1680
                /*
1681
                 * unlink and destroy tp 
1682
                 */
1683
0
                unlink_tbucket(tp);
1684
0
                unlink_tree(tp);
1685
0
                free(tp);
1686
0
            } else {
1687
                /*
1688
                 * Uh?  One of these two should have been anonymous! 
1689
                 */
1690
0
                if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
1691
0
               NETSNMP_DS_LIB_MIB_WARNINGS)) {
1692
0
                    snmp_log(LOG_WARNING,
1693
0
                             "Warning: expected anonymous node (either %s or %s) in %s\n",
1694
0
                             tp->label, anon_tp->label, File);
1695
0
    }
1696
0
            }
1697
0
            anon_tp = NULL;
1698
0
        }
1699
0
    }
1700
    /*
1701
     * free all nodes that were copied into tree 
1702
     */
1703
0
    oldnp = NULL;
1704
0
    for (np = child_list; np; np = np->next) {
1705
0
        if (oldnp)
1706
0
            free_node(oldnp);
1707
0
        oldnp = np;
1708
0
    }
1709
0
    if (oldnp)
1710
0
        free_node(oldnp);
1711
0
}
1712
1713
static void
1714
do_linkup(struct module *mp, struct node *np)
1715
0
{
1716
0
    struct module_import *mip;
1717
0
    struct node    *onp, *oldp, *newp;
1718
0
    struct tree    *tp;
1719
0
    int             i, more;
1720
    /*
1721
     * All modules implicitly import
1722
     *   the roots of the tree
1723
     */
1724
0
    if (snmp_get_do_debugging() > 1)
1725
0
        dump_module_list();
1726
0
    DEBUGMSGTL(("parse-mibs", "Processing IMPORTS for module %d %s\n",
1727
0
                mp->modid, mp->name));
1728
0
    if (mp->no_imports == 0) {
1729
0
        mp->no_imports = NUMBER_OF_ROOT_NODES;
1730
0
        mp->imports = root_imports;
1731
0
    }
1732
1733
    /*
1734
     * Build the tree
1735
     */
1736
0
    init_node_hash(np);
1737
0
    for (i = 0, mip = mp->imports; i < mp->no_imports; ++i, ++mip) {
1738
0
        char            modbuf[256];
1739
0
        DEBUGMSGTL(("parse-mibs", "  Processing import: %s\n",
1740
0
                    mip->label));
1741
0
        if (get_tc_index(mip->label, mip->modid) != -1)
1742
0
            continue;
1743
0
        tp = find_tree_node(mip->label, mip->modid);
1744
0
        if (!tp) {
1745
0
      if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, NETSNMP_DS_LIB_MIB_ERRORS))
1746
0
                snmp_log(LOG_WARNING,
1747
0
                         "Did not find '%s' in module %s (%s)\n",
1748
0
                         mip->label, module_name(mip->modid, modbuf),
1749
0
                         File);
1750
0
            continue;
1751
0
        }
1752
0
        do_subtree(tp, &np);
1753
0
    }
1754
1755
    /*
1756
     * If any nodes left over,
1757
     *   check that they're not the result of a "fully qualified"
1758
     *   name, and then add them to the list of orphans
1759
     */
1760
1761
0
    if (!np)
1762
0
        return;
1763
0
    for (tp = tree_head; tp; tp = tp->next_peer)
1764
0
        do_subtree(tp, &np);
1765
0
    if (!np)
1766
0
        return;
1767
1768
    /*
1769
     * quietly move all internal references to the orphan list 
1770
     */
1771
0
    oldp = orphan_nodes;
1772
0
    do {
1773
0
        for (i = 0; i < NHASHSIZE; i++)
1774
0
            for (onp = nbuckets[i]; onp; onp = onp->next) {
1775
0
                struct node    *op = NULL;
1776
0
                int             hash = NBUCKET(name_hash(onp->label));
1777
0
                np = nbuckets[hash];
1778
0
                while (np) {
1779
0
                    if (label_compare(onp->label, np->parent)) {
1780
0
                        op = np;
1781
0
                        np = np->next;
1782
0
                    } else {
1783
0
                        if (op)
1784
0
                            op->next = np->next;
1785
0
                        else
1786
0
                            nbuckets[hash] = np->next;
1787
0
      DEBUGMSGTL(("parse-mibs", "Moving %s to orphanage", np->label));
1788
0
                        np->next = orphan_nodes;
1789
0
                        orphan_nodes = np;
1790
0
                        op = NULL;
1791
0
                        np = nbuckets[hash];
1792
0
                    }
1793
0
                }
1794
0
            }
1795
0
        newp = orphan_nodes;
1796
0
        more = 0;
1797
0
        for (onp = orphan_nodes; onp != oldp; onp = onp->next) {
1798
0
            struct node    *op = NULL;
1799
0
            int             hash = NBUCKET(name_hash(onp->label));
1800
0
            np = nbuckets[hash];
1801
0
            while (np) {
1802
0
                if (label_compare(onp->label, np->parent)) {
1803
0
                    op = np;
1804
0
                    np = np->next;
1805
0
                } else {
1806
0
                    if (op)
1807
0
                        op->next = np->next;
1808
0
                    else
1809
0
                        nbuckets[hash] = np->next;
1810
0
                    np->next = orphan_nodes;
1811
0
                    orphan_nodes = np;
1812
0
                    op = NULL;
1813
0
                    np = nbuckets[hash];
1814
0
                    more = 1;
1815
0
                }
1816
0
            }
1817
0
        }
1818
0
        oldp = newp;
1819
0
    } while (more);
1820
1821
    /*
1822
     * complain about left over nodes 
1823
     */
1824
0
    for (np = orphan_nodes; np && np->next; np = np->next);     /* find the end of the orphan list */
1825
0
    for (i = 0; i < NHASHSIZE; i++)
1826
0
        if (nbuckets[i]) {
1827
0
            if (orphan_nodes)
1828
0
                onp = np->next = nbuckets[i];
1829
0
            else
1830
0
                onp = orphan_nodes = nbuckets[i];
1831
0
            nbuckets[i] = NULL;
1832
0
            while (onp) {
1833
0
                snmp_log(LOG_WARNING,
1834
0
                         "Cannot resolve OID in %s: %s ::= { %s %ld } at line %d in %s\n",
1835
0
                         (mp->name ? mp->name : "<no module>"),
1836
0
                         (onp->label ? onp->label : "<no label>"),
1837
0
                         (onp->parent ? onp->parent : "<no parent>"),
1838
0
                         onp->subid, onp->lineno, onp->filename);
1839
0
                np = onp;
1840
0
                onp = onp->next;
1841
0
            }
1842
0
        }
1843
0
    return;
1844
0
}
1845
1846
1847
/**
1848
 * Read an OID from a file.
1849
 * @param[in]  file   File to read from.
1850
 * @param[out] id_arg Array to store the OID in.
1851
 * @param[in]  length Number of elements in the @id_arg array.
1852
 *
1853
 * Takes a list of the form:
1854
 * { iso org(3) dod(6) 1 }
1855
 * and creates several nodes, one for each parent-child pair.
1856
 * Returns 0 on error.
1857
 */
1858
static int
1859
getoid(FILE * fp, struct subid_s *id_arg, int length)
1860
387
{
1861
387
    struct subid_s *id = id_arg;
1862
387
    int             i, count, type;
1863
387
    char            token[MAXTOKEN];
1864
1865
387
    if ((type = get_token(fp, token, MAXTOKEN)) != LEFTBRACKET) {
1866
0
        print_error("Expected \"{\"", token, type);
1867
0
        return 0;
1868
0
    }
1869
387
    type = get_token(fp, token, MAXTOKEN);
1870
1.62k
    for (count = 0; count < length; count++, id++) {
1871
1.62k
        id->label = NULL;
1872
1.62k
        id->modid = current_module;
1873
1.62k
        id->subid = -1;
1874
1.62k
        if (type == RIGHTBRACKET)
1875
305
            return count;
1876
1.32k
        if (type == LABEL) {
1877
            /*
1878
             * this entry has a label 
1879
             */
1880
852
            id->label = strdup(token);
1881
852
            type = get_token(fp, token, MAXTOKEN);
1882
852
            if (type == LEFTPAREN) {
1883
32
                type = get_token(fp, token, MAXTOKEN);
1884
32
                if (type == NUMBER) {
1885
8
                    id->subid = strtoul(token, NULL, 10);
1886
8
                    if ((type =
1887
8
                         get_token(fp, token, MAXTOKEN)) != RIGHTPAREN) {
1888
8
                        print_error("Expected a closing parenthesis",
1889
8
                                    token, type);
1890
8
                        goto free_labels;
1891
8
                    }
1892
24
                } else {
1893
24
                    print_error("Expected a number", token, type);
1894
24
                    goto free_labels;
1895
24
                }
1896
820
            } else {
1897
820
                continue;
1898
820
            }
1899
852
        } else if (type == NUMBER) {
1900
            /*
1901
             * this entry  has just an integer sub-identifier 
1902
             */
1903
422
            id->subid = strtoul(token, NULL, 10);
1904
422
        } else {
1905
47
            print_error("Expected label or number", token, type);
1906
47
            goto free_labels;
1907
47
        }
1908
422
        type = get_token(fp, token, MAXTOKEN);
1909
422
    }
1910
3
    print_error("Too long OID", token, type);
1911
3
    --count;
1912
1913
82
free_labels:
1914
428
    for (i = 0; i <= count; i++) {
1915
346
        free(id_arg[i].label);
1916
346
        id_arg[i].label = NULL;
1917
346
    }
1918
1919
82
    return 0;
1920
3
}
1921
1922
/*
1923
 * Parse a sequence of object subidentifiers for the given name.
1924
 * The "label OBJECT IDENTIFIER ::=" portion has already been parsed.
1925
 *
1926
 * The majority of cases take this form :
1927
 * label OBJECT IDENTIFIER ::= { parent 2 }
1928
 * where a parent label and a child subidentifier number are specified.
1929
 *
1930
 * Variations on the theme include cases where a number appears with
1931
 * the parent, or intermediate subidentifiers are specified by label,
1932
 * by number, or both.
1933
 *
1934
 * Here are some representative samples :
1935
 * internet        OBJECT IDENTIFIER ::= { iso org(3) dod(6) 1 }
1936
 * mgmt            OBJECT IDENTIFIER ::= { internet 2 }
1937
 * rptrInfoHealth  OBJECT IDENTIFIER ::= { snmpDot3RptrMgt 0 4 }
1938
 *
1939
 * Here is a very rare form :
1940
 * iso             OBJECT IDENTIFIER ::= { 1 }
1941
 *
1942
 * Returns NULL on error.  When this happens, memory may be leaked.
1943
 */
1944
static struct node *
1945
parse_objectid(FILE * fp, char *name)
1946
387
{
1947
387
    register int    count;
1948
387
    register struct subid_s *op, *nop;
1949
387
    int             length;
1950
387
    struct subid_s  loid[32];
1951
387
    struct node    *np, *root = NULL, *oldnp = NULL;
1952
387
    struct tree    *tp;
1953
1954
387
    if ((length = getoid(fp, loid, 32)) == 0) {
1955
82
        print_error("Bad object identifier", NULL, CONTINUE);
1956
82
        return NULL;
1957
82
    }
1958
1959
    /*
1960
     * Handle numeric-only object identifiers,
1961
     *  by labeling the first sub-identifier
1962
     */
1963
305
    op = loid;
1964
305
    if (!op->label) {
1965
157
        if (length == 1) {
1966
18
            print_error("Attempt to define a root oid", name, OBJECT);
1967
18
            return NULL;
1968
18
        }
1969
451
        for (tp = tree_head; tp; tp = tp->next_peer)
1970
370
            if ((int) tp->subid == op->subid) {
1971
58
                op->label = strdup(tp->label);
1972
58
                break;
1973
58
            }
1974
139
    }
1975
1976
    /*
1977
     * Handle  "label OBJECT-IDENTIFIER ::= { subid }"
1978
     */
1979
287
    if (length == 1) {
1980
65
        op = loid;
1981
65
        np = alloc_node(op->modid);
1982
65
        if (np == NULL)
1983
0
            return (NULL);
1984
65
        np->subid = op->subid;
1985
65
        np->label = strdup(name);
1986
65
        np->parent = op->label;
1987
65
        return np;
1988
65
    }
1989
1990
    /*
1991
     * For each parent-child subid pair in the subid array,
1992
     * create a node and link it into the node list.
1993
     */
1994
892
    for (count = 0, op = loid, nop = loid + 1; count < (length - 1);
1995
670
         count++, op++, nop++) {
1996
        /*
1997
         * every node must have parent's name and child's name or number 
1998
         */
1999
        /*
2000
         * XX the next statement is always true -- does it matter ?? 
2001
         */
2002
670
        if (op->label && (nop->label || (nop->subid != -1))) {
2003
587
            np = alloc_node(nop->modid);
2004
587
            if (np == NULL)
2005
0
                goto err;
2006
587
            if (root == NULL) {
2007
215
                root = np;
2008
372
            } else {
2009
372
                netsnmp_assert(oldnp);
2010
372
                oldnp->next = np;
2011
372
            }
2012
587
            oldnp = np;
2013
2014
587
            np->parent = strdup(op->label);
2015
587
            if (count == (length - 2)) {
2016
                /*
2017
                 * The name for this node is the label for this entry 
2018
                 */
2019
215
                np->label = strdup(name);
2020
215
                if (np->label == NULL)
2021
0
                    goto err;
2022
372
            } else {
2023
372
                if (!nop->label) {
2024
106
                    if (asprintf(&nop->label, "%s%d", ANON, anonymous++) < 0)
2025
0
                        goto err;
2026
106
                }
2027
372
                np->label = strdup(nop->label);
2028
372
            }
2029
587
            if (nop->subid != -1)
2030
196
                np->subid = nop->subid;
2031
391
            else
2032
391
                print_error("Warning: This entry is pretty silly",
2033
391
                            np->label, CONTINUE);
2034
587
        }                       /* end if(op->label... */
2035
670
    }
2036
2037
222
out:
2038
    /*
2039
     * free the loid array 
2040
     */
2041
1.11k
    for (count = 0, op = loid; count < length; count++, op++) {
2042
892
        free(op->label);
2043
892
        op->label = NULL;
2044
892
    }
2045
2046
222
    return root;
2047
2048
0
err:
2049
0
    for (; root; root = np) {
2050
0
        np = root->next;
2051
0
        free_node(root);
2052
0
    }
2053
0
    goto out;
2054
222
}
2055
2056
static int
2057
get_tc(const char *descriptor,
2058
       int modid,
2059
       int *tc_index,
2060
       struct enum_list **ep, struct range_list **rp, char **hint)
2061
79
{
2062
79
    int             i;
2063
79
    struct tc      *tcp;
2064
2065
79
    i = get_tc_index(descriptor, modid);
2066
79
    if (tc_index)
2067
0
        *tc_index = i;
2068
79
    if (i != -1) {
2069
0
        tcp = &tclist[i];
2070
0
        if (ep) {
2071
0
            free_enums(ep);
2072
0
            *ep = copy_enums(tcp->enums);
2073
0
        }
2074
0
        if (rp) {
2075
0
            free_ranges(rp);
2076
0
            *rp = copy_ranges(tcp->ranges);
2077
0
        }
2078
0
        if (hint) {
2079
0
            if (*hint)
2080
0
                free(*hint);
2081
0
            *hint = (tcp->hint ? strdup(tcp->hint) : NULL);
2082
0
        }
2083
0
        return tcp->type;
2084
0
    }
2085
79
    return LABEL;
2086
79
}
2087
2088
/*
2089
 * return index into tclist of given TC descriptor
2090
 * return -1 if not found
2091
 */
2092
static int
2093
get_tc_index(const char *descriptor, int modid)
2094
79
{
2095
79
    int             i;
2096
79
    struct tc      *tcp;
2097
79
    struct module  *mp;
2098
79
    struct module_import *mip;
2099
2100
    /*
2101
     * Check that the descriptor isn't imported
2102
     *  by searching the import list
2103
     */
2104
2105
79
    for (mp = module_head; mp; mp = mp->next)
2106
79
        if (mp->modid == modid)
2107
79
            break;
2108
79
    if (mp)
2109
79
        for (i = 0, mip = mp->imports; i < mp->no_imports; ++i, ++mip) {
2110
0
            if (!label_compare(mip->label, descriptor)) {
2111
                /*
2112
                 * Found it - so amend the module ID 
2113
                 */
2114
0
                modid = mip->modid;
2115
0
                break;
2116
0
            }
2117
0
        }
2118
2119
2120
79
    for (i = 0, tcp = tclist; i < tc_alloc; i++, tcp++) {
2121
79
        if (tcp->type == 0)
2122
79
            break;
2123
0
        if (!label_compare(descriptor, tcp->descriptor) &&
2124
0
            ((modid == tcp->modid) || (modid == -1))) {
2125
0
            return i;
2126
0
        }
2127
0
    }
2128
79
    return -1;
2129
79
}
2130
2131
/*
2132
 * translate integer tc_index to string identifier from tclist
2133
 * *
2134
 * * Returns pointer to string in table (should not be modified) or NULL
2135
 */
2136
const char     *
2137
get_tc_descriptor(int tc_index)
2138
0
{
2139
0
    if (tc_index < 0 || tc_index >= tc_alloc)
2140
0
        return NULL;
2141
0
    return tclist[tc_index].descriptor;
2142
0
}
2143
2144
#ifndef NETSNMP_FEATURE_REMOVE_GET_TC_DESCRIPTION
2145
/* used in the perl module */
2146
const char     *
2147
get_tc_description(int tc_index)
2148
0
{
2149
0
    if (tc_index < 0 || tc_index >= tc_alloc)
2150
0
        return NULL;
2151
0
    return tclist[tc_index].description;
2152
0
}
2153
#endif /* NETSNMP_FEATURE_REMOVE_GET_TC_DESCRIPTION */
2154
2155
2156
/*
2157
 * Parses an enumeration list of the form:
2158
 *        { label(value) label(value) ... }
2159
 * The initial { has already been parsed.
2160
 * Returns NULL on error.
2161
 */
2162
2163
static struct enum_list *
2164
parse_enumlist(FILE * fp, struct enum_list **retp)
2165
0
{
2166
0
    register int    type;
2167
0
    char            token[MAXTOKEN];
2168
0
    struct enum_list *ep = NULL, **epp = &ep;
2169
2170
0
    free_enums(retp);
2171
2172
0
    while ((type = get_token(fp, token, MAXTOKEN)) != ENDOFFILE) {
2173
0
        if (type == RIGHTBRACKET)
2174
0
            break;
2175
        /* some enums use "deprecated" to indicate a no longer value label */
2176
        /* (EG: IP-MIB's IpAddressStatusTC) */
2177
0
        if (type == LABEL || type == DEPRECATED) {
2178
            /*
2179
             * this is an enumerated label 
2180
             */
2181
0
            *epp = calloc(1, sizeof(struct enum_list));
2182
0
            if (*epp == NULL)
2183
0
                return (NULL);
2184
            /*
2185
             * a reasonable approximation for the length 
2186
             */
2187
0
            (*epp)->label = strdup(token);
2188
0
            type = get_token(fp, token, MAXTOKEN);
2189
0
            if (type != LEFTPAREN) {
2190
0
                print_error("Expected \"(\"", token, type);
2191
0
                goto err;
2192
0
            }
2193
0
            type = get_token(fp, token, MAXTOKEN);
2194
0
            if (type != NUMBER) {
2195
0
                print_error("Expected integer", token, type);
2196
0
                goto err;
2197
0
            }
2198
0
            (*epp)->value = strtol(token, NULL, 10);
2199
0
            (*epp)->lineno = mibLine;
2200
0
            type = get_token(fp, token, MAXTOKEN);
2201
0
            if (type != RIGHTPAREN) {
2202
0
                print_error("Expected \")\"", token, type);
2203
0
                goto err;
2204
0
            } else {
2205
0
                struct enum_list *op = ep;
2206
0
                while (op != *epp) {
2207
0
                    if (strcmp((*epp)->label, op->label) == 0) {
2208
0
                        snmp_log(LOG_ERR,
2209
0
                            "Duplicate enum label '%s' at line %d in %s. First at line %d\n",
2210
0
                            (*epp)->label, mibLine, File, op->lineno);
2211
0
                        erroneousMibs++;
2212
0
                        break;
2213
0
                    }
2214
0
                    else if ((*epp)->value == op->value) {
2215
0
                        snmp_log(LOG_ERR,
2216
0
                            "Duplicate enum value '%d' at line %d in %s. First at line %d\n",
2217
0
                            (*epp)->value, mibLine, File, op->lineno);
2218
0
                        erroneousMibs++;
2219
0
                        break;
2220
0
                    }
2221
0
                    op = op->next;
2222
0
                }
2223
0
            }
2224
0
            epp = &(*epp)->next;
2225
0
        }
2226
0
    }
2227
0
    if (type == ENDOFFILE) {
2228
0
        print_error("Expected \"}\"", token, type);
2229
0
        goto err;
2230
0
    }
2231
0
    *retp = ep;
2232
0
    return ep;
2233
2234
0
err:
2235
0
    free_enums(&ep);
2236
0
    return NULL;
2237
0
}
2238
2239
static struct range_list *
2240
parse_ranges(FILE * fp, struct range_list **retp)
2241
0
{
2242
0
    int             low, high;
2243
0
    char            nexttoken[MAXTOKEN];
2244
0
    int             nexttype;
2245
0
    struct range_list *rp = NULL, **rpp = &rp;
2246
0
    int             size = 0, taken = 1;
2247
2248
0
    free_ranges(retp);
2249
2250
0
    nexttype = get_token(fp, nexttoken, MAXTOKEN);
2251
0
    if (nexttype == SIZE) {
2252
0
        size = 1;
2253
0
        taken = 0;
2254
0
        nexttype = get_token(fp, nexttoken, MAXTOKEN);
2255
0
        if (nexttype != LEFTPAREN)
2256
0
            print_error("Expected \"(\" after SIZE", nexttoken, nexttype);
2257
0
    }
2258
2259
0
    do {
2260
0
        if (!taken)
2261
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
2262
0
        else
2263
0
            taken = 0;
2264
0
        high = low = strtoul(nexttoken, NULL, 10);
2265
0
        nexttype = get_token(fp, nexttoken, MAXTOKEN);
2266
0
        if (nexttype == RANGE) {
2267
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
2268
0
            errno = 0;
2269
0
            high = strtoul(nexttoken, NULL, 10);
2270
0
            if ( errno == ERANGE ) {
2271
0
                if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
2272
0
                                       NETSNMP_DS_LIB_MIB_WARNINGS))
2273
0
                    snmp_log(LOG_WARNING,
2274
0
                             "Warning: Upper bound not handled correctly (%s != %d): At line %d in %s\n",
2275
0
                                 nexttoken, high, mibLine, File);
2276
0
            }
2277
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
2278
0
        }
2279
0
        *rpp = (struct range_list *) calloc(1, sizeof(struct range_list));
2280
0
        if (*rpp == NULL)
2281
0
            break;
2282
0
        (*rpp)->low = low;
2283
0
        (*rpp)->high = high;
2284
0
        rpp = &(*rpp)->next;
2285
2286
0
    } while (nexttype == BAR);
2287
0
    if (size) {
2288
0
        if (nexttype != RIGHTPAREN)
2289
0
            print_error("Expected \")\" after SIZE", nexttoken, nexttype);
2290
0
        nexttype = get_token(fp, nexttoken, MAXTOKEN);
2291
0
    }
2292
0
    if (nexttype != RIGHTPAREN)
2293
0
        print_error("Expected \")\"", nexttoken, nexttype);
2294
2295
0
    *retp = rp;
2296
0
    return rp;
2297
0
}
2298
2299
/*
2300
 * Parses an asn type.  Structures are ignored by this parser.
2301
 * Returns NULL on error.
2302
 */
2303
static struct node *
2304
parse_asntype(FILE * fp, char *name, int *ntype, char *ntoken)
2305
769
{
2306
769
    int             type, i;
2307
769
    char            token[MAXTOKEN];
2308
769
    char            quoted_string_buffer[MAXQUOTESTR];
2309
769
    char           *hint = NULL;
2310
769
    char           *descr = NULL;
2311
769
    struct tc      *tcp;
2312
769
    int             level;
2313
2314
769
    type = get_token(fp, token, MAXTOKEN);
2315
769
    if (type == SEQUENCE || type == CHOICE) {
2316
0
        level = 0;
2317
0
        while ((type = get_token(fp, token, MAXTOKEN)) != ENDOFFILE) {
2318
0
            if (type == LEFTBRACKET) {
2319
0
                level++;
2320
0
            } else if (type == RIGHTBRACKET && --level == 0) {
2321
0
                *ntype = get_token(fp, ntoken, MAXTOKEN);
2322
0
                return NULL;
2323
0
            }
2324
0
        }
2325
0
        print_error("Expected \"}\"", token, type);
2326
0
        return NULL;
2327
769
    } else if (type == LEFTBRACKET) {
2328
387
        struct node    *np;
2329
387
        int             ch_next = '{';
2330
387
        ungetc(ch_next, fp);
2331
387
        np = parse_objectid(fp, name);
2332
387
        if (np != NULL) {
2333
280
            *ntype = get_token(fp, ntoken, MAXTOKEN);
2334
280
            return np;
2335
280
        }
2336
107
        return NULL;
2337
387
    } else if (type == LEFTSQBRACK) {
2338
249
        int             size = 0;
2339
5.58k
        do {
2340
5.58k
            type = get_token(fp, token, MAXTOKEN);
2341
5.58k
        } while (type != ENDOFFILE && type != RIGHTSQBRACK);
2342
249
        if (type != RIGHTSQBRACK) {
2343
5
            print_error("Expected \"]\"", token, type);
2344
5
            return NULL;
2345
5
        }
2346
244
        type = get_token(fp, token, MAXTOKEN);
2347
244
        if (type == IMPLICIT)
2348
0
            type = get_token(fp, token, MAXTOKEN);
2349
244
        *ntype = get_token(fp, ntoken, MAXTOKEN);
2350
244
        if (*ntype == LEFTPAREN) {
2351
1
            switch (type) {
2352
0
            case OCTETSTR:
2353
0
                *ntype = get_token(fp, ntoken, MAXTOKEN);
2354
0
                if (*ntype != SIZE) {
2355
0
                    print_error("Expected SIZE", ntoken, *ntype);
2356
0
                    return NULL;
2357
0
                }
2358
0
                size = 1;
2359
0
                *ntype = get_token(fp, ntoken, MAXTOKEN);
2360
0
                if (*ntype != LEFTPAREN) {
2361
0
                    print_error("Expected \"(\" after SIZE", ntoken,
2362
0
                                *ntype);
2363
0
                    return NULL;
2364
0
                }
2365
0
                NETSNMP_FALLTHROUGH;
2366
0
            case INTEGER:
2367
0
                *ntype = get_token(fp, ntoken, MAXTOKEN);
2368
0
                do {
2369
0
                    if (*ntype != NUMBER)
2370
0
                        print_error("Expected NUMBER", ntoken, *ntype);
2371
0
                    *ntype = get_token(fp, ntoken, MAXTOKEN);
2372
0
                    if (*ntype == RANGE) {
2373
0
                        *ntype = get_token(fp, ntoken, MAXTOKEN);
2374
0
                        if (*ntype != NUMBER)
2375
0
                            print_error("Expected NUMBER", ntoken, *ntype);
2376
0
                        *ntype = get_token(fp, ntoken, MAXTOKEN);
2377
0
                    }
2378
0
                } while (*ntype == BAR);
2379
0
                if (*ntype != RIGHTPAREN) {
2380
0
                    print_error("Expected \")\"", ntoken, *ntype);
2381
0
                    return NULL;
2382
0
                }
2383
0
                *ntype = get_token(fp, ntoken, MAXTOKEN);
2384
0
                if (size) {
2385
0
                    if (*ntype != RIGHTPAREN) {
2386
0
                        print_error("Expected \")\" to terminate SIZE",
2387
0
                                    ntoken, *ntype);
2388
0
                        return NULL;
2389
0
                    }
2390
0
                    *ntype = get_token(fp, ntoken, MAXTOKEN);
2391
0
                }
2392
1
            }
2393
1
        }
2394
244
        return NULL;
2395
244
    } else {
2396
133
        if (type == CONVENTION) {
2397
0
            while (type != SYNTAX && type != ENDOFFILE) {
2398
0
                if (type == DISPLAYHINT) {
2399
0
                    type = get_token(fp, token, MAXTOKEN);
2400
0
                    if (type != QUOTESTRING) {
2401
0
                        print_error("DISPLAY-HINT must be string", token,
2402
0
                                    type);
2403
0
                    } else {
2404
0
                        free(hint);
2405
0
                        hint = strdup(token);
2406
0
                    }
2407
0
                } else if (type == DESCRIPTION &&
2408
0
                           netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
2409
0
                                                  NETSNMP_DS_LIB_SAVE_MIB_DESCRS)) {
2410
0
                    type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2411
0
                    if (type != QUOTESTRING) {
2412
0
                        print_error("DESCRIPTION must be string", token,
2413
0
                                    type);
2414
0
                    } else {
2415
0
                        free(descr);
2416
0
                        descr = strdup(quoted_string_buffer);
2417
0
                    }
2418
0
                } else
2419
0
                    type =
2420
0
                        get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2421
0
            }
2422
0
            type = get_token(fp, token, MAXTOKEN);
2423
0
            if (type == OBJECT) {
2424
0
                type = get_token(fp, token, MAXTOKEN);
2425
0
                if (type != IDENTIFIER) {
2426
0
                    print_error("Expected IDENTIFIER", token, type);
2427
0
                    goto err;
2428
0
                }
2429
0
                type = OBJID;
2430
0
            }
2431
133
        } else if (type == OBJECT) {
2432
0
            type = get_token(fp, token, MAXTOKEN);
2433
0
            if (type != IDENTIFIER) {
2434
0
                print_error("Expected IDENTIFIER", token, type);
2435
0
                goto err;
2436
0
            }
2437
0
            type = OBJID;
2438
0
        }
2439
2440
133
        if (type == LABEL) {
2441
79
            type = get_tc(token, current_module, NULL, NULL, NULL, NULL);
2442
79
        }
2443
2444
        /*
2445
         * textual convention 
2446
         */
2447
133
        tcp = NULL;
2448
13.4k
        for (i = 0; i < tc_alloc; i++) {
2449
13.3k
            if (tclist[i].type == 0) {
2450
13.3k
                if (tcp == NULL)
2451
133
                    tcp = &tclist[i];
2452
13.3k
            } else if (strcmp(name, tclist[i].descriptor) == 0 &&
2453
0
                       tclist[i].modid == current_module) {
2454
0
                snmp_log(LOG_ERR,
2455
0
                         "Duplicate TEXTUAL-CONVENTION '%s' at line %d in %s. First at line %d\n",
2456
0
                         name, mibLine, File, tclist[i].lineno);
2457
0
                erroneousMibs++;
2458
0
            }
2459
13.3k
        }
2460
2461
133
        if (tcp == NULL) {
2462
0
            tclist = realloc(tclist, (tc_alloc + TC_INCR)*sizeof(struct tc));
2463
0
            memset(tclist+tc_alloc, 0, TC_INCR*sizeof(struct tc));
2464
0
            tcp = tclist + tc_alloc;
2465
0
            tc_alloc += TC_INCR;
2466
0
        }
2467
133
        if (!(type & SYNTAX_MASK)) {
2468
133
            print_error("Textual convention doesn't map to real type",
2469
133
                        token, type);
2470
133
            goto err;
2471
133
        }
2472
0
        tcp->modid = current_module;
2473
0
        tcp->descriptor = strdup(name);
2474
0
        tcp->hint = hint;
2475
0
        tcp->description = descr;
2476
0
        tcp->lineno = mibLine;
2477
0
        tcp->type = type;
2478
0
        *ntype = get_token(fp, ntoken, MAXTOKEN);
2479
0
        if (*ntype == LEFTPAREN) {
2480
0
            tcp->ranges = parse_ranges(fp, &tcp->ranges);
2481
0
            *ntype = get_token(fp, ntoken, MAXTOKEN);
2482
0
        } else if (*ntype == LEFTBRACKET) {
2483
            /*
2484
             * if there is an enumeration list, parse it 
2485
             */
2486
0
            tcp->enums = parse_enumlist(fp, &tcp->enums);
2487
0
            *ntype = get_token(fp, ntoken, MAXTOKEN);
2488
0
        }
2489
0
        return NULL;
2490
133
    }
2491
2492
133
err:
2493
133
    SNMP_FREE(descr);
2494
133
    SNMP_FREE(hint);
2495
133
    return NULL;
2496
769
}
2497
2498
2499
/*
2500
 * Parses an OBJECT TYPE macro.
2501
 * Returns 0 on error.
2502
 */
2503
static struct node *
2504
parse_objecttype(FILE * fp, char *name)
2505
0
{
2506
0
    register int    type;
2507
0
    char            token[MAXTOKEN];
2508
0
    char            nexttoken[MAXTOKEN];
2509
0
    char            quoted_string_buffer[MAXQUOTESTR];
2510
0
    int             nexttype, tctype;
2511
0
    register struct node *np;
2512
2513
0
    type = get_token(fp, token, MAXTOKEN);
2514
0
    if (type != SYNTAX) {
2515
0
        print_error("Bad format for OBJECT-TYPE", token, type);
2516
0
        return NULL;
2517
0
    }
2518
0
    np = alloc_node(current_module);
2519
0
    if (np == NULL)
2520
0
        return (NULL);
2521
0
    type = get_token(fp, token, MAXTOKEN);
2522
0
    if (type == OBJECT) {
2523
0
        type = get_token(fp, token, MAXTOKEN);
2524
0
        if (type != IDENTIFIER) {
2525
0
            print_error("Expected IDENTIFIER", token, type);
2526
0
            free_node(np);
2527
0
            return NULL;
2528
0
        }
2529
0
        type = OBJID;
2530
0
    }
2531
0
    if (type == LABEL) {
2532
0
        int             tmp_index;
2533
0
        tctype = get_tc(token, current_module, &tmp_index,
2534
0
                        &np->enums, &np->ranges, &np->hint);
2535
0
        if (tctype == LABEL &&
2536
0
            netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
2537
0
             NETSNMP_DS_LIB_MIB_WARNINGS) > 1) {
2538
0
            print_error("Warning: No known translation for type", token,
2539
0
                        type);
2540
0
        }
2541
0
        type = tctype;
2542
0
        np->tc_index = tmp_index;       /* store TC for later reference */
2543
0
    }
2544
0
    np->type = type;
2545
0
    nexttype = get_token(fp, nexttoken, MAXTOKEN);
2546
0
    switch (type) {
2547
0
    case SEQUENCE:
2548
0
        if (nexttype == OF) {
2549
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
2550
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
2551
2552
0
        }
2553
0
        break;
2554
0
    case INTEGER:
2555
0
    case INTEGER32:
2556
0
    case UINTEGER32:
2557
0
    case UNSIGNED32:
2558
0
    case COUNTER:
2559
0
    case GAUGE:
2560
0
    case BITSTRING:
2561
0
    case LABEL:
2562
0
        if (nexttype == LEFTBRACKET) {
2563
            /*
2564
             * if there is an enumeration list, parse it 
2565
             */
2566
0
            np->enums = parse_enumlist(fp, &np->enums);
2567
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
2568
0
        } else if (nexttype == LEFTPAREN) {
2569
            /*
2570
             * if there is a range list, parse it 
2571
             */
2572
0
            np->ranges = parse_ranges(fp, &np->ranges);
2573
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
2574
0
        }
2575
0
        break;
2576
0
    case OCTETSTR:
2577
0
    case KW_OPAQUE:
2578
        /*
2579
         * parse any SIZE specification 
2580
         */
2581
0
        if (nexttype == LEFTPAREN) {
2582
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
2583
0
            if (nexttype == SIZE) {
2584
0
                nexttype = get_token(fp, nexttoken, MAXTOKEN);
2585
0
                if (nexttype == LEFTPAREN) {
2586
0
                    np->ranges = parse_ranges(fp, &np->ranges);
2587
0
                    nexttype = get_token(fp, nexttoken, MAXTOKEN);      /* ) */
2588
0
                    if (nexttype == RIGHTPAREN) {
2589
0
                        nexttype = get_token(fp, nexttoken, MAXTOKEN);
2590
0
                        break;
2591
0
                    }
2592
0
                }
2593
0
            }
2594
0
            print_error("Bad SIZE syntax", token, type);
2595
0
            free_node(np);
2596
0
            return NULL;
2597
0
        }
2598
0
        break;
2599
0
    case OBJID:
2600
0
    case NETADDR:
2601
0
    case IPADDR:
2602
0
    case TIMETICKS:
2603
0
    case NUL:
2604
0
    case NSAPADDRESS:
2605
0
    case COUNTER64:
2606
0
        break;
2607
0
    default:
2608
0
        print_error("Bad syntax", token, type);
2609
0
        free_node(np);
2610
0
        return NULL;
2611
0
    }
2612
0
    if (nexttype == UNITS) {
2613
0
        type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2614
0
        if (type != QUOTESTRING) {
2615
0
            print_error("Bad UNITS", quoted_string_buffer, type);
2616
0
            free_node(np);
2617
0
            return NULL;
2618
0
        }
2619
0
        np->units = strdup(quoted_string_buffer);
2620
0
        nexttype = get_token(fp, nexttoken, MAXTOKEN);
2621
0
    }
2622
0
    if (nexttype != ACCESS) {
2623
0
        print_error("Should be ACCESS", nexttoken, nexttype);
2624
0
        free_node(np);
2625
0
        return NULL;
2626
0
    }
2627
0
    type = get_token(fp, token, MAXTOKEN);
2628
0
    if (type != READONLY && type != READWRITE && type != WRITEONLY
2629
0
        && type != NOACCESS && type != READCREATE && type != ACCNOTIFY) {
2630
0
        print_error("Bad ACCESS type", token, type);
2631
0
        free_node(np);
2632
0
        return NULL;
2633
0
    }
2634
0
    np->access = type;
2635
0
    type = get_token(fp, token, MAXTOKEN);
2636
0
    if (type != STATUS) {
2637
0
        print_error("Should be STATUS", token, type);
2638
0
        free_node(np);
2639
0
        return NULL;
2640
0
    }
2641
0
    type = get_token(fp, token, MAXTOKEN);
2642
0
    if (type != MANDATORY && type != CURRENT && type != KW_OPTIONAL &&
2643
0
        type != OBSOLETE && type != DEPRECATED) {
2644
0
        print_error("Bad STATUS", token, type);
2645
0
        free_node(np);
2646
0
        return NULL;
2647
0
    }
2648
0
    np->status = type;
2649
    /*
2650
     * Optional parts of the OBJECT-TYPE macro
2651
     */
2652
0
    type = get_token(fp, token, MAXTOKEN);
2653
0
    while (type != EQUALS && type != ENDOFFILE) {
2654
0
        switch (type) {
2655
0
        case DESCRIPTION:
2656
0
            type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2657
2658
0
            if (type != QUOTESTRING) {
2659
0
                print_error("Bad DESCRIPTION", quoted_string_buffer, type);
2660
0
                free_node(np);
2661
0
                return NULL;
2662
0
            }
2663
0
            if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
2664
0
               NETSNMP_DS_LIB_SAVE_MIB_DESCRS)) {
2665
0
                np->description = strdup(quoted_string_buffer);
2666
0
            }
2667
0
            break;
2668
2669
0
        case REFERENCE:
2670
0
            type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2671
0
            if (type != QUOTESTRING) {
2672
0
                print_error("Bad REFERENCE", quoted_string_buffer, type);
2673
0
                free_node(np);
2674
0
                return NULL;
2675
0
            }
2676
0
            np->reference = strdup(quoted_string_buffer);
2677
0
            break;
2678
0
        case INDEX:
2679
0
            if (np->augments) {
2680
0
                print_error("Cannot have both INDEX and AUGMENTS", token,
2681
0
                            type);
2682
0
                free_node(np);
2683
0
                return NULL;
2684
0
            }
2685
0
            np->indexes = getIndexes(fp, &np->indexes);
2686
0
            if (np->indexes == NULL) {
2687
0
                print_error("Bad INDEX list", token, type);
2688
0
                free_node(np);
2689
0
                return NULL;
2690
0
            }
2691
0
            break;
2692
0
        case AUGMENTS:
2693
0
            if (np->indexes) {
2694
0
                print_error("Cannot have both INDEX and AUGMENTS", token,
2695
0
                            type);
2696
0
                free_node(np);
2697
0
                return NULL;
2698
0
            }
2699
0
            np->indexes = getIndexes(fp, &np->indexes);
2700
0
            if (np->indexes == NULL) {
2701
0
                print_error("Bad AUGMENTS list", token, type);
2702
0
                free_node(np);
2703
0
                return NULL;
2704
0
            }
2705
0
            np->augments = strdup(np->indexes->ilabel);
2706
0
            free_indexes(&np->indexes);
2707
0
            break;
2708
0
        case DEFVAL:
2709
            /*
2710
             * Mark's defVal section 
2711
             */
2712
0
            type = get_token(fp, quoted_string_buffer,
2713
0
                             sizeof(quoted_string_buffer));
2714
0
            if (type != LEFTBRACKET) {
2715
0
                print_error("Bad DEFAULTVALUE", quoted_string_buffer,
2716
0
                            type);
2717
0
                free_node(np);
2718
0
                return NULL;
2719
0
            }
2720
2721
0
            {
2722
0
                int             level = 1;
2723
0
                char            defbuf[512];
2724
2725
0
                defbuf[0] = 0;
2726
0
                while (1) {
2727
0
                    type = get_token(fp, quoted_string_buffer,
2728
0
                                     sizeof(quoted_string_buffer));
2729
0
                    if ((type == RIGHTBRACKET && --level == 0)
2730
0
                        || type == ENDOFFILE)
2731
0
                        break;
2732
0
                    else if (type == LEFTBRACKET)
2733
0
                        level++;
2734
0
                    if (type == QUOTESTRING)
2735
0
                        strlcat(defbuf, "\\\"", sizeof(defbuf));
2736
0
                    strlcat(defbuf, quoted_string_buffer, sizeof(defbuf));
2737
0
                    if (type == QUOTESTRING)
2738
0
                        strlcat(defbuf, "\\\"", sizeof(defbuf));
2739
0
                    strlcat(defbuf, " ", sizeof(defbuf));
2740
0
                }
2741
2742
0
                if (type != RIGHTBRACKET) {
2743
0
                    print_error("Bad DEFAULTVALUE", quoted_string_buffer,
2744
0
                                type);
2745
0
                    free_node(np);
2746
0
                    return NULL;
2747
0
                }
2748
2749
                /*
2750
                 * Ensure strlen(defbuf) is above zero
2751
                 */
2752
0
                if (strlen(defbuf) == 0) {
2753
0
                    print_error("Bad DEFAULTVALUE", quoted_string_buffer,
2754
0
                                type);
2755
0
                    free_node(np);
2756
0
                    return NULL;
2757
0
                }
2758
0
                defbuf[strlen(defbuf) - 1] = 0;
2759
0
                np->defaultValue = strdup(defbuf);
2760
0
            }
2761
2762
0
            break;
2763
2764
0
        case NUM_ENTRIES:
2765
0
            if (tossObjectIdentifier(fp) != OBJID) {
2766
0
                print_error("Bad Object Identifier", token, type);
2767
0
                free_node(np);
2768
0
                return NULL;
2769
0
            }
2770
0
            break;
2771
2772
0
        default:
2773
0
            print_error("Bad format of optional clauses", token, type);
2774
0
            free_node(np);
2775
0
            return NULL;
2776
2777
0
        }
2778
0
        type = get_token(fp, token, MAXTOKEN);
2779
0
    }
2780
0
    if (type != EQUALS) {
2781
0
        print_error("Bad format", token, type);
2782
0
        free_node(np);
2783
0
        return NULL;
2784
0
    }
2785
0
    return merge_parse_objectid(np, fp, name);
2786
0
}
2787
2788
/*
2789
 * Parses an OBJECT GROUP macro.
2790
 * Returns 0 on error.
2791
 *
2792
 * Also parses object-identity, since they are similar (ignore STATUS).
2793
 *   - WJH 10/96
2794
 */
2795
static struct node *
2796
parse_objectgroup(FILE * fp, char *name, int what, struct objgroup **ol)
2797
0
{
2798
0
    int             type;
2799
0
    char            token[MAXTOKEN];
2800
0
    char            quoted_string_buffer[MAXQUOTESTR];
2801
0
    struct node    *np;
2802
2803
0
    np = alloc_node(current_module);
2804
0
    if (np == NULL)
2805
0
        return (NULL);
2806
0
    type = get_token(fp, token, MAXTOKEN);
2807
0
    if (type == what) {
2808
0
        type = get_token(fp, token, MAXTOKEN);
2809
0
        if (type != LEFTBRACKET) {
2810
0
            print_error("Expected \"{\"", token, type);
2811
0
            goto skip;
2812
0
        }
2813
0
        do {
2814
0
            struct objgroup *o;
2815
0
            type = get_token(fp, token, MAXTOKEN);
2816
0
            if (type != LABEL) {
2817
0
                print_error("Bad identifier", token, type);
2818
0
                goto skip;
2819
0
            }
2820
0
            o = (struct objgroup *) malloc(sizeof(struct objgroup));
2821
0
            if (!o) {
2822
0
                print_error("Resource failure", token, type);
2823
0
                goto skip;
2824
0
            }
2825
0
            o->line = mibLine;
2826
0
            o->name = strdup(token);
2827
0
            o->next = *ol;
2828
0
            *ol = o;
2829
0
            type = get_token(fp, token, MAXTOKEN);
2830
0
        } while (type == COMMA);
2831
0
        if (type != RIGHTBRACKET) {
2832
0
            print_error("Expected \"}\" after list", token, type);
2833
0
            goto skip;
2834
0
        }
2835
0
        type = get_token(fp, token, type);
2836
0
    }
2837
0
    if (type != STATUS) {
2838
0
        print_error("Expected STATUS", token, type);
2839
0
        goto skip;
2840
0
    }
2841
0
    type = get_token(fp, token, MAXTOKEN);
2842
0
    if (type != CURRENT && type != DEPRECATED && type != OBSOLETE) {
2843
0
        print_error("Bad STATUS value", token, type);
2844
0
        goto skip;
2845
0
    }
2846
0
    type = get_token(fp, token, MAXTOKEN);
2847
0
    if (type != DESCRIPTION) {
2848
0
        print_error("Expected DESCRIPTION", token, type);
2849
0
        goto skip;
2850
0
    }
2851
0
    type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2852
0
    if (type != QUOTESTRING) {
2853
0
        print_error("Bad DESCRIPTION", quoted_string_buffer, type);
2854
0
        free_node(np);
2855
0
        return NULL;
2856
0
    }
2857
0
    if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
2858
0
             NETSNMP_DS_LIB_SAVE_MIB_DESCRS)) {
2859
0
        np->description = strdup(quoted_string_buffer);
2860
0
    }
2861
0
    type = get_token(fp, token, MAXTOKEN);
2862
0
    if (type == REFERENCE) {
2863
0
        type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2864
0
        if (type != QUOTESTRING) {
2865
0
            print_error("Bad REFERENCE", quoted_string_buffer, type);
2866
0
            free_node(np);
2867
0
            return NULL;
2868
0
        }
2869
0
        np->reference = strdup(quoted_string_buffer);
2870
0
        type = get_token(fp, token, MAXTOKEN);
2871
0
    }
2872
0
    if (type != EQUALS)
2873
0
        print_error("Expected \"::=\"", token, type);
2874
0
  skip:
2875
0
    while (type != EQUALS && type != ENDOFFILE)
2876
0
        type = get_token(fp, token, MAXTOKEN);
2877
2878
0
    return merge_parse_objectid(np, fp, name);
2879
0
}
2880
2881
/*
2882
 * Parses a NOTIFICATION-TYPE macro.
2883
 * Returns 0 on error.
2884
 */
2885
static struct node *
2886
parse_notificationDefinition(FILE * fp, char *name)
2887
0
{
2888
0
    register int    type;
2889
0
    char            token[MAXTOKEN];
2890
0
    char            quoted_string_buffer[MAXQUOTESTR];
2891
0
    register struct node *np;
2892
2893
0
    np = alloc_node(current_module);
2894
0
    if (np == NULL)
2895
0
        return (NULL);
2896
0
    type = get_token(fp, token, MAXTOKEN);
2897
0
    while (type != EQUALS && type != ENDOFFILE) {
2898
0
        switch (type) {
2899
0
        case DESCRIPTION:
2900
0
            type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2901
0
            if (type != QUOTESTRING) {
2902
0
                print_error("Bad DESCRIPTION", quoted_string_buffer, type);
2903
0
                goto free_node;
2904
0
            }
2905
0
            if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
2906
0
               NETSNMP_DS_LIB_SAVE_MIB_DESCRS)) {
2907
0
                np->description = strdup(quoted_string_buffer);
2908
0
            }
2909
0
            break;
2910
0
        case REFERENCE:
2911
0
            type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2912
0
            if (type != QUOTESTRING) {
2913
0
                print_error("Bad REFERENCE", quoted_string_buffer, type);
2914
0
                goto free_node;
2915
0
            }
2916
0
            free(np->reference);
2917
0
            np->reference = strdup(quoted_string_buffer);
2918
0
            break;
2919
0
        case OBJECTS:
2920
0
            np->varbinds = getVarbinds(fp, &np->varbinds);
2921
0
            if (!np->varbinds) {
2922
0
                print_error("Bad OBJECTS list", token, type);
2923
0
                goto free_node;
2924
0
            }
2925
0
            break;
2926
0
        default:
2927
            /*
2928
             * NOTHING 
2929
             */
2930
0
            break;
2931
0
        }
2932
0
        type = get_token(fp, token, MAXTOKEN);
2933
0
    }
2934
0
    return merge_parse_objectid(np, fp, name);
2935
2936
0
free_node:
2937
0
    free_node(np);
2938
0
    return NULL;
2939
0
}
2940
2941
/*
2942
 * Parses a TRAP-TYPE macro.
2943
 * Returns 0 on error.
2944
 */
2945
static struct node *
2946
parse_trapDefinition(FILE * fp, char *name)
2947
0
{
2948
0
    register int    type;
2949
0
    char            token[MAXTOKEN];
2950
0
    char            quoted_string_buffer[MAXQUOTESTR];
2951
0
    register struct node *np;
2952
2953
0
    np = alloc_node(current_module);
2954
0
    if (np == NULL)
2955
0
        return (NULL);
2956
0
    type = get_token(fp, token, MAXTOKEN);
2957
0
    while (type != EQUALS && type != ENDOFFILE) {
2958
0
        switch (type) {
2959
0
        case DESCRIPTION:
2960
0
            type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2961
0
            if (type != QUOTESTRING) {
2962
0
                print_error("Bad DESCRIPTION", quoted_string_buffer, type);
2963
0
                goto free_node;
2964
0
            }
2965
0
            if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
2966
0
               NETSNMP_DS_LIB_SAVE_MIB_DESCRS)) {
2967
0
                np->description = strdup(quoted_string_buffer);
2968
0
            }
2969
0
            break;
2970
0
        case REFERENCE:
2971
            /* I'm not sure REFERENCEs are legal in smiv1 traps??? */
2972
0
            type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
2973
0
            if (type != QUOTESTRING) {
2974
0
                print_error("Bad REFERENCE", quoted_string_buffer, type);
2975
0
                goto free_node;
2976
0
            }
2977
0
            np->reference = strdup(quoted_string_buffer);
2978
0
            break;
2979
0
        case ENTERPRISE:
2980
0
            type = get_token(fp, token, MAXTOKEN);
2981
0
            if (type == LEFTBRACKET) {
2982
0
                type = get_token(fp, token, MAXTOKEN);
2983
0
                if (type != LABEL) {
2984
0
                    print_error("Bad Trap Format", token, type);
2985
0
                    goto free_node;
2986
0
                }
2987
0
                np->parent = strdup(token);
2988
                /*
2989
                 * Get right bracket 
2990
                 */
2991
0
                type = get_token(fp, token, MAXTOKEN);
2992
0
            } else if (type == LABEL) {
2993
0
                np->parent = strdup(token);
2994
0
            } else {
2995
0
                goto free_node;
2996
0
            }
2997
0
            break;
2998
0
        case VARIABLES:
2999
0
            np->varbinds = getVarbinds(fp, &np->varbinds);
3000
0
            if (!np->varbinds) {
3001
0
                print_error("Bad VARIABLES list", token, type);
3002
0
                goto free_node;
3003
0
            }
3004
0
            break;
3005
0
        default:
3006
            /*
3007
             * NOTHING 
3008
             */
3009
0
            break;
3010
0
        }
3011
0
        type = get_token(fp, token, MAXTOKEN);
3012
0
    }
3013
0
    type = get_token(fp, token, MAXTOKEN);
3014
3015
0
    np->label = strdup(name);
3016
3017
0
    if (type != NUMBER) {
3018
0
        print_error("Expected a Number", token, type);
3019
0
        goto free_node;
3020
0
    }
3021
0
    np->subid = strtoul(token, NULL, 10);
3022
0
    np->next = alloc_node(current_module);
3023
0
    if (np->next == NULL)
3024
0
        goto free_node;
3025
3026
    /* Catch the syntax error */
3027
0
    if (np->parent == NULL) {
3028
0
        gMibError = MODULE_SYNTAX_ERROR;
3029
0
        goto free_next_node;
3030
0
    }
3031
3032
0
    np->next->parent = np->parent;
3033
0
    np->parent = NULL;
3034
0
    if (asprintf(&np->parent, "%s#", np->next->parent) < 0)
3035
0
        goto free_next_node;
3036
0
    np->next->label = strdup(np->parent);
3037
0
    return np;
3038
3039
0
free_next_node:
3040
0
    free_node(np->next);
3041
3042
0
free_node:
3043
0
    free_node(np);
3044
0
    return NULL;
3045
0
}
3046
3047
3048
/*
3049
 * Parses a compliance macro
3050
 * Returns 0 on error.
3051
 */
3052
static int
3053
eat_syntax(FILE * fp, char *token, int maxtoken)
3054
0
{
3055
0
    int             type, nexttype;
3056
0
    struct node    *np = alloc_node(current_module);
3057
0
    char            nexttoken[MAXTOKEN];
3058
3059
0
    if (!np)
3060
0
  return 0;
3061
3062
0
    type = get_token(fp, token, maxtoken);
3063
0
    nexttype = get_token(fp, nexttoken, MAXTOKEN);
3064
0
    switch (type) {
3065
0
    case INTEGER:
3066
0
    case INTEGER32:
3067
0
    case UINTEGER32:
3068
0
    case UNSIGNED32:
3069
0
    case COUNTER:
3070
0
    case GAUGE:
3071
0
    case BITSTRING:
3072
0
    case LABEL:
3073
0
        if (nexttype == LEFTBRACKET) {
3074
            /*
3075
             * if there is an enumeration list, parse it 
3076
             */
3077
0
            np->enums = parse_enumlist(fp, &np->enums);
3078
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
3079
0
        } else if (nexttype == LEFTPAREN) {
3080
            /*
3081
             * if there is a range list, parse it 
3082
             */
3083
0
            np->ranges = parse_ranges(fp, &np->ranges);
3084
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
3085
0
        }
3086
0
        break;
3087
0
    case OCTETSTR:
3088
0
    case KW_OPAQUE:
3089
        /*
3090
         * parse any SIZE specification 
3091
         */
3092
0
        if (nexttype == LEFTPAREN) {
3093
0
            nexttype = get_token(fp, nexttoken, MAXTOKEN);
3094
0
            if (nexttype == SIZE) {
3095
0
                nexttype = get_token(fp, nexttoken, MAXTOKEN);
3096
0
                if (nexttype == LEFTPAREN) {
3097
0
                    np->ranges = parse_ranges(fp, &np->ranges);
3098
0
                    nexttype = get_token(fp, nexttoken, MAXTOKEN);      /* ) */
3099
0
                    if (nexttype == RIGHTPAREN) {
3100
0
                        nexttype = get_token(fp, nexttoken, MAXTOKEN);
3101
0
                        break;
3102
0
                    }
3103
0
                }
3104
0
            }
3105
0
            print_error("Bad SIZE syntax", token, type);
3106
0
            free_node(np);
3107
0
            return nexttype;
3108
0
        }
3109
0
        break;
3110
0
    case OBJID:
3111
0
    case NETADDR:
3112
0
    case IPADDR:
3113
0
    case TIMETICKS:
3114
0
    case NUL:
3115
0
    case NSAPADDRESS:
3116
0
    case COUNTER64:
3117
0
        break;
3118
0
    default:
3119
0
        print_error("Bad syntax", token, type);
3120
0
        free_node(np);
3121
0
        return nexttype;
3122
0
    }
3123
0
    free_node(np);
3124
0
    return nexttype;
3125
0
}
3126
3127
static int
3128
compliance_lookup(const char *name, int modid)
3129
0
{
3130
0
    struct objgroup *op;
3131
3132
0
    if (modid != -1)
3133
0
        return find_tree_node(name, modid) != NULL;
3134
3135
0
    op = malloc(sizeof(struct objgroup));
3136
0
    if (!op)
3137
0
        return 0;
3138
3139
0
    op->next = objgroups;
3140
0
    op->name = strdup(name);
3141
0
    if (!op->name) {
3142
0
        free(op);
3143
0
        return 0;
3144
0
    }
3145
0
    op->line = mibLine;
3146
0
    objgroups = op;
3147
0
    return 1;
3148
0
}
3149
3150
static struct node *
3151
parse_compliance(FILE * fp, char *name)
3152
0
{
3153
0
    int             type;
3154
0
    char            token[MAXTOKEN];
3155
0
    char            quoted_string_buffer[MAXQUOTESTR];
3156
0
    struct node    *np;
3157
3158
0
    np = alloc_node(current_module);
3159
0
    if (np == NULL)
3160
0
        return (NULL);
3161
0
    type = get_token(fp, token, MAXTOKEN);
3162
0
    if (type != STATUS) {
3163
0
        print_error("Expected STATUS", token, type);
3164
0
        goto skip;
3165
0
    }
3166
0
    type = get_token(fp, token, MAXTOKEN);
3167
0
    if (type != CURRENT && type != DEPRECATED && type != OBSOLETE) {
3168
0
        print_error("Bad STATUS", token, type);
3169
0
        goto skip;
3170
0
    }
3171
0
    type = get_token(fp, token, MAXTOKEN);
3172
0
    if (type != DESCRIPTION) {
3173
0
        print_error("Expected DESCRIPTION", token, type);
3174
0
        goto skip;
3175
0
    }
3176
0
    type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
3177
0
    if (type != QUOTESTRING) {
3178
0
        print_error("Bad DESCRIPTION", quoted_string_buffer, type);
3179
0
        goto skip;
3180
0
    }
3181
0
    if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
3182
0
             NETSNMP_DS_LIB_SAVE_MIB_DESCRS))
3183
0
        np->description = strdup(quoted_string_buffer);
3184
0
    type = get_token(fp, token, MAXTOKEN);
3185
0
    if (type == REFERENCE) {
3186
0
        type = get_token(fp, quoted_string_buffer,
3187
0
                         sizeof(quoted_string_buffer));
3188
0
        if (type != QUOTESTRING) {
3189
0
            print_error("Bad REFERENCE", quoted_string_buffer, type);
3190
0
            goto skip;
3191
0
        }
3192
0
        np->reference = strdup(quoted_string_buffer);
3193
0
        type = get_token(fp, token, MAXTOKEN);
3194
0
    }
3195
0
    if (type != MODULE) {
3196
0
        print_error("Expected MODULE", token, type);
3197
0
        goto skip;
3198
0
    }
3199
0
    while (type == MODULE) {
3200
0
        int             modid = -1;
3201
0
        char            modname[MAXTOKEN];
3202
0
        type = get_token(fp, token, MAXTOKEN);
3203
0
        if (type == LABEL
3204
0
            && strcmp(token, module_name(current_module, modname))) {
3205
0
            modid = read_module_internal(token);
3206
0
            if (modid != MODULE_LOADED_OK
3207
0
                && modid != MODULE_ALREADY_LOADED) {
3208
0
                print_error("Unknown module", token, type);
3209
0
                goto skip;
3210
0
            }
3211
0
            modid = which_module(token);
3212
0
            type = get_token(fp, token, MAXTOKEN);
3213
0
        }
3214
0
        if (type == MANDATORYGROUPS) {
3215
0
            type = get_token(fp, token, MAXTOKEN);
3216
0
            if (type != LEFTBRACKET) {
3217
0
                print_error("Expected \"{\"", token, type);
3218
0
                goto skip;
3219
0
            }
3220
0
            do {
3221
0
                type = get_token(fp, token, MAXTOKEN);
3222
0
                if (type != LABEL) {
3223
0
                    print_error("Bad group name", token, type);
3224
0
                    goto skip;
3225
0
                }
3226
0
                if (!compliance_lookup(token, modid))
3227
0
                    print_error("Unknown group", token, type);
3228
0
                type = get_token(fp, token, MAXTOKEN);
3229
0
            } while (type == COMMA);
3230
0
            if (type != RIGHTBRACKET) {
3231
0
                print_error("Expected \"}\"", token, type);
3232
0
                goto skip;
3233
0
            }
3234
0
            type = get_token(fp, token, MAXTOKEN);
3235
0
        }
3236
0
        while (type == GROUP || type == OBJECT) {
3237
0
            if (type == GROUP) {
3238
0
                type = get_token(fp, token, MAXTOKEN);
3239
0
                if (type != LABEL) {
3240
0
                    print_error("Bad group name", token, type);
3241
0
                    goto skip;
3242
0
                }
3243
0
                if (!compliance_lookup(token, modid))
3244
0
                    print_error("Unknown group", token, type);
3245
0
                type = get_token(fp, token, MAXTOKEN);
3246
0
            } else {
3247
0
                type = get_token(fp, token, MAXTOKEN);
3248
0
                if (type != LABEL) {
3249
0
                    print_error("Bad object name", token, type);
3250
0
                    goto skip;
3251
0
                }
3252
0
                if (!compliance_lookup(token, modid))
3253
0
                    print_error("Unknown group", token, type);
3254
0
                type = get_token(fp, token, MAXTOKEN);
3255
0
                if (type == SYNTAX)
3256
0
                    type = eat_syntax(fp, token, MAXTOKEN);
3257
0
                if (type == WRSYNTAX)
3258
0
                    type = eat_syntax(fp, token, MAXTOKEN);
3259
0
                if (type == MINACCESS) {
3260
0
                    type = get_token(fp, token, MAXTOKEN);
3261
0
                    if (type != NOACCESS && type != ACCNOTIFY
3262
0
                        && type != READONLY && type != WRITEONLY
3263
0
                        && type != READCREATE && type != READWRITE) {
3264
0
                        print_error("Bad MIN-ACCESS spec", token, type);
3265
0
                        goto skip;
3266
0
                    }
3267
0
                    type = get_token(fp, token, MAXTOKEN);
3268
0
                }
3269
0
            }
3270
0
            if (type != DESCRIPTION) {
3271
0
                print_error("Expected DESCRIPTION", token, type);
3272
0
                goto skip;
3273
0
            }
3274
0
            type = get_token(fp, token, MAXTOKEN);
3275
0
            if (type != QUOTESTRING) {
3276
0
                print_error("Bad DESCRIPTION", token, type);
3277
0
                goto skip;
3278
0
            }
3279
0
            type = get_token(fp, token, MAXTOKEN);
3280
0
        }
3281
0
    }
3282
0
  skip:
3283
0
    while (type != EQUALS && type != ENDOFFILE)
3284
0
        type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
3285
3286
0
    return merge_parse_objectid(np, fp, name);
3287
0
}
3288
3289
3290
/*
3291
 * Parses a capabilities macro
3292
 * Returns 0 on error.
3293
 */
3294
static struct node *
3295
parse_capabilities(FILE * fp, char *name)
3296
0
{
3297
0
    int             type;
3298
0
    char            token[MAXTOKEN];
3299
0
    char            quoted_string_buffer[MAXQUOTESTR];
3300
0
    struct node    *np;
3301
3302
0
    np = alloc_node(current_module);
3303
0
    if (np == NULL)
3304
0
        return (NULL);
3305
0
    type = get_token(fp, token, MAXTOKEN);
3306
0
    if (type != PRODREL) {
3307
0
        print_error("Expected PRODUCT-RELEASE", token, type);
3308
0
        goto skip;
3309
0
    }
3310
0
    type = get_token(fp, token, MAXTOKEN);
3311
0
    if (type != QUOTESTRING) {
3312
0
        print_error("Expected STRING after PRODUCT-RELEASE", token, type);
3313
0
        goto skip;
3314
0
    }
3315
0
    type = get_token(fp, token, MAXTOKEN);
3316
0
    if (type != STATUS) {
3317
0
        print_error("Expected STATUS", token, type);
3318
0
        goto skip;
3319
0
    }
3320
0
    type = get_token(fp, token, MAXTOKEN);
3321
0
    if (type != CURRENT && type != OBSOLETE) {
3322
0
        print_error("STATUS should be current or obsolete", token, type);
3323
0
        goto skip;
3324
0
    }
3325
0
    type = get_token(fp, token, MAXTOKEN);
3326
0
    if (type != DESCRIPTION) {
3327
0
        print_error("Expected DESCRIPTION", token, type);
3328
0
        goto skip;
3329
0
    }
3330
0
    type = get_token(fp, quoted_string_buffer, sizeof(quoted_string_buffer));
3331
0
    if (type != QUOTESTRING) {
3332
0
        print_error("Bad DESCRIPTION", quoted_string_buffer, type);
3333
0
        goto skip;
3334
0
    }
3335
0
    if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
3336
0
             NETSNMP_DS_LIB_SAVE_MIB_DESCRS)) {
3337
0
        np->description = strdup(quoted_string_buffer);
3338
0
    }
3339
0
    type = get_token(fp, token, MAXTOKEN);
3340
0
    if (type == REFERENCE) {
3341
0
        type = get_token(fp, quoted_string_buffer,
3342
0
                         sizeof(quoted_string_buffer));
3343
0
        if (type != QUOTESTRING) {
3344
0
            print_error("Bad REFERENCE", quoted_string_buffer, type);
3345
0
            goto skip;
3346
0
        }
3347
0
        np->reference = strdup(quoted_string_buffer);
3348
0
        type = get_token(fp, token, type);
3349
0
    }
3350
0
    while (type == SUPPORTS) {
3351
0
        int             modid;
3352
0
        struct tree    *tp;
3353
3354
0
        type = get_token(fp, token, MAXTOKEN);
3355
0
        if (type != LABEL) {
3356
0
            print_error("Bad module name", token, type);
3357
0
            goto skip;
3358
0
        }
3359
0
        modid = read_module_internal(token);
3360
0
        if (modid != MODULE_LOADED_OK && modid != MODULE_ALREADY_LOADED) {
3361
0
            print_error("Module not found", token, type);
3362
0
            goto skip;
3363
0
        }
3364
0
        modid = which_module(token);
3365
0
        type = get_token(fp, token, MAXTOKEN);
3366
0
        if (type != INCLUDES) {
3367
0
            print_error("Expected INCLUDES", token, type);
3368
0
            goto skip;
3369
0
        }
3370
0
        type = get_token(fp, token, MAXTOKEN);
3371
0
        if (type != LEFTBRACKET) {
3372
0
            print_error("Expected \"{\"", token, type);
3373
0
            goto skip;
3374
0
        }
3375
0
        do {
3376
0
            type = get_token(fp, token, MAXTOKEN);
3377
0
            if (type != LABEL) {
3378
0
                print_error("Expected group name", token, type);
3379
0
                goto skip;
3380
0
            }
3381
0
            tp = find_tree_node(token, modid);
3382
0
            if (!tp)
3383
0
                print_error("Group not found in module", token, type);
3384
0
            type = get_token(fp, token, MAXTOKEN);
3385
0
        } while (type == COMMA);
3386
0
        if (type != RIGHTBRACKET) {
3387
0
            print_error("Expected \"}\" after group list", token, type);
3388
0
            goto skip;
3389
0
        }
3390
0
        type = get_token(fp, token, MAXTOKEN);
3391
0
        while (type == VARIATION) {
3392
0
            type = get_token(fp, token, MAXTOKEN);
3393
0
            if (type != LABEL) {
3394
0
                print_error("Bad object name", token, type);
3395
0
                goto skip;
3396
0
            }
3397
0
            tp = find_tree_node(token, modid);
3398
0
            if (!tp)
3399
0
                print_error("Object not found in module", token, type);
3400
0
            type = get_token(fp, token, MAXTOKEN);
3401
0
            if (type == SYNTAX) {
3402
0
                type = eat_syntax(fp, token, MAXTOKEN);
3403
0
            }
3404
0
            if (type == WRSYNTAX) {
3405
0
                type = eat_syntax(fp, token, MAXTOKEN);
3406
0
            }
3407
0
            if (type == ACCESS) {
3408
0
                type = get_token(fp, token, MAXTOKEN);
3409
0
                if (type != ACCNOTIFY && type != READONLY
3410
0
                    && type != READWRITE && type != READCREATE
3411
0
                    && type != WRITEONLY && type != NOTIMPL) {
3412
0
                    print_error("Bad ACCESS", token, type);
3413
0
                    goto skip;
3414
0
                }
3415
0
                type = get_token(fp, token, MAXTOKEN);
3416
0
            }
3417
0
            if (type == CREATEREQ) {
3418
0
                type = get_token(fp, token, MAXTOKEN);
3419
0
                if (type != LEFTBRACKET) {
3420
0
                    print_error("Expected \"{\"", token, type);
3421
0
                    goto skip;
3422
0
                }
3423
0
                do {
3424
0
                    type = get_token(fp, token, MAXTOKEN);
3425
0
                    if (type != LABEL) {
3426
0
                        print_error("Bad object name in list", token,
3427
0
                                    type);
3428
0
                        goto skip;
3429
0
                    }
3430
0
                    type = get_token(fp, token, MAXTOKEN);
3431
0
                } while (type == COMMA);
3432
0
                if (type != RIGHTBRACKET) {
3433
0
                    print_error("Expected \"}\" after list", token, type);
3434
0
                    goto skip;
3435
0
                }
3436
0
                type = get_token(fp, token, MAXTOKEN);
3437
0
            }
3438
0
            if (type == DEFVAL) {
3439
0
                int             level = 1;
3440
0
                type = get_token(fp, token, MAXTOKEN);
3441
0
                if (type != LEFTBRACKET) {
3442
0
                    print_error("Expected \"{\" after DEFVAL", token,
3443
0
                                type);
3444
0
                    goto skip;
3445
0
                }
3446
0
                do {
3447
0
                    type = get_token(fp, token, MAXTOKEN);
3448
0
                    if (type == LEFTBRACKET)
3449
0
                        level++;
3450
0
                    else if (type == RIGHTBRACKET)
3451
0
                        level--;
3452
0
                } while ((type != RIGHTBRACKET || level != 0)
3453
0
                         && type != ENDOFFILE);
3454
0
                if (type != RIGHTBRACKET) {
3455
0
                    print_error("Missing \"}\" after DEFVAL", token, type);
3456
0
                    goto skip;
3457
0
                }
3458
0
                type = get_token(fp, token, MAXTOKEN);
3459
0
            }
3460
0
            if (type != DESCRIPTION) {
3461
0
                print_error("Expected DESCRIPTION", token, type);
3462
0
                goto skip;
3463
0
            }
3464
0
            type = get_token(fp, quoted_string_buffer,
3465
0
                             sizeof(quoted_string_buffer));
3466
0
            if (type != QUOTESTRING) {
3467
0
                print_error("Bad DESCRIPTION", quoted_string_buffer, type);
3468
0
                goto skip;
3469
0
            }
3470
0
            type = get_token(fp, token, MAXTOKEN);
3471
0
        }
3472
0
    }
3473
0
    if (type != EQUALS)
3474
0
        print_error("Expected \"::=\"", token, type);
3475
0
  skip:
3476
0
    while (type != EQUALS && type != ENDOFFILE) {
3477
0
        type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
3478
0
    }
3479
0
    return merge_parse_objectid(np, fp, name);
3480
0
}
3481
3482
/*
3483
 * Parses a module identity macro
3484
 * Returns 0 on error.
3485
 */
3486
static void
3487
check_utc(const char *utc)
3488
0
{
3489
0
    int             len, year, month, day, hour, minute;
3490
3491
0
    len = strlen(utc);
3492
0
    if (len == 0) {
3493
0
        print_error("Timestamp has zero length", utc, QUOTESTRING);
3494
0
        return;
3495
0
    }
3496
0
    if (utc[len - 1] != 'Z' && utc[len - 1] != 'z') {
3497
0
        print_error("Timestamp should end with Z", utc, QUOTESTRING);
3498
0
        return;
3499
0
    }
3500
0
    if (len == 11) {
3501
0
        len = sscanf(utc, "%2d%2d%2d%2d%2dZ", &year, &month, &day, &hour,
3502
0
                     &minute);
3503
0
        year += 1900;
3504
0
    } else if (len == 13)
3505
0
        len = sscanf(utc, "%4d%2d%2d%2d%2dZ", &year, &month, &day, &hour,
3506
0
                     &minute);
3507
0
    else {
3508
0
        print_error("Bad timestamp format (11 or 13 characters)",
3509
0
                    utc, QUOTESTRING);
3510
0
        return;
3511
0
    }
3512
0
    if (len != 5) {
3513
0
        print_error("Bad timestamp format", utc, QUOTESTRING);
3514
0
        return;
3515
0
    }
3516
0
    if (month < 1 || month > 12)
3517
0
        print_error("Bad month in timestamp", utc, QUOTESTRING);
3518
0
    if (day < 1 || day > 31)
3519
0
        print_error("Bad day in timestamp", utc, QUOTESTRING);
3520
0
    if (hour < 0 || hour > 23)
3521
0
        print_error("Bad hour in timestamp", utc, QUOTESTRING);
3522
0
    if (minute < 0 || minute > 59)
3523
0
        print_error("Bad minute in timestamp", utc, QUOTESTRING);
3524
0
}
3525
3526
static struct node *
3527
parse_moduleIdentity(FILE * fp, char *name)
3528
0
{
3529
0
    register int    type;
3530
0
    char            token[MAXTOKEN];
3531
0
    char            quoted_string_buffer[MAXQUOTESTR];
3532
0
    register struct node *np;
3533
3534
0
    np = alloc_node(current_module);
3535
0
    if (np == NULL)
3536
0
        return (NULL);
3537
0
    type = get_token(fp, token, MAXTOKEN);
3538
0
    if (type != LASTUPDATED) {
3539
0
        print_error("Expected LAST-UPDATED", token, type);
3540
0
        goto skip;
3541
0
    }
3542
0
    type = get_token(fp, token, MAXTOKEN);
3543
0
    if (type != QUOTESTRING) {
3544
0
        print_error("Need STRING for LAST-UPDATED", token, type);
3545
0
        goto skip;
3546
0
    }
3547
0
    check_utc(token);
3548
0
    type = get_token(fp, token, MAXTOKEN);
3549
0
    if (type != ORGANIZATION) {
3550
0
        print_error("Expected ORGANIZATION", token, type);
3551
0
        goto skip;
3552
0
    }
3553
0
    type = get_token(fp, token, MAXTOKEN);
3554
0
    if (type != QUOTESTRING) {
3555
0
        print_error("Bad ORGANIZATION", token, type);
3556
0
        goto skip;
3557
0
    }
3558
0
    type = get_token(fp, token, MAXTOKEN);
3559
0
    if (type != CONTACTINFO) {
3560
0
        print_error("Expected CONTACT-INFO", token, type);
3561
0
        goto skip;
3562
0
    }
3563
0
    type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
3564
0
    if (type != QUOTESTRING) {
3565
0
        print_error("Bad CONTACT-INFO", quoted_string_buffer, type);
3566
0
        goto skip;
3567
0
    }
3568
0
    type = get_token(fp, token, MAXTOKEN);
3569
0
    if (type != DESCRIPTION) {
3570
0
        print_error("Expected DESCRIPTION", token, type);
3571
0
        goto skip;
3572
0
    }
3573
0
    type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
3574
0
    if (type != QUOTESTRING) {
3575
0
        print_error("Bad DESCRIPTION", quoted_string_buffer, type);
3576
0
        goto skip;
3577
0
    }
3578
0
    if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
3579
0
             NETSNMP_DS_LIB_SAVE_MIB_DESCRS)) {
3580
0
        np->description = strdup(quoted_string_buffer);
3581
0
    }
3582
0
    type = get_token(fp, token, MAXTOKEN);
3583
0
    while (type == REVISION) {
3584
0
        type = get_token(fp, token, MAXTOKEN);
3585
0
        if (type != QUOTESTRING) {
3586
0
            print_error("Bad REVISION", token, type);
3587
0
            goto skip;
3588
0
        }
3589
0
        check_utc(token);
3590
0
        type = get_token(fp, token, MAXTOKEN);
3591
0
        if (type != DESCRIPTION) {
3592
0
            print_error("Expected DESCRIPTION", token, type);
3593
0
            goto skip;
3594
0
        }
3595
0
        type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
3596
0
        if (type != QUOTESTRING) {
3597
0
            print_error("Bad DESCRIPTION", quoted_string_buffer, type);
3598
0
            goto skip;
3599
0
        }
3600
0
        type = get_token(fp, token, MAXTOKEN);
3601
0
    }
3602
0
    if (type != EQUALS)
3603
0
        print_error("Expected \"::=\"", token, type);
3604
0
  skip:
3605
0
    while (type != EQUALS && type != ENDOFFILE) {
3606
0
        type = get_token(fp, quoted_string_buffer, MAXQUOTESTR);
3607
0
    }
3608
0
    return merge_parse_objectid(np, fp, name);
3609
0
}
3610
3611
3612
/*
3613
 * Parses a MACRO definition
3614
 * Expect BEGIN, discard everything to end.
3615
 * Returns 0 on error.
3616
 */
3617
static struct node *
3618
parse_macro(FILE * fp, char *name)
3619
1
{
3620
1
    register int    type;
3621
1
    char            token[MAXTOKEN];
3622
1
    struct node    *np;
3623
1
    int             iLine = mibLine;
3624
3625
1
    np = alloc_node(current_module);
3626
1
    if (np == NULL)
3627
0
        return (NULL);
3628
1
    type = get_token(fp, token, sizeof(token));
3629
26.4k
    while (type != EQUALS && type != ENDOFFILE) {
3630
26.4k
        type = get_token(fp, token, sizeof(token));
3631
26.4k
    }
3632
1
    if (type != EQUALS) {
3633
1
        if (np)
3634
1
            free_node(np);
3635
1
        return NULL;
3636
1
    }
3637
0
    while (type != BEGIN && type != ENDOFFILE) {
3638
0
        type = get_token(fp, token, sizeof(token));
3639
0
    }
3640
0
    if (type != BEGIN) {
3641
0
        if (np)
3642
0
            free_node(np);
3643
0
        return NULL;
3644
0
    }
3645
0
    while (type != END && type != ENDOFFILE) {
3646
0
        type = get_token(fp, token, sizeof(token));
3647
0
    }
3648
0
    if (type != END) {
3649
0
        if (np)
3650
0
            free_node(np);
3651
0
        return NULL;
3652
0
    }
3653
3654
0
    if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
3655
0
         NETSNMP_DS_LIB_MIB_WARNINGS)) {
3656
0
        snmp_log(LOG_WARNING,
3657
0
                 "%s MACRO (lines %d..%d parsed and ignored).\n", name,
3658
0
                 iLine, mibLine);
3659
0
    }
3660
3661
0
    return np;
3662
0
}
3663
3664
/*
3665
 * Parses a module import clause
3666
 *   loading any modules referenced
3667
 */
3668
static void
3669
parse_imports(FILE * fp)
3670
0
{
3671
0
    register int    type;
3672
0
    char            token[MAXTOKEN];
3673
0
    char            modbuf[256];
3674
0
#define MAX_IMPORTS 512
3675
0
    struct module_import *import_list;
3676
0
    int             this_module;
3677
0
    struct module  *mp;
3678
3679
0
    int             import_count = 0;   /* Total number of imported descriptors */
3680
0
    int             i = 0, old_i;       /* index of first import from each module */
3681
3682
0
    import_list = malloc(MAX_IMPORTS * sizeof(*import_list));
3683
3684
0
    type = get_token(fp, token, MAXTOKEN);
3685
3686
    /*
3687
     * Parse the IMPORTS clause
3688
     */
3689
0
    while (type != SEMI && type != ENDOFFILE) {
3690
0
        if (type == LABEL) {
3691
0
            if (import_count == MAX_IMPORTS) {
3692
0
                print_error("Too many imported symbols", token, type);
3693
0
                do {
3694
0
                    type = get_token(fp, token, MAXTOKEN);
3695
0
                } while (type != SEMI && type != ENDOFFILE);
3696
0
                goto out;
3697
0
            }
3698
0
            import_list[import_count++].label = strdup(token);
3699
0
        } else if (type == FROM) {
3700
0
            type = get_token(fp, token, MAXTOKEN);
3701
0
            if (import_count == i) {    /* All imports are handled internally */
3702
0
                type = get_token(fp, token, MAXTOKEN);
3703
0
                continue;
3704
0
            }
3705
0
            this_module = which_module(token);
3706
3707
0
            for (old_i = i; i < import_count; ++i)
3708
0
                import_list[i].modid = this_module;
3709
3710
            /*
3711
             * Recursively read any pre-requisite modules
3712
             */
3713
0
            if (read_module_internal(token) == MODULE_NOT_FOUND) {
3714
0
    int found = 0;
3715
0
                for (; old_i < import_count; ++old_i) {
3716
0
                    found += read_import_replacements(token, &import_list[old_i]);
3717
0
                }
3718
0
    if (!found)
3719
0
        print_module_not_found(token);
3720
0
            }
3721
0
        }
3722
0
        type = get_token(fp, token, MAXTOKEN);
3723
0
    }
3724
3725
    /* Initialize modid in case the module name was missing. */
3726
0
    for (; i < import_count; ++i)
3727
0
        import_list[i].modid = -1;
3728
3729
    /*
3730
     * Save the import information
3731
     *   in the global module table
3732
     */
3733
0
    for (mp = module_head; mp; mp = mp->next) {
3734
0
        if (mp->modid == current_module) {
3735
0
            if (import_count == 0)
3736
0
                goto out;
3737
0
            if (mp->imports && (mp->imports != root_imports)) {
3738
                /*
3739
                 * this can happen if all modules are in one source file. 
3740
                 */
3741
0
                for (i = 0; i < mp->no_imports; ++i) {
3742
0
                    DEBUGMSGTL(("parse-mibs",
3743
0
                                "#### freeing Module %d '%s' %d\n",
3744
0
                                mp->modid, mp->imports[i].label,
3745
0
                                mp->imports[i].modid));
3746
0
                    free(mp->imports[i].label);
3747
0
                }
3748
0
                free(mp->imports);
3749
0
            }
3750
0
            mp->imports = (struct module_import *)
3751
0
                calloc(import_count, sizeof(struct module_import));
3752
0
            if (mp->imports == NULL)
3753
0
                goto out;
3754
0
            for (i = 0; i < import_count; ++i) {
3755
0
                mp->imports[i].label = import_list[i].label;
3756
0
                import_list[i].label = NULL;
3757
0
                mp->imports[i].modid = import_list[i].modid;
3758
0
                DEBUGMSGTL(("parse-mibs",
3759
0
                            "#### adding Module %d '%s' %d\n", mp->modid,
3760
0
                            mp->imports[i].label, mp->imports[i].modid));
3761
0
            }
3762
0
            mp->no_imports = import_count;
3763
0
            goto out;
3764
0
        }
3765
0
    }
3766
3767
    /*
3768
     * Shouldn't get this far
3769
     */
3770
0
    print_module_not_found(module_name(current_module, modbuf));
3771
3772
0
out:
3773
0
    for (i = 0; i < import_count; ++i)
3774
0
        free(import_list[i].label);
3775
0
    free(import_list);
3776
0
    return;
3777
0
}
3778
3779
3780
3781
/*
3782
 * MIB module handling routines
3783
 */
3784
3785
static void
3786
dump_module_list(void)
3787
0
{
3788
0
    struct module  *mp = module_head;
3789
3790
0
    DEBUGMSGTL(("parse-mibs", "Module list:\n"));
3791
0
    while (mp) {
3792
0
        DEBUGMSGTL(("parse-mibs", "  %s %d %s %d\n", mp->name, mp->modid,
3793
0
                    mp->file, mp->no_imports));
3794
0
        mp = mp->next;
3795
0
    }
3796
0
}
3797
3798
int
3799
which_module(const char *name)
3800
38
{
3801
38
    struct module  *mp;
3802
3803
38
    for (mp = module_head; mp; mp = mp->next)
3804
35
        if (!label_compare(mp->name, name))
3805
35
            return (mp->modid);
3806
3807
3
    DEBUGMSGTL(("parse-mibs", "Module %s not found\n", name));
3808
3
    return (-1);
3809
38
}
3810
3811
/*
3812
 * module_name - copy module name to user buffer, return ptr to same.
3813
 */
3814
char           *
3815
module_name(int modid, char *cp)
3816
0
{
3817
0
    struct module  *mp;
3818
3819
0
    for (mp = module_head; mp; mp = mp->next)
3820
0
        if (mp->modid == modid) {
3821
0
            strcpy(cp, mp->name);
3822
0
            return (cp);
3823
0
        }
3824
3825
0
    if (modid != -1) DEBUGMSGTL(("parse-mibs", "Module %d not found\n", modid));
3826
0
    sprintf(cp, "#%d", modid);
3827
0
    return (cp);
3828
0
}
3829
3830
/*
3831
 *  Backwards compatability
3832
 *  Read newer modules that replace the one specified:-
3833
 *      either all of them (read_module_replacements),
3834
 *      or those relating to a specified identifier (read_import_replacements)
3835
 *      plus an interface to add new replacement requirements
3836
 */
3837
netsnmp_feature_child_of(parse_add_module_replacement, netsnmp_unused);
3838
#ifndef NETSNMP_FEATURE_REMOVE_PARSE_ADD_MODULE_REPLACEMENT
3839
void
3840
add_module_replacement(const char *old_module,
3841
                       const char *new_module_name,
3842
                       const char *tag, int len)
3843
0
{
3844
0
    struct module_compatability *mcp;
3845
3846
0
    mcp = (struct module_compatability *)
3847
0
        calloc(1, sizeof(struct module_compatability));
3848
0
    if (mcp == NULL)
3849
0
        return;
3850
3851
0
    mcp->old_module = strdup(old_module);
3852
0
    mcp->new_module = strdup(new_module_name);
3853
0
    if (tag)
3854
0
        mcp->tag = strdup(tag);
3855
0
    mcp->tag_len = len;
3856
3857
0
    mcp->next = module_map_head;
3858
0
    module_map_head = mcp;
3859
0
}
3860
#endif /* NETSNMP_FEATURE_REMOVE_PARSE_ADD_MODULE_REPLACEMENT */
3861
3862
static int
3863
read_module_replacements(const char *name)
3864
47
{
3865
47
    struct module_compatability *mcp;
3866
3867
1.08k
    for (mcp = module_map_head; mcp; mcp = mcp->next) {
3868
1.03k
        if (!label_compare(mcp->old_module, name)) {
3869
0
            if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
3870
0
           NETSNMP_DS_LIB_MIB_WARNINGS)) {
3871
0
                snmp_log(LOG_WARNING,
3872
0
                         "Loading replacement module %s for %s (%s)\n",
3873
0
                         mcp->new_module, name, File);
3874
0
      }
3875
0
            (void) netsnmp_read_module(mcp->new_module);
3876
0
            return 1;
3877
0
        }
3878
1.03k
    }
3879
47
    return 0;
3880
47
}
3881
3882
static int
3883
read_import_replacements(const char *old_module_name,
3884
                         struct module_import *identifier)
3885
0
{
3886
0
    struct module_compatability *mcp;
3887
3888
    /*
3889
     * Look for matches first
3890
     */
3891
0
    for (mcp = module_map_head; mcp; mcp = mcp->next) {
3892
0
        if (!label_compare(mcp->old_module, old_module_name)) {
3893
3894
0
            if (                /* exact match */
3895
0
                   (mcp->tag_len == 0 &&
3896
0
                    (mcp->tag == NULL ||
3897
0
                     !label_compare(mcp->tag, identifier->label))) ||
3898
                   /*
3899
                    * prefix match 
3900
                    */
3901
0
                   (mcp->tag_len != 0 &&
3902
0
                    !strncmp(mcp->tag, identifier->label, mcp->tag_len))
3903
0
                ) {
3904
3905
0
                if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
3906
0
               NETSNMP_DS_LIB_MIB_WARNINGS)) {
3907
0
                    snmp_log(LOG_WARNING,
3908
0
                             "Importing %s from replacement module %s instead of %s (%s)\n",
3909
0
                             identifier->label, mcp->new_module,
3910
0
                             old_module_name, File);
3911
0
    }
3912
0
                (void) netsnmp_read_module(mcp->new_module);
3913
0
                identifier->modid = which_module(mcp->new_module);
3914
0
                return 1;         /* finished! */
3915
0
            }
3916
0
        }
3917
0
    }
3918
3919
    /*
3920
     * If no exact match, load everything relevant
3921
     */
3922
0
    return read_module_replacements(old_module_name);
3923
0
}
3924
3925
static int
3926
read_from_file(struct module *mp, const char *name)
3927
1.08k
{
3928
1.08k
    const char     *oldFile = File;
3929
1.08k
    int             oldLine = mibLine;
3930
1.08k
    int             oldModule = current_module;
3931
1.08k
    FILE           *fp;
3932
1.08k
    struct node    *np;
3933
1.08k
    int             res;
3934
3935
1.08k
    if (mp->no_imports != -1) {
3936
524
        DEBUGMSGTL(("parse-mibs", "Module %s already loaded\n",
3937
524
                    name));
3938
524
        return MODULE_ALREADY_LOADED;
3939
524
    }
3940
557
    if ((fp = fopen(mp->file, "r")) == NULL) {
3941
0
        int rval;
3942
0
        if (errno == ENOTDIR || errno == ENOENT)
3943
0
            rval = MODULE_NOT_FOUND;
3944
0
        else
3945
0
            rval = MODULE_LOAD_FAILED;
3946
0
        snmp_log_perror(mp->file);
3947
0
        return rval;
3948
0
    }
3949
557
#ifdef HAVE_FLOCKFILE
3950
557
    flockfile(fp);
3951
557
#endif
3952
557
    mp->no_imports = 0; /* Note that we've read the file */
3953
557
    File = mp->file;
3954
557
    mibLine = 1;
3955
557
    current_module = mp->modid;
3956
    /*
3957
     * Parse the file
3958
     */
3959
557
    np = parse(fp);
3960
557
#ifdef HAVE_FUNLOCKFILE
3961
557
    funlockfile(fp);
3962
557
#endif
3963
557
    fclose(fp);
3964
557
    File = oldFile;
3965
557
    mibLine = oldLine;
3966
557
    current_module = oldModule;
3967
557
    res = !np && gMibError == MODULE_SYNTAX_ERROR ?
3968
469
        MODULE_SYNTAX_ERROR : MODULE_LOADED_OK;
3969
557
    while (np) {
3970
0
        struct node *nnp = np->next;
3971
0
        free_node(np);
3972
0
        np = nnp;
3973
0
    }
3974
557
    return res;
3975
557
}
3976
3977
/*
3978
 *  Read in the named module
3979
 *      Returns the root of the whole tree
3980
 *      (by analogy with 'read_mib')
3981
 */
3982
static int
3983
read_module_internal(const char *name)
3984
1.12k
{
3985
1.12k
    struct module  *mp;
3986
3987
1.12k
    netsnmp_init_mib_internals();
3988
3989
23.0k
    for (mp = module_head; mp; mp = mp->next)
3990
22.9k
        if (!label_compare(mp->name, name))
3991
1.08k
            return read_from_file(mp, name);
3992
3993
47
    return MODULE_NOT_FOUND;
3994
1.12k
}
3995
3996
void
3997
adopt_orphans(void)
3998
1
{
3999
1
    struct node    *np = NULL, *onp;
4000
1
    struct tree    *tp;
4001
1
    int             i, adopted = 1;
4002
4003
1
    if (!orphan_nodes)
4004
1
        return;
4005
0
    init_node_hash(orphan_nodes);
4006
0
    orphan_nodes = NULL;
4007
4008
0
    while (adopted) {
4009
0
        adopted = 0;
4010
0
        for (i = 0; i < NHASHSIZE; i++)
4011
0
            if (nbuckets[i]) {
4012
0
                for (np = nbuckets[i]; np != NULL; np = np->next) {
4013
0
                    tp = find_tree_node(np->parent, -1);
4014
0
        if (tp) {
4015
0
      do_subtree(tp, &np);
4016
0
      adopted = 1;
4017
                        /*
4018
                         * if do_subtree adopted the entire bucket, stop
4019
                         */
4020
0
                        if(NULL == nbuckets[i])
4021
0
                            break;
4022
4023
                        /*
4024
                         * do_subtree may modify nbuckets, and if np
4025
                         * was adopted, np->next probably isn't an orphan
4026
                         * anymore. if np is still in the bucket (do_subtree
4027
                         * didn't adopt it) keep on plugging. otherwise
4028
                         * start over, at the top of the bucket.
4029
                         */
4030
0
                        for(onp = nbuckets[i]; onp; onp = onp->next)
4031
0
                            if(onp == np)
4032
0
                                break;
4033
0
                        if(NULL == onp) { /* not in the list */
4034
0
                            np = nbuckets[i]; /* start over */
4035
0
                        }
4036
0
        }
4037
0
    }
4038
0
            }
4039
0
    }
4040
4041
    /*
4042
     * Report on outstanding orphans
4043
     *    and link them back into the orphan list
4044
     */
4045
0
    for (i = 0; i < NHASHSIZE; i++)
4046
0
        if (nbuckets[i]) {
4047
0
            if (orphan_nodes)
4048
0
                onp = np->next = nbuckets[i];
4049
0
            else
4050
0
                onp = orphan_nodes = nbuckets[i];
4051
0
            nbuckets[i] = NULL;
4052
0
            while (onp) {
4053
0
                char            modbuf[256];
4054
0
                snmp_log(LOG_WARNING,
4055
0
                         "Cannot resolve OID in %s: %s ::= { %s %ld } at line %d in %s\n",
4056
0
                         module_name(onp->modid, modbuf),
4057
0
                         (onp->label ? onp->label : "<no label>"),
4058
0
                         (onp->parent ? onp->parent : "<no parent>"),
4059
0
                         onp->subid, onp->lineno, onp->filename);
4060
0
                np = onp;
4061
0
                onp = onp->next;
4062
0
            }
4063
0
        }
4064
0
}
4065
4066
#ifndef NETSNMP_NO_LEGACY_DEFINITIONS
4067
struct tree    *
4068
read_module(const char *name)
4069
0
{
4070
0
    return netsnmp_read_module(name);
4071
0
}
4072
#endif
4073
4074
struct tree    *
4075
netsnmp_read_module(const char *name)
4076
1.12k
{
4077
1.12k
    int status = 0;
4078
1.12k
    status = read_module_internal(name);
4079
4080
1.12k
    if (status == MODULE_NOT_FOUND) {
4081
47
        if (!read_module_replacements(name))
4082
47
            print_module_not_found(name);
4083
1.08k
    } else if (status == MODULE_SYNTAX_ERROR) {
4084
469
        gMibError = 0;
4085
469
        gLoop = 1;
4086
4087
469
        strncat(gMibNames, " ", sizeof(gMibNames) - strlen(gMibNames) - 1);
4088
469
        strncat(gMibNames, name, sizeof(gMibNames) - strlen(gMibNames) - 1);
4089
469
    }
4090
4091
1.12k
    return tree_head;
4092
1.12k
}
4093
4094
/*
4095
 * Prototype definition 
4096
 */
4097
void            unload_module_by_ID(int modID, struct tree *tree_top);
4098
4099
void
4100
unload_module_by_ID(int modID, struct tree *tree_top)
4101
0
{
4102
0
    struct tree    *tp, *next;
4103
0
    int             i;
4104
4105
0
    for (tp = tree_top; tp; tp = next) {
4106
        /*
4107
         * Essentially, this is equivalent to the code fragment:
4108
         *      if (tp->modID == modID)
4109
         *        tp->number_modules--;
4110
         * but handles one tree node being part of several modules,
4111
         * and possible multiple copies of the same module ID.
4112
         */
4113
0
        int             nmod = tp->number_modules;
4114
0
        if (nmod > 0) {         /* in some module */
4115
            /*
4116
             * Remove all copies of this module ID
4117
             */
4118
0
            int             cnt = 0, *pi1, *pi2 = tp->module_list;
4119
0
            for (i = 0, pi1 = pi2; i < nmod; i++, pi2++) {
4120
0
                if (*pi2 == modID)
4121
0
                    continue;
4122
0
                cnt++;
4123
0
                *pi1++ = *pi2;
4124
0
            }
4125
0
            if (nmod != cnt) {  /* in this module */
4126
                /*
4127
                 * if ( (nmod - cnt) > 1)
4128
                 * printf("Dup modid %d,  %d times, '%s'\n", tp->modid, (nmod-cnt), tp->label); fflush(stdout); ?* XXDEBUG 
4129
                 */
4130
0
                tp->number_modules = cnt;
4131
0
                switch (cnt) {
4132
0
                case 0:
4133
0
                    tp->module_list[0] = -1;    /* Mark unused, */
4134
0
        NETSNMP_FALLTHROUGH;
4135
4136
0
                case 1:        /* save the remaining module */
4137
0
                    if (&(tp->modid) != tp->module_list) {
4138
0
                        tp->modid = tp->module_list[0];
4139
0
                        free(tp->module_list);
4140
0
                        tp->module_list = &(tp->modid);
4141
0
                    }
4142
0
                    break;
4143
4144
0
                default:
4145
0
                    break;
4146
0
                }
4147
0
            }                   /* if tree node is in this module */
4148
0
        }
4149
        /*
4150
         * if tree node is in some module 
4151
         */
4152
0
        next = tp->next_peer;
4153
4154
4155
        /*
4156
         *  OK - that's dealt with *this* node.
4157
         *    Now let's look at the children.
4158
         *    (Isn't recursion wonderful!)
4159
         */
4160
0
        if (tp->child_list)
4161
0
            unload_module_by_ID(modID, tp->child_list);
4162
4163
4164
0
        if (tp->number_modules == 0) {
4165
            /*
4166
             * This node isn't needed any more (except perhaps
4167
             * for the sake of the children) 
4168
             */
4169
0
            if (tp->child_list == NULL) {
4170
0
                unlink_tree(tp);
4171
0
                free_tree(tp);
4172
0
            } else {
4173
0
                free_partial_tree(tp, TRUE);
4174
0
            }
4175
0
        }
4176
0
    }
4177
0
}
4178
4179
#ifndef NETSNMP_NO_LEGACY_DEFINITIONS
4180
int
4181
unload_module(const char *name)
4182
0
{
4183
0
    return netsnmp_unload_module(name);
4184
0
}
4185
#endif
4186
4187
int
4188
netsnmp_unload_module(const char *name)
4189
0
{
4190
0
    struct module  *mp;
4191
0
    int             modID = -1;
4192
4193
0
    for (mp = module_head; mp; mp = mp->next)
4194
0
        if (!label_compare(mp->name, name)) {
4195
0
            modID = mp->modid;
4196
0
            break;
4197
0
        }
4198
4199
0
    if (modID == -1) {
4200
0
        DEBUGMSGTL(("unload-mib", "Module %s not found to unload\n",
4201
0
                    name));
4202
0
        return MODULE_NOT_FOUND;
4203
0
    }
4204
0
    unload_module_by_ID(modID, tree_head);
4205
0
    mp->no_imports = -1;        /* mark as unloaded */
4206
0
    return MODULE_LOADED_OK;    /* Well, you know what I mean! */
4207
0
}
4208
4209
/*
4210
 * Clear module map, tree nodes, textual convention table.
4211
 */
4212
void
4213
unload_all_mibs(void)
4214
0
{
4215
0
    struct module  *mp;
4216
0
    struct module_compatability *mcp;
4217
0
    struct tc      *ptc;
4218
0
    unsigned int    i;
4219
4220
0
    for (mcp = module_map_head; mcp; mcp = module_map_head) {
4221
0
        if (mcp == module_map)
4222
0
            break;
4223
0
        module_map_head = mcp->next;
4224
0
        if (mcp->tag) free(NETSNMP_REMOVE_CONST(char *, mcp->tag));
4225
0
        free(NETSNMP_REMOVE_CONST(char *, mcp->old_module));
4226
0
        free(NETSNMP_REMOVE_CONST(char *, mcp->new_module));
4227
0
        free(mcp);
4228
0
    }
4229
4230
0
    for (mp = module_head; mp; mp = module_head) {
4231
0
        struct module_import *mi = mp->imports;
4232
0
        if (mi) {
4233
0
            for (i = 0; i < (unsigned int)mp->no_imports; ++i) {
4234
0
                SNMP_FREE((mi + i)->label);
4235
0
            }
4236
0
            mp->no_imports = 0;
4237
0
            if (mi == root_imports)
4238
0
                memset(mi, 0, sizeof(*mi));
4239
0
            else
4240
0
                free(mi);
4241
0
        }
4242
4243
0
        unload_module_by_ID(mp->modid, tree_head);
4244
0
        module_head = mp->next;
4245
0
        free(mp->name);
4246
0
        free(mp->file);
4247
0
        free(mp);
4248
0
    }
4249
0
    unload_module_by_ID(-1, tree_head);
4250
    /*
4251
     * tree nodes are cleared 
4252
     */
4253
4254
0
    for (i = 0, ptc = tclist; i < tc_alloc; i++, ptc++) {
4255
0
        if (ptc->type == 0)
4256
0
            continue;
4257
0
        free_enums(&ptc->enums);
4258
0
        free_ranges(&ptc->ranges);
4259
0
        free(ptc->descriptor);
4260
0
        if (ptc->hint)
4261
0
            free(ptc->hint);
4262
0
        if (ptc->description)
4263
0
            free(ptc->description);
4264
0
    }
4265
0
    SNMP_FREE(tclist);
4266
0
    tc_alloc = 0;
4267
4268
0
    memset(buckets, 0, sizeof(buckets));
4269
0
    memset(nbuckets, 0, sizeof(nbuckets));
4270
0
    memset(tbuckets, 0, sizeof(tbuckets));
4271
4272
0
    for (i = 0; i < sizeof(root_imports) / sizeof(root_imports[0]); i++) {
4273
0
        SNMP_FREE(root_imports[i].label);
4274
0
    }
4275
4276
0
    max_module = 0;
4277
0
    current_module = 0;
4278
0
    module_map_head = NULL;
4279
0
    SNMP_FREE(last_err_module);
4280
0
}
4281
4282
static void
4283
new_module(const char *name, const char *file)
4284
1.08k
{
4285
1.08k
    struct module  *mp;
4286
4287
177k
    for (mp = module_head; mp; mp = mp->next)
4288
177k
        if (!label_compare(mp->name, name)) {
4289
524
            DEBUGMSGTL(("parse-mibs", "  Module %s already noted\n", name));
4290
            /*
4291
             * Not the same file 
4292
             */
4293
524
            if (label_compare(mp->file, file)) {
4294
0
                DEBUGMSGTL(("parse-mibs", "    %s is now in %s\n",
4295
0
                            name, file));
4296
0
                if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
4297
0
               NETSNMP_DS_LIB_MIB_WARNINGS)) {
4298
0
                    snmp_log(LOG_WARNING,
4299
0
                             "Warning: Module %s was in %s now is %s\n",
4300
0
                             name, mp->file, file);
4301
0
    }
4302
4303
                /*
4304
                 * Use the new one in preference 
4305
                 */
4306
0
                free(mp->file);
4307
0
                mp->file = strdup(file);
4308
0
            }
4309
524
            return;
4310
524
        }
4311
4312
    /*
4313
     * Add this module to the list 
4314
     */
4315
557
    DEBUGMSGTL(("parse-mibs", "  Module %d %s is in %s\n", max_module,
4316
557
                name, file));
4317
557
    mp = calloc(1, sizeof(struct module));
4318
557
    if (mp == NULL)
4319
0
        return;
4320
557
    mp->name = strdup(name);
4321
557
    mp->file = strdup(file);
4322
557
    if (mp->name == NULL || mp->file == NULL) {
4323
0
        free(mp->name);
4324
0
        free(mp->file);
4325
0
        free(mp);
4326
0
        return;
4327
0
    }
4328
557
    mp->imports = NULL;
4329
557
    mp->no_imports = -1;        /* Not yet loaded */
4330
557
    mp->modid = max_module;
4331
557
    ++max_module;
4332
4333
557
    mp->next = module_head;     /* Or add to the *end* of the list? */
4334
557
    module_head = mp;
4335
557
}
4336
4337
4338
static void
4339
scan_objlist(struct node *root, struct module *mp, struct objgroup *list, const char *error)
4340
0
{
4341
0
    int             oLine = mibLine;
4342
4343
0
    while (list) {
4344
0
        struct objgroup *gp = list;
4345
0
        struct node    *np;
4346
0
        list = list->next;
4347
0
        np = root;
4348
0
        while (np)
4349
0
            if (label_compare(np->label, gp->name))
4350
0
                np = np->next;
4351
0
            else
4352
0
                break;
4353
0
        if (!np) {
4354
0
      int i;
4355
0
      struct module_import *mip;
4356
      /* if not local, check if it was IMPORTed */
4357
0
      for (i = 0, mip = mp->imports; i < mp->no_imports; i++, mip++)
4358
0
    if (strcmp(mip->label, gp->name) == 0)
4359
0
        break;
4360
0
      if (i == mp->no_imports) {
4361
0
    mibLine = gp->line;
4362
0
    print_error(error, gp->name, QUOTESTRING);
4363
0
      }
4364
0
        }
4365
0
        free(gp->name);
4366
0
        free(gp);
4367
0
    }
4368
0
    mibLine = oLine;
4369
0
}
4370
4371
static void free_objgroup(struct objgroup *o)
4372
1.40k
{
4373
1.40k
    while (o) {
4374
0
        struct objgroup *next = o->next;
4375
4376
0
        free(o->name);
4377
0
        free(o);
4378
0
        o = next;
4379
0
    }
4380
1.40k
}
4381
4382
/*
4383
 * Parses a mib file and returns a linked list of nodes found in the file.
4384
 * Returns NULL on error.
4385
 */
4386
static struct node *
4387
parse(FILE * fp)
4388
557
{
4389
#ifdef TEST
4390
    extern void     xmalloc_stats(FILE *);
4391
#endif
4392
557
    char            token[MAXTOKEN];
4393
557
    char            name[MAXTOKEN+1];
4394
557
    int             type = LABEL;
4395
557
    int             lasttype = LABEL;
4396
4397
592
#define BETWEEN_MIBS          1
4398
557
#define IN_MIB                2
4399
557
    int             state = BETWEEN_MIBS;
4400
557
    struct node    *np = NULL, *root = NULL;
4401
557
    struct objgroup *oldgroups = NULL, *oldobjects = NULL, *oldnotifs =
4402
557
        NULL;
4403
4404
557
    DEBUGMSGTL(("parse-file", "Parsing file:  %s...\n", File));
4405
4406
557
    if (last_err_module)
4407
1
        free(last_err_module);
4408
557
    last_err_module = NULL;
4409
4410
1.97k
    while (type != ENDOFFILE) {
4411
1.88k
        struct node *nnp;
4412
4413
1.88k
        if (lasttype == CONTINUE)
4414
769
            lasttype = type;
4415
1.11k
        else
4416
1.11k
            type = lasttype = get_token(fp, token, MAXTOKEN);
4417
4418
1.88k
        switch (type) {
4419
0
        case END:
4420
0
            if (state != IN_MIB) {
4421
0
                print_error("Error, END before start of MIB", NULL, type);
4422
0
                gMibError = MODULE_SYNTAX_ERROR;
4423
0
                goto free_mib;
4424
0
            } else {
4425
0
                struct module  *mp;
4426
#ifdef TEST
4427
                printf("\nNodes for Module %s:\n", name);
4428
                print_nodes(stdout, root);
4429
#endif
4430
0
                for (mp = module_head; mp; mp = mp->next)
4431
0
                    if (mp->modid == current_module)
4432
0
                        break;
4433
0
                scan_objlist(root, mp, objgroups, "Undefined OBJECT-GROUP");
4434
0
                scan_objlist(root, mp, objects, "Undefined OBJECT");
4435
0
                scan_objlist(root, mp, notifs, "Undefined NOTIFICATION");
4436
0
                objgroups = oldgroups;
4437
0
                objects = oldobjects;
4438
0
                notifs = oldnotifs;
4439
0
                do_linkup(mp, root);
4440
0
                np = root = NULL;
4441
0
            }
4442
0
            state = BETWEEN_MIBS;
4443
#ifdef TEST
4444
            if (netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
4445
           NETSNMP_DS_LIB_MIB_WARNINGS)) {
4446
                /* xmalloc_stats(stderr); */
4447
      }
4448
#endif
4449
0
            continue;
4450
0
        case IMPORTS:
4451
0
            parse_imports(fp);
4452
0
            continue;
4453
0
        case EXPORTS:
4454
0
            while (type != SEMI && type != ENDOFFILE)
4455
0
                type = get_token(fp, token, MAXTOKEN);
4456
0
            continue;
4457
1.31k
        case LABEL:
4458
1.31k
        case INTEGER:
4459
1.31k
        case INTEGER32:
4460
1.31k
        case UINTEGER32:
4461
1.31k
        case UNSIGNED32:
4462
1.31k
        case COUNTER:
4463
1.31k
        case COUNTER64:
4464
1.31k
        case GAUGE:
4465
1.31k
        case IPADDR:
4466
1.31k
        case NETADDR:
4467
1.31k
        case NSAPADDRESS:
4468
1.31k
        case OBJSYNTAX:
4469
1.31k
        case APPSYNTAX:
4470
1.31k
        case SIMPLESYNTAX:
4471
1.31k
        case OBJNAME:
4472
1.31k
        case NOTIFNAME:
4473
1.31k
        case KW_OPAQUE:
4474
1.31k
        case TIMETICKS:
4475
1.31k
            break;
4476
1
        case ENDOFFILE:
4477
1
            continue;
4478
568
        default:
4479
568
            strlcpy(name, token, sizeof(name));
4480
568
            type = get_token(fp, token, MAXTOKEN);
4481
568
            nnp = NULL;
4482
568
            if (type == MACRO) {
4483
0
                nnp = parse_macro(fp, name);
4484
0
                if (nnp == NULL) {
4485
0
                    print_error("Bad parse of MACRO", NULL, type);
4486
0
                    gMibError = MODULE_SYNTAX_ERROR;
4487
0
                }
4488
0
                free_node(nnp); /* IGNORE */
4489
0
                nnp = NULL;
4490
0
            } else
4491
568
                print_error(name, "is a reserved word", lasttype);
4492
568
            continue;           /* see if we can parse the rest of the file */
4493
1.88k
        }
4494
1.31k
        strlcpy(name, token, sizeof(name));
4495
1.31k
        type = get_token(fp, token, MAXTOKEN);
4496
1.31k
        nnp = NULL;
4497
4498
        /*
4499
         * Handle obsolete method to assign an object identifier to a
4500
         * module
4501
         */
4502
1.31k
        if (lasttype == LABEL && type == LEFTBRACKET) {
4503
1.12M
            while (type != RIGHTBRACKET && type != ENDOFFILE)
4504
1.12M
                type = get_token(fp, token, MAXTOKEN);
4505
1.06k
            if (type == ENDOFFILE) {
4506
262
                print_error("Expected \"}\"", token, type);
4507
262
                gMibError = MODULE_SYNTAX_ERROR;
4508
262
                goto free_mib;
4509
262
            }
4510
807
            type = get_token(fp, token, MAXTOKEN);
4511
807
        }
4512
4513
1.05k
        switch (type) {
4514
35
        case DEFINITIONS:
4515
35
            if (state != BETWEEN_MIBS) {
4516
0
                print_error("Error, nested MIBS", NULL, type);
4517
0
                gMibError = MODULE_SYNTAX_ERROR;
4518
0
                goto free_mib;
4519
0
            }
4520
35
            state = IN_MIB;
4521
35
            current_module = which_module(name);
4522
35
            oldgroups = objgroups;
4523
35
            objgroups = NULL;
4524
35
            oldobjects = objects;
4525
35
            objects = NULL;
4526
35
            oldnotifs = notifs;
4527
35
            notifs = NULL;
4528
35
            if (current_module == -1) {
4529
0
                new_module(name, File);
4530
0
                current_module = which_module(name);
4531
0
            }
4532
35
            DEBUGMSGTL(("parse-mibs", "Parsing MIB: %d %s\n",
4533
35
                        current_module, name));
4534
111k
            while ((type = get_token(fp, token, MAXTOKEN)) != ENDOFFILE)
4535
111k
                if (type == BEGIN)
4536
0
                    break;
4537
35
            break;
4538
0
        case OBJTYPE:
4539
0
            nnp = parse_objecttype(fp, name);
4540
0
            if (nnp == NULL) {
4541
0
                print_error("Bad parse of OBJECT-TYPE", NULL, type);
4542
0
                gMibError = MODULE_SYNTAX_ERROR;
4543
0
                goto free_mib;
4544
0
            }
4545
0
            break;
4546
0
        case OBJGROUP:
4547
0
            nnp = parse_objectgroup(fp, name, OBJECTS, &objects);
4548
0
            if (nnp == NULL) {
4549
0
                print_error("Bad parse of OBJECT-GROUP", NULL, type);
4550
0
                gMibError = MODULE_SYNTAX_ERROR;
4551
0
                goto free_mib;
4552
0
            }
4553
0
            break;
4554
0
        case NOTIFGROUP:
4555
0
            nnp = parse_objectgroup(fp, name, NOTIFICATIONS, &notifs);
4556
0
            if (nnp == NULL) {
4557
0
                print_error("Bad parse of NOTIFICATION-GROUP", NULL, type);
4558
0
                gMibError = MODULE_SYNTAX_ERROR;
4559
0
                goto free_mib;
4560
0
            }
4561
0
            break;
4562
0
        case TRAPTYPE:
4563
0
            nnp = parse_trapDefinition(fp, name);
4564
0
            if (nnp == NULL) {
4565
0
                print_error("Bad parse of TRAP-TYPE", NULL, type);
4566
0
                gMibError = MODULE_SYNTAX_ERROR;
4567
0
                goto free_mib;
4568
0
            }
4569
0
            break;
4570
0
        case NOTIFTYPE:
4571
0
            nnp = parse_notificationDefinition(fp, name);
4572
0
            if (nnp == NULL) {
4573
0
                print_error("Bad parse of NOTIFICATION-TYPE", NULL, type);
4574
0
                gMibError = MODULE_SYNTAX_ERROR;
4575
0
                goto free_mib;
4576
0
            }
4577
0
            break;
4578
0
        case COMPLIANCE:
4579
0
            nnp = parse_compliance(fp, name);
4580
0
            if (nnp == NULL) {
4581
0
                print_error("Bad parse of MODULE-COMPLIANCE", NULL, type);
4582
0
                gMibError = MODULE_SYNTAX_ERROR;
4583
0
                goto free_mib;
4584
0
            }
4585
0
            break;
4586
0
        case AGENTCAP:
4587
0
            nnp = parse_capabilities(fp, name);
4588
0
            if (nnp == NULL) {
4589
0
                print_error("Bad parse of AGENT-CAPABILITIES", NULL, type);
4590
0
                gMibError = MODULE_SYNTAX_ERROR;
4591
0
                goto free_mib;
4592
0
            }
4593
0
            break;
4594
1
        case MACRO:
4595
1
            nnp = parse_macro(fp, name);
4596
1
            if (nnp == NULL) {
4597
1
                print_error("Bad parse of MACRO", NULL, type);
4598
1
                gMibError = MODULE_SYNTAX_ERROR;
4599
1
            }
4600
1
            free_node(nnp);     /* IGNORE */
4601
1
            nnp = NULL;
4602
1
            break;
4603
0
        case MODULEIDENTITY:
4604
0
            nnp = parse_moduleIdentity(fp, name);
4605
0
            if (nnp == NULL) {
4606
0
                print_error("Bad parse of MODULE-IDENTITY", NULL, type);
4607
0
                gMibError = MODULE_SYNTAX_ERROR;
4608
0
                goto free_mib;
4609
0
            }
4610
0
            break;
4611
0
        case OBJIDENTITY:
4612
0
            nnp = parse_objectgroup(fp, name, OBJECTS, &objects);
4613
0
            if (nnp == NULL) {
4614
0
                print_error("Bad parse of OBJECT-IDENTITY", NULL, type);
4615
0
                gMibError = MODULE_SYNTAX_ERROR;
4616
0
                goto free_mib;
4617
0
            }
4618
0
            break;
4619
5
        case OBJECT:
4620
5
            type = get_token(fp, token, MAXTOKEN);
4621
5
            if (type != IDENTIFIER) {
4622
5
                print_error("Expected IDENTIFIER", token, type);
4623
5
                gMibError = MODULE_SYNTAX_ERROR;
4624
5
                goto free_mib;
4625
5
            }
4626
0
            type = get_token(fp, token, MAXTOKEN);
4627
0
            if (type != EQUALS) {
4628
0
                print_error("Expected \"::=\"", token, type);
4629
0
                gMibError = MODULE_SYNTAX_ERROR;
4630
0
                goto free_mib;
4631
0
            }
4632
0
            nnp = parse_objectid(fp, name);
4633
0
            if (nnp == NULL) {
4634
0
                print_error("Bad parse of OBJECT IDENTIFIER", NULL, type);
4635
0
                gMibError = MODULE_SYNTAX_ERROR;
4636
0
                goto free_mib;
4637
0
            }
4638
0
            break;
4639
769
        case EQUALS:
4640
769
            nnp = parse_asntype(fp, name, &type, token);
4641
769
            lasttype = CONTINUE;
4642
769
            break;
4643
45
        case ENDOFFILE:
4644
45
            break;
4645
201
        default:
4646
201
            print_error("Bad operator", token, type);
4647
201
            gMibError = MODULE_SYNTAX_ERROR;
4648
201
            goto free_mib;
4649
1.05k
        }
4650
850
        if (nnp) {
4651
280
            struct node *op;
4652
280
            if (np)
4653
169
                np->next = nnp;
4654
111
            else
4655
111
                np = root = nnp;
4656
821
            while (np->next)
4657
541
                np = np->next;
4658
280
            if (np->type == TYPE_OTHER)
4659
280
                np->type = type;
4660
280
            op = root;
4661
1.21k
            while (op != nnp) {
4662
939
                if (strcmp(nnp->label, op->label) == 0 && nnp->subid != op->subid) {
4663
0
                    snmp_log(LOG_ERR, 
4664
0
                        "Duplicate Object '%s' at line %d in %s. First at line %d\n",
4665
0
                        op->label, mibLine, File, op->lineno);
4666
0
        erroneousMibs++;
4667
0
    }
4668
939
                op = op->next;
4669
939
            }
4670
280
        }
4671
850
    }
4672
89
    DEBUGMSGTL(("parse-file", "End of file (%s)\n", File));
4673
89
    return root;
4674
4675
468
free_mib:
4676
1.12k
    for (; root; root = np) {
4677
652
        np = root->next;
4678
652
        free_node(root);
4679
652
    }
4680
468
    free_objgroup(objgroups);
4681
468
    objgroups = NULL;
4682
468
    free_objgroup(objects);
4683
468
    objects = NULL;
4684
468
    free_objgroup(notifs);
4685
468
    notifs = NULL;
4686
468
    return NULL;
4687
557
}
4688
4689
/*
4690
 * return zero if character is not a label character. 
4691
 */
4692
static int
4693
is_labelchar(int ich)
4694
1.46M
{
4695
1.46M
    netsnmp_assert(ich == EOF || (0 <= ich && ich < 256));
4696
1.46M
    if ((isalnum(ich)) || (ich == '-'))
4697
239k
        return 1;
4698
1.22M
    if (ich == '_' && netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
4699
1.94k
               NETSNMP_DS_LIB_MIB_PARSE_LABEL)) {
4700
0
        return 1;
4701
0
    }
4702
4703
1.22M
    return 0;
4704
1.22M
}
4705
4706
/**
4707
 * Read a single character from a file. Assumes that the caller has invoked
4708
 * flockfile(). Uses fgetc_unlocked() instead of getc() since the former is
4709
 * implemented as an inline function in glibc. See also bug 3447196
4710
 * (http://sourceforge.net/tracker/?func=detail&aid=3447196&group_id=12694&atid=112694).
4711
 */
4712
static int netsnmp_getc(FILE *stream)
4713
4.90M
{
4714
4.90M
#ifdef HAVE_FGETC_UNLOCKED
4715
4.90M
    return fgetc_unlocked(stream);
4716
#else
4717
    return getc(stream);
4718
#endif
4719
4.90M
}
4720
4721
/*
4722
 * Parses a token from the file.  The type of the token parsed is returned,
4723
 * and the text is placed in the string pointed to by token.
4724
 * Warning: this method may recurse.
4725
 */
4726
static int
4727
get_token(FILE *const fp, char *const token, const int maxtlen)
4728
1.27M
{
4729
1.27M
    int             ch, ch_next;
4730
1.27M
    char           *cp;
4731
1.27M
    int             hash;
4732
1.27M
    struct tok     *tp;
4733
1.27M
    int             too_long;
4734
1.27M
    enum { bdigits, xdigits, other } seenSymbols;
4735
4736
1.27M
fetch_next_token:
4737
1.27M
    cp = token;
4738
1.27M
    hash = 0;
4739
1.27M
    too_long = 0;
4740
    /*
4741
     * skip all white space 
4742
     */
4743
1.32M
    do {
4744
1.32M
        ch = netsnmp_getc(fp);
4745
1.32M
        if (ch == '\n')
4746
5.75k
            mibLine++;
4747
1.32M
    }
4748
1.32M
    while (isspace(ch) && ch != EOF);
4749
1.27M
    *cp++ = ch;
4750
1.27M
    *cp = '\0';
4751
1.27M
    switch (ch) {
4752
329
    case EOF:
4753
329
        return ENDOFFILE;
4754
2.05k
    case '"':
4755
2.05k
        return parseQuoteString(fp, token, maxtlen);
4756
4.95k
    case '\'':                 /* binary or hex constant */
4757
4.95k
        seenSymbols = bdigits;
4758
2.77M
        while ((ch = netsnmp_getc(fp)) != EOF && ch != '\'') {
4759
2.76M
            switch (seenSymbols) {
4760
6.54k
            case bdigits:
4761
6.54k
                if (ch == '0' || ch == '1')
4762
1.71k
                    break;
4763
4.82k
                seenSymbols = xdigits;
4764
4.82k
                NETSNMP_FALLTHROUGH;
4765
6.87k
            case xdigits:
4766
6.87k
                if (isxdigit(ch))
4767
2.08k
                    break;
4768
4.79k
                seenSymbols = other;
4769
4.79k
                NETSNMP_FALLTHROUGH;
4770
2.76M
            case other:
4771
2.76M
                break;
4772
2.76M
            }
4773
2.76M
            if (cp - token < maxtlen - 2)
4774
571k
                *cp++ = ch;
4775
2.76M
        }
4776
4.95k
        if (ch == '\'') {
4777
4.51k
            unsigned long   val = 0;
4778
4.51k
            char           *run = token + 1;
4779
4.51k
            ch = netsnmp_getc(fp);
4780
4.51k
            switch (ch) {
4781
0
            case EOF:
4782
0
                return ENDOFFILE;
4783
233
            case 'b':
4784
351
            case 'B':
4785
351
                if (seenSymbols > bdigits) {
4786
276
                    *cp++ = '\'';
4787
276
                    *cp = 0;
4788
276
                    return LABEL;
4789
276
                }
4790
95
                while (run != cp)
4791
20
                    val = val * 2 + *run++ - '0';
4792
75
                break;
4793
580
            case 'h':
4794
797
            case 'H':
4795
797
                if (seenSymbols > xdigits) {
4796
734
                    *cp++ = '\'';
4797
734
                    *cp = 0;
4798
734
                    return LABEL;
4799
734
                }
4800
118
                while (run != cp) {
4801
55
                    ch = *run++;
4802
55
                    if ('0' <= ch && ch <= '9')
4803
18
                        val = val * 16 + ch - '0';
4804
37
                    else if ('a' <= ch && ch <= 'f')
4805
22
                        val = val * 16 + ch - 'a' + 10;
4806
15
                    else if ('A' <= ch && ch <= 'F')
4807
15
                        val = val * 16 + ch - 'A' + 10;
4808
55
                }
4809
63
                break;
4810
3.36k
            default:
4811
3.36k
                *cp++ = '\'';
4812
3.36k
                *cp = 0;
4813
3.36k
                return LABEL;
4814
4.51k
            }
4815
138
            sprintf(token, "%ld", val);
4816
138
            return NUMBER;
4817
4.51k
        } else
4818
441
            return LABEL;
4819
5.18k
    case '(':
4820
5.18k
        return LEFTPAREN;
4821
4.67k
    case ')':
4822
4.67k
        return RIGHTPAREN;
4823
5.20k
    case '{':
4824
5.20k
        return LEFTBRACKET;
4825
1.40k
    case '}':
4826
1.40k
        return RIGHTBRACKET;
4827
1.52k
    case '[':
4828
1.52k
        return LEFTSQBRACK;
4829
2.68k
    case ']':
4830
2.68k
        return RIGHTSQBRACK;
4831
1.38k
    case ';':
4832
1.38k
        return SEMI;
4833
1.57k
    case ',':
4834
1.57k
        return COMMA;
4835
1.35k
    case '|':
4836
1.35k
        return BAR;
4837
1.53k
    case '.':
4838
1.53k
        ch_next = netsnmp_getc(fp);
4839
1.53k
        if (ch_next == '.')
4840
55
            return RANGE;
4841
1.47k
        ungetc(ch_next, fp);
4842
1.47k
        return LABEL;
4843
13.6k
    case ':':
4844
13.6k
        ch_next = netsnmp_getc(fp);
4845
13.6k
        if (ch_next != ':') {
4846
11.4k
            ungetc(ch_next, fp);
4847
11.4k
            return LABEL;
4848
11.4k
        }
4849
2.13k
        ch_next = netsnmp_getc(fp);
4850
2.13k
        if (ch_next != '=') {
4851
1.32k
            ungetc(ch_next, fp);
4852
1.32k
            return LABEL;
4853
1.32k
        }
4854
810
        return EQUALS;
4855
6.73k
    case '-':
4856
6.73k
        ch_next = netsnmp_getc(fp);
4857
6.73k
        if (ch_next == '-') {
4858
2.30k
            if (netsnmp_ds_get_boolean(NETSNMP_DS_LIBRARY_ID, 
4859
2.30k
               NETSNMP_DS_LIB_MIB_COMMENT_TERM)) {
4860
                /*
4861
                 * Treat the rest of this line as a comment. 
4862
                 */
4863
108k
                while ((ch_next != EOF) && (ch_next != '\n'))
4864
106k
                    ch_next = netsnmp_getc(fp);
4865
2.30k
            } else {
4866
                /*
4867
                 * Treat the rest of the line or until another '--' as a comment 
4868
                 */
4869
                /*
4870
                 * (this is the "technically" correct way to parse comments) 
4871
                 */
4872
0
                ch = ' ';
4873
0
                ch_next = netsnmp_getc(fp);
4874
0
                while (ch_next != EOF && ch_next != '\n' &&
4875
0
                       (ch != '-' || ch_next != '-')) {
4876
0
                    ch = ch_next;
4877
0
                    ch_next = netsnmp_getc(fp);
4878
0
                }
4879
0
            }
4880
2.30k
            if (ch_next == EOF)
4881
0
                return ENDOFFILE;
4882
2.30k
            if (ch_next == '\n')
4883
2.30k
                mibLine++;
4884
2.30k
            goto fetch_next_token;
4885
2.30k
        }
4886
4.43k
        ungetc(ch_next, fp);
4887
4.43k
  NETSNMP_FALLTHROUGH;
4888
1.22M
    default:
4889
        /*
4890
         * Accumulate characters until end of token is found.  Then attempt to
4891
         * match this token as a reserved word.  If a match is found, return the
4892
         * type.  Else it is a label.
4893
         */
4894
1.22M
        if (!is_labelchar(ch))
4895
1.15M
            return LABEL;
4896
72.3k
        hash += tolower(ch);
4897
72.9k
      more:
4898
239k
        while (is_labelchar(ch_next = netsnmp_getc(fp))) {
4899
166k
            hash += tolower(ch_next);
4900
166k
            if (cp - token < maxtlen - 1)
4901
166k
                *cp++ = ch_next;
4902
0
            else
4903
0
                too_long = 1;
4904
166k
        }
4905
72.9k
        ungetc(ch_next, fp);
4906
72.9k
        *cp = '\0';
4907
4908
72.9k
        if (too_long)
4909
0
            print_error("Warning: token too long", token, CONTINUE);
4910
284k
        for (tp = buckets[BUCKET(hash)]; tp; tp = tp->next) {
4911
213k
            if ((tp->hash == hash) && (!label_compare(tp->name, token)))
4912
1.66k
                break;
4913
213k
        }
4914
72.9k
        if (tp) {
4915
1.66k
            if (tp->token != CONTINUE)
4916
946
                return (tp->token);
4917
722
            while (isspace((ch_next = netsnmp_getc(fp))))
4918
643
                if (ch_next == '\n')
4919
92
                    mibLine++;
4920
722
            if (ch_next == EOF)
4921
0
                return ENDOFFILE;
4922
722
            if (isalnum(ch_next)) {
4923
535
                *cp++ = ch_next;
4924
535
                hash += tolower(ch_next);
4925
535
                goto more;
4926
535
            }
4927
722
        }
4928
71.4k
        if (token[0] == '-' || isdigit((unsigned char)(token[0]))) {
4929
14.9k
            for (cp = token + 1; *cp; cp++)
4930
4.27k
                if (!isdigit((unsigned char)(*cp)))
4931
1.52k
                    return LABEL;
4932
10.6k
            return NUMBER;
4933
12.1k
        }
4934
59.2k
        return LABEL;
4935
1.27M
    }
4936
1.27M
}
4937
4938
netsnmp_feature_child_of(parse_get_token, netsnmp_unused);
4939
#ifndef NETSNMP_FEATURE_REMOVE_PARSE_GET_TOKEN
4940
int
4941
snmp_get_token(FILE * fp, char *token, int maxtlen)
4942
0
{
4943
0
    return get_token(fp, token, maxtlen);
4944
0
}
4945
#endif /* NETSNMP_FEATURE_REMOVE_PARSE_GET_TOKEN */
4946
4947
int
4948
add_mibfile(const char* tmpstr, const char* d_name)
4949
0
{
4950
0
    FILE           *fp;
4951
0
    char            token[MAXTOKEN], token2[MAXTOKEN];
4952
4953
    /*
4954
     * which module is this 
4955
     */
4956
0
    if ((fp = fopen(tmpstr, "r")) == NULL) {
4957
0
        snmp_log_perror(tmpstr);
4958
0
        return 1;
4959
0
    }
4960
0
    DEBUGMSGTL(("parse-mibs", "Checking file: %s...\n",
4961
0
                tmpstr));
4962
0
    mibLine = 1;
4963
0
    File = tmpstr;
4964
0
    if (get_token(fp, token, MAXTOKEN) != LABEL) {
4965
0
      fclose(fp);
4966
0
      return 1;
4967
0
    }
4968
    /*
4969
     * simple test for this being a MIB 
4970
     */
4971
0
    if (get_token(fp, token2, MAXTOKEN) == DEFINITIONS) {
4972
0
        new_module(token, tmpstr);
4973
0
        fclose(fp);
4974
0
        return 0;
4975
0
    } else {
4976
0
        fclose(fp);
4977
0
        return 1;
4978
0
    }
4979
0
}
4980
4981
static int elemcmp(const void *a, const void *b)
4982
0
{
4983
0
    const char *const *s1 = a, *const *s2 = b;
4984
4985
0
    return strcmp(*s1, *s2);
4986
0
}
4987
4988
/*
4989
 * Scan a directory and return all filenames found as an array of pointers to
4990
 * directory entries (@result).
4991
 */
4992
static int scan_directory(char ***result, const char *dirname)
4993
2
{
4994
2
    DIR            *dir, *dir2;
4995
2
    struct dirent  *file;
4996
2
    char          **filenames = NULL;
4997
2
    int             fname_len, i, filename_count = 0, array_size = 0;
4998
2
    char           *tmpstr;
4999
5000
2
    *result = NULL;
5001
5002
2
    dir = opendir(dirname);
5003
2
    if (!dir)
5004
2
        return -1;
5005
5006
0
    while ((file = readdir(dir))) {
5007
        /*
5008
         * Only parse file names that don't begin with a '.'
5009
         * Also skip files ending in '~', or starting/ending
5010
         * with '#' which are typically editor backup files.
5011
         */
5012
0
        fname_len = strlen(file->d_name);
5013
0
        if (fname_len > 0 && file->d_name[0] != '.'
5014
0
            && file->d_name[0] != '#'
5015
0
            && file->d_name[fname_len-1] != '#'
5016
0
            && file->d_name[fname_len-1] != '~') {
5017
0
            if (asprintf(&tmpstr, "%s/%s", dirname, file->d_name) < 0)
5018
0
                continue;
5019
0
            dir2 = opendir(tmpstr);
5020
0
            if (dir2) {
5021
                /* file is a directory, don't read it */
5022
0
                closedir(dir2);
5023
0
            } else {
5024
0
                if (filename_count >= array_size) {
5025
0
                    char **new_filenames;
5026
5027
0
                    array_size = (array_size + 16) * 2;
5028
0
                    new_filenames = realloc(filenames,
5029
0
                                        array_size * sizeof(filenames[0]));
5030
0
                    if (!new_filenames) {
5031
0
                        free(tmpstr);
5032
0
                        for (i = 0; i < filename_count; i++)
5033
0
                            free(filenames[i]);
5034
0
                        free(filenames);
5035
0
                        closedir(dir);
5036
0
                        return -1;
5037
0
                    }
5038
0
                    filenames = new_filenames;
5039
0
                }
5040
0
                filenames[filename_count++] = tmpstr;
5041
0
                tmpstr = NULL;
5042
0
            }
5043
0
            free(tmpstr);
5044
0
        }
5045
0
    }
5046
0
    closedir(dir);
5047
5048
0
    if (filenames)
5049
0
        qsort(filenames, filename_count, sizeof(filenames[0]), elemcmp);
5050
0
    *result = filenames;
5051
5052
0
    return filename_count;
5053
0
}
5054
5055
/* For Win32 platforms, the directory does not maintain a last modification
5056
 * date that we can compare with the modification date of the .index file.
5057
 * Therefore there is no way to know whether any .index file is valid.
5058
 * This is the reason for the #if !(defined(WIN32) || defined(cygwin))
5059
 * in the add_mibdir function
5060
 */
5061
int
5062
add_mibdir(const char *dirname)
5063
2
{
5064
2
    const char     *oldFile = File;
5065
2
    char          **filenames;
5066
2
    int             count = 0;
5067
2
    int             filename_count, i;
5068
5069
2
    DEBUGMSGTL(("parse-mibs", "Scanning directory %s\n", dirname));
5070
5071
2
    filename_count = scan_directory(&filenames, dirname);
5072
5073
2
    if (filename_count >= 0) {
5074
0
        for (i = 0; i < filename_count; i++) {
5075
0
            if (add_mibfile(filenames[i], strrchr(filenames[i], '/')) == 0)
5076
0
                count++;
5077
0
      free(filenames[i]);
5078
0
        }
5079
0
        File = oldFile;
5080
0
        free(filenames);
5081
0
        return (count);
5082
0
    }
5083
2
    else
5084
2
        DEBUGMSGTL(("parse-mibs","cannot open MIB directory %s\n", dirname));
5085
5086
2
    return (-1);
5087
2
}
5088
5089
5090
/*
5091
 * Returns the root of the whole tree
5092
 *   (for backwards compatability)
5093
 */
5094
struct tree    *
5095
read_mib(const char *filename)
5096
1.29k
{
5097
1.29k
    FILE           *fp;
5098
1.29k
    char            token[MAXTOKEN];
5099
5100
1.29k
    fp = fopen(filename, "r");
5101
1.29k
    if (fp == NULL) {
5102
72
        snmp_log_perror(filename);
5103
72
        return NULL;
5104
72
    }
5105
1.22k
    mibLine = 1;
5106
1.22k
    File = filename;
5107
1.22k
    DEBUGMSGTL(("parse-mibs", "Parsing file: %s...\n", filename));
5108
1.22k
    if (get_token(fp, token, MAXTOKEN) != LABEL) {
5109
142
      snmp_log(LOG_ERR, "Failed to parse MIB file %s\n", filename);
5110
142
      fclose(fp);
5111
142
      return NULL;
5112
142
    }
5113
1.08k
    fclose(fp);
5114
1.08k
    new_module(token, filename);
5115
1.08k
    (void) netsnmp_read_module(token);
5116
5117
1.08k
    return tree_head;
5118
1.22k
}
5119
5120
5121
struct tree    *
5122
read_all_mibs(void)
5123
0
{
5124
0
    struct module  *mp;
5125
5126
0
    for (mp = module_head; mp; mp = mp->next)
5127
0
        if (mp->no_imports == -1)
5128
0
            netsnmp_read_module(mp->name);
5129
0
    adopt_orphans();
5130
5131
    /* If entered the syntax error loop in "read_module()" */
5132
0
    if (gLoop == 1) {
5133
0
        gLoop = 0;
5134
0
        free(gpMibErrorString);
5135
0
        gpMibErrorString = NULL;
5136
0
        if (asprintf(&gpMibErrorString, "Error in parsing MIB module(s): %s !"
5137
0
                     " Unable to load corresponding MIB(s)", gMibNames) < 0) {
5138
0
            snmp_log(LOG_CRIT,
5139
0
                     "failed to allocated memory for gpMibErrorString\n");
5140
0
        }
5141
0
    }
5142
5143
    /* Caller's responsibility to free this memory */
5144
0
    tree_head->parseErrorString = gpMibErrorString;
5145
  
5146
0
    return tree_head;
5147
0
}
5148
5149
5150
#ifdef TEST
5151
int main(int argc, char *argv[])
5152
{
5153
    int             i;
5154
    struct tree    *tp;
5155
    netsnmp_ds_set_int(NETSNMP_DS_LIBRARY_ID, NETSNMP_DS_LIB_MIB_WARNINGS, 2);
5156
5157
    netsnmp_init_mib();
5158
5159
    if (argc == 1)
5160
        (void) read_all_mibs();
5161
    else
5162
        for (i = 1; i < argc; i++)
5163
            read_mib(argv[i]);
5164
5165
    for (tp = tree_head; tp; tp = tp->next_peer)
5166
        print_subtree(stdout, tp, 0);
5167
    free_tree(tree_head);
5168
5169
    return 0;
5170
}
5171
#endif                          /* TEST */
5172
5173
static int
5174
parseQuoteString(FILE * fp, char *token, int maxtlen)
5175
2.05k
{
5176
2.05k
    register int    ch;
5177
2.05k
    int             count = 0;
5178
2.05k
    int             too_long = 0;
5179
2.05k
    char           *token_start = token;
5180
5181
431k
    for (ch = netsnmp_getc(fp); ch != EOF; ch = netsnmp_getc(fp)) {
5182
431k
        if (ch == '\r')
5183
201
            continue;
5184
431k
        if (ch == '\n') {
5185
1.62k
            mibLine++;
5186
429k
        } else if (ch == '"') {
5187
2.01k
            netsnmp_assert(token - token_start < maxtlen);
5188
2.01k
            *token = '\0';
5189
2.01k
            if (too_long && netsnmp_ds_get_int(NETSNMP_DS_LIBRARY_ID, 
5190
898
             NETSNMP_DS_LIB_MIB_WARNINGS) > 1) {
5191
                /*
5192
                 * show short form for brevity sake 
5193
                 */
5194
0
                int             truncate_at = SNMP_MIN(50, maxtlen - 1);
5195
0
                char            ch_save = *(token_start + truncate_at);
5196
5197
0
                *(token_start + truncate_at) = '\0';
5198
0
                print_error("Warning: string too long",
5199
0
                            token_start, QUOTESTRING);
5200
0
                *(token_start + truncate_at) = ch_save;
5201
0
            }
5202
2.01k
            return QUOTESTRING;
5203
2.01k
        }
5204
        /*
5205
         * maximum description length check.  If greater, keep parsing
5206
         * but truncate the string 
5207
         */
5208
429k
        if (++count < maxtlen)
5209
150k
            *token++ = ch;
5210
279k
        else
5211
279k
            too_long = 1;
5212
429k
    }
5213
5214
34
    return 0;
5215
2.05k
}
5216
5217
/*
5218
 * struct index_list *
5219
 * getIndexes(FILE *fp):
5220
 *   This routine parses a string like  { blah blah blah } and returns a
5221
 *   list of the strings enclosed within it.
5222
 *
5223
 */
5224
static struct index_list *
5225
getIndexes(FILE * fp, struct index_list **retp)
5226
0
{
5227
0
    int             type;
5228
0
    char            token[MAXTOKEN];
5229
0
    char            nextIsImplied = 0;
5230
5231
0
    struct index_list *mylist = NULL;
5232
0
    struct index_list **mypp = &mylist;
5233
5234
0
    free_indexes(retp);
5235
5236
0
    type = get_token(fp, token, MAXTOKEN);
5237
5238
0
    if (type != LEFTBRACKET) {
5239
0
        return NULL;
5240
0
    }
5241
5242
0
    type = get_token(fp, token, MAXTOKEN);
5243
0
    while (type != RIGHTBRACKET && type != ENDOFFILE) {
5244
0
        if ((type == LABEL) || (type & SYNTAX_MASK)) {
5245
0
            *mypp = calloc(1, sizeof(struct index_list));
5246
0
            if (*mypp) {
5247
0
                (*mypp)->ilabel = strdup(token);
5248
0
                (*mypp)->isimplied = nextIsImplied;
5249
0
                mypp = &(*mypp)->next;
5250
0
                nextIsImplied = 0;
5251
0
            }
5252
0
        } else if (type == IMPLIED) {
5253
0
            nextIsImplied = 1;
5254
0
        }
5255
0
        type = get_token(fp, token, MAXTOKEN);
5256
0
    }
5257
5258
0
    *retp = mylist;
5259
0
    return mylist;
5260
0
}
5261
5262
static struct varbind_list *
5263
getVarbinds(FILE * fp, struct varbind_list **retp)
5264
0
{
5265
0
    int             type;
5266
0
    char            token[MAXTOKEN];
5267
5268
0
    struct varbind_list *mylist = NULL;
5269
0
    struct varbind_list **mypp = &mylist;
5270
5271
0
    free_varbinds(retp);
5272
5273
0
    type = get_token(fp, token, MAXTOKEN);
5274
5275
0
    if (type != LEFTBRACKET) {
5276
0
        return NULL;
5277
0
    }
5278
5279
0
    type = get_token(fp, token, MAXTOKEN);
5280
0
    while (type != RIGHTBRACKET && type != ENDOFFILE) {
5281
0
        if ((type == LABEL) || (type & SYNTAX_MASK)) {
5282
0
            *mypp = calloc(1, sizeof(struct varbind_list));
5283
0
            if (*mypp) {
5284
0
                (*mypp)->vblabel = strdup(token);
5285
0
                mypp = &(*mypp)->next;
5286
0
            }
5287
0
        }
5288
0
        type = get_token(fp, token, MAXTOKEN);
5289
0
    }
5290
5291
0
    *retp = mylist;
5292
0
    return mylist;
5293
0
}
5294
5295
static void
5296
free_indexes(struct index_list **spp)
5297
653
{
5298
653
    if (spp && *spp) {
5299
0
        struct index_list *pp, *npp;
5300
5301
0
        pp = *spp;
5302
0
        *spp = NULL;
5303
5304
0
        while (pp) {
5305
0
            npp = pp->next;
5306
0
            if (pp->ilabel)
5307
0
                free(pp->ilabel);
5308
0
            free(pp);
5309
0
            pp = npp;
5310
0
        }
5311
0
    }
5312
653
}
5313
5314
static void
5315
free_varbinds(struct varbind_list **spp)
5316
653
{
5317
653
    if (spp && *spp) {
5318
0
        struct varbind_list *pp, *npp;
5319
5320
0
        pp = *spp;
5321
0
        *spp = NULL;
5322
5323
0
        while (pp) {
5324
0
            npp = pp->next;
5325
0
            if (pp->vblabel)
5326
0
                free(pp->vblabel);
5327
0
            free(pp);
5328
0
            pp = npp;
5329
0
        }
5330
0
    }
5331
653
}
5332
5333
static void
5334
free_ranges(struct range_list **spp)
5335
653
{
5336
653
    if (spp && *spp) {
5337
0
        struct range_list *pp, *npp;
5338
5339
0
        pp = *spp;
5340
0
        *spp = NULL;
5341
5342
0
        while (pp) {
5343
0
            npp = pp->next;
5344
0
            free(pp);
5345
0
            pp = npp;
5346
0
        }
5347
0
    }
5348
653
}
5349
5350
static void
5351
free_enums(struct enum_list **spp)
5352
653
{
5353
653
    if (spp && *spp) {
5354
0
        struct enum_list *pp, *npp;
5355
5356
0
        pp = *spp;
5357
0
        *spp = NULL;
5358
5359
0
        while (pp) {
5360
0
            npp = pp->next;
5361
0
            if (pp->label)
5362
0
                free(pp->label);
5363
0
            free(pp);
5364
0
            pp = npp;
5365
0
        }
5366
0
    }
5367
653
}
5368
5369
static struct enum_list *
5370
copy_enums(struct enum_list *sp)
5371
0
{
5372
0
    struct enum_list *xp = NULL, **spp = &xp;
5373
5374
0
    while (sp) {
5375
0
        *spp = calloc(1, sizeof(struct enum_list));
5376
0
        if (!*spp)
5377
0
            break;
5378
0
        (*spp)->label = strdup(sp->label);
5379
0
        (*spp)->value = sp->value;
5380
0
        spp = &(*spp)->next;
5381
0
        sp = sp->next;
5382
0
    }
5383
0
    return (xp);
5384
0
}
5385
5386
static struct range_list *
5387
copy_ranges(struct range_list *sp)
5388
0
{
5389
0
    struct range_list *xp = NULL, **spp = &xp;
5390
5391
0
    while (sp) {
5392
0
        *spp = calloc(1, sizeof(struct range_list));
5393
0
        if (!*spp)
5394
0
            break;
5395
0
        (*spp)->low = sp->low;
5396
0
        (*spp)->high = sp->high;
5397
0
        spp = &(*spp)->next;
5398
0
        sp = sp->next;
5399
0
    }
5400
0
    return (xp);
5401
0
}
5402
5403
/*
5404
 * This routine parses a string like  { blah blah blah } and returns OBJID if
5405
 * it is well formed, and NULL if not.
5406
 */
5407
static int
5408
tossObjectIdentifier(FILE * fp)
5409
0
{
5410
0
    int             type;
5411
0
    char            token[MAXTOKEN];
5412
0
    int             bracketcount = 1;
5413
5414
0
    type = get_token(fp, token, MAXTOKEN);
5415
5416
0
    if (type != LEFTBRACKET)
5417
0
        return 0;
5418
0
    while ((type != RIGHTBRACKET || bracketcount > 0) && type != ENDOFFILE) {
5419
0
        type = get_token(fp, token, MAXTOKEN);
5420
0
        if (type == LEFTBRACKET)
5421
0
            bracketcount++;
5422
0
        else if (type == RIGHTBRACKET)
5423
0
            bracketcount--;
5424
0
    }
5425
5426
0
    if (type == RIGHTBRACKET)
5427
0
        return OBJID;
5428
0
    else
5429
0
        return 0;
5430
0
}
5431
5432
/* Find node in any MIB module
5433
   Used by Perl modules   */
5434
struct tree    *
5435
find_node(const char *name, struct tree *subtree)
5436
0
{                               /* Unused */
5437
0
    return (find_tree_node(name, -1));
5438
0
}
5439
5440
netsnmp_feature_child_of(parse_find_node2, netsnmp_unused);
5441
#ifndef NETSNMP_FEATURE_REMOVE_PARSE_FIND_NODE2
5442
struct tree    *
5443
find_node2(const char *name, const char *module)
5444
0
{                               
5445
0
  int modid = -1;
5446
0
  if (module) {
5447
0
    modid = which_module(module);
5448
0
  }
5449
0
  if (modid == -1)
5450
0
  {
5451
0
    return (NULL);
5452
0
  }
5453
0
  return (find_tree_node(name, modid));
5454
0
}
5455
#endif /* NETSNMP_FEATURE_REMOVE_PARSE_FIND_NODE2 */
5456
5457
#ifndef NETSNMP_FEATURE_REMOVE_FIND_MODULE
5458
/* Used in the perl module */
5459
struct module  *
5460
find_module(int mid)
5461
0
{
5462
0
    struct module  *mp;
5463
5464
0
    for (mp = module_head; mp != NULL; mp = mp->next) {
5465
0
        if (mp->modid == mid)
5466
0
            break;
5467
0
    }
5468
0
    return mp;
5469
0
}
5470
#endif /* NETSNMP_FEATURE_REMOVE_FIND_MODULE */
5471
5472
5473
static char     leave_indent[256];
5474
static int      leave_was_simple;
5475
5476
static void
5477
print_mib_leaves(FILE * f, struct tree *tp, int width)
5478
0
{
5479
0
    struct tree    *ntp;
5480
0
    char           *ip = leave_indent + strlen(leave_indent) - 1;
5481
0
    char            last_ipch = *ip;
5482
5483
0
    *ip = '+';
5484
0
    if (tp->type == TYPE_OTHER || tp->type > TYPE_SIMPLE_LAST) {
5485
0
        fprintf(f, "%s--%s(%ld)\n", leave_indent, tp->label, tp->subid);
5486
0
        if (tp->indexes) {
5487
0
            struct index_list *xp = tp->indexes;
5488
0
            int             first = 1, cpos = 0, len, cmax =
5489
0
                width - strlen(leave_indent) - 12;
5490
0
            *ip = last_ipch;
5491
0
            fprintf(f, "%s  |  Index: ", leave_indent);
5492
0
            while (xp) {
5493
0
                if (first)
5494
0
                    first = 0;
5495
0
                else
5496
0
                    fprintf(f, ", ");
5497
0
                cpos += (len = strlen(xp->ilabel) + 2);
5498
0
                if (cpos > cmax) {
5499
0
                    fprintf(f, "\n");
5500
0
                    fprintf(f, "%s  |         ", leave_indent);
5501
0
                    cpos = len;
5502
0
                }
5503
0
                fprintf(f, "%s", xp->ilabel);
5504
0
                xp = xp->next;
5505
0
            }
5506
0
            fprintf(f, "\n");
5507
0
            *ip = '+';
5508
0
        }
5509
0
    } else {
5510
0
        const char     *acc, *typ;
5511
0
        int             size = 0;
5512
0
        switch (tp->access) {
5513
0
        case MIB_ACCESS_NOACCESS:
5514
0
            acc = "----";
5515
0
            break;
5516
0
        case MIB_ACCESS_READONLY:
5517
0
            acc = "-R--";
5518
0
            break;
5519
0
        case MIB_ACCESS_WRITEONLY:
5520
0
            acc = "--W-";
5521
0
            break;
5522
0
        case MIB_ACCESS_READWRITE:
5523
0
            acc = "-RW-";
5524
0
            break;
5525
0
        case MIB_ACCESS_NOTIFY:
5526
0
            acc = "---N";
5527
0
            break;
5528
0
        case MIB_ACCESS_CREATE:
5529
0
            acc = "CR--";
5530
0
            break;
5531
0
        default:
5532
0
            acc = "    ";
5533
0
            break;
5534
0
        }
5535
0
        switch (tp->type) {
5536
0
        case TYPE_OBJID:
5537
0
            typ = "ObjID    ";
5538
0
            break;
5539
0
        case TYPE_OCTETSTR:
5540
0
            typ = "String   ";
5541
0
            size = 1;
5542
0
            break;
5543
0
        case TYPE_INTEGER:
5544
0
            if (tp->enums)
5545
0
                typ = "EnumVal  ";
5546
0
            else
5547
0
                typ = "INTEGER  ";
5548
0
            break;
5549
0
        case TYPE_NETADDR:
5550
0
            typ = "NetAddr  ";
5551
0
            break;
5552
0
        case TYPE_IPADDR:
5553
0
            typ = "IpAddr   ";
5554
0
            break;
5555
0
        case TYPE_COUNTER:
5556
0
            typ = "Counter  ";
5557
0
            break;
5558
0
        case TYPE_GAUGE:
5559
0
            typ = "Gauge    ";
5560
0
            break;
5561
0
        case TYPE_TIMETICKS:
5562
0
            typ = "TimeTicks";
5563
0
            break;
5564
0
        case TYPE_OPAQUE:
5565
0
            typ = "Opaque   ";
5566
0
            size = 1;
5567
0
            break;
5568
0
        case TYPE_NULL:
5569
0
            typ = "Null     ";
5570
0
            break;
5571
0
        case TYPE_COUNTER64:
5572
0
            typ = "Counter64";
5573
0
            break;
5574
0
        case TYPE_BITSTRING:
5575
0
            typ = "BitString";
5576
0
            break;
5577
0
        case TYPE_NSAPADDRESS:
5578
0
            typ = "NsapAddr ";
5579
0
            break;
5580
0
        case TYPE_UNSIGNED32:
5581
0
            typ = "Unsigned ";
5582
0
            break;
5583
0
        case TYPE_UINTEGER:
5584
0
            typ = "UInteger ";
5585
0
            break;
5586
0
        case TYPE_INTEGER32:
5587
0
            typ = "Integer32";
5588
0
            break;
5589
0
        default:
5590
0
            typ = "         ";
5591
0
            break;
5592
0
        }
5593
0
        fprintf(f, "%s-- %s %s %s(%ld)\n", leave_indent, acc, typ,
5594
0
                tp->label, tp->subid);
5595
0
        *ip = last_ipch;
5596
0
        if (tp->tc_index >= 0)
5597
0
            fprintf(f, "%s        Textual Convention: %s\n", leave_indent,
5598
0
                    tclist[tp->tc_index].descriptor);
5599
0
        if (tp->enums) {
5600
0
            struct enum_list *ep = tp->enums;
5601
0
            int             cpos = 0, cmax =
5602
0
                width - strlen(leave_indent) - 16;
5603
0
            fprintf(f, "%s        Values: ", leave_indent);
5604
0
            while (ep) {
5605
0
                char            buf[80];
5606
0
                int             bufw;
5607
0
                if (ep != tp->enums)
5608
0
                    fprintf(f, ", ");
5609
0
                snprintf(buf, sizeof(buf), "%s(%d)", ep->label, ep->value);
5610
0
                buf[ sizeof(buf)-1 ] = 0;
5611
0
                cpos += (bufw = strlen(buf) + 2);
5612
0
                if (cpos >= cmax) {
5613
0
                    fprintf(f, "\n%s                ", leave_indent);
5614
0
                    cpos = bufw;
5615
0
                }
5616
0
                fprintf(f, "%s", buf);
5617
0
                ep = ep->next;
5618
0
            }
5619
0
            fprintf(f, "\n");
5620
0
        }
5621
0
        if (tp->ranges) {
5622
0
            struct range_list *rp = tp->ranges;
5623
0
            if (size)
5624
0
                fprintf(f, "%s        Size: ", leave_indent);
5625
0
            else
5626
0
                fprintf(f, "%s        Range: ", leave_indent);
5627
0
            while (rp) {
5628
0
                if (rp != tp->ranges)
5629
0
                    fprintf(f, " | ");
5630
0
                print_range_value(f, tp->type, rp);
5631
0
                rp = rp->next;
5632
0
            }
5633
0
            fprintf(f, "\n");
5634
0
        }
5635
0
    }
5636
0
    *ip = last_ipch;
5637
0
    strcat(leave_indent, "  |");
5638
0
    leave_was_simple = tp->type != TYPE_OTHER;
5639
5640
0
    {
5641
0
        int             i, j, count = 0;
5642
0
        struct leave {
5643
0
            oid             id;
5644
0
            struct tree    *tp;
5645
0
        }              *leaves, *lp;
5646
5647
0
        for (ntp = tp->child_list; ntp; ntp = ntp->next_peer)
5648
0
            count++;
5649
0
        if (count) {
5650
0
            leaves = calloc(count, sizeof(struct leave));
5651
0
            if (!leaves)
5652
0
                return;
5653
0
            for (ntp = tp->child_list, count = 0; ntp;
5654
0
                 ntp = ntp->next_peer) {
5655
0
                for (i = 0, lp = leaves; i < count; i++, lp++)
5656
0
                    if (lp->id >= ntp->subid)
5657
0
                        break;
5658
0
                for (j = count; j > i; j--)
5659
0
                    leaves[j] = leaves[j - 1];
5660
0
                lp->id = ntp->subid;
5661
0
                lp->tp = ntp;
5662
0
                count++;
5663
0
            }
5664
0
            for (i = 1, lp = leaves; i <= count; i++, lp++) {
5665
0
                if (!leave_was_simple || lp->tp->type == 0)
5666
0
                    fprintf(f, "%s\n", leave_indent);
5667
0
                if (i == count)
5668
0
                    ip[3] = ' ';
5669
0
                print_mib_leaves(f, lp->tp, width);
5670
0
            }
5671
0
            free(leaves);
5672
0
            leave_was_simple = 0;
5673
0
        }
5674
0
    }
5675
0
    ip[1] = 0;
5676
0
}
5677
5678
void
5679
print_mib_tree(FILE * f, struct tree *tp, int width)
5680
0
{
5681
0
    leave_indent[0] = ' ';
5682
0
    leave_indent[1] = 0;
5683
0
    leave_was_simple = 1;
5684
0
    print_mib_leaves(f, tp, width);
5685
0
}
5686
5687
5688
/*
5689
 * Merge the parsed object identifier with the existing node.
5690
 * If there is a problem with the identifier, release the existing node.
5691
 */
5692
static struct node *
5693
merge_parse_objectid(struct node *np, FILE * fp, char *name)
5694
0
{
5695
0
    struct node    *nnp;
5696
    /*
5697
     * printf("merge defval --> %s\n",np->defaultValue); 
5698
     */
5699
0
    nnp = parse_objectid(fp, name);
5700
0
    if (nnp) {
5701
5702
        /*
5703
         * apply last OID sub-identifier data to the information 
5704
         */
5705
        /*
5706
         * already collected for this node. 
5707
         */
5708
0
        struct node    *headp, *nextp;
5709
0
        int             ncount = 0;
5710
0
        nextp = headp = nnp;
5711
0
        while (nnp->next) {
5712
0
            nextp = nnp;
5713
0
            ncount++;
5714
0
            nnp = nnp->next;
5715
0
        }
5716
5717
0
        np->label = nnp->label;
5718
0
        np->subid = nnp->subid;
5719
0
        np->modid = nnp->modid;
5720
0
        np->parent = nnp->parent;
5721
0
  if (nnp->filename != NULL) {
5722
0
    free(nnp->filename);
5723
0
  }
5724
0
        free(nnp);
5725
5726
0
        if (ncount) {
5727
0
            nextp->next = np;
5728
0
            np = headp;
5729
0
        }
5730
0
    } else {
5731
0
        free_node(np);
5732
0
        np = NULL;
5733
0
    }
5734
5735
0
    return np;
5736
0
}
5737
5738
/*
5739
 * transfer data to tree from node
5740
 *
5741
 * move pointers for alloc'd data from np to tp.
5742
 * this prevents them from being freed when np is released.
5743
 * parent member is not moved.
5744
 *
5745
 * CAUTION: nodes may be repeats of existing tree nodes.
5746
 * This can happen especially when resolving IMPORT clauses.
5747
 *
5748
 */
5749
static void
5750
tree_from_node(struct tree *tp, struct node *np)
5751
0
{
5752
0
    free_partial_tree(tp, FALSE);
5753
5754
0
    tp->label = np->label;
5755
0
    np->label = NULL;
5756
0
    tp->enums = np->enums;
5757
0
    np->enums = NULL;
5758
0
    tp->ranges = np->ranges;
5759
0
    np->ranges = NULL;
5760
0
    tp->indexes = np->indexes;
5761
0
    np->indexes = NULL;
5762
0
    tp->augments = np->augments;
5763
0
    np->augments = NULL;
5764
0
    tp->varbinds = np->varbinds;
5765
0
    np->varbinds = NULL;
5766
0
    tp->hint = np->hint;
5767
0
    np->hint = NULL;
5768
0
    tp->units = np->units;
5769
0
    np->units = NULL;
5770
0
    tp->description = np->description;
5771
0
    np->description = NULL;
5772
0
    tp->reference = np->reference;
5773
0
    np->reference = NULL;
5774
0
    tp->defaultValue = np->defaultValue;
5775
0
    np->defaultValue = NULL;
5776
0
    tp->subid = np->subid;
5777
0
    tp->tc_index = np->tc_index;
5778
0
    tp->type = translation_table[np->type];
5779
0
    tp->access = np->access;
5780
0
    tp->status = np->status;
5781
5782
0
    set_function(tp);
5783
0
}
5784
5785
#endif /* NETSNMP_DISABLE_MIB_LOADING */