1 /* Load the dependencies of a mapped object.
2 Copyright (C) 1996 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Library General Public License as
7 published by the Free Software Foundation; either version 2 of the
8 License, or (at your option) any later version.
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Library General Public License for more details.
15 You should have received a copy of the GNU Library General Public
16 License along with the GNU C Library; see the file COPYING.LIB. If
17 not, write to the Free Software Foundation, Inc., 675 Mass Ave,
18 Cambridge, MA 02139, USA. */
26 _dl_map_object_deps (struct link_map
*map
,
27 struct link_map
**preloads
, unsigned int npreloads
)
34 struct list head
[1 + npreloads
], *tailp
, *scanp
;
37 /* Start the search list with one element: MAP itself. */
40 /* Add the preloaded items after MAP but before any of its dependencies. */
41 for (nlist
= 0; nlist
< npreloads
; ++nlist
)
43 head
[nlist
].next
= &head
[nlist
+ 1];
44 head
[nlist
+ 1].map
= preloads
[nlist
];
47 /* Terminate the list. */
48 head
[nlist
].next
= NULL
;
50 /* Start here for adding dependencies to the list. */
51 tailp
= &head
[nlist
++];
53 /* We use `l_reserved' as a mark bit to detect objects we have already
54 put in the search list and avoid adding duplicate elements later in
58 /* Process each element of the search list, loading each of its immediate
59 dependencies and appending them to the list as we step through it.
60 This produces a flat, ordered list that represents a breadth-first
61 search of the dependency tree. */
62 for (scanp
= head
; scanp
; scanp
= scanp
->next
)
64 struct link_map
*l
= scanp
->map
;
66 if (l
->l_info
[DT_NEEDED
])
69 = ((void *) l
->l_addr
+ l
->l_info
[DT_STRTAB
]->d_un
.d_ptr
);
71 for (d
= l
->l_ld
; d
->d_tag
!= DT_NULL
; ++d
)
72 if (d
->d_tag
== DT_NEEDED
)
74 /* Map in the needed object. */
76 = _dl_map_object (l
, strtab
+ d
->d_un
.d_val
,
77 l
->l_type
== lt_executable
? lt_library
:
81 /* This object is already in the search list we are
82 building. Don't add a duplicate pointer. Release the
83 reference just added by _dl_map_object. */
87 /* Append DEP to the search list. */
88 tailp
->next
= alloca (sizeof *tailp
);
93 /* Set the mark bit that says it's already in the list. */
100 /* Store the search list we built in the object. It will be used for
101 searches in the scope of this object. */
102 map
->l_searchlist
= malloc (nlist
* sizeof (struct link_map
*));
103 map
->l_nsearchlist
= nlist
;
106 for (scanp
= head
; scanp
; scanp
= scanp
->next
)
108 map
->l_searchlist
[nlist
++] = scanp
->map
;
110 /* Now clear all the mark bits we set in the objects on the search list
111 to avoid duplicates, so the next call starts fresh. */
112 scanp
->map
->l_reserved
= 0;