MIPS multi-got link support

[Alexandre Oliva]

On Jan 27, 2003, "H. J. Lu" <hjl@lucon.org> wrote:

> I admit it is unlikely we will have more than 2^32 bfds. However,
> for each bfd opened for input, we may have created more than one bfd.

And that one will be accounted for too, taking up memory just the
same.  Sections don't have any testing for wrapping around either,
FWIW.  Besides, unlike the section case, in which certain section
numbers are reserved for special uses, we don't really need the bfd
ids to be unique, at least for purposes of hashing.

-- 
Alexandre Oliva   Enjoy Guarana', see http://www.ic.unicamp.br/~oliva/
Red Hat GCC Developer                 aoliva@{redhat.com, gcc.gnu.org}
CS PhD student at IC-Unicamp        oliva@{lsd.ic.unicamp.br, gnu.org}
Free Software Evangelist                Professional serial bug killer