(libcrypt.so): Depend on libc.so for dynamic loading and for Linux
[glibc/history.git] / elf / dl-object.c
blob941bfa34cc43ead89631b8b2a01268392737a1f9
1 /* Storage management for the chain of loaded shared objects.
2 Copyright (C) 1995, 1996, 1997 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 not,
17 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA. */
20 #include <link.h>
21 #include <assert.h>
22 #include <string.h>
23 #include <stdlib.h>
24 #include <errno.h>
27 /* List of objects currently loaded is [2] of this, aka _dl_loaded. */
28 struct link_map *_dl_default_scope[5];
30 /* Allocate a `struct link_map' for a new object being loaded,
31 and enter it into the _dl_loaded list. */
33 struct link_map *
34 _dl_new_object (char *realname, const char *libname, int type)
36 struct link_map *new = malloc (sizeof *new);
37 struct libname_list *newname = malloc (sizeof *newname);
38 if (! new || ! newname)
39 return NULL;
41 memset (new, 0, sizeof *new);
42 new->l_name = realname;
43 newname->name = libname;
44 newname->next = NULL;
45 new->l_libname = newname;
46 new->l_type = type;
48 if (_dl_loaded == NULL)
50 new->l_prev = new->l_next = NULL;
51 _dl_loaded = new;
53 else
55 struct link_map *l = _dl_loaded;
56 while (l->l_next)
57 l = l->l_next;
58 new->l_prev = l;
59 new->l_next = NULL;
60 l->l_next = new;
63 return new;