On 29 March 2011 06:21, Manjit wrote:
> Are we using any Hash Table or tree implementation in this ? or only list.
The original implementation used a simple linked list,
and that's still the underlying mechanism, as far as I can tell.
Since then, there's another lookup layer on top of this list,
Thanks David,
Are we using any Hash Table or tree implementation in this ? or only list.
Regards,
Manjit
Dave Shield wrote:
On 28 March 2011 08:29, Manjit wrote:
> How the handlers are registered for a particular oid.
This basically uses 'netsnmp_register_handler()'
(either dir
On 28 March 2011 08:29, Manjit wrote:
> > How the handlers are registered for a particular oid.
This basically uses 'netsnmp_register_handler()'
(either directly, or via another helper registration call,
which typically sets up the helper and handler chain information
and then calls 'netsnmp_
Hi All,
I am having some query about the netsnmp oid registration concept:
> Need to know in brief about the registration of a mib objects in the
mib-tree.
> How the tree is searched whenever a request arrives for a particular oid.
> How the handlers are registered for a particular oid.
What d
