WeatherStation - Web server based weather station using Sparkfun W…

Users » AdamGreen » Code » WeatherStation

Adam Green / Mbed 2 deprecated WeatherStation

Web server based weather station using Sparkfun Weather Meters.

Dependencies: FatFileSystem mbed WeatherMeters SDFileSystem

NetStack/lwip/core/snmp/mib_structs.c@0:616601bde9fb, 2012-02-23 (annotated)

Committer:: AdamGreen
Date:: Thu Feb 23 21:38:39 2012 +0000
Revision:: 0:616601bde9fb

Who changed what in which revision?

User	Revision	Line number	New contents of line
AdamGreen	0:616601bde9fb	1	/**
AdamGreen	0:616601bde9fb	2	* @file
AdamGreen	0:616601bde9fb	3	* MIB tree access/construction functions.
AdamGreen	0:616601bde9fb	4	*/
AdamGreen	0:616601bde9fb	5
AdamGreen	0:616601bde9fb	6	/*
AdamGreen	0:616601bde9fb	7	* Copyright (c) 2006 Axon Digital Design B.V., The Netherlands.
AdamGreen	0:616601bde9fb	8	* All rights reserved.
AdamGreen	0:616601bde9fb	9	*
AdamGreen	0:616601bde9fb	10	* Redistribution and use in source and binary forms, with or without modification,
AdamGreen	0:616601bde9fb	11	* are permitted provided that the following conditions are met:
AdamGreen	0:616601bde9fb	12	*
AdamGreen	0:616601bde9fb	13	* 1. Redistributions of source code must retain the above copyright notice,
AdamGreen	0:616601bde9fb	14	* this list of conditions and the following disclaimer.
AdamGreen	0:616601bde9fb	15	* 2. Redistributions in binary form must reproduce the above copyright notice,
AdamGreen	0:616601bde9fb	16	* this list of conditions and the following disclaimer in the documentation
AdamGreen	0:616601bde9fb	17	* and/or other materials provided with the distribution.
AdamGreen	0:616601bde9fb	18	* 3. The name of the author may not be used to endorse or promote products
AdamGreen	0:616601bde9fb	19	* derived from this software without specific prior written permission.
AdamGreen	0:616601bde9fb	20	*
AdamGreen	0:616601bde9fb	21	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
AdamGreen	0:616601bde9fb	22	* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
AdamGreen	0:616601bde9fb	23	* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
AdamGreen	0:616601bde9fb	24	* SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
AdamGreen	0:616601bde9fb	25	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
AdamGreen	0:616601bde9fb	26	* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
AdamGreen	0:616601bde9fb	27	* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
AdamGreen	0:616601bde9fb	28	* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
AdamGreen	0:616601bde9fb	29	* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
AdamGreen	0:616601bde9fb	30	* OF SUCH DAMAGE.
AdamGreen	0:616601bde9fb	31	*
AdamGreen	0:616601bde9fb	32	* Author: Christiaan Simons <christiaan.simons@axon.tv>
AdamGreen	0:616601bde9fb	33	*/
AdamGreen	0:616601bde9fb	34
AdamGreen	0:616601bde9fb	35	#include "lwip/opt.h"
AdamGreen	0:616601bde9fb	36
AdamGreen	0:616601bde9fb	37	#if LWIP_SNMP /* don't build if not configured for use in lwipopts.h */
AdamGreen	0:616601bde9fb	38
AdamGreen	0:616601bde9fb	39	#include "lwip/snmp_structs.h"
AdamGreen	0:616601bde9fb	40	#include "lwip/memp.h"
AdamGreen	0:616601bde9fb	41	#include "lwip/netif.h"
AdamGreen	0:616601bde9fb	42
AdamGreen	0:616601bde9fb	43	/** .iso.org.dod.internet address prefix, @see snmp_iso_() /
AdamGreen	0:616601bde9fb	44	const s32_t prefix[4] = {1, 3, 6, 1};
AdamGreen	0:616601bde9fb	45
AdamGreen	0:616601bde9fb	46	#define NODE_STACK_SIZE (LWIP_SNMP_OBJ_ID_LEN)
AdamGreen	0:616601bde9fb	47	/** node stack entry (old news?) */
AdamGreen	0:616601bde9fb	48	struct nse
AdamGreen	0:616601bde9fb	49	{
AdamGreen	0:616601bde9fb	50	/** right child */
AdamGreen	0:616601bde9fb	51	struct mib_node* r_ptr;
AdamGreen	0:616601bde9fb	52	/** right child identifier */
AdamGreen	0:616601bde9fb	53	s32_t r_id;
AdamGreen	0:616601bde9fb	54	/** right child next level */
AdamGreen	0:616601bde9fb	55	u8_t r_nl;
AdamGreen	0:616601bde9fb	56	};
AdamGreen	0:616601bde9fb	57	static u8_t node_stack_cnt;
AdamGreen	0:616601bde9fb	58	static struct nse node_stack[NODE_STACK_SIZE];
AdamGreen	0:616601bde9fb	59
AdamGreen	0:616601bde9fb	60	/**
AdamGreen	0:616601bde9fb	61	* Pushes nse struct onto stack.
AdamGreen	0:616601bde9fb	62	*/
AdamGreen	0:616601bde9fb	63	static void
AdamGreen	0:616601bde9fb	64	push_node(struct nse* node)
AdamGreen	0:616601bde9fb	65	{
AdamGreen	0:616601bde9fb	66	LWIP_ASSERT("node_stack_cnt < NODE_STACK_SIZE",node_stack_cnt < NODE_STACK_SIZE);
AdamGreen	0:616601bde9fb	67	LWIP_DEBUGF(SNMP_MIB_DEBUG,("push_node() node=%p id=%"S32_F"\n",(void*)(node->r_ptr),node->r_id));
AdamGreen	0:616601bde9fb	68	if (node_stack_cnt < NODE_STACK_SIZE)
AdamGreen	0:616601bde9fb	69	{
AdamGreen	0:616601bde9fb	70	node_stack[node_stack_cnt] = *node;
AdamGreen	0:616601bde9fb	71	node_stack_cnt++;
AdamGreen	0:616601bde9fb	72	}
AdamGreen	0:616601bde9fb	73	}
AdamGreen	0:616601bde9fb	74
AdamGreen	0:616601bde9fb	75	/**
AdamGreen	0:616601bde9fb	76	* Pops nse struct from stack.
AdamGreen	0:616601bde9fb	77	*/
AdamGreen	0:616601bde9fb	78	static void
AdamGreen	0:616601bde9fb	79	pop_node(struct nse* node)
AdamGreen	0:616601bde9fb	80	{
AdamGreen	0:616601bde9fb	81	if (node_stack_cnt > 0)
AdamGreen	0:616601bde9fb	82	{
AdamGreen	0:616601bde9fb	83	node_stack_cnt--;
AdamGreen	0:616601bde9fb	84	*node = node_stack[node_stack_cnt];
AdamGreen	0:616601bde9fb	85	}
AdamGreen	0:616601bde9fb	86	LWIP_DEBUGF(SNMP_MIB_DEBUG,("pop_node() node=%p id=%"S32_F"\n",(void *)(node->r_ptr),node->r_id));
AdamGreen	0:616601bde9fb	87	}
AdamGreen	0:616601bde9fb	88
AdamGreen	0:616601bde9fb	89	/**
AdamGreen	0:616601bde9fb	90	* Conversion from ifIndex to lwIP netif
AdamGreen	0:616601bde9fb	91	* @param ifindex is a s32_t object sub-identifier
AdamGreen	0:616601bde9fb	92	* @param netif points to returned netif struct pointer
AdamGreen	0:616601bde9fb	93	*/
AdamGreen	0:616601bde9fb	94	void
AdamGreen	0:616601bde9fb	95	snmp_ifindextonetif(s32_t ifindex, struct netif **netif)
AdamGreen	0:616601bde9fb	96	{
AdamGreen	0:616601bde9fb	97	struct netif *nif = netif_list;
AdamGreen	0:616601bde9fb	98	s32_t i, ifidx;
AdamGreen	0:616601bde9fb	99
AdamGreen	0:616601bde9fb	100	ifidx = ifindex - 1;
AdamGreen	0:616601bde9fb	101	i = 0;
AdamGreen	0:616601bde9fb	102	while ((nif != NULL) && (i < ifidx))
AdamGreen	0:616601bde9fb	103	{
AdamGreen	0:616601bde9fb	104	nif = nif->next;
AdamGreen	0:616601bde9fb	105	i++;
AdamGreen	0:616601bde9fb	106	}
AdamGreen	0:616601bde9fb	107	*netif = nif;
AdamGreen	0:616601bde9fb	108	}
AdamGreen	0:616601bde9fb	109
AdamGreen	0:616601bde9fb	110	/**
AdamGreen	0:616601bde9fb	111	* Conversion from lwIP netif to ifIndex
AdamGreen	0:616601bde9fb	112	* @param netif points to a netif struct
AdamGreen	0:616601bde9fb	113	* @param ifidx points to s32_t object sub-identifier
AdamGreen	0:616601bde9fb	114	*/
AdamGreen	0:616601bde9fb	115	void
AdamGreen	0:616601bde9fb	116	snmp_netiftoifindex(struct netif netif, s32_t ifidx)
AdamGreen	0:616601bde9fb	117	{
AdamGreen	0:616601bde9fb	118	struct netif *nif = netif_list;
AdamGreen	0:616601bde9fb	119	u16_t i;
AdamGreen	0:616601bde9fb	120
AdamGreen	0:616601bde9fb	121	i = 0;
AdamGreen	0:616601bde9fb	122	while ((nif != NULL) && (nif != netif))
AdamGreen	0:616601bde9fb	123	{
AdamGreen	0:616601bde9fb	124	nif = nif->next;
AdamGreen	0:616601bde9fb	125	i++;
AdamGreen	0:616601bde9fb	126	}
AdamGreen	0:616601bde9fb	127	*ifidx = i+1;
AdamGreen	0:616601bde9fb	128	}
AdamGreen	0:616601bde9fb	129
AdamGreen	0:616601bde9fb	130	/**
AdamGreen	0:616601bde9fb	131	* Conversion from oid to lwIP ip_addr
AdamGreen	0:616601bde9fb	132	* @param ident points to s32_t ident[4] input
AdamGreen	0:616601bde9fb	133	* @param ip points to output struct
AdamGreen	0:616601bde9fb	134	*/
AdamGreen	0:616601bde9fb	135	void
AdamGreen	0:616601bde9fb	136	snmp_oidtoip(s32_t ident, ip_addr_t ip)
AdamGreen	0:616601bde9fb	137	{
AdamGreen	0:616601bde9fb	138	IP4_ADDR(ip, ident[0], ident[1], ident[2], ident[3]);
AdamGreen	0:616601bde9fb	139	}
AdamGreen	0:616601bde9fb	140
AdamGreen	0:616601bde9fb	141	/**
AdamGreen	0:616601bde9fb	142	* Conversion from lwIP ip_addr to oid
AdamGreen	0:616601bde9fb	143	* @param ip points to input struct
AdamGreen	0:616601bde9fb	144	* @param ident points to s32_t ident[4] output
AdamGreen	0:616601bde9fb	145	*/
AdamGreen	0:616601bde9fb	146	void
AdamGreen	0:616601bde9fb	147	snmp_iptooid(ip_addr_t ip, s32_t ident)
AdamGreen	0:616601bde9fb	148	{
AdamGreen	0:616601bde9fb	149	ident[0] = ip4_addr1(ip);
AdamGreen	0:616601bde9fb	150	ident[1] = ip4_addr2(ip);
AdamGreen	0:616601bde9fb	151	ident[2] = ip4_addr3(ip);
AdamGreen	0:616601bde9fb	152	ident[3] = ip4_addr4(ip);
AdamGreen	0:616601bde9fb	153	}
AdamGreen	0:616601bde9fb	154
AdamGreen	0:616601bde9fb	155	struct mib_list_node *
AdamGreen	0:616601bde9fb	156	snmp_mib_ln_alloc(s32_t id)
AdamGreen	0:616601bde9fb	157	{
AdamGreen	0:616601bde9fb	158	struct mib_list_node *ln;
AdamGreen	0:616601bde9fb	159
AdamGreen	0:616601bde9fb	160	ln = (struct mib_list_node *)memp_malloc(MEMP_SNMP_NODE);
AdamGreen	0:616601bde9fb	161	if (ln != NULL)
AdamGreen	0:616601bde9fb	162	{
AdamGreen	0:616601bde9fb	163	ln->prev = NULL;
AdamGreen	0:616601bde9fb	164	ln->next = NULL;
AdamGreen	0:616601bde9fb	165	ln->objid = id;
AdamGreen	0:616601bde9fb	166	ln->nptr = NULL;
AdamGreen	0:616601bde9fb	167	}
AdamGreen	0:616601bde9fb	168	return ln;
AdamGreen	0:616601bde9fb	169	}
AdamGreen	0:616601bde9fb	170
AdamGreen	0:616601bde9fb	171	void
AdamGreen	0:616601bde9fb	172	snmp_mib_ln_free(struct mib_list_node *ln)
AdamGreen	0:616601bde9fb	173	{
AdamGreen	0:616601bde9fb	174	memp_free(MEMP_SNMP_NODE, ln);
AdamGreen	0:616601bde9fb	175	}
AdamGreen	0:616601bde9fb	176
AdamGreen	0:616601bde9fb	177	struct mib_list_rootnode *
AdamGreen	0:616601bde9fb	178	snmp_mib_lrn_alloc(void)
AdamGreen	0:616601bde9fb	179	{
AdamGreen	0:616601bde9fb	180	struct mib_list_rootnode *lrn;
AdamGreen	0:616601bde9fb	181
AdamGreen	0:616601bde9fb	182	lrn = (struct mib_list_rootnode*)memp_malloc(MEMP_SNMP_ROOTNODE);
AdamGreen	0:616601bde9fb	183	if (lrn != NULL)
AdamGreen	0:616601bde9fb	184	{
AdamGreen	0:616601bde9fb	185	lrn->get_object_def = noleafs_get_object_def;
AdamGreen	0:616601bde9fb	186	lrn->get_value = noleafs_get_value;
AdamGreen	0:616601bde9fb	187	lrn->set_test = noleafs_set_test;
AdamGreen	0:616601bde9fb	188	lrn->set_value = noleafs_set_value;
AdamGreen	0:616601bde9fb	189	lrn->node_type = MIB_NODE_LR;
AdamGreen	0:616601bde9fb	190	lrn->maxlength = 0;
AdamGreen	0:616601bde9fb	191	lrn->head = NULL;
AdamGreen	0:616601bde9fb	192	lrn->tail = NULL;
AdamGreen	0:616601bde9fb	193	lrn->count = 0;
AdamGreen	0:616601bde9fb	194	}
AdamGreen	0:616601bde9fb	195	return lrn;
AdamGreen	0:616601bde9fb	196	}
AdamGreen	0:616601bde9fb	197
AdamGreen	0:616601bde9fb	198	void
AdamGreen	0:616601bde9fb	199	snmp_mib_lrn_free(struct mib_list_rootnode *lrn)
AdamGreen	0:616601bde9fb	200	{
AdamGreen	0:616601bde9fb	201	memp_free(MEMP_SNMP_ROOTNODE, lrn);
AdamGreen	0:616601bde9fb	202	}
AdamGreen	0:616601bde9fb	203
AdamGreen	0:616601bde9fb	204	/**
AdamGreen	0:616601bde9fb	205	* Inserts node in idx list in a sorted
AdamGreen	0:616601bde9fb	206	* (ascending order) fashion and
AdamGreen	0:616601bde9fb	207	* allocates the node if needed.
AdamGreen	0:616601bde9fb	208	*
AdamGreen	0:616601bde9fb	209	* @param rn points to the root node
AdamGreen	0:616601bde9fb	210	* @param objid is the object sub identifier
AdamGreen	0:616601bde9fb	211	* @param insn points to a pointer to the inserted node
AdamGreen	0:616601bde9fb	212	* used for constructing the tree.
AdamGreen	0:616601bde9fb	213	* @return -1 if failed, 1 if inserted, 2 if present.
AdamGreen	0:616601bde9fb	214	*/
AdamGreen	0:616601bde9fb	215	s8_t
AdamGreen	0:616601bde9fb	216	snmp_mib_node_insert(struct mib_list_rootnode rn, s32_t objid, struct mib_list_node *insn)
AdamGreen	0:616601bde9fb	217	{
AdamGreen	0:616601bde9fb	218	struct mib_list_node *nn;
AdamGreen	0:616601bde9fb	219	s8_t insert;
AdamGreen	0:616601bde9fb	220
AdamGreen	0:616601bde9fb	221	LWIP_ASSERT("rn != NULL",rn != NULL);
AdamGreen	0:616601bde9fb	222
AdamGreen	0:616601bde9fb	223	/* -1 = malloc failure, 0 = not inserted, 1 = inserted, 2 = was present */
AdamGreen	0:616601bde9fb	224	insert = 0;
AdamGreen	0:616601bde9fb	225	if (rn->head == NULL)
AdamGreen	0:616601bde9fb	226	{
AdamGreen	0:616601bde9fb	227	/* empty list, add first node */
AdamGreen	0:616601bde9fb	228	LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc empty list objid==%"S32_F"\n",objid));
AdamGreen	0:616601bde9fb	229	nn = snmp_mib_ln_alloc(objid);
AdamGreen	0:616601bde9fb	230	if (nn != NULL)
AdamGreen	0:616601bde9fb	231	{
AdamGreen	0:616601bde9fb	232	rn->head = nn;
AdamGreen	0:616601bde9fb	233	rn->tail = nn;
AdamGreen	0:616601bde9fb	234	*insn = nn;
AdamGreen	0:616601bde9fb	235	insert = 1;
AdamGreen	0:616601bde9fb	236	}
AdamGreen	0:616601bde9fb	237	else
AdamGreen	0:616601bde9fb	238	{
AdamGreen	0:616601bde9fb	239	insert = -1;
AdamGreen	0:616601bde9fb	240	}
AdamGreen	0:616601bde9fb	241	}
AdamGreen	0:616601bde9fb	242	else
AdamGreen	0:616601bde9fb	243	{
AdamGreen	0:616601bde9fb	244	struct mib_list_node *n;
AdamGreen	0:616601bde9fb	245	/* at least one node is present */
AdamGreen	0:616601bde9fb	246	n = rn->head;
AdamGreen	0:616601bde9fb	247	while ((n != NULL) && (insert == 0))
AdamGreen	0:616601bde9fb	248	{
AdamGreen	0:616601bde9fb	249	if (n->objid == objid)
AdamGreen	0:616601bde9fb	250	{
AdamGreen	0:616601bde9fb	251	/* node is already there */
AdamGreen	0:616601bde9fb	252	LWIP_DEBUGF(SNMP_MIB_DEBUG,("node already there objid==%"S32_F"\n",objid));
AdamGreen	0:616601bde9fb	253	*insn = n;
AdamGreen	0:616601bde9fb	254	insert = 2;
AdamGreen	0:616601bde9fb	255	}
AdamGreen	0:616601bde9fb	256	else if (n->objid < objid)
AdamGreen	0:616601bde9fb	257	{
AdamGreen	0:616601bde9fb	258	if (n->next == NULL)
AdamGreen	0:616601bde9fb	259	{
AdamGreen	0:616601bde9fb	260	/* alloc and insert at the tail */
AdamGreen	0:616601bde9fb	261	LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc ins tail objid==%"S32_F"\n",objid));
AdamGreen	0:616601bde9fb	262	nn = snmp_mib_ln_alloc(objid);
AdamGreen	0:616601bde9fb	263	if (nn != NULL)
AdamGreen	0:616601bde9fb	264	{
AdamGreen	0:616601bde9fb	265	nn->next = NULL;
AdamGreen	0:616601bde9fb	266	nn->prev = n;
AdamGreen	0:616601bde9fb	267	n->next = nn;
AdamGreen	0:616601bde9fb	268	rn->tail = nn;
AdamGreen	0:616601bde9fb	269	*insn = nn;
AdamGreen	0:616601bde9fb	270	insert = 1;
AdamGreen	0:616601bde9fb	271	}
AdamGreen	0:616601bde9fb	272	else
AdamGreen	0:616601bde9fb	273	{
AdamGreen	0:616601bde9fb	274	/* insertion failure */
AdamGreen	0:616601bde9fb	275	insert = -1;
AdamGreen	0:616601bde9fb	276	}
AdamGreen	0:616601bde9fb	277	}
AdamGreen	0:616601bde9fb	278	else
AdamGreen	0:616601bde9fb	279	{
AdamGreen	0:616601bde9fb	280	/* there's more to explore: traverse list */
AdamGreen	0:616601bde9fb	281	LWIP_DEBUGF(SNMP_MIB_DEBUG,("traverse list\n"));
AdamGreen	0:616601bde9fb	282	n = n->next;
AdamGreen	0:616601bde9fb	283	}
AdamGreen	0:616601bde9fb	284	}
AdamGreen	0:616601bde9fb	285	else
AdamGreen	0:616601bde9fb	286	{
AdamGreen	0:616601bde9fb	287	/* n->objid > objid */
AdamGreen	0:616601bde9fb	288	/* alloc and insert between n->prev and n */
AdamGreen	0:616601bde9fb	289	LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc ins n->prev, objid==%"S32_F", n\n",objid));
AdamGreen	0:616601bde9fb	290	nn = snmp_mib_ln_alloc(objid);
AdamGreen	0:616601bde9fb	291	if (nn != NULL)
AdamGreen	0:616601bde9fb	292	{
AdamGreen	0:616601bde9fb	293	if (n->prev == NULL)
AdamGreen	0:616601bde9fb	294	{
AdamGreen	0:616601bde9fb	295	/* insert at the head */
AdamGreen	0:616601bde9fb	296	nn->next = n;
AdamGreen	0:616601bde9fb	297	nn->prev = NULL;
AdamGreen	0:616601bde9fb	298	rn->head = nn;
AdamGreen	0:616601bde9fb	299	n->prev = nn;
AdamGreen	0:616601bde9fb	300	}
AdamGreen	0:616601bde9fb	301	else
AdamGreen	0:616601bde9fb	302	{
AdamGreen	0:616601bde9fb	303	/* insert in the middle */
AdamGreen	0:616601bde9fb	304	nn->next = n;
AdamGreen	0:616601bde9fb	305	nn->prev = n->prev;
AdamGreen	0:616601bde9fb	306	n->prev->next = nn;
AdamGreen	0:616601bde9fb	307	n->prev = nn;
AdamGreen	0:616601bde9fb	308	}
AdamGreen	0:616601bde9fb	309	*insn = nn;
AdamGreen	0:616601bde9fb	310	insert = 1;
AdamGreen	0:616601bde9fb	311	}
AdamGreen	0:616601bde9fb	312	else
AdamGreen	0:616601bde9fb	313	{
AdamGreen	0:616601bde9fb	314	/* insertion failure */
AdamGreen	0:616601bde9fb	315	insert = -1;
AdamGreen	0:616601bde9fb	316	}
AdamGreen	0:616601bde9fb	317	}
AdamGreen	0:616601bde9fb	318	}
AdamGreen	0:616601bde9fb	319	}
AdamGreen	0:616601bde9fb	320	if (insert == 1)
AdamGreen	0:616601bde9fb	321	{
AdamGreen	0:616601bde9fb	322	rn->count += 1;
AdamGreen	0:616601bde9fb	323	}
AdamGreen	0:616601bde9fb	324	LWIP_ASSERT("insert != 0",insert != 0);
AdamGreen	0:616601bde9fb	325	return insert;
AdamGreen	0:616601bde9fb	326	}
AdamGreen	0:616601bde9fb	327
AdamGreen	0:616601bde9fb	328	/**
AdamGreen	0:616601bde9fb	329	* Finds node in idx list and returns deletion mark.
AdamGreen	0:616601bde9fb	330	*
AdamGreen	0:616601bde9fb	331	* @param rn points to the root node
AdamGreen	0:616601bde9fb	332	* @param objid is the object sub identifier
AdamGreen	0:616601bde9fb	333	* @param fn returns pointer to found node
AdamGreen	0:616601bde9fb	334	* @return 0 if not found, 1 if deletable,
AdamGreen	0:616601bde9fb	335	* 2 can't delete (2 or more children), 3 not a list_node
AdamGreen	0:616601bde9fb	336	*/
AdamGreen	0:616601bde9fb	337	s8_t
AdamGreen	0:616601bde9fb	338	snmp_mib_node_find(struct mib_list_rootnode rn, s32_t objid, struct mib_list_node *fn)
AdamGreen	0:616601bde9fb	339	{
AdamGreen	0:616601bde9fb	340	s8_t fc;
AdamGreen	0:616601bde9fb	341	struct mib_list_node *n;
AdamGreen	0:616601bde9fb	342
AdamGreen	0:616601bde9fb	343	LWIP_ASSERT("rn != NULL",rn != NULL);
AdamGreen	0:616601bde9fb	344	n = rn->head;
AdamGreen	0:616601bde9fb	345	while ((n != NULL) && (n->objid != objid))
AdamGreen	0:616601bde9fb	346	{
AdamGreen	0:616601bde9fb	347	n = n->next;
AdamGreen	0:616601bde9fb	348	}
AdamGreen	0:616601bde9fb	349	if (n == NULL)
AdamGreen	0:616601bde9fb	350	{
AdamGreen	0:616601bde9fb	351	fc = 0;
AdamGreen	0:616601bde9fb	352	}
AdamGreen	0:616601bde9fb	353	else if (n->nptr == NULL)
AdamGreen	0:616601bde9fb	354	{
AdamGreen	0:616601bde9fb	355	/* leaf, can delete node */
AdamGreen	0:616601bde9fb	356	fc = 1;
AdamGreen	0:616601bde9fb	357	}
AdamGreen	0:616601bde9fb	358	else
AdamGreen	0:616601bde9fb	359	{
AdamGreen	0:616601bde9fb	360	struct mib_list_rootnode *r;
AdamGreen	0:616601bde9fb	361
AdamGreen	0:616601bde9fb	362	if (n->nptr->node_type == MIB_NODE_LR)
AdamGreen	0:616601bde9fb	363	{
AdamGreen	0:616601bde9fb	364	r = (struct mib_list_rootnode *)n->nptr;
AdamGreen	0:616601bde9fb	365	if (r->count > 1)
AdamGreen	0:616601bde9fb	366	{
AdamGreen	0:616601bde9fb	367	/* can't delete node */
AdamGreen	0:616601bde9fb	368	fc = 2;
AdamGreen	0:616601bde9fb	369	}
AdamGreen	0:616601bde9fb	370	else
AdamGreen	0:616601bde9fb	371	{
AdamGreen	0:616601bde9fb	372	/* count <= 1, can delete node */
AdamGreen	0:616601bde9fb	373	fc = 1;
AdamGreen	0:616601bde9fb	374	}
AdamGreen	0:616601bde9fb	375	}
AdamGreen	0:616601bde9fb	376	else
AdamGreen	0:616601bde9fb	377	{
AdamGreen	0:616601bde9fb	378	/* other node type */
AdamGreen	0:616601bde9fb	379	fc = 3;
AdamGreen	0:616601bde9fb	380	}
AdamGreen	0:616601bde9fb	381	}
AdamGreen	0:616601bde9fb	382	*fn = n;
AdamGreen	0:616601bde9fb	383	return fc;
AdamGreen	0:616601bde9fb	384	}
AdamGreen	0:616601bde9fb	385
AdamGreen	0:616601bde9fb	386	/**
AdamGreen	0:616601bde9fb	387	* Removes node from idx list
AdamGreen	0:616601bde9fb	388	* if it has a single child left.
AdamGreen	0:616601bde9fb	389	*
AdamGreen	0:616601bde9fb	390	* @param rn points to the root node
AdamGreen	0:616601bde9fb	391	* @param n points to the node to delete
AdamGreen	0:616601bde9fb	392	* @return the nptr to be freed by caller
AdamGreen	0:616601bde9fb	393	*/
AdamGreen	0:616601bde9fb	394	struct mib_list_rootnode *
AdamGreen	0:616601bde9fb	395	snmp_mib_node_delete(struct mib_list_rootnode rn, struct mib_list_node n)
AdamGreen	0:616601bde9fb	396	{
AdamGreen	0:616601bde9fb	397	struct mib_list_rootnode *next;
AdamGreen	0:616601bde9fb	398
AdamGreen	0:616601bde9fb	399	LWIP_ASSERT("rn != NULL",rn != NULL);
AdamGreen	0:616601bde9fb	400	LWIP_ASSERT("n != NULL",n != NULL);
AdamGreen	0:616601bde9fb	401
AdamGreen	0:616601bde9fb	402	/* caller must remove this sub-tree */
AdamGreen	0:616601bde9fb	403	next = (struct mib_list_rootnode*)(n->nptr);
AdamGreen	0:616601bde9fb	404	rn->count -= 1;
AdamGreen	0:616601bde9fb	405
AdamGreen	0:616601bde9fb	406	if (n == rn->head)
AdamGreen	0:616601bde9fb	407	{
AdamGreen	0:616601bde9fb	408	rn->head = n->next;
AdamGreen	0:616601bde9fb	409	if (n->next != NULL)
AdamGreen	0:616601bde9fb	410	{
AdamGreen	0:616601bde9fb	411	/* not last node, new list begin */
AdamGreen	0:616601bde9fb	412	n->next->prev = NULL;
AdamGreen	0:616601bde9fb	413	}
AdamGreen	0:616601bde9fb	414	}
AdamGreen	0:616601bde9fb	415	else if (n == rn->tail)
AdamGreen	0:616601bde9fb	416	{
AdamGreen	0:616601bde9fb	417	rn->tail = n->prev;
AdamGreen	0:616601bde9fb	418	if (n->prev != NULL)
AdamGreen	0:616601bde9fb	419	{
AdamGreen	0:616601bde9fb	420	/* not last node, new list end */
AdamGreen	0:616601bde9fb	421	n->prev->next = NULL;
AdamGreen	0:616601bde9fb	422	}
AdamGreen	0:616601bde9fb	423	}
AdamGreen	0:616601bde9fb	424	else
AdamGreen	0:616601bde9fb	425	{
AdamGreen	0:616601bde9fb	426	/* node must be in the middle */
AdamGreen	0:616601bde9fb	427	n->prev->next = n->next;
AdamGreen	0:616601bde9fb	428	n->next->prev = n->prev;
AdamGreen	0:616601bde9fb	429	}
AdamGreen	0:616601bde9fb	430	LWIP_DEBUGF(SNMP_MIB_DEBUG,("free list objid==%"S32_F"\n",n->objid));
AdamGreen	0:616601bde9fb	431	snmp_mib_ln_free(n);
AdamGreen	0:616601bde9fb	432	if (rn->count == 0)
AdamGreen	0:616601bde9fb	433	{
AdamGreen	0:616601bde9fb	434	rn->head = NULL;
AdamGreen	0:616601bde9fb	435	rn->tail = NULL;
AdamGreen	0:616601bde9fb	436	}
AdamGreen	0:616601bde9fb	437	return next;
AdamGreen	0:616601bde9fb	438	}
AdamGreen	0:616601bde9fb	439
AdamGreen	0:616601bde9fb	440
AdamGreen	0:616601bde9fb	441
AdamGreen	0:616601bde9fb	442	/**
AdamGreen	0:616601bde9fb	443	* Searches tree for the supplied (scalar?) object identifier.
AdamGreen	0:616601bde9fb	444	*
AdamGreen	0:616601bde9fb	445	* @param node points to the root of the tree ('.internet')
AdamGreen	0:616601bde9fb	446	* @param ident_len the length of the supplied object identifier
AdamGreen	0:616601bde9fb	447	* @param ident points to the array of sub identifiers
AdamGreen	0:616601bde9fb	448	* @param np points to the found object instance (return)
AdamGreen	0:616601bde9fb	449	* @return pointer to the requested parent (!) node if success, NULL otherwise
AdamGreen	0:616601bde9fb	450	*/
AdamGreen	0:616601bde9fb	451	struct mib_node *
AdamGreen	0:616601bde9fb	452	snmp_search_tree(struct mib_node node, u8_t ident_len, s32_t ident, struct snmp_name_ptr *np)
AdamGreen	0:616601bde9fb	453	{
AdamGreen	0:616601bde9fb	454	u8_t node_type, ext_level;
AdamGreen	0:616601bde9fb	455
AdamGreen	0:616601bde9fb	456	ext_level = 0;
AdamGreen	0:616601bde9fb	457	LWIP_DEBUGF(SNMP_MIB_DEBUG,("node==%p ident==%"S32_F"\n",(void)node,*ident));
AdamGreen	0:616601bde9fb	458	while (node != NULL)
AdamGreen	0:616601bde9fb	459	{
AdamGreen	0:616601bde9fb	460	node_type = node->node_type;
AdamGreen	0:616601bde9fb	461	if ((node_type == MIB_NODE_AR) \|\| (node_type == MIB_NODE_RA))
AdamGreen	0:616601bde9fb	462	{
AdamGreen	0:616601bde9fb	463	struct mib_array_node *an;
AdamGreen	0:616601bde9fb	464	u16_t i;
AdamGreen	0:616601bde9fb	465
AdamGreen	0:616601bde9fb	466	if (ident_len > 0)
AdamGreen	0:616601bde9fb	467	{
AdamGreen	0:616601bde9fb	468	/* array node (internal ROM or RAM, fixed length) */
AdamGreen	0:616601bde9fb	469	an = (struct mib_array_node *)node;
AdamGreen	0:616601bde9fb	470	i = 0;
AdamGreen	0:616601bde9fb	471	while ((i < an->maxlength) && (an->objid[i] != *ident))
AdamGreen	0:616601bde9fb	472	{
AdamGreen	0:616601bde9fb	473	i++;
AdamGreen	0:616601bde9fb	474	}
AdamGreen	0:616601bde9fb	475	if (i < an->maxlength)
AdamGreen	0:616601bde9fb	476	{
AdamGreen	0:616601bde9fb	477	/* found it, if available proceed to child, otherwise inspect leaf */
AdamGreen	0:616601bde9fb	478	LWIP_DEBUGF(SNMP_MIB_DEBUG,("an->objid[%"U16_F"]==%"S32_F" ident==%"S32_F"\n",i,an->objid[i],ident));
AdamGreen	0:616601bde9fb	479	if (an->nptr[i] == NULL)
AdamGreen	0:616601bde9fb	480	{
AdamGreen	0:616601bde9fb	481	/* a scalar leaf OR table,
AdamGreen	0:616601bde9fb	482	inspect remaining instance number / table index */
AdamGreen	0:616601bde9fb	483	np->ident_len = ident_len;
AdamGreen	0:616601bde9fb	484	np->ident = ident;
AdamGreen	0:616601bde9fb	485	return (struct mib_node*)an;
AdamGreen	0:616601bde9fb	486	}
AdamGreen	0:616601bde9fb	487	else
AdamGreen	0:616601bde9fb	488	{
AdamGreen	0:616601bde9fb	489	/* follow next child pointer */
AdamGreen	0:616601bde9fb	490	ident++;
AdamGreen	0:616601bde9fb	491	ident_len--;
AdamGreen	0:616601bde9fb	492	node = an->nptr[i];
AdamGreen	0:616601bde9fb	493	}
AdamGreen	0:616601bde9fb	494	}
AdamGreen	0:616601bde9fb	495	else
AdamGreen	0:616601bde9fb	496	{
AdamGreen	0:616601bde9fb	497	/* search failed, identifier mismatch (nosuchname) */
AdamGreen	0:616601bde9fb	498	LWIP_DEBUGF(SNMP_MIB_DEBUG,("an search failed ident==%"S32_F"\n",ident));
AdamGreen	0:616601bde9fb	499	return NULL;
AdamGreen	0:616601bde9fb	500	}
AdamGreen	0:616601bde9fb	501	}
AdamGreen	0:616601bde9fb	502	else
AdamGreen	0:616601bde9fb	503	{
AdamGreen	0:616601bde9fb	504	/* search failed, short object identifier (nosuchname) */
AdamGreen	0:616601bde9fb	505	LWIP_DEBUGF(SNMP_MIB_DEBUG,("an search failed, short object identifier\n"));
AdamGreen	0:616601bde9fb	506	return NULL;
AdamGreen	0:616601bde9fb	507	}
AdamGreen	0:616601bde9fb	508	}
AdamGreen	0:616601bde9fb	509	else if(node_type == MIB_NODE_LR)
AdamGreen	0:616601bde9fb	510	{
AdamGreen	0:616601bde9fb	511	struct mib_list_rootnode *lrn;
AdamGreen	0:616601bde9fb	512	struct mib_list_node *ln;
AdamGreen	0:616601bde9fb	513
AdamGreen	0:616601bde9fb	514	if (ident_len > 0)
AdamGreen	0:616601bde9fb	515	{
AdamGreen	0:616601bde9fb	516	/* list root node (internal 'RAM', variable length) */
AdamGreen	0:616601bde9fb	517	lrn = (struct mib_list_rootnode *)node;
AdamGreen	0:616601bde9fb	518	ln = lrn->head;
AdamGreen	0:616601bde9fb	519	/* iterate over list, head to tail */
AdamGreen	0:616601bde9fb	520	while ((ln != NULL) && (ln->objid != *ident))
AdamGreen	0:616601bde9fb	521	{
AdamGreen	0:616601bde9fb	522	ln = ln->next;
AdamGreen	0:616601bde9fb	523	}
AdamGreen	0:616601bde9fb	524	if (ln != NULL)
AdamGreen	0:616601bde9fb	525	{
AdamGreen	0:616601bde9fb	526	/* found it, proceed to child */;
AdamGreen	0:616601bde9fb	527	LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln->objid==%"S32_F" ident==%"S32_F"\n",ln->objid,ident));
AdamGreen	0:616601bde9fb	528	if (ln->nptr == NULL)
AdamGreen	0:616601bde9fb	529	{
AdamGreen	0:616601bde9fb	530	np->ident_len = ident_len;
AdamGreen	0:616601bde9fb	531	np->ident = ident;
AdamGreen	0:616601bde9fb	532	return (struct mib_node*)lrn;
AdamGreen	0:616601bde9fb	533	}
AdamGreen	0:616601bde9fb	534	else
AdamGreen	0:616601bde9fb	535	{
AdamGreen	0:616601bde9fb	536	/* follow next child pointer */
AdamGreen	0:616601bde9fb	537	ident_len--;
AdamGreen	0:616601bde9fb	538	ident++;
AdamGreen	0:616601bde9fb	539	node = ln->nptr;
AdamGreen	0:616601bde9fb	540	}
AdamGreen	0:616601bde9fb	541	}
AdamGreen	0:616601bde9fb	542	else
AdamGreen	0:616601bde9fb	543	{
AdamGreen	0:616601bde9fb	544	/* search failed */
AdamGreen	0:616601bde9fb	545	LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln search failed ident==%"S32_F"\n",ident));
AdamGreen	0:616601bde9fb	546	return NULL;
AdamGreen	0:616601bde9fb	547	}
AdamGreen	0:616601bde9fb	548	}
AdamGreen	0:616601bde9fb	549	else
AdamGreen	0:616601bde9fb	550	{
AdamGreen	0:616601bde9fb	551	/* search failed, short object identifier (nosuchname) */
AdamGreen	0:616601bde9fb	552	LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln search failed, short object identifier\n"));
AdamGreen	0:616601bde9fb	553	return NULL;
AdamGreen	0:616601bde9fb	554	}
AdamGreen	0:616601bde9fb	555	}
AdamGreen	0:616601bde9fb	556	else if(node_type == MIB_NODE_EX)
AdamGreen	0:616601bde9fb	557	{
AdamGreen	0:616601bde9fb	558	struct mib_external_node *en;
AdamGreen	0:616601bde9fb	559	u16_t i, len;
AdamGreen	0:616601bde9fb	560
AdamGreen	0:616601bde9fb	561	if (ident_len > 0)
AdamGreen	0:616601bde9fb	562	{
AdamGreen	0:616601bde9fb	563	/* external node (addressing and access via functions) */
AdamGreen	0:616601bde9fb	564	en = (struct mib_external_node *)node;
AdamGreen	0:616601bde9fb	565
AdamGreen	0:616601bde9fb	566	i = 0;
AdamGreen	0:616601bde9fb	567	len = en->level_length(en->addr_inf,ext_level);
AdamGreen	0:616601bde9fb	568	while ((i < len) && (en->ident_cmp(en->addr_inf,ext_level,i,*ident) != 0))
AdamGreen	0:616601bde9fb	569	{
AdamGreen	0:616601bde9fb	570	i++;
AdamGreen	0:616601bde9fb	571	}
AdamGreen	0:616601bde9fb	572	if (i < len)
AdamGreen	0:616601bde9fb	573	{
AdamGreen	0:616601bde9fb	574	s32_t debug_id;
AdamGreen	0:616601bde9fb	575
AdamGreen	0:616601bde9fb	576	en->get_objid(en->addr_inf,ext_level,i,&debug_id);
AdamGreen	0:616601bde9fb	577	LWIP_DEBUGF(SNMP_MIB_DEBUG,("en->objid==%"S32_F" ident==%"S32_F"\n",debug_id,ident));
AdamGreen	0:616601bde9fb	578	if ((ext_level + 1) == en->tree_levels)
AdamGreen	0:616601bde9fb	579	{
AdamGreen	0:616601bde9fb	580	np->ident_len = ident_len;
AdamGreen	0:616601bde9fb	581	np->ident = ident;
AdamGreen	0:616601bde9fb	582	return (struct mib_node*)en;
AdamGreen	0:616601bde9fb	583	}
AdamGreen	0:616601bde9fb	584	else
AdamGreen	0:616601bde9fb	585	{
AdamGreen	0:616601bde9fb	586	/* found it, proceed to child */
AdamGreen	0:616601bde9fb	587	ident_len--;
AdamGreen	0:616601bde9fb	588	ident++;
AdamGreen	0:616601bde9fb	589	ext_level++;
AdamGreen	0:616601bde9fb	590	}
AdamGreen	0:616601bde9fb	591	}
AdamGreen	0:616601bde9fb	592	else
AdamGreen	0:616601bde9fb	593	{
AdamGreen	0:616601bde9fb	594	/* search failed */
AdamGreen	0:616601bde9fb	595	LWIP_DEBUGF(SNMP_MIB_DEBUG,("en search failed ident==%"S32_F"\n",ident));
AdamGreen	0:616601bde9fb	596	return NULL;
AdamGreen	0:616601bde9fb	597	}
AdamGreen	0:616601bde9fb	598	}
AdamGreen	0:616601bde9fb	599	else
AdamGreen	0:616601bde9fb	600	{
AdamGreen	0:616601bde9fb	601	/* search failed, short object identifier (nosuchname) */
AdamGreen	0:616601bde9fb	602	LWIP_DEBUGF(SNMP_MIB_DEBUG,("en search failed, short object identifier\n"));
AdamGreen	0:616601bde9fb	603	return NULL;
AdamGreen	0:616601bde9fb	604	}
AdamGreen	0:616601bde9fb	605	}
AdamGreen	0:616601bde9fb	606	else if (node_type == MIB_NODE_SC)
AdamGreen	0:616601bde9fb	607	{
AdamGreen	0:616601bde9fb	608	mib_scalar_node *sn;
AdamGreen	0:616601bde9fb	609
AdamGreen	0:616601bde9fb	610	sn = (mib_scalar_node *)node;
AdamGreen	0:616601bde9fb	611	if ((ident_len == 1) && (*ident == 0))
AdamGreen	0:616601bde9fb	612	{
AdamGreen	0:616601bde9fb	613	np->ident_len = ident_len;
AdamGreen	0:616601bde9fb	614	np->ident = ident;
AdamGreen	0:616601bde9fb	615	return (struct mib_node*)sn;
AdamGreen	0:616601bde9fb	616	}
AdamGreen	0:616601bde9fb	617	else
AdamGreen	0:616601bde9fb	618	{
AdamGreen	0:616601bde9fb	619	/* search failed, short object identifier (nosuchname) */
AdamGreen	0:616601bde9fb	620	LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed, invalid object identifier length\n"));
AdamGreen	0:616601bde9fb	621	return NULL;
AdamGreen	0:616601bde9fb	622	}
AdamGreen	0:616601bde9fb	623	}
AdamGreen	0:616601bde9fb	624	else
AdamGreen	0:616601bde9fb	625	{
AdamGreen	0:616601bde9fb	626	/* unknown node_type */
AdamGreen	0:616601bde9fb	627	LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed node_type %"U16_F" unkown\n",(u16_t)node_type));
AdamGreen	0:616601bde9fb	628	return NULL;
AdamGreen	0:616601bde9fb	629	}
AdamGreen	0:616601bde9fb	630	}
AdamGreen	0:616601bde9fb	631	/* done, found nothing */
AdamGreen	0:616601bde9fb	632	LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed node==%p\n",(void*)node));
AdamGreen	0:616601bde9fb	633	return NULL;
AdamGreen	0:616601bde9fb	634	}
AdamGreen	0:616601bde9fb	635
AdamGreen	0:616601bde9fb	636	/**
AdamGreen	0:616601bde9fb	637	* Test table for presence of at least one table entry.
AdamGreen	0:616601bde9fb	638	*/
AdamGreen	0:616601bde9fb	639	static u8_t
AdamGreen	0:616601bde9fb	640	empty_table(struct mib_node *node)
AdamGreen	0:616601bde9fb	641	{
AdamGreen	0:616601bde9fb	642	u8_t node_type;
AdamGreen	0:616601bde9fb	643	u8_t empty = 0;
AdamGreen	0:616601bde9fb	644
AdamGreen	0:616601bde9fb	645	if (node != NULL)
AdamGreen	0:616601bde9fb	646	{
AdamGreen	0:616601bde9fb	647	node_type = node->node_type;
AdamGreen	0:616601bde9fb	648	if (node_type == MIB_NODE_LR)
AdamGreen	0:616601bde9fb	649	{
AdamGreen	0:616601bde9fb	650	struct mib_list_rootnode *lrn;
AdamGreen	0:616601bde9fb	651	lrn = (struct mib_list_rootnode *)node;
AdamGreen	0:616601bde9fb	652	if ((lrn->count == 0) \|\| (lrn->head == NULL))
AdamGreen	0:616601bde9fb	653	{
AdamGreen	0:616601bde9fb	654	empty = 1;
AdamGreen	0:616601bde9fb	655	}
AdamGreen	0:616601bde9fb	656	}
AdamGreen	0:616601bde9fb	657	else if ((node_type == MIB_NODE_AR) \|\| (node_type == MIB_NODE_RA))
AdamGreen	0:616601bde9fb	658	{
AdamGreen	0:616601bde9fb	659	struct mib_array_node *an;
AdamGreen	0:616601bde9fb	660	an = (struct mib_array_node *)node;
AdamGreen	0:616601bde9fb	661	if ((an->maxlength == 0) \|\| (an->nptr == NULL))
AdamGreen	0:616601bde9fb	662	{
AdamGreen	0:616601bde9fb	663	empty = 1;
AdamGreen	0:616601bde9fb	664	}
AdamGreen	0:616601bde9fb	665	}
AdamGreen	0:616601bde9fb	666	else if (node_type == MIB_NODE_EX)
AdamGreen	0:616601bde9fb	667	{
AdamGreen	0:616601bde9fb	668	struct mib_external_node *en;
AdamGreen	0:616601bde9fb	669	en = (struct mib_external_node *)node;
AdamGreen	0:616601bde9fb	670	if (en->tree_levels == 0)
AdamGreen	0:616601bde9fb	671	{
AdamGreen	0:616601bde9fb	672	empty = 1;
AdamGreen	0:616601bde9fb	673	}
AdamGreen	0:616601bde9fb	674	}
AdamGreen	0:616601bde9fb	675	}
AdamGreen	0:616601bde9fb	676	return empty;
AdamGreen	0:616601bde9fb	677	}
AdamGreen	0:616601bde9fb	678
AdamGreen	0:616601bde9fb	679	/**
AdamGreen	0:616601bde9fb	680	* Tree expansion.
AdamGreen	0:616601bde9fb	681	*/
AdamGreen	0:616601bde9fb	682	struct mib_node *
AdamGreen	0:616601bde9fb	683	snmp_expand_tree(struct mib_node node, u8_t ident_len, s32_t ident, struct snmp_obj_id *oidret)
AdamGreen	0:616601bde9fb	684	{
AdamGreen	0:616601bde9fb	685	u8_t node_type, ext_level, climb_tree;
AdamGreen	0:616601bde9fb	686
AdamGreen	0:616601bde9fb	687	ext_level = 0;
AdamGreen	0:616601bde9fb	688	/* reset node stack */
AdamGreen	0:616601bde9fb	689	node_stack_cnt = 0;
AdamGreen	0:616601bde9fb	690	while (node != NULL)
AdamGreen	0:616601bde9fb	691	{
AdamGreen	0:616601bde9fb	692	climb_tree = 0;
AdamGreen	0:616601bde9fb	693	node_type = node->node_type;
AdamGreen	0:616601bde9fb	694	if ((node_type == MIB_NODE_AR) \|\| (node_type == MIB_NODE_RA))
AdamGreen	0:616601bde9fb	695	{
AdamGreen	0:616601bde9fb	696	struct mib_array_node *an;
AdamGreen	0:616601bde9fb	697	u16_t i;
AdamGreen	0:616601bde9fb	698
AdamGreen	0:616601bde9fb	699	/* array node (internal ROM or RAM, fixed length) */
AdamGreen	0:616601bde9fb	700	an = (struct mib_array_node *)node;
AdamGreen	0:616601bde9fb	701	if (ident_len > 0)
AdamGreen	0:616601bde9fb	702	{
AdamGreen	0:616601bde9fb	703	i = 0;
AdamGreen	0:616601bde9fb	704	while ((i < an->maxlength) && (an->objid[i] < *ident))
AdamGreen	0:616601bde9fb	705	{
AdamGreen	0:616601bde9fb	706	i++;
AdamGreen	0:616601bde9fb	707	}
AdamGreen	0:616601bde9fb	708	if (i < an->maxlength)
AdamGreen	0:616601bde9fb	709	{
AdamGreen	0:616601bde9fb	710	LWIP_DEBUGF(SNMP_MIB_DEBUG,("an->objid[%"U16_F"]==%"S32_F" ident==%"S32_F"\n",i,an->objid[i],ident));
AdamGreen	0:616601bde9fb	711	/* add identifier to oidret */
AdamGreen	0:616601bde9fb	712	oidret->id[oidret->len] = an->objid[i];
AdamGreen	0:616601bde9fb	713	(oidret->len)++;
AdamGreen	0:616601bde9fb	714
AdamGreen	0:616601bde9fb	715	if (an->nptr[i] == NULL)
AdamGreen	0:616601bde9fb	716	{
AdamGreen	0:616601bde9fb	717	LWIP_DEBUGF(SNMP_MIB_DEBUG,("leaf node\n"));
AdamGreen	0:616601bde9fb	718	/* leaf node (e.g. in a fixed size table) */
AdamGreen	0:616601bde9fb	719	if (an->objid[i] > *ident)
AdamGreen	0:616601bde9fb	720	{
AdamGreen	0:616601bde9fb	721	return (struct mib_node*)an;
AdamGreen	0:616601bde9fb	722	}
AdamGreen	0:616601bde9fb	723	else if ((i + 1) < an->maxlength)
AdamGreen	0:616601bde9fb	724	{
AdamGreen	0:616601bde9fb	725	/* an->objid[i] == ident /
AdamGreen	0:616601bde9fb	726	(oidret->len)--;
AdamGreen	0:616601bde9fb	727	oidret->id[oidret->len] = an->objid[i + 1];
AdamGreen	0:616601bde9fb	728	(oidret->len)++;
AdamGreen	0:616601bde9fb	729	return (struct mib_node*)an;
AdamGreen	0:616601bde9fb	730	}
AdamGreen	0:616601bde9fb	731	else
AdamGreen	0:616601bde9fb	732	{
AdamGreen	0:616601bde9fb	733	/* (i + 1) == an->maxlength */
AdamGreen	0:616601bde9fb	734	(oidret->len)--;
AdamGreen	0:616601bde9fb	735	climb_tree = 1;
AdamGreen	0:616601bde9fb	736	}
AdamGreen	0:616601bde9fb	737	}
AdamGreen	0:616601bde9fb	738	else
AdamGreen	0:616601bde9fb	739	{
AdamGreen	0:616601bde9fb	740	u8_t j;
AdamGreen	0:616601bde9fb	741	struct nse cur_node;
AdamGreen	0:616601bde9fb	742
AdamGreen	0:616601bde9fb	743	LWIP_DEBUGF(SNMP_MIB_DEBUG,("non-leaf node\n"));
AdamGreen	0:616601bde9fb	744	/* non-leaf, store right child ptr and id */
AdamGreen	0:616601bde9fb	745	LWIP_ASSERT("i < 0xff", i < 0xff);
AdamGreen	0:616601bde9fb	746	j = (u8_t)i + 1;
AdamGreen	0:616601bde9fb	747	while ((j < an->maxlength) && (empty_table(an->nptr[j])))
AdamGreen	0:616601bde9fb	748	{
AdamGreen	0:616601bde9fb	749	j++;
AdamGreen	0:616601bde9fb	750	}
AdamGreen	0:616601bde9fb	751	if (j < an->maxlength)
AdamGreen	0:616601bde9fb	752	{
AdamGreen	0:616601bde9fb	753	cur_node.r_ptr = an->nptr[j];
AdamGreen	0:616601bde9fb	754	cur_node.r_id = an->objid[j];
AdamGreen	0:616601bde9fb	755	cur_node.r_nl = 0;
AdamGreen	0:616601bde9fb	756	}
AdamGreen	0:616601bde9fb	757	else
AdamGreen	0:616601bde9fb	758	{
AdamGreen	0:616601bde9fb	759	cur_node.r_ptr = NULL;
AdamGreen	0:616601bde9fb	760	}
AdamGreen	0:616601bde9fb	761	push_node(&cur_node);
AdamGreen	0:616601bde9fb	762	if (an->objid[i] == *ident)
AdamGreen	0:616601bde9fb	763	{
AdamGreen	0:616601bde9fb	764	ident_len--;
AdamGreen	0:616601bde9fb	765	ident++;
AdamGreen	0:616601bde9fb	766	}
AdamGreen	0:616601bde9fb	767	else
AdamGreen	0:616601bde9fb	768	{
AdamGreen	0:616601bde9fb	769	/* an->objid[i] < ident /
AdamGreen	0:616601bde9fb	770	ident_len = 0;
AdamGreen	0:616601bde9fb	771	}
AdamGreen	0:616601bde9fb	772	/* follow next child pointer */
AdamGreen	0:616601bde9fb	773	node = an->nptr[i];
AdamGreen	0:616601bde9fb	774	}
AdamGreen	0:616601bde9fb	775	}
AdamGreen	0:616601bde9fb	776	else
AdamGreen	0:616601bde9fb	777	{
AdamGreen	0:616601bde9fb	778	/* i == an->maxlength */
AdamGreen	0:616601bde9fb	779	climb_tree = 1;
AdamGreen	0:616601bde9fb	780	}
AdamGreen	0:616601bde9fb	781	}
AdamGreen	0:616601bde9fb	782	else
AdamGreen	0:616601bde9fb	783	{
AdamGreen	0:616601bde9fb	784	u8_t j;
AdamGreen	0:616601bde9fb	785	/* ident_len == 0, complete with leftmost '.thing' */
AdamGreen	0:616601bde9fb	786	j = 0;
AdamGreen	0:616601bde9fb	787	while ((j < an->maxlength) && empty_table(an->nptr[j]))
AdamGreen	0:616601bde9fb	788	{
AdamGreen	0:616601bde9fb	789	j++;
AdamGreen	0:616601bde9fb	790	}
AdamGreen	0:616601bde9fb	791	if (j < an->maxlength)
AdamGreen	0:616601bde9fb	792	{
AdamGreen	0:616601bde9fb	793	LWIP_DEBUGF(SNMP_MIB_DEBUG,("left an->objid[j]==%"S32_F"\n",an->objid[j]));
AdamGreen	0:616601bde9fb	794	oidret->id[oidret->len] = an->objid[j];
AdamGreen	0:616601bde9fb	795	(oidret->len)++;
AdamGreen	0:616601bde9fb	796	if (an->nptr[j] == NULL)
AdamGreen	0:616601bde9fb	797	{
AdamGreen	0:616601bde9fb	798	/* leaf node */
AdamGreen	0:616601bde9fb	799	return (struct mib_node*)an;
AdamGreen	0:616601bde9fb	800	}
AdamGreen	0:616601bde9fb	801	else
AdamGreen	0:616601bde9fb	802	{
AdamGreen	0:616601bde9fb	803	/* no leaf, continue */
AdamGreen	0:616601bde9fb	804	node = an->nptr[j];
AdamGreen	0:616601bde9fb	805	}
AdamGreen	0:616601bde9fb	806	}
AdamGreen	0:616601bde9fb	807	else
AdamGreen	0:616601bde9fb	808	{
AdamGreen	0:616601bde9fb	809	/* j == an->maxlength */
AdamGreen	0:616601bde9fb	810	climb_tree = 1;
AdamGreen	0:616601bde9fb	811	}
AdamGreen	0:616601bde9fb	812	}
AdamGreen	0:616601bde9fb	813	}
AdamGreen	0:616601bde9fb	814	else if(node_type == MIB_NODE_LR)
AdamGreen	0:616601bde9fb	815	{
AdamGreen	0:616601bde9fb	816	struct mib_list_rootnode *lrn;
AdamGreen	0:616601bde9fb	817	struct mib_list_node *ln;
AdamGreen	0:616601bde9fb	818
AdamGreen	0:616601bde9fb	819	/* list root node (internal 'RAM', variable length) */
AdamGreen	0:616601bde9fb	820	lrn = (struct mib_list_rootnode *)node;
AdamGreen	0:616601bde9fb	821	if (ident_len > 0)
AdamGreen	0:616601bde9fb	822	{
AdamGreen	0:616601bde9fb	823	ln = lrn->head;
AdamGreen	0:616601bde9fb	824	/* iterate over list, head to tail */
AdamGreen	0:616601bde9fb	825	while ((ln != NULL) && (ln->objid < *ident))
AdamGreen	0:616601bde9fb	826	{
AdamGreen	0:616601bde9fb	827	ln = ln->next;
AdamGreen	0:616601bde9fb	828	}
AdamGreen	0:616601bde9fb	829	if (ln != NULL)
AdamGreen	0:616601bde9fb	830	{
AdamGreen	0:616601bde9fb	831	LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln->objid==%"S32_F" ident==%"S32_F"\n",ln->objid,ident));
AdamGreen	0:616601bde9fb	832	oidret->id[oidret->len] = ln->objid;
AdamGreen	0:616601bde9fb	833	(oidret->len)++;
AdamGreen	0:616601bde9fb	834	if (ln->nptr == NULL)
AdamGreen	0:616601bde9fb	835	{
AdamGreen	0:616601bde9fb	836	/* leaf node */
AdamGreen	0:616601bde9fb	837	if (ln->objid > *ident)
AdamGreen	0:616601bde9fb	838	{
AdamGreen	0:616601bde9fb	839	return (struct mib_node*)lrn;
AdamGreen	0:616601bde9fb	840	}
AdamGreen	0:616601bde9fb	841	else if (ln->next != NULL)
AdamGreen	0:616601bde9fb	842	{
AdamGreen	0:616601bde9fb	843	/* ln->objid == ident /
AdamGreen	0:616601bde9fb	844	(oidret->len)--;
AdamGreen	0:616601bde9fb	845	oidret->id[oidret->len] = ln->next->objid;
AdamGreen	0:616601bde9fb	846	(oidret->len)++;
AdamGreen	0:616601bde9fb	847	return (struct mib_node*)lrn;
AdamGreen	0:616601bde9fb	848	}
AdamGreen	0:616601bde9fb	849	else
AdamGreen	0:616601bde9fb	850	{
AdamGreen	0:616601bde9fb	851	/* ln->next == NULL */
AdamGreen	0:616601bde9fb	852	(oidret->len)--;
AdamGreen	0:616601bde9fb	853	climb_tree = 1;
AdamGreen	0:616601bde9fb	854	}
AdamGreen	0:616601bde9fb	855	}
AdamGreen	0:616601bde9fb	856	else
AdamGreen	0:616601bde9fb	857	{
AdamGreen	0:616601bde9fb	858	struct mib_list_node *jn;
AdamGreen	0:616601bde9fb	859	struct nse cur_node;
AdamGreen	0:616601bde9fb	860
AdamGreen	0:616601bde9fb	861	/* non-leaf, store right child ptr and id */
AdamGreen	0:616601bde9fb	862	jn = ln->next;
AdamGreen	0:616601bde9fb	863	while ((jn != NULL) && empty_table(jn->nptr))
AdamGreen	0:616601bde9fb	864	{
AdamGreen	0:616601bde9fb	865	jn = jn->next;
AdamGreen	0:616601bde9fb	866	}
AdamGreen	0:616601bde9fb	867	if (jn != NULL)
AdamGreen	0:616601bde9fb	868	{
AdamGreen	0:616601bde9fb	869	cur_node.r_ptr = jn->nptr;
AdamGreen	0:616601bde9fb	870	cur_node.r_id = jn->objid;
AdamGreen	0:616601bde9fb	871	cur_node.r_nl = 0;
AdamGreen	0:616601bde9fb	872	}
AdamGreen	0:616601bde9fb	873	else
AdamGreen	0:616601bde9fb	874	{
AdamGreen	0:616601bde9fb	875	cur_node.r_ptr = NULL;
AdamGreen	0:616601bde9fb	876	}
AdamGreen	0:616601bde9fb	877	push_node(&cur_node);
AdamGreen	0:616601bde9fb	878	if (ln->objid == *ident)
AdamGreen	0:616601bde9fb	879	{
AdamGreen	0:616601bde9fb	880	ident_len--;
AdamGreen	0:616601bde9fb	881	ident++;
AdamGreen	0:616601bde9fb	882	}
AdamGreen	0:616601bde9fb	883	else
AdamGreen	0:616601bde9fb	884	{
AdamGreen	0:616601bde9fb	885	/* ln->objid < ident /
AdamGreen	0:616601bde9fb	886	ident_len = 0;
AdamGreen	0:616601bde9fb	887	}
AdamGreen	0:616601bde9fb	888	/* follow next child pointer */
AdamGreen	0:616601bde9fb	889	node = ln->nptr;
AdamGreen	0:616601bde9fb	890	}
AdamGreen	0:616601bde9fb	891
AdamGreen	0:616601bde9fb	892	}
AdamGreen	0:616601bde9fb	893	else
AdamGreen	0:616601bde9fb	894	{
AdamGreen	0:616601bde9fb	895	/* ln == NULL */
AdamGreen	0:616601bde9fb	896	climb_tree = 1;
AdamGreen	0:616601bde9fb	897	}
AdamGreen	0:616601bde9fb	898	}
AdamGreen	0:616601bde9fb	899	else
AdamGreen	0:616601bde9fb	900	{
AdamGreen	0:616601bde9fb	901	struct mib_list_node *jn;
AdamGreen	0:616601bde9fb	902	/* ident_len == 0, complete with leftmost '.thing' */
AdamGreen	0:616601bde9fb	903	jn = lrn->head;
AdamGreen	0:616601bde9fb	904	while ((jn != NULL) && empty_table(jn->nptr))
AdamGreen	0:616601bde9fb	905	{
AdamGreen	0:616601bde9fb	906	jn = jn->next;
AdamGreen	0:616601bde9fb	907	}
AdamGreen	0:616601bde9fb	908	if (jn != NULL)
AdamGreen	0:616601bde9fb	909	{
AdamGreen	0:616601bde9fb	910	LWIP_DEBUGF(SNMP_MIB_DEBUG,("left jn->objid==%"S32_F"\n",jn->objid));
AdamGreen	0:616601bde9fb	911	oidret->id[oidret->len] = jn->objid;
AdamGreen	0:616601bde9fb	912	(oidret->len)++;
AdamGreen	0:616601bde9fb	913	if (jn->nptr == NULL)
AdamGreen	0:616601bde9fb	914	{
AdamGreen	0:616601bde9fb	915	/* leaf node */
AdamGreen	0:616601bde9fb	916	LWIP_DEBUGF(SNMP_MIB_DEBUG,("jn->nptr == NULL\n"));
AdamGreen	0:616601bde9fb	917	return (struct mib_node*)lrn;
AdamGreen	0:616601bde9fb	918	}
AdamGreen	0:616601bde9fb	919	else
AdamGreen	0:616601bde9fb	920	{
AdamGreen	0:616601bde9fb	921	/* no leaf, continue */
AdamGreen	0:616601bde9fb	922	node = jn->nptr;
AdamGreen	0:616601bde9fb	923	}
AdamGreen	0:616601bde9fb	924	}
AdamGreen	0:616601bde9fb	925	else
AdamGreen	0:616601bde9fb	926	{
AdamGreen	0:616601bde9fb	927	/* jn == NULL */
AdamGreen	0:616601bde9fb	928	climb_tree = 1;
AdamGreen	0:616601bde9fb	929	}
AdamGreen	0:616601bde9fb	930	}
AdamGreen	0:616601bde9fb	931	}
AdamGreen	0:616601bde9fb	932	else if(node_type == MIB_NODE_EX)
AdamGreen	0:616601bde9fb	933	{
AdamGreen	0:616601bde9fb	934	struct mib_external_node *en;
AdamGreen	0:616601bde9fb	935	s32_t ex_id;
AdamGreen	0:616601bde9fb	936
AdamGreen	0:616601bde9fb	937	/* external node (addressing and access via functions) */
AdamGreen	0:616601bde9fb	938	en = (struct mib_external_node *)node;
AdamGreen	0:616601bde9fb	939	if (ident_len > 0)
AdamGreen	0:616601bde9fb	940	{
AdamGreen	0:616601bde9fb	941	u16_t i, len;
AdamGreen	0:616601bde9fb	942
AdamGreen	0:616601bde9fb	943	i = 0;
AdamGreen	0:616601bde9fb	944	len = en->level_length(en->addr_inf,ext_level);
AdamGreen	0:616601bde9fb	945	while ((i < len) && (en->ident_cmp(en->addr_inf,ext_level,i,*ident) < 0))
AdamGreen	0:616601bde9fb	946	{
AdamGreen	0:616601bde9fb	947	i++;
AdamGreen	0:616601bde9fb	948	}
AdamGreen	0:616601bde9fb	949	if (i < len)
AdamGreen	0:616601bde9fb	950	{
AdamGreen	0:616601bde9fb	951	/* add identifier to oidret */
AdamGreen	0:616601bde9fb	952	en->get_objid(en->addr_inf,ext_level,i,&ex_id);
AdamGreen	0:616601bde9fb	953	LWIP_DEBUGF(SNMP_MIB_DEBUG,("en->objid[%"U16_F"]==%"S32_F" ident==%"S32_F"\n",i,ex_id,ident));
AdamGreen	0:616601bde9fb	954	oidret->id[oidret->len] = ex_id;
AdamGreen	0:616601bde9fb	955	(oidret->len)++;
AdamGreen	0:616601bde9fb	956
AdamGreen	0:616601bde9fb	957	if ((ext_level + 1) == en->tree_levels)
AdamGreen	0:616601bde9fb	958	{
AdamGreen	0:616601bde9fb	959	LWIP_DEBUGF(SNMP_MIB_DEBUG,("leaf node\n"));
AdamGreen	0:616601bde9fb	960	/* leaf node */
AdamGreen	0:616601bde9fb	961	if (ex_id > *ident)
AdamGreen	0:616601bde9fb	962	{
AdamGreen	0:616601bde9fb	963	return (struct mib_node*)en;
AdamGreen	0:616601bde9fb	964	}
AdamGreen	0:616601bde9fb	965	else if ((i + 1) < len)
AdamGreen	0:616601bde9fb	966	{
AdamGreen	0:616601bde9fb	967	/* ex_id == ident /
AdamGreen	0:616601bde9fb	968	en->get_objid(en->addr_inf,ext_level,i + 1,&ex_id);
AdamGreen	0:616601bde9fb	969	(oidret->len)--;
AdamGreen	0:616601bde9fb	970	oidret->id[oidret->len] = ex_id;
AdamGreen	0:616601bde9fb	971	(oidret->len)++;
AdamGreen	0:616601bde9fb	972	return (struct mib_node*)en;
AdamGreen	0:616601bde9fb	973	}
AdamGreen	0:616601bde9fb	974	else
AdamGreen	0:616601bde9fb	975	{
AdamGreen	0:616601bde9fb	976	/* (i + 1) == len */
AdamGreen	0:616601bde9fb	977	(oidret->len)--;
AdamGreen	0:616601bde9fb	978	climb_tree = 1;
AdamGreen	0:616601bde9fb	979	}
AdamGreen	0:616601bde9fb	980	}
AdamGreen	0:616601bde9fb	981	else
AdamGreen	0:616601bde9fb	982	{
AdamGreen	0:616601bde9fb	983	u8_t j;
AdamGreen	0:616601bde9fb	984	struct nse cur_node;
AdamGreen	0:616601bde9fb	985
AdamGreen	0:616601bde9fb	986	LWIP_DEBUGF(SNMP_MIB_DEBUG,("non-leaf node\n"));
AdamGreen	0:616601bde9fb	987	/* non-leaf, store right child ptr and id */
AdamGreen	0:616601bde9fb	988	LWIP_ASSERT("i < 0xff", i < 0xff);
AdamGreen	0:616601bde9fb	989	j = (u8_t)i + 1;
AdamGreen	0:616601bde9fb	990	if (j < len)
AdamGreen	0:616601bde9fb	991	{
AdamGreen	0:616601bde9fb	992	/* right node is the current external node */
AdamGreen	0:616601bde9fb	993	cur_node.r_ptr = node;
AdamGreen	0:616601bde9fb	994	en->get_objid(en->addr_inf,ext_level,j,&cur_node.r_id);
AdamGreen	0:616601bde9fb	995	cur_node.r_nl = ext_level + 1;
AdamGreen	0:616601bde9fb	996	}
AdamGreen	0:616601bde9fb	997	else
AdamGreen	0:616601bde9fb	998	{
AdamGreen	0:616601bde9fb	999	cur_node.r_ptr = NULL;
AdamGreen	0:616601bde9fb	1000	}
AdamGreen	0:616601bde9fb	1001	push_node(&cur_node);
AdamGreen	0:616601bde9fb	1002	if (en->ident_cmp(en->addr_inf,ext_level,i,*ident) == 0)
AdamGreen	0:616601bde9fb	1003	{
AdamGreen	0:616601bde9fb	1004	ident_len--;
AdamGreen	0:616601bde9fb	1005	ident++;
AdamGreen	0:616601bde9fb	1006	}
AdamGreen	0:616601bde9fb	1007	else
AdamGreen	0:616601bde9fb	1008	{
AdamGreen	0:616601bde9fb	1009	/* external id < ident /
AdamGreen	0:616601bde9fb	1010	ident_len = 0;
AdamGreen	0:616601bde9fb	1011	}
AdamGreen	0:616601bde9fb	1012	/* proceed to child */
AdamGreen	0:616601bde9fb	1013	ext_level++;
AdamGreen	0:616601bde9fb	1014	}
AdamGreen	0:616601bde9fb	1015	}
AdamGreen	0:616601bde9fb	1016	else
AdamGreen	0:616601bde9fb	1017	{
AdamGreen	0:616601bde9fb	1018	/* i == len (en->level_len()) */
AdamGreen	0:616601bde9fb	1019	climb_tree = 1;
AdamGreen	0:616601bde9fb	1020	}
AdamGreen	0:616601bde9fb	1021	}
AdamGreen	0:616601bde9fb	1022	else
AdamGreen	0:616601bde9fb	1023	{
AdamGreen	0:616601bde9fb	1024	/* ident_len == 0, complete with leftmost '.thing' */
AdamGreen	0:616601bde9fb	1025	en->get_objid(en->addr_inf,ext_level,0,&ex_id);
AdamGreen	0:616601bde9fb	1026	LWIP_DEBUGF(SNMP_MIB_DEBUG,("left en->objid==%"S32_F"\n",ex_id));
AdamGreen	0:616601bde9fb	1027	oidret->id[oidret->len] = ex_id;
AdamGreen	0:616601bde9fb	1028	(oidret->len)++;
AdamGreen	0:616601bde9fb	1029	if ((ext_level + 1) == en->tree_levels)
AdamGreen	0:616601bde9fb	1030	{
AdamGreen	0:616601bde9fb	1031	/* leaf node */
AdamGreen	0:616601bde9fb	1032	LWIP_DEBUGF(SNMP_MIB_DEBUG,("(ext_level + 1) == en->tree_levels\n"));
AdamGreen	0:616601bde9fb	1033	return (struct mib_node*)en;
AdamGreen	0:616601bde9fb	1034	}
AdamGreen	0:616601bde9fb	1035	else
AdamGreen	0:616601bde9fb	1036	{
AdamGreen	0:616601bde9fb	1037	/* no leaf, proceed to child */
AdamGreen	0:616601bde9fb	1038	ext_level++;
AdamGreen	0:616601bde9fb	1039	}
AdamGreen	0:616601bde9fb	1040	}
AdamGreen	0:616601bde9fb	1041	}
AdamGreen	0:616601bde9fb	1042	else if(node_type == MIB_NODE_SC)
AdamGreen	0:616601bde9fb	1043	{
AdamGreen	0:616601bde9fb	1044	mib_scalar_node *sn;
AdamGreen	0:616601bde9fb	1045
AdamGreen	0:616601bde9fb	1046	/* scalar node */
AdamGreen	0:616601bde9fb	1047	sn = (mib_scalar_node *)node;
AdamGreen	0:616601bde9fb	1048	if (ident_len > 0)
AdamGreen	0:616601bde9fb	1049	{
AdamGreen	0:616601bde9fb	1050	/* at .0 */
AdamGreen	0:616601bde9fb	1051	climb_tree = 1;
AdamGreen	0:616601bde9fb	1052	}
AdamGreen	0:616601bde9fb	1053	else
AdamGreen	0:616601bde9fb	1054	{
AdamGreen	0:616601bde9fb	1055	/* ident_len == 0, complete object identifier */
AdamGreen	0:616601bde9fb	1056	oidret->id[oidret->len] = 0;
AdamGreen	0:616601bde9fb	1057	(oidret->len)++;
AdamGreen	0:616601bde9fb	1058	/* leaf node */
AdamGreen	0:616601bde9fb	1059	LWIP_DEBUGF(SNMP_MIB_DEBUG,("completed scalar leaf\n"));
AdamGreen	0:616601bde9fb	1060	return (struct mib_node*)sn;
AdamGreen	0:616601bde9fb	1061	}
AdamGreen	0:616601bde9fb	1062	}
AdamGreen	0:616601bde9fb	1063	else
AdamGreen	0:616601bde9fb	1064	{
AdamGreen	0:616601bde9fb	1065	/* unknown/unhandled node_type */
AdamGreen	0:616601bde9fb	1066	LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed node_type %"U16_F" unkown\n",(u16_t)node_type));
AdamGreen	0:616601bde9fb	1067	return NULL;
AdamGreen	0:616601bde9fb	1068	}
AdamGreen	0:616601bde9fb	1069
AdamGreen	0:616601bde9fb	1070	if (climb_tree)
AdamGreen	0:616601bde9fb	1071	{
AdamGreen	0:616601bde9fb	1072	struct nse child;
AdamGreen	0:616601bde9fb	1073
AdamGreen	0:616601bde9fb	1074	/* find right child ptr */
AdamGreen	0:616601bde9fb	1075	child.r_ptr = NULL;
AdamGreen	0:616601bde9fb	1076	child.r_id = 0;
AdamGreen	0:616601bde9fb	1077	child.r_nl = 0;
AdamGreen	0:616601bde9fb	1078	while ((node_stack_cnt > 0) && (child.r_ptr == NULL))
AdamGreen	0:616601bde9fb	1079	{
AdamGreen	0:616601bde9fb	1080	pop_node(&child);
AdamGreen	0:616601bde9fb	1081	/* trim returned oid */
AdamGreen	0:616601bde9fb	1082	(oidret->len)--;
AdamGreen	0:616601bde9fb	1083	}
AdamGreen	0:616601bde9fb	1084	if (child.r_ptr != NULL)
AdamGreen	0:616601bde9fb	1085	{
AdamGreen	0:616601bde9fb	1086	/* incoming ident is useless beyond this point */
AdamGreen	0:616601bde9fb	1087	ident_len = 0;
AdamGreen	0:616601bde9fb	1088	oidret->id[oidret->len] = child.r_id;
AdamGreen	0:616601bde9fb	1089	oidret->len++;
AdamGreen	0:616601bde9fb	1090	node = child.r_ptr;
AdamGreen	0:616601bde9fb	1091	ext_level = child.r_nl;
AdamGreen	0:616601bde9fb	1092	}
AdamGreen	0:616601bde9fb	1093	else
AdamGreen	0:616601bde9fb	1094	{
AdamGreen	0:616601bde9fb	1095	/* tree ends here ... */
AdamGreen	0:616601bde9fb	1096	LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed, tree ends here\n"));
AdamGreen	0:616601bde9fb	1097	return NULL;
AdamGreen	0:616601bde9fb	1098	}
AdamGreen	0:616601bde9fb	1099	}
AdamGreen	0:616601bde9fb	1100	}
AdamGreen	0:616601bde9fb	1101	/* done, found nothing */
AdamGreen	0:616601bde9fb	1102	LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed node==%p\n",(void*)node));
AdamGreen	0:616601bde9fb	1103	return NULL;
AdamGreen	0:616601bde9fb	1104	}
AdamGreen	0:616601bde9fb	1105
AdamGreen	0:616601bde9fb	1106	/**
AdamGreen	0:616601bde9fb	1107	* Test object identifier for the iso.org.dod.internet prefix.
AdamGreen	0:616601bde9fb	1108	*
AdamGreen	0:616601bde9fb	1109	* @param ident_len the length of the supplied object identifier
AdamGreen	0:616601bde9fb	1110	* @param ident points to the array of sub identifiers
AdamGreen	0:616601bde9fb	1111	* @return 1 if it matches, 0 otherwise
AdamGreen	0:616601bde9fb	1112	*/
AdamGreen	0:616601bde9fb	1113	u8_t
AdamGreen	0:616601bde9fb	1114	snmp_iso_prefix_tst(u8_t ident_len, s32_t *ident)
AdamGreen	0:616601bde9fb	1115	{
AdamGreen	0:616601bde9fb	1116	if ((ident_len > 3) &&
AdamGreen	0:616601bde9fb	1117	(ident[0] == 1) && (ident[1] == 3) &&
AdamGreen	0:616601bde9fb	1118	(ident[2] == 6) && (ident[3] == 1))
AdamGreen	0:616601bde9fb	1119	{
AdamGreen	0:616601bde9fb	1120	return 1;
AdamGreen	0:616601bde9fb	1121	}
AdamGreen	0:616601bde9fb	1122	else
AdamGreen	0:616601bde9fb	1123	{
AdamGreen	0:616601bde9fb	1124	return 0;
AdamGreen	0:616601bde9fb	1125	}
AdamGreen	0:616601bde9fb	1126	}
AdamGreen	0:616601bde9fb	1127
AdamGreen	0:616601bde9fb	1128	/**
AdamGreen	0:616601bde9fb	1129	* Expands object identifier to the iso.org.dod.internet
AdamGreen	0:616601bde9fb	1130	* prefix for use in getnext operation.
AdamGreen	0:616601bde9fb	1131	*
AdamGreen	0:616601bde9fb	1132	* @param ident_len the length of the supplied object identifier
AdamGreen	0:616601bde9fb	1133	* @param ident points to the array of sub identifiers
AdamGreen	0:616601bde9fb	1134	* @param oidret points to returned expanded object identifier
AdamGreen	0:616601bde9fb	1135	* @return 1 if it matches, 0 otherwise
AdamGreen	0:616601bde9fb	1136	*
AdamGreen	0:616601bde9fb	1137	* @note ident_len 0 is allowed, expanding to the first known object id!!
AdamGreen	0:616601bde9fb	1138	*/
AdamGreen	0:616601bde9fb	1139	u8_t
AdamGreen	0:616601bde9fb	1140	snmp_iso_prefix_expand(u8_t ident_len, s32_t ident, struct snmp_obj_id oidret)
AdamGreen	0:616601bde9fb	1141	{
AdamGreen	0:616601bde9fb	1142	const s32_t *prefix_ptr;
AdamGreen	0:616601bde9fb	1143	s32_t *ret_ptr;
AdamGreen	0:616601bde9fb	1144	u8_t i;
AdamGreen	0:616601bde9fb	1145
AdamGreen	0:616601bde9fb	1146	i = 0;
AdamGreen	0:616601bde9fb	1147	prefix_ptr = &prefix[0];
AdamGreen	0:616601bde9fb	1148	ret_ptr = &oidret->id[0];
AdamGreen	0:616601bde9fb	1149	ident_len = ((ident_len < 4)?ident_len:4);
AdamGreen	0:616601bde9fb	1150	while ((i < ident_len) && ((ident) <= (prefix_ptr)))
AdamGreen	0:616601bde9fb	1151	{
AdamGreen	0:616601bde9fb	1152	ret_ptr++ = prefix_ptr++;
AdamGreen	0:616601bde9fb	1153	ident++;
AdamGreen	0:616601bde9fb	1154	i++;
AdamGreen	0:616601bde9fb	1155	}
AdamGreen	0:616601bde9fb	1156	if (i == ident_len)
AdamGreen	0:616601bde9fb	1157	{
AdamGreen	0:616601bde9fb	1158	/* match, complete missing bits */
AdamGreen	0:616601bde9fb	1159	while (i < 4)
AdamGreen	0:616601bde9fb	1160	{
AdamGreen	0:616601bde9fb	1161	ret_ptr++ = prefix_ptr++;
AdamGreen	0:616601bde9fb	1162	i++;
AdamGreen	0:616601bde9fb	1163	}
AdamGreen	0:616601bde9fb	1164	oidret->len = i;
AdamGreen	0:616601bde9fb	1165	return 1;
AdamGreen	0:616601bde9fb	1166	}
AdamGreen	0:616601bde9fb	1167	else
AdamGreen	0:616601bde9fb	1168	{
AdamGreen	0:616601bde9fb	1169	/* i != ident_len */
AdamGreen	0:616601bde9fb	1170	return 0;
AdamGreen	0:616601bde9fb	1171	}
AdamGreen	0:616601bde9fb	1172	}
AdamGreen	0:616601bde9fb	1173
AdamGreen	0:616601bde9fb	1174	#endif /* LWIP_SNMP */

Repository toolbox

Export to desktop IDE

Build repository

Repository details

Type:	Program
Mbed OS support:	Mbed 2 deprecated
Created:	23 Feb 2012
Imports:	113
Forks:	0
Commits:	2
Dependents:	0
Dependencies:	4
Followers:	6

NetStack/lwip/core/snmp/mib_structs.c@0:616601bde9fb, 2012-02-23 (annotated)

Who changed what in which revision?

Repository toolbox

Repository details

Important Information for this Arm website

Access Warning