unsigned nsearchlist;
unsigned int nsearchlist; unsigned int nrellist;
_dl_close (void *_map){  struct link_map **list;  struct link_map *map = _map;  unsigned nsearchlist;  unsigned int i;  if (map->l_opencount == 0)    LOSE ("shared object not open");  /* Acquire the lock.  */  __libc_lock_lock (_dl_load_lock);  /* Decrement the reference count.  */  if (map->l_opencount > 1 || map->l_type != lt_loaded)    {      /* There are still references to this object.  Do nothing more.  */      --map->l_opencount;      __libc_lock_unlock (_dl_load_lock);      return;    }  list = map->l_searchlist.r_list;  nsearchlist = map->l_searchlist.r_nlist;  /* Call all termination functions at once.  */  for (i = 0; i < nsearchlist; ++i)    {      struct link_map *imap = map->l_initfini[i];      if (imap->l_opencount == 1 && imap->l_type == lt_loaded	  && (imap->l_info[DT_FINI] || imap->l_info[DT_FINI_ARRAY])	  /* Skip any half-cooked objects that were never initialized.  */	  && imap->l_init_called)	{	  /* When debugging print a message first.  */	  if (_dl_debug_impcalls)	    _dl_debug_message (1, "\ncalling fini: ", imap->l_name,			       "\n\n", NULL);	  /* Call its termination function.  */	  if (imap->l_info[DT_FINI_ARRAY] != NULL)	    {	      ElfW(Addr) *array =		(ElfW(Addr) *) (imap->l_addr				+ imap->l_info[DT_FINI_ARRAY]->d_un.d_ptr);	      unsigned int sz = (imap->l_info[DT_FINI_ARRAYSZ]->d_un.d_val				 / sizeof (ElfW(Addr)));	      unsigned int cnt;	      for (cnt = 0; cnt < sz; ++cnt)		((fini_t) (imap->l_addr + array[cnt])) ();	    }	  /* Next try the old-style destructor.  */	  if (imap->l_info[DT_FINI] != NULL)	    (*(void (*) (void)) ((void *) imap->l_addr				 + imap->l_info[DT_FINI]->d_un.d_ptr)) ();	}    }  /* Notify the debugger we are about to remove some loaded objects.  */  _r_debug.r_state = RT_DELETE;  _dl_debug_state ();  /* The search list contains a counted reference to each object it     points to, the 0th elt being MAP itself.  Decrement the reference     counts on all the objects MAP depends on.  */  for (i = 0; i < nsearchlist; ++i)    --list[i]->l_opencount;  /* Check each element of the search list to see if all references to     it are gone.  */  for (i = 0; i < nsearchlist; ++i)    {      struct link_map *imap = list[i];      if (imap->l_opencount == 0 && imap->l_type == lt_loaded)	{	  struct libname_list *lnp;	  /* That was the last reference, and this was a dlopen-loaded	     object.  We can unmap it.  */	  if (imap->l_global)	    {	      /* This object is in the global scope list.  Remove it.  */	      int cnt = _dl_main_searchlist->r_nlist;	      do		--cnt;	      while (_dl_main_searchlist->r_list[cnt] != imap);	      /* The object was already correctly registered.  */	      while (++cnt < _dl_main_searchlist->r_nlist)		_dl_main_searchlist->r_list[cnt - 1]		  = _dl_main_searchlist->r_list[cnt];	      --_dl_main_searchlist->r_nlist;	    }	  /* We can unmap all the maps at once.  We determined the	     start address and length when we loaded the object and	     the `munmap' call does the rest.  */	  __munmap ((void *) imap->l_map_start,		    imap->l_map_end - imap->l_map_start);	  /* Finally, unlink the data structure and free it.  */#ifdef SHARED	  /* We will unlink the first object only if this is a statically	     linked program.  */	  assert (imap->l_prev != NULL);	  imap->l_prev->l_next = imap->l_next;#else	  if (imap->l_prev != NULL)	    imap->l_prev->l_next = imap->l_next;	  else	    _dl_loaded = imap->l_next;#endif	  if (imap->l_next)	    imap->l_next->l_prev = imap->l_prev;	  if (imap->l_versions != NULL)	    free (imap->l_versions);	  if (imap->l_origin != NULL && imap->l_origin != (char *) -1)	    free ((char *) imap->l_origin);	  /* This name always is allocated.  */	  free (imap->l_name);	  /* Remove the list with all the names of the shared object.  */	  lnp = imap->l_libname;	  do	    {	      struct libname_list *this = lnp;	      lnp = lnp->next;	      free (this);	    }	  while (lnp != NULL);	  /* Remove the searchlists.  */	  if (imap != map)	    {	    if (imap->l_searchlist.r_list != NULL)	      free (imap->l_searchlist.r_list);	    else if (imap->l_initfini != NULL)	      free (imap->l_initfini);	    }	  if (imap->l_phdr_allocated)	    free ((void *) imap->l_phdr);	  free (imap);	}    }  free (list);  if (_dl_global_scope_alloc != 0      && _dl_main_searchlist->r_nlist == _dl_initial_searchlist.r_nlist)    {      /* All object dynamically loaded by the program are unloaded.  Free	 the memory allocated for the global scope variable.  */      struct link_map **old = _dl_main_searchlist->r_list;      /* Put the old map in.  */      _dl_main_searchlist->r_list = _dl_initial_searchlist.r_list;      /* Signal that the original map is used.  */      _dl_global_scope_alloc = 0;      /* Now free the old map.  */      free (old);    }  /* Notify the debugger those objects are finalized and gone.  */  _r_debug.r_state = RT_CONSISTENT;  _dl_debug_state ();  /* Release the lock.  */  __libc_lock_unlock (_dl_load_lock);}