Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Turned the note into a TODO, adding a thought how to implement it.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@24546 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Ingo Weinhold 2008-03-24 02:31:20 +00:00
parent 77570fb545
commit 92af28df98
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/system/runtime_loader/elf.cpp
View File

@ -1022,8 +1022,10 @@ find_undefined_symbol(image_t* rootImage, image_t* image, const char* name,
image_t** foundInImage)
{
// If not simulating BeOS style symbol resolution, undefined symbols are
// search recursively starting from the root image. (Note, breadth first
// might be better than the depth first use here.)
// searched recursively starting from the root image.
// TODO: Breadth first might be better than the depth first strategy used
// here. We're also visiting images multiple times. Consider building a
// breadth-first sorted array of images for each root image.
if ((rootImage->flags & IMAGE_FLAG_R5_SYMBOL_RESOLUTION) == 0) {
Elf32_Sym* symbol = find_symbol_recursively(rootImage, name,
foundInImage);