On Wed, 2005-06-15 at 19:12, Steve S. Law wrote:
> > How do the iterator 'get_{first,next}' hook routines
> > obtain the list of entries to work with?
> > Do you have an internal list, or something similar?
> > How is this generated?
> Iterator routines are generated by mib2c tool. There
> is a global pointer to the list -
> struct applTable_entry *applTable_head , which is a
> linked list, also generated by mib2c
Yes - mib2c generated the framework of the module
implementation, including the code to look through
a linked list.
But how is this list populated?
Are you monitoring some underlying system, or is this
module purely internal to the SNMP agent?
What does an individual row of the table represent?
> For my situation, I just need to write/implement a new
> function applTable_removeEntry which will look for the
> entry and delete it from the linked list. Correct?
Not necessarily, no.
The MIB data doesn't exist in isolation - it's the SNMP
representation of some external subsystem. When one of
these external "things" disappears, then the corresponding
row in the table should be removed. Conversely, when
a row is deleted from the table, it should have a knock-on
effect on the relevant external "thing".
That's why I'm asking about this link. How you build
the linked list will affect how to handle deletions.
Dave
-------------------------------------------------------
SF.Net email is sponsored by: Discover Easy Linux Migration Strategies
from IBM. Find simple to follow Roadmaps, straightforward articles,
informative Webcasts and more! Get everything you need to get up to
speed, fast. http://ads.osdn.com/?ad_id=7477&alloc_id=16492&op=click
_______________________________________________
Net-snmp-users mailing list
Net-snmp-users@lists.sourceforge.net
Please see the following page to unsubscribe or change other options:
https://lists.sourceforge.net/lists/listinfo/net-snmp-users
