ZG2100NetIfSource - ZG2100 Network interface source

Users » donatien » Code » ZG2100NetIfSource

ZG2100 Network interface source

lwip/core/snmp/mib_structs.c@0:b802fc31f1db, 2010-07-09 (annotated)

Committer:: donatien
Date:: Fri Jul 09 15:37:23 2010 +0000
Revision:: 0:b802fc31f1db
Child:: 1:3a7c15057192

Who changed what in which revision?

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

Repository toolbox

Export to desktop IDE

Build repository

Repository details

Type:	Program
Created:	09 Jul 2010
Imports:	20
Forks:	0
Commits:	5
Dependents:	0
Dependencies:	0
Followers:	3

This repository is Public (Unlisted).

lwip/core/snmp/mib_structs.c@0:b802fc31f1db, 2010-07-09 (annotated)

Who changed what in which revision?

Repository toolbox

Repository details

Important Information for this Arm website

Access Warning