Skip to content

Commit

Permalink
Updated to fedora-glibc-20070515T2025
Browse files Browse the repository at this point in the history
  • Loading branch information
Roland McGrath committed May 15, 2007
1 parent e169ea9 commit 18b8643
Showing 23 changed files with 306 additions and 113 deletions.
45 changes: 45 additions & 0 deletions ChangeLog
Original file line number Diff line number Diff line change
@@ -1,5 +1,50 @@
2007-05-14 Ulrich Drepper <drepper@redhat.com>

* version.h (VERSION): Define to 6.
* include/features.h (__GLIBC_MINOR__): Likewise.

* malloc/malloc.c: Use all small bin slots on 64-bit archs.

* malloc/malloc.c (largebin_index): Really have 32 buckets with 64
sizes.

2007-05-13 Ulrich Drepper <drepper@redhat.com>

* malloc/malloc.c [MALLOC_DEBUG]: Keep track of current maximum
number of mmaps. n_mmaps_max is the target.
* malloc/hooks.c: Likewise.
* malloc/arena.c: Likewise.

2007-05-12 Andreas Jaeger <aj@suse.de>

* sysdeps/unix/sysv/linux/tst-getcpu.c: Include <unistd.h> for
getpid.

2007-05-11 Ulrich Drepper <drepper@redhat.com>

* elf/dl-close.c (_dl_close_worker): Help gcc to optimize by
adding new variables.

* elf/dl-open.c (add_to_global): Introduce variable ns to help gcc
optimize. Completely extend global scope array before making the
new entries visible.

2007-05-10 Ulrich Drepper <drepper@redhat.com>

* sysdeps/unix/sysv/linux/tst-getcpu.c: New file.
* sysdeps/unix/sysv/linux/Makefile [subdir=posix] (tests): Add
tst-getcpu.

* include/link.h: Move l_version and l_nversion members around to
fill gaps.

* scripts/check-c++-types.sh: Don't use -fnu89-inline option.

* sysdeps/unix/sysv/linux/sched_setaffinity.c
(__sched_setaffinity_new): If syscall was successful and
RESET_VGETCPU_CACHE is defined, use it before returning.
* sysdeps/unix/sysv/linux/x86_64/sched_setaffinity.c: New file.

* io/sys/stat.h: Make sure struct timespec is defined for
__USE_ATFILE.

4 changes: 2 additions & 2 deletions README
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
This directory contains the version 2.5 release of the GNU C Library.
This directory contains the version 2.6 release of the GNU C Library.

The GNU C Library is the standard system C library for all GNU systems,
and is an important part of what makes up a GNU system. It provides the
@@ -52,7 +52,7 @@ The GNU C Library supports these configurations for using Linux kernels:

The code for other CPU configurations supported by volunteers outside of
the core glibc maintenance effort is contained in the separate `ports'
add-on. You can find glibc-ports-2.5 distributed separately in the
add-on. You can find glibc-ports-2.6 distributed separately in the
same place where you got the main glibc distribution files.
Currently these configurations are known to work using the `ports' add-on:

58 changes: 29 additions & 29 deletions elf/dl-close.c
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
/* Close a shared object opened by `_dl_open'.
Copyright (C) 1996-2005, 2006 Free Software Foundation, Inc.
Copyright (C) 1996-2005, 2006, 2007 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
@@ -107,8 +107,6 @@ remove_slotinfo (size_t idx, struct dtv_slotinfo_list *listp, size_t disp,
void
_dl_close_worker (struct link_map *map)
{
Lmid_t ns = map->l_ns;

/* One less direct use. */
--map->l_direct_opencount;

@@ -131,19 +129,22 @@ _dl_close_worker (struct link_map *map)
return;
}

Lmid_t nsid = map->l_ns;
struct link_namespaces *ns = &GL(dl_ns)[nsid];

retry:
dl_close_state = pending;

bool any_tls = false;
const unsigned int nloaded = GL(dl_ns)[ns]._ns_nloaded;
const unsigned int nloaded = ns->_ns_nloaded;
char used[nloaded];
char done[nloaded];
struct link_map *maps[nloaded];

/* Run over the list and assign indexes to the link maps and enter
them into the MAPS array. */
int idx = 0;
for (struct link_map *l = GL(dl_ns)[ns]._ns_loaded; l != NULL; l = l->l_next)
for (struct link_map *l = ns->_ns_loaded; l != NULL; l = l->l_next)
{
l->l_idx = idx;
maps[idx] = l;
@@ -220,11 +221,11 @@ _dl_close_worker (struct link_map *map)
}

/* Sort the entries. */
_dl_sort_fini (GL(dl_ns)[ns]._ns_loaded, maps, nloaded, used, ns);
_dl_sort_fini (ns->_ns_loaded, maps, nloaded, used, nsid);

/* Call all termination functions at once. */
#ifdef SHARED
bool do_audit = GLRO(dl_naudit) > 0 && !GL(dl_ns)[ns]._ns_loaded->l_auditing;
bool do_audit = GLRO(dl_naudit) > 0 && !ns->_ns_loaded->l_auditing;
#endif
bool unload_any = false;
unsigned int first_loaded = ~0;
@@ -233,7 +234,7 @@ _dl_close_worker (struct link_map *map)
struct link_map *imap = maps[i];

/* All elements must be in the same namespace. */
assert (imap->l_ns == ns);
assert (imap->l_ns == nsid);

if (!used[i])
{
@@ -248,7 +249,7 @@ _dl_close_worker (struct link_map *map)
if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_IMPCALLS,
0))
_dl_debug_printf ("\ncalling fini: %s [%lu]\n\n",
imap->l_name, ns);
imap->l_name, nsid);

if (imap->l_info[DT_FINI_ARRAY] != NULL)
{
@@ -334,7 +335,7 @@ _dl_close_worker (struct link_map *map)
struct link_map *tmap = (struct link_map *)
((char *) imap->l_scope[cnt]
- offsetof (struct link_map, l_searchlist));
assert (tmap->l_ns == ns);
assert (tmap->l_ns == nsid);
if (tmap->l_idx == IDX_STILL_USED)
++remain;
else
@@ -435,7 +436,7 @@ _dl_close_worker (struct link_map *map)
/* Auditing checkpoint: we will start deleting objects. */
if (__builtin_expect (do_audit, 0))
{
struct link_map *head = GL(dl_ns)[ns]._ns_loaded;
struct link_map *head = ns->_ns_loaded;
struct audit_ifaces *afct = GLRO(dl_audit);
/* Do not call the functions for any auditing object. */
if (head->l_auditing == 0)
@@ -452,7 +453,7 @@ _dl_close_worker (struct link_map *map)
#endif

/* Notify the debugger we are about to remove some loaded objects. */
struct r_debug *r = _dl_debug_initialize (0, ns);
struct r_debug *r = _dl_debug_initialize (0, nsid);
r->r_state = RT_DELETE;
_dl_debug_state ();

@@ -474,19 +475,18 @@ _dl_close_worker (struct link_map *map)
if (__builtin_expect (imap->l_global, 0))
{
/* This object is in the global scope list. Remove it. */
unsigned int cnt = GL(dl_ns)[ns]._ns_main_searchlist->r_nlist;
struct r_scope_elem *ns_msl = ns->_ns_main_searchlist;
unsigned int cnt = ns_msl->r_nlist;

do
--cnt;
while (GL(dl_ns)[ns]._ns_main_searchlist->r_list[cnt] != imap);
while (ns_msl->r_list[cnt] != imap);

/* The object was already correctly registered. */
while (++cnt
< GL(dl_ns)[ns]._ns_main_searchlist->r_nlist)
GL(dl_ns)[ns]._ns_main_searchlist->r_list[cnt - 1]
= GL(dl_ns)[ns]._ns_main_searchlist->r_list[cnt];
while (++cnt < ns_msl->r_nlist)
ns_msl->r_list[cnt - 1] = ns_msl->r_list[cnt];

--GL(dl_ns)[ns]._ns_main_searchlist->r_nlist;
--ns_msl->r_nlist;
}

/* Remove the object from the dtv slotinfo array if it uses TLS. */
@@ -581,12 +581,12 @@ _dl_close_worker (struct link_map *map)
else
{
#ifdef SHARED
assert (ns != LM_ID_BASE);
assert (nsid != LM_ID_BASE);
#endif
GL(dl_ns)[ns]._ns_loaded = imap->l_next;
ns->_ns_loaded = imap->l_next;
}

--GL(dl_ns)[ns]._ns_nloaded;
--ns->_ns_nloaded;
if (imap->l_next != NULL)
imap->l_next->l_prev = imap->l_prev;

@@ -648,7 +648,7 @@ _dl_close_worker (struct link_map *map)
/* Auditing checkpoint: we have deleted all objects. */
if (__builtin_expect (do_audit, 0))
{
struct link_map *head = GL(dl_ns)[ns]._ns_loaded;
struct link_map *head = ns->_ns_loaded;
/* Do not call the functions for any auditing object. */
if (head->l_auditing == 0)
{
@@ -732,22 +732,22 @@ free_slotinfo (struct dtv_slotinfo_list **elemp)

libc_freeres_fn (free_mem)
{
for (Lmid_t ns = 0; ns < DL_NNS; ++ns)
if (__builtin_expect (GL(dl_ns)[ns]._ns_global_scope_alloc, 0) != 0
&& (GL(dl_ns)[ns]._ns_main_searchlist->r_nlist
for (Lmid_t nsid = 0; nsid < DL_NNS; ++nsid)
if (__builtin_expect (GL(dl_ns)[nsid]._ns_global_scope_alloc, 0) != 0
&& (GL(dl_ns)[nsid]._ns_main_searchlist->r_nlist
// XXX Check whether we need NS-specific initial_searchlist
== GLRO(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 = GL(dl_ns)[ns]._ns_main_searchlist->r_list;
struct link_map **old = GL(dl_ns)[nsid]._ns_main_searchlist->r_list;

/* Put the old map in. */
GL(dl_ns)[ns]._ns_main_searchlist->r_list
GL(dl_ns)[nsid]._ns_main_searchlist->r_list
// XXX Check whether we need NS-specific initial_searchlist
= GLRO(dl_initial_searchlist).r_list;
/* Signal that the original map is used. */
GL(dl_ns)[ns]._ns_global_scope_alloc = 0;
GL(dl_ns)[nsid]._ns_global_scope_alloc = 0;

/* Now free the old map. */
free (old);
40 changes: 20 additions & 20 deletions elf/dl-open.c
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
/* Load a shared object at runtime, relocate it, and run its initializer.
Copyright (C) 1996-2004, 2005, 2006 Free Software Foundation, Inc.
Copyright (C) 1996-2004, 2005, 2006, 2007 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
@@ -97,59 +97,59 @@ add_to_global (struct link_map *new)
in an realloc() call. Therefore we allocate a completely new
array the first time we have to add something to the locale scope. */

if (GL(dl_ns)[new->l_ns]._ns_global_scope_alloc == 0)
struct link_namespaces *ns = &GL(dl_ns)[new->l_ns];
if (ns->_ns_global_scope_alloc == 0)
{
/* This is the first dynamic object given global scope. */
GL(dl_ns)[new->l_ns]._ns_global_scope_alloc
= GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_nlist + to_add + 8;
ns->_ns_global_scope_alloc
= ns->_ns_main_searchlist->r_nlist + to_add + 8;
new_global = (struct link_map **)
malloc (GL(dl_ns)[new->l_ns]._ns_global_scope_alloc
* sizeof (struct link_map *));
malloc (ns->_ns_global_scope_alloc * sizeof (struct link_map *));
if (new_global == NULL)
{
GL(dl_ns)[new->l_ns]._ns_global_scope_alloc = 0;
ns->_ns_global_scope_alloc = 0;
nomem:
_dl_signal_error (ENOMEM, new->l_libname->name, NULL,
N_("cannot extend global scope"));
return 1;
}

/* Copy over the old entries. */
GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_list
= memcpy (new_global,
GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_list,
(GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_nlist
ns->_ns_main_searchlist->r_list
= memcpy (new_global, ns->_ns_main_searchlist->r_list,
(ns->_ns_main_searchlist->r_nlist
* sizeof (struct link_map *)));
}
else if (GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_nlist + to_add
> GL(dl_ns)[new->l_ns]._ns_global_scope_alloc)
else if (ns->_ns_main_searchlist->r_nlist + to_add
> ns->_ns_global_scope_alloc)
{
/* We have to extend the existing array of link maps in the
main map. */
new_global = (struct link_map **)
realloc (GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_list,
((GL(dl_ns)[new->l_ns]._ns_global_scope_alloc + to_add + 8)
realloc (ns->_ns_main_searchlist->r_list,
((ns->_ns_global_scope_alloc + to_add + 8)
* sizeof (struct link_map *)));
if (new_global == NULL)
goto nomem;

GL(dl_ns)[new->l_ns]._ns_global_scope_alloc += to_add + 8;
GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_list = new_global;
ns->_ns_global_scope_alloc += to_add + 8;
ns->_ns_main_searchlist->r_list = new_global;
}

/* Now add the new entries. */
unsigned int new_nlist = ns->_ns_main_searchlist->r_nlist;
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;
GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_list[GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_nlist]
= map;
++GL(dl_ns)[new->l_ns]._ns_main_searchlist->r_nlist;
ns->_ns_main_searchlist->r_list[new_nlist++] = map;
}
}
atomic_write_barrier ();
ns->_ns_main_searchlist->r_nlist = new_nlist;

return 0;
}
4 changes: 2 additions & 2 deletions fedora/branch.mk
Original file line number Diff line number Diff line change
@@ -3,5 +3,5 @@ glibc-branch := fedora
glibc-base := HEAD
DIST_BRANCH := devel
COLLECTION := dist-fc7
fedora-sync-date := 2007-05-10 23:08 UTC
fedora-sync-tag := fedora-glibc-20070510T2308
fedora-sync-date := 2007-05-15 20:25 UTC
fedora-sync-tag := fedora-glibc-20070515T2025
5 changes: 2 additions & 3 deletions include/features.h
Original file line number Diff line number Diff line change
@@ -1,5 +1,4 @@
/* Copyright (C) 1991,1992,1993,1995,1996,1997,1998,1999,2000,2001,2002,2003,2004,2005,2006
Free Software Foundation, Inc.
/* Copyright (C) 1991,1992,1993,1995-2006,2007 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
@@ -310,7 +309,7 @@
/* Major and minor version number of the GNU C library package. Use
these macros to test for features in specific releases. */
#define __GLIBC__ 2
#define __GLIBC_MINOR__ 5
#define __GLIBC_MINOR__ 6

#define __GLIBC_PREREQ(maj, min) \
((__GLIBC__ << 16) + __GLIBC_MINOR__ >= ((maj) << 16) + (min))
10 changes: 5 additions & 5 deletions include/link.h
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
/* Data structure for communication from the run-time dynamic linker for
loaded ELF shared objects.
Copyright (C) 1995-2002,2003,2004,2005,2006 Free Software Foundation, Inc.
Copyright (C) 1995-2006, 2007 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
@@ -141,6 +141,10 @@ struct link_map
/* Dependent object that first caused this object to be loaded. */
struct link_map *l_loader;

/* Array with version names. */
struct r_found_version *l_versions;
unsigned int l_nversions;

/* Symbol hash table. */
Elf_Symndx l_nbuckets;
Elf32_Word l_gnu_bitmask_idxbits;
@@ -184,10 +188,6 @@ struct link_map
unsigned int l_removed:1; /* Nozero if the object cannot be used anymore
since it is removed. */

/* Array with version names. */
unsigned int l_nversions;
struct r_found_version *l_versions;

/* Collected information about own RPATH directories. */
struct r_search_path_struct l_rpath_dirs;

3 changes: 3 additions & 0 deletions malloc/arena.c
Original file line number Diff line number Diff line change
@@ -370,6 +370,9 @@ ptmalloc_init_minimal (void)
mp_.top_pad = DEFAULT_TOP_PAD;
#endif
mp_.n_mmaps_max = DEFAULT_MMAP_MAX;
#if MALLOC_DEBUG
mp_.n_mmaps_cmax = DEFAULT_MMAP_MAX;
#endif
mp_.mmap_threshold = DEFAULT_MMAP_THRESHOLD;
mp_.trim_threshold = DEFAULT_TRIM_THRESHOLD;
mp_.pagesize = malloc_getpagesize;
Loading

0 comments on commit 18b8643

Please sign in to comment.