Re: lt_dlhandle list iterator

[Alexandre Oliva]

On Jan  5, 2001, "Gary V. Vaughan" <address@hidden> wrote:

> Currently, with lt_dlforeach, there is no way to implement search
> algorithms across the opaque list of loaded modules.  This patch
> defines a new function, lt_dlhandle_next(), modelled on lt_dlinfo_next.

In this case, shouldn't there be a function to obtain the first
dlhandle too?

IIRC, the point of not having iterators like that was that we might
eventually go for a different implementation of dlhandle sets that
wouldn't be easily mapped onto an iterator type.  But I really don't
see a reason to use anything different from a linked list, which is
quite suitable for sequential iteration, so this is ok with me.

-- 
Alexandre Oliva   Enjoy Guarana', see http://www.ic.unicamp.br/~oliva/
Red Hat GCC Developer                  address@hidden, redhat.com}
CS PhD student at IC-Unicamp        address@hidden, gnu.org}
Free Software Evangelist    *Please* write to mailing lists, not to me