[PATCH] remove nested functions from elf/dl-deps.c

[Konstantin Serebryany <konstantin dot s dot serebryany at gmail dot com>]

Hi,

Please review the patch that removes nested functions from elf/dl-deps.c
The patch does not noticeably affect the generated code (the new code is 2
instructions shorter, a few differences in used registers, offsets, etc).
The function is inlined in both cases.

No regressions in 'make check' on x86_64-linux-gnu (Ubuntu 14.04)

2014-09-30  Kostya Serebryany  <konstantin.s.serebryany@gmail.com>

        * elf/dl-deps.c
        (preload): New functions broken out of _dl_map_object_deps.
        (_dl_map_object_deps):  Remove a nested function. Update call sites.

--kcc

diff --git a/elf/dl-deps.c b/elf/dl-deps.c
index c3b0cfc..c4824d1 100644
--- a/elf/dl-deps.c
+++ b/elf/dl-deps.c
@@ -138,6 +138,19 @@ cannot load auxiliary `%s' because of empty dynamic string token "	      \
 									      \
     __result; })
 
+static inline
+void preload (struct link_map *map, struct list *known, unsigned int *nlist)
+{
+  known[*nlist].done = 0;
+  known[*nlist].map = map;
+  known[*nlist].next = &known[*nlist + 1];
+
+  ++(*nlist);
+  /* We use `l_reserved' as a mark bit to detect objects we have
+     already put in the search list and avoid adding duplicate
+     elements later in the list.  */
+  map->l_reserved = 1;
+}
 
 void
 internal_function
@@ -155,28 +168,15 @@ _dl_map_object_deps (struct link_map *map,
   const char *errstring;
   const char *objname;
 
-  void preload (struct link_map *map)
-    {
-      known[nlist].done = 0;
-      known[nlist].map = map;
-      known[nlist].next = &known[nlist + 1];
-
-      ++nlist;
-      /* We use `l_reserved' as a mark bit to detect objects we have
-	 already put in the search list and avoid adding duplicate
-	 elements later in the list.  */
-      map->l_reserved = 1;
-    }
-
   /* No loaded object so far.  */
   nlist = 0;
 
   /* First load MAP itself.  */
-  preload (map);
+  preload (map, known, &nlist);
 
   /* Add the preloaded items after MAP but before any of its dependencies.  */
   for (i = 0; i < npreloads; ++i)
-    preload (preloads[i]);
+    preload (preloads[i], known, &nlist);
 
   /* Terminate the lists.  */
   known[nlist - 1].next = NULL;