return;
{  if (__builtin_expect (_dl_debug_files, 0)) { char buf[20];  buf[sizeof buf - 1] = '\0';  _dl_debug_message (1, "\nopening file=", new->l_name, "; opencount == ", _itoa_word (new->l_opencount, buf + sizeof buf - 1, 10, 0), "\n", NULL); }  return; }
weak_extern (BP_SYM (_dl_sysdep_start))/* This function is used to unload the cache file if necessary.  */extern void _dl_unload_cache (void);extern int __libc_multiple_libcs;	/* Defined in init-first.c.  */extern int __libc_argc;extern char **__libc_argv;extern char **__environ;extern int _dl_lazy;			/* Do we do lazy relocations?  *//* Undefine the following for debugging.  *//* #define SCOPE_DEBUG 1 */#ifdef SCOPE_DEBUGstatic void show_scope (struct link_map *new);#endif/* During the program run we must not modify the global data of   loaded shared object simultanously in two threads.  Therefore we   protect `_dl_open' and `_dl_close' in dl-close.c.   This must be a recursive lock since the initializer function of   the loaded object might as well require a call to this function.   At this time it is not anymore a problem to modify the tables.  */__libc_lock_define (extern, _dl_load_lock)extern size_t _dl_platformlen;/* We must be carefull not to leave us in an inconsistent state.  Thus we   catch any error and re-raise it after cleaning up.  */struct dl_open_args{  const char *file;  int mode;  const void *caller;  struct link_map *map;};static voiddl_open_worker (void *a){  struct dl_open_args *args = a;  const char *file = args->file;  int mode = args->mode;  struct link_map *new, *l;  const char *dst;  int lazy;  unsigned int i;  /* Maybe we have to expand a DST.  */  dst = strchr (file, '$');  if (dst != NULL)    {      const void *caller = args->caller;      size_t len = strlen (file);      size_t required;      struct link_map *call_map;      char *new_file;      /* DSTs must not appear in SUID/SGID programs.  */      if (__libc_enable_secure)	/* This is an error.  */	_dl_signal_error (0, "dlopen",			  N_("DST not allowed in SUID/SGID programs"));      /* We have to find out from which object the caller is calling.	 Find the highest-addressed object that ADDRESS is not below.  */      call_map = NULL;      for (l = _dl_loaded; l; l = l->l_next)	if (l->l_addr != 0 /* Make sure we do not currently set this map up			      in this moment.  */	    && caller >= (const void *) l->l_map_start	    && caller < (const void *) l->l_map_end)	  {	    /* There must be exactly one DSO for the range of the virtual	       memory.  Otherwise something is really broken.  */	    call_map = l;	    break;	  }      if (call_map == NULL)	/* In this case we assume this is the main application.  */	call_map = _dl_loaded;      /* Determine how much space we need.  We have to allocate the	 memory locally.  */      required = DL_DST_REQUIRED (call_map, file, len, _dl_dst_count (dst, 0));      /* Get space for the new file name.  */      new_file = (char *) alloca (required + 1);      /* Generate the new file name.  */      DL_DST_SUBSTITUTE (call_map, file, new_file, 0);      /* If the substitution failed don't try to load.  */      if (*new_file == '\0')	_dl_signal_error (0, "dlopen",			  N_("empty dynamic string token substitution"));      /* Now we have a new file name.  */      file = new_file;    }  /* Load the named object.  */  args->map = new = _dl_map_object (NULL, file, 0, lt_loaded, 0,				    mode);  /* If the pointer returned is NULL this means the RTLD_NOLOAD flag is     set and the object is not already loaded.  */  if (new == NULL)    {      assert (mode & RTLD_NOLOAD);      return;    }  if (new->l_searchlist.r_list)    /* It was already open.  */    return;  /* Load that object's dependencies.  */  _dl_map_object_deps (new, NULL, 0, 0);  /* So far, so good.  Now check the versions.  */  for (i = 0; i < new->l_searchlist.r_nlist; ++i)    if (new->l_searchlist.r_list[i]->l_versions == NULL)      (void) _dl_check_map_versions (new->l_searchlist.r_list[i], 0, 0);#ifdef SCOPE_DEBUG  show_scope (new);#endif  /* Only do lazy relocation if `LD_BIND_NOW' is not set.  */  lazy = (mode & RTLD_BINDING_MASK) == RTLD_LAZY && _dl_lazy;  /* Relocate the objects loaded.  We do this in reverse order so that copy     relocs of earlier objects overwrite the data written by later objects.  */  l = new;  while (l->l_next)    l = l->l_next;  while (1)    {      if (! l->l_relocated)	{#ifdef SHARED	  if (_dl_profile != NULL)	    {	      /* If this here is the shared object which we want to profile		 make sure the profile is started.  We can find out whether	         this is necessary or not by observing the `_dl_profile_map'	         variable.  If was NULL but is not NULL afterwars we must		 start the profiling.  */	      struct link_map *old_profile_map = _dl_profile_map;	      _dl_relocate_object (l, l->l_scope, 1, 1);	      if (old_profile_map == NULL && _dl_profile_map != NULL)		/* We must prepare the profiling.  */		_dl_start_profile (_dl_profile_map, _dl_profile_output);	    }	  else#endif	    _dl_relocate_object (l, l->l_scope, lazy, 0);	}      if (l == new)	break;      l = l->l_prev;    }  /* Run the initializer functions of new objects.  */  _dl_init (new, __libc_argc, __libc_argv, __environ);  /* Now we can make the new map available in the global scope.  */  if (mode & RTLD_GLOBAL)    {      struct link_map **new_global;      unsigned int to_add = 0;      unsigned int cnt;      /* Count the objects we have to put in the global scope.  */      for (cnt = 0; cnt < new->l_searchlist.r_nlist; ++cnt)	if (new->l_searchlist.r_list[cnt]->l_global == 0)	  ++to_add;      /* The symbols of the new objects and its dependencies are to be	 introduced into the global scope that will be used to resolve	 references from other dynamically-loaded objects.	 The global scope is the searchlist in the main link map.  We	 extend this list if necessary.  There is one problem though:	 since this structure was allocated very early (before the libc	 is loaded) the memory it uses is allocated by the malloc()-stub	 in the ld.so.  When we come here these functions are not used	 anymore.  Instead the malloc() implementation of the libc is	 used.  But this means the block from the main map cannot be used	 in an realloc() call.  Therefore we allocate a completely new	 array the first time we have to add something to the locale scope.  */      if (_dl_global_scope_alloc == 0)	{	  /* This is the first dynamic object given global scope.  */	  _dl_global_scope_alloc = _dl_main_searchlist->r_nlist + to_add + 8;	  new_global = (struct link_map **)	    malloc (_dl_global_scope_alloc * sizeof (struct link_map *));	  if (new_global == NULL)	    {	      _dl_global_scope_alloc = 0;	    nomem:	      _dl_signal_error (ENOMEM, new->l_libname->name,				N_("cannot extend global scope"));	      return;	    }	  /* Copy over the old entries.  */	  memcpy (new_global, _dl_main_searchlist->r_list,		  (_dl_main_searchlist->r_nlist * sizeof (struct link_map *)));	  _dl_main_searchlist->r_list = new_global;	}      else if (_dl_main_searchlist->r_nlist + to_add > _dl_global_scope_alloc)	{	  /* We have to extend the existing array of link maps in the	     main map.  */	  new_global = (struct link_map **)	    realloc (_dl_main_searchlist->r_list,		     ((_dl_global_scope_alloc + to_add + 8)		      * sizeof (struct link_map *)));	  if (new_global == NULL)	    goto nomem;	  _dl_global_scope_alloc += to_add + 8;	  _dl_main_searchlist->r_list = new_global;	}      /* Now add the new entries.  */      for (cnt = 0; cnt < new->l_searchlist.r_nlist; ++cnt)	{	  struct link_map *map = new->l_searchlist.r_list[cnt];	  if (map->l_global == 0)	    {	      map->l_global = 1;	      _dl_main_searchlist->r_list[_dl_main_searchlist->r_nlist] = map;	      ++_dl_main_searchlist->r_nlist;	    }	}      /* XXX Do we have to add something to r_dupsearchlist???  --drepper */    }  /* Mark the object as not deletable if the RTLD_NODELETE flags was     passed.  */  if (__builtin_expect (mode & RTLD_NODELETE, 0))    new->l_flags_1 |= DF_1_NODELETE;  if (_dl_sysdep_start == NULL)    /* We must be the static _dl_open in libc.a.  A static program that       has loaded a dynamic object now has competition.  */    __libc_multiple_libcs = 1;}