mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-10 07:10:06 +00:00
Merge branch 'master' of ssh://sourceware.org/git/glibc
Conflicts: ChangeLog
This commit is contained in:
commit
4d8e1f1195
11
ChangeLog
11
ChangeLog
@ -3,6 +3,17 @@
|
||||
* sysdeps/x86_64/fpu/bits/mathinline.h: Add fmax and fmin optimizations
|
||||
for __FINITE_MATH_ONLY__ == 1.
|
||||
|
||||
2011-09-15 Andreas Schwab <schwab@redhat.com>
|
||||
|
||||
* sysdeps/powerpc/fpu/e_hypot.c (__ieee754_hypot): Use
|
||||
__ieee754_sqrt instead of sqrt.
|
||||
* sysdeps/powerpc/fpu/e_hypotf.c (__ieee754_hypotf): Use
|
||||
__ieee754_sqrtf instead of sqrtf.
|
||||
* sysdeps/powerpc/fpu/e_rem_pio2f.c (__ieee754_rem_pio2f): Use
|
||||
__floorf instead of floorf.
|
||||
* sysdeps/powerpc/fpu/k_rem_pio2f.c (__fp_kernel_rem_pio2f): Use
|
||||
__floorf, __truncf instead of floorf, truncf.
|
||||
|
||||
2011-09-14 Ulrich Drepper <drepper@gmail.com>
|
||||
|
||||
* sysdeps/x86_64/fpu/s_copysign.S [ELF]: Use correct section.
|
||||
|
@ -1,3 +1,12 @@
|
||||
2011-09-15 Andreas Schwab <schwab@redhat.com>
|
||||
|
||||
* sysdeps/pthread/list.h: Define only list_t if __need_list_t is
|
||||
defined.
|
||||
(list_add): Add atomic_write_barrier.
|
||||
* descr.h: Define __need_list_t before including <list.h>.
|
||||
* nptl-init.c: Include <list.h>
|
||||
* allocatestack.c: Likewise.
|
||||
|
||||
2011-09-11 Ulrich Drepper <drepper@gmail.com>
|
||||
|
||||
* sysdeps/i386/tls.h: Remove HAVE_TLS_SUPPORT test.
|
||||
|
@ -28,6 +28,7 @@
|
||||
#include <dl-sysdep.h>
|
||||
#include <dl-tls.h>
|
||||
#include <tls.h>
|
||||
#include <list.h>
|
||||
#include <lowlevellock.h>
|
||||
#include <kernel-features.h>
|
||||
|
||||
|
@ -26,6 +26,7 @@
|
||||
#include <stdbool.h>
|
||||
#include <sys/types.h>
|
||||
#include <hp-timing.h>
|
||||
#define __need_list_t
|
||||
#include <list.h>
|
||||
#include <lowlevellock.h>
|
||||
#include <pthreaddef.h>
|
||||
|
@ -29,6 +29,7 @@
|
||||
#include <atomic.h>
|
||||
#include <ldsodefs.h>
|
||||
#include <tls.h>
|
||||
#include <list.h>
|
||||
#include <fork.h>
|
||||
#include <version.h>
|
||||
#include <shlib-compat.h>
|
||||
|
@ -1,4 +1,4 @@
|
||||
/* Copyright (C) 2002, 2009 Free Software Foundation, Inc.
|
||||
/* Copyright (C) 2002, 2009, 2011 Free Software Foundation, Inc.
|
||||
This file is part of the GNU C Library.
|
||||
Contributed by Ulrich Drepper <drepper@redhat.com>, 2002.
|
||||
|
||||
@ -18,27 +18,39 @@
|
||||
02111-1307 USA. */
|
||||
|
||||
#ifndef _LIST_H
|
||||
#define _LIST_H 1
|
||||
|
||||
#ifndef __need_list_t
|
||||
# define _LIST_H 1
|
||||
#endif
|
||||
|
||||
/* The definitions of this file are adopted from those which can be
|
||||
found in the Linux kernel headers to enable people familiar with
|
||||
the latter find their way in these sources as well. */
|
||||
|
||||
|
||||
#if defined __need_list_t || defined _LIST_H
|
||||
# ifndef __list_t_defined
|
||||
# define __list_t_defined
|
||||
/* Basic type for the double-link list. */
|
||||
typedef struct list_head
|
||||
{
|
||||
struct list_head *next;
|
||||
struct list_head *prev;
|
||||
} list_t;
|
||||
# endif
|
||||
# undef __need_list_t
|
||||
#endif
|
||||
|
||||
#ifdef _LIST_H
|
||||
|
||||
# include <atomic.h>
|
||||
|
||||
/* Define a variable with the head and tail of the list. */
|
||||
#define LIST_HEAD(name) \
|
||||
# define LIST_HEAD(name) \
|
||||
list_t name = { &(name), &(name) }
|
||||
|
||||
/* Initialize a new list head. */
|
||||
#define INIT_LIST_HEAD(ptr) \
|
||||
# define INIT_LIST_HEAD(ptr) \
|
||||
(ptr)->next = (ptr)->prev = (ptr)
|
||||
|
||||
|
||||
@ -49,6 +61,7 @@ list_add (list_t *newp, list_t *head)
|
||||
newp->next = head->next;
|
||||
newp->prev = head;
|
||||
head->next->prev = newp;
|
||||
atomic_write_barrier ();
|
||||
head->next = newp;
|
||||
}
|
||||
|
||||
@ -78,26 +91,28 @@ list_splice (list_t *add, list_t *head)
|
||||
|
||||
|
||||
/* Get typed element from list at a given position. */
|
||||
#define list_entry(ptr, type, member) \
|
||||
# define list_entry(ptr, type, member) \
|
||||
((type *) ((char *) (ptr) - (unsigned long) (&((type *) 0)->member)))
|
||||
|
||||
|
||||
|
||||
/* Iterate forward over the elements of the list. */
|
||||
#define list_for_each(pos, head) \
|
||||
# define list_for_each(pos, head) \
|
||||
for (pos = (head)->next; pos != (head); pos = pos->next)
|
||||
|
||||
|
||||
/* Iterate forward over the elements of the list. */
|
||||
#define list_for_each_prev(pos, head) \
|
||||
# define list_for_each_prev(pos, head) \
|
||||
for (pos = (head)->prev; pos != (head); pos = pos->prev)
|
||||
|
||||
|
||||
/* Iterate backwards over the elements list. The list elements can be
|
||||
removed from the list while doing this. */
|
||||
#define list_for_each_prev_safe(pos, p, head) \
|
||||
# define list_for_each_prev_safe(pos, p, head) \
|
||||
for (pos = (head)->prev, p = pos->prev; \
|
||||
pos != (head); \
|
||||
pos = p, p = pos->prev)
|
||||
|
||||
#endif /* _LIST_H */
|
||||
|
||||
#endif /* list.h */
|
||||
|
@ -1,3 +1,7 @@
|
||||
2011-09-15 Andreas Schwab <schwab@redhat.com>
|
||||
|
||||
* thread_dbP.h: Include <list.h>
|
||||
|
||||
2009-08-23 Roland McGrath <roland@redhat.com>
|
||||
|
||||
* td_ta_map_lwp2thr.c (__td_ta_lookup_th_unique): Move ta_ok check
|
||||
|
@ -1,5 +1,5 @@
|
||||
/* Private header for thread debug library
|
||||
Copyright (C) 2003, 2004, 2007 Free Software Foundation, Inc.
|
||||
Copyright (C) 2003, 2004, 2007, 2011 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
|
||||
@ -29,6 +29,7 @@
|
||||
#include "proc_service.h"
|
||||
#include "thread_db.h"
|
||||
#include "../nptl/pthreadP.h" /* This is for *_BITMASK only. */
|
||||
#include <list.h>
|
||||
|
||||
/* Indeces for the symbol names. */
|
||||
enum
|
||||
|
@ -96,7 +96,7 @@ __ieee754_hypot (double x, double y)
|
||||
{
|
||||
x *= twoM600;
|
||||
y *= twoM600;
|
||||
return sqrt (x * x + y * y) / twoM600;
|
||||
return __ieee754_sqrt (x * x + y * y) / twoM600;
|
||||
}
|
||||
if (y < twoM500)
|
||||
{
|
||||
@ -104,14 +104,14 @@ __ieee754_hypot (double x, double y)
|
||||
{
|
||||
x *= two1022;
|
||||
y *= two1022;
|
||||
return sqrt (x * x + y * y) / two1022;
|
||||
return __ieee754_sqrt (x * x + y * y) / two1022;
|
||||
}
|
||||
else
|
||||
{
|
||||
x *= two600;
|
||||
y *= two600;
|
||||
return sqrt (x * x + y * y) / two600;
|
||||
return __ieee754_sqrt (x * x + y * y) / two600;
|
||||
}
|
||||
}
|
||||
return sqrt (x * x + y * y);
|
||||
return __ieee754_sqrt (x * x + y * y);
|
||||
}
|
||||
|
@ -97,7 +97,7 @@ __ieee754_hypotf (float x, float y)
|
||||
{
|
||||
x *= twoM60;
|
||||
y *= twoM60;
|
||||
return sqrtf (x * x + y * y) / twoM60;
|
||||
return __ieee754_sqrtf (x * x + y * y) / twoM60;
|
||||
}
|
||||
if (y < twoM50)
|
||||
{
|
||||
@ -105,14 +105,14 @@ __ieee754_hypotf (float x, float y)
|
||||
{
|
||||
x *= two126;
|
||||
y *= two126;
|
||||
return sqrtf (x * x + y * y) / two126;
|
||||
return __ieee754_sqrtf (x * x + y * y) / two126;
|
||||
}
|
||||
else
|
||||
{
|
||||
x *= two60;
|
||||
y *= two60;
|
||||
return sqrtf (x * x + y * y) / two60;
|
||||
return __ieee754_sqrtf (x * x + y * y) / two60;
|
||||
}
|
||||
}
|
||||
return sqrtf (x * x + y * y);
|
||||
return __ieee754_sqrtf (x * x + y * y);
|
||||
}
|
||||
|
@ -112,7 +112,7 @@ __ieee754_rem_pio2f (float x, float *y)
|
||||
}
|
||||
if (ax <= pio2_2e7)
|
||||
{
|
||||
n = floorf (ax * invpio2 + half);
|
||||
n = __floorf (ax * invpio2 + half);
|
||||
i = (int32_t) n;
|
||||
r = ax - n * pio2_1;
|
||||
w = n * pio2_1t; /* 1st round good to 40 bit */
|
||||
@ -168,11 +168,11 @@ __ieee754_rem_pio2f (float x, float *y)
|
||||
e0 = __float_and8 (ax / 128.0);
|
||||
z = ax / e0;
|
||||
|
||||
tx[0] = floorf (z);
|
||||
tx[0] = __floorf (z);
|
||||
z = (z - tx[0]) * two8;
|
||||
tx[1] = floorf (z);
|
||||
tx[1] = __floorf (z);
|
||||
z = (z - tx[1]) * two8;
|
||||
tx[2] = floorf (z);
|
||||
tx[2] = __floorf (z);
|
||||
|
||||
nx = 3;
|
||||
while (tx[nx - 1] == zero)
|
||||
|
@ -135,16 +135,16 @@ recompute:
|
||||
/* distill q[] into iq[] reversingly */
|
||||
for (i = 0, j = jz, z = q[jz]; j > 0; i++, j--)
|
||||
{
|
||||
fw = truncf (twon8 * z);
|
||||
fw = __truncf (twon8 * z);
|
||||
iq[i] = (int32_t) (z - two8 * fw);
|
||||
z = q[j - 1] + fw;
|
||||
}
|
||||
|
||||
/* compute n */
|
||||
z = __scalbnf (z, q0); /* actual value of z */
|
||||
z -= 8.0 * floorf (z * 0.125); /* trim off integer >= 8 */
|
||||
z -= 8.0 * __floorf (z * 0.125); /* trim off integer >= 8 */
|
||||
n = (int32_t) z;
|
||||
z -= truncf (z);
|
||||
z -= __truncf (z);
|
||||
ih = 0;
|
||||
if (q0 > 0)
|
||||
{ /* need iq[jz-1] to determine n */
|
||||
@ -234,7 +234,7 @@ recompute:
|
||||
z = __scalbnf (z, -q0);
|
||||
if (z >= two8)
|
||||
{
|
||||
fw = truncf (twon8 * z);
|
||||
fw = __truncf (twon8 * z);
|
||||
iq[jz] = (int32_t) (z - two8 * fw);
|
||||
jz += 1;
|
||||
q0 += 8;
|
||||
|
Loading…
Reference in New Issue
Block a user